Node selection in distributed overlays

With the proliferation of latency aware services such as live video streaming, Internetbased financial trading and the popularity of distributed overlays such as BitTorrent there is a growing need for latency-aware distributed overlays. To make such overlays viable, efficient resource discovery serv...

Full description

Bibliographic Details
Main Author: Latif, L.
Published: University College London (University of London) 2013
Subjects:
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.626141
id ndltd-bl.uk-oai-ethos.bl.uk-626141
record_format oai_dc
spelling ndltd-bl.uk-oai-ethos.bl.uk-6261412015-12-03T03:28:43ZNode selection in distributed overlaysLatif, L.2013With the proliferation of latency aware services such as live video streaming, Internetbased financial trading and the popularity of distributed overlays such as BitTorrent there is a growing need for latency-aware distributed overlays. To make such overlays viable, efficient resource discovery services are needed. Anycast is a routing protocol that sends packets to nodes that are a member of a particular group, with the work presented the Anycast protocol in the distributed overlay domain. Structured and unstructured distributed networks have become a popular way to disseminate data without the need for a fixed infrastructure, however there is a need to provide quality of service (QoS). To meet the demands of applications, an overlay needs to maintain accurate Anycast group membership data, locality information and have minimal protocol overhead. Three protocols are proposed to meet these goals. The Distributed Overlay Anycast Table (DOAT) brings the notion of locality to a structured overlay, while introducing Bloom filters as an efficient data structure to present an overlay that can accurately return a node that is participating in a particular group. The Gossip Overlay Anycast Table (GOAT) is a scalable location-aware unstructured overlay that can provide the probabilistic Anycast routing. Through the use of an efficient discovery protocol and the use of Bloom filters, GOAT is able to provide the advantages of a structured overlay, while mitigating the performance issues typically found in unstructured overlays. The N-casting overlay is an unstructured overlay with the ability to send queries to multiple members of an group, uses a hierarchical decomposition of the Internet and an elegant data structure that offers predictable compression of overlay membership. N-casting shows that unstructured overlays can be scalable and sustain high performance in environments that exhibit realistic membership churn. DOAT, GOAT and N-casting present viable services that implemented at the application layer provide location aware node discovery in QoS-enabled applications.621.3University College London (University of London)http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.626141http://discovery.ucl.ac.uk/1389944/Electronic Thesis or Dissertation
collection NDLTD
sources NDLTD
topic 621.3
spellingShingle 621.3
Latif, L.
Node selection in distributed overlays
description With the proliferation of latency aware services such as live video streaming, Internetbased financial trading and the popularity of distributed overlays such as BitTorrent there is a growing need for latency-aware distributed overlays. To make such overlays viable, efficient resource discovery services are needed. Anycast is a routing protocol that sends packets to nodes that are a member of a particular group, with the work presented the Anycast protocol in the distributed overlay domain. Structured and unstructured distributed networks have become a popular way to disseminate data without the need for a fixed infrastructure, however there is a need to provide quality of service (QoS). To meet the demands of applications, an overlay needs to maintain accurate Anycast group membership data, locality information and have minimal protocol overhead. Three protocols are proposed to meet these goals. The Distributed Overlay Anycast Table (DOAT) brings the notion of locality to a structured overlay, while introducing Bloom filters as an efficient data structure to present an overlay that can accurately return a node that is participating in a particular group. The Gossip Overlay Anycast Table (GOAT) is a scalable location-aware unstructured overlay that can provide the probabilistic Anycast routing. Through the use of an efficient discovery protocol and the use of Bloom filters, GOAT is able to provide the advantages of a structured overlay, while mitigating the performance issues typically found in unstructured overlays. The N-casting overlay is an unstructured overlay with the ability to send queries to multiple members of an group, uses a hierarchical decomposition of the Internet and an elegant data structure that offers predictable compression of overlay membership. N-casting shows that unstructured overlays can be scalable and sustain high performance in environments that exhibit realistic membership churn. DOAT, GOAT and N-casting present viable services that implemented at the application layer provide location aware node discovery in QoS-enabled applications.
author Latif, L.
author_facet Latif, L.
author_sort Latif, L.
title Node selection in distributed overlays
title_short Node selection in distributed overlays
title_full Node selection in distributed overlays
title_fullStr Node selection in distributed overlays
title_full_unstemmed Node selection in distributed overlays
title_sort node selection in distributed overlays
publisher University College London (University of London)
publishDate 2013
url http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.626141
work_keys_str_mv AT latifl nodeselectionindistributedoverlays
_version_ 1718141810440667136