Change search
ReferencesLink to record
Permanent link

Direct link
Enabling Internet-Scale Publish/Subscribe In Overlay Networks
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS. (Communication: Services and Infrastucture, Software and Computer Systems, SCS)
2011 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

As the amount of data in todays Internet is growing larger, users are exposedto too much information, which becomes increasingly more difficult tocomprehend. Publish/subscribe systems leverage this problem by providingloosely-coupled communications between producers and consumers of data ina network. Data consumers, i.e., subscribers, are provided with a subscriptionmechanism, to express their interests in a subset of data, in order to be notifiedonly when some data that matches their subscription is generated by theproducers, i.e., publishers. Most publish/subscribe systems today, are basedon the client/server architectural model. However, to provide the publish/-subscribe service in large scale, companies either have to invest huge amountof money for over-provisioning the resources, or are prone to frequent servicefailures. Peer-to-peer overlay networks are attractive alternative solutions forbuilding Internet-scale publish/subscribe systems. However, scalability comeswith a cost: a published message often needs to traverse a large number ofuninterested (unsubscribed) nodes before reaching all its subscribers. Werefer to this undesirable traffic, as relay overhead. Without careful considerations,the relay overhead might sharply increase resource consumption for therelay nodes (in terms of bandwidth transmission cost, CPU, etc) and couldultimately lead to rapid deterioration of the system’s performance once therelay nodes start dropping the messages or choose to permanently abandonthe system. To mitigate this problem, some solutions use unbounded numberof connections per node, while some other limit the expressiveness of thesubscription scheme.

In this thesis work, we introduce two systems called Vitis and Vinifera, fortopic-based and content-based publish/subscribe models, respectively. Boththese systems are gossip-based and significantly decrease the relay overhead.We utilize novel techniques to cluster together nodes that exhibit similarsubscriptions. In the topic-based model, distinct clusters for each topic areconstructed, while clusters in the content-based model are fuzzy and do nothave explicit boundaries. We augment these clustered overlays by links thatfacilitate routing in the network. We construct a hybrid system by injectingstructure into an otherwise unstructured network. The resulting structuresresemble navigable small-world networks, which spans along clusters of nodesthat have similar subscriptions. The properties of such overlays make theman ideal platform for efficient data dissemination in large-scale systems. Thesystems requires only a bounded node degree and as we show, through simulations,they scale well with the number of nodes and subscriptions and remainefficient under highly complex subscription patterns, high publication rates,and even in the presence of failures in the network. We also compare bothsystems against some state-of-the-art publish/subscribe systems. Our measurementsshow that both Vitis and Vinifera significantly outperform theircounterparts on various subscription and churn scenarios, under both syntheticworkloads and real-world traces.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology , 2011. , xiii, 63 p.
Trita-ICT-ECS AVH, ISSN 1653-6363 ; 11:08
Keyword [en]
Publish/Subscribe, Content Distribution, Peer-To-Peer Overlay Network
National Category
Computer Systems Communication Systems Computer and Information Science
Research subject
URN: urn:nbn:se:kth:diva-43716ISBN: 978-91-7501-137-0OAI: diva2:448573
2011-11-11, C1, Electrum, Isafjordsgatan 22/Kistagången 16 164 40 Kista, Stockholm, 14:00 (English)
QC 20111114Available from: 2011-11-14 Created: 2011-10-17 Last updated: 2011-11-14Bibliographically approved

Open Access in DiVA

Rahimian-Licentiate(1185 kB)267 downloads
File information
File name FULLTEXT01.pdfFile size 1185 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Rahimian, Fatemeh
By organisation
Software and Computer Systems, SCS
Computer SystemsCommunication SystemsComputer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 267 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 206 hits
ReferencesLink to record
Permanent link

Direct link