Turning heterogeneity into an advantage in overlay routing

Xu, Zhou; Mahalingam, Mallik; Karlsson, Magnus

doi:10.1109/infcom.2003.1208985

Cited by 98 publications

(63 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The multicast tree is constructed using the deterministic routing functionalities of these P2P networks. Because of the structured nature of the underlying network, these systems can incorporate techniques for optimizing various system parameters [32,24,35]. As we discussed in Section 1, DHT-based structured P2P networks are not suitable for scenarios wherein the peer populations are transient.…”

Section: Constructing a Distributed Spanning Treementioning

confidence: 99%

A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications

Zhang

Liu

Ramaswamy

et al. 2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supporting group communication applications. However, the ad-hoc nature of these networks poses significant challenges to the efficiency and scalability of the group communication services. This paper presents the design and implementation of GroupCast − a utility-aware middleware architecture for scalable and efficient P2P group communications. The GroupCast design is characterized by three unique features. First, we present the utility function for quantifying the role of unicast links in enhancing the scalability and efficiency of the group communication applications. This utility function provides a careful combination of the two most important performance factors, namely relative network locations and resource capabilities of the end hosts. Second, we develop a utility-aware distributed spanning tree construction algorithm for efficiently propagating group communication messages. It dynamically creates and maintains the group communication channels by optimizing the utility value of the group communication spanning trees. Third, we propose a utility-based overlay management protocol for constructing and maintaining low-diameter overlay networks to further enhance the performance of the group communication services. We evaluate the effectiveness of the GroupCast middleware architecture through analytical and experimental analysis of the costs and benefits of the proposed techniques. Our experimental results show that the GroupCast system can improve the scalability of wide-area group communication services by one to two orders of magnitude.

show abstract

Section: Constructing a Distributed Spanning Treementioning

confidence: 99%

A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications

Zhang

Liu

Ramaswamy

et al. 2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Id-mapping can be performed using space-filling curves. Xu et al [19] demonstrated to use space-filling curves to map points in the domain R d into R 1 such that the closeness relationship among the points is preserved. We adopt a similar but slightly different strategy to do id-mapping.…”

Section: Lexicographic Id Generationmentioning

confidence: 99%

Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning

Shi

Yang

Wang

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract-This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks. The state-of-the-art keyword searching techniques for unstructured and structured P2P systems are query flooding and inverted list intersection respectively. However, it has been demonstrated that P2P-based large scale full-text searching is not feasible by using either of the two techniques. We propose in this paper a new index partitioning and building scheme, multi-level partitioning (MLP), and discuss its implementation on top of P2P networks. MLP can dramatically reduce bisection bandwidth and end-user latency compared to the partition-by-keyword scheme. And compare to partition-bydocument, it need only broadcast a query to moderate number of peers to generate precise results.

show abstract

“…Given the dynamic conditions of both the peer content and its location in a peer-to-peer network, we devise a unique adaptive better-neighbor selection scheme, by effectively coupling the "best results" scheme with the "best physical proximity" scheme. A SplitProber node first caches the nodes which had previously delivered a specified number of results in the least amount of time into its candidate neighbors list, and then updates its neighborhood by periodically evaluating the "distance" to the nodes in this list and its neighborhood according to a novel technique called Landmark Clustering [19] explained below.…”

Section: Splitprober: Model and Algorithmmentioning

confidence: 99%

Exploring Small-World-Like Topologies Via SplitProber: Turning Power Laws into an Advantage in Unstructured Overlays

Huang

Zhang

et al. 2005

Embedded and Ubiquitous Computing – EUC 2005 Workshops

View full text Add to dashboard Cite

Abstract. Recent unstructured Peer-to-Peer systems, represented by Gnutella and Freenet, offer an administration-free and fault-tolerant application-level overlay network. While elegant from a theoretical perspective, these systems have some serious disadvantages. First, due to knowing very little about the nature of the network topology, the search algorithms operating on these networks result in fatal scaling problems. Second, these systems rely on application-level routing, which may be inefficient with respect to network delays and bandwidth consumption. In this paper, we propose a novel search algorithm, called SplitProber, to explore the small-world-like topologies of these networks efficiently and scalablely, by turning the power-law degree distributions in these networks to an advantage, and by making discriminative use of nodes according to their different roles in the network. As a result, we are able to reconcile the conflict of remedying the mismatch between the overlay topology and its projection on the underlying physical network, while at the same time navigating these networks with a guaranteed high efficiency and using only local knowledge as cues. Our simulation results indicate that the proposed algorithm outperforms several other well-known methods with significant performance gains.

show abstract

Turning heterogeneity into an advantage in overlay routing

Cited by 98 publications

References 11 publications

A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications

A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications

Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning

Exploring Small-World-Like Topologies Via SplitProber: Turning Power Laws into an Advantage in Unstructured Overlays

Contact Info

Product

Resources

About