Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

He, Yan; Zhao, Qi; Zhang, Jianzhong; Wu, Gongyi

doi:10.1007/11577188_21

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using an approach similar to mOverlay [26], the authors of [23] and [13] proposed a solution, named distributed binning to arrange nodes into areas that will exploit the geographical information to gain locality-awareness. The idea behind this is that nodes are arranged into bins, with unique identifiers.…”

Section: Related Workmentioning

confidence: 99%

Locality-Awareness in a Peer-to-Peer Publish/Subscribe Network

Rahimian

Huu

Girdzijauskas

2012

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Peer-to-peer publish/subscribe systems are promising solutions to provide distributed content distribution services at Internet-scale with low cost. One of the potential problems with peer-to-peer overlays, however, is the inefficient traffic and large delays, due to the mismatch between the physical network and the overlay topology. This paper introduces a locality-aware extension to a peer-to-peer publish/subscribe system, named Vitis. The ultimate purpose is to avoid communications over long-distance links, instead, nodes send data over short-distance and low-cost links, when possible, while maintaining an acceptable quality of service. We show, through simulations, that the average data delivery time is up to 40% improved. The cost to pay is at most 10% more relaying in the peer-to-peer overlay.

show abstract

Section: Related Workmentioning

confidence: 99%

Locality-Awareness in a Peer-to-Peer Publish/Subscribe Network

Rahimian

Huu

Girdzijauskas

2012

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

show abstract

“…Consequently, the hierarchical ICS offers more accurate latency estimations for intra-cluster distances. More generally, hierarchical overlay approaches, where nodes are clustered based on their network distances, have been shown to allow for robust and scalable network-aware overlays [6,7,8]. In such case, scalability is achieved by drastically reducing the bandwidth requirements and management overhead for overlay maintenance.…”

Section: Introductionmentioning

confidence: 99%

A Self-Organized Clustering Scheme for Overlay Networks

Cantin

Gueye

Kâafar

et al. 2008

Self-Organizing Systems

View full text Add to dashboard Cite

Hierarchical approaches, where nodes are clustered based on their network distances, have been shown to allow for robust and scalable topology-aware overlays. Moreover, recent research works have shown that cluster-based deployments of Internet Coordinates Systems (ICS), where nodes estimate both intracluster and inter-cluster distances, do mitigate the impact of Triangle Inequality Violations (TIVs) on the distance predictions, and hence offer more accurate internet latency estimations. To allow the construction of such useful clusters we propose a self-organized distributed clustering scheme. For better scalability and efficiency, our algorithm uses the coordinates of a subset of nodes, known by running an ICS system, as first approximations of node positions. We designed and evaluated two variants of this algorithm. The first one, based on some cooperation among nodes, aims at reducing the expected time to construct clusters. The second variant, where nodes are selfish, aims at reducing the induced communication overhead.

show abstract

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

Cited by 2 publications

References 14 publications

Locality-Awareness in a Peer-to-Peer Publish/Subscribe Network

Locality-Awareness in a Peer-to-Peer Publish/Subscribe Network

A Self-Organized Clustering Scheme for Overlay Networks

Contact Info

Product

Resources

About