Scalable multicasting with network-aware geometric overlay

Lua, Eng Keong; Zhou, Xiaoming; Crowcroft, Jon; Mieghem, Piet Van

doi:10.1016/j.comcom.2007.08.046

Cited by 18 publications

(7 citation statements)

References 26 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whether for a network service provider or a network user, it is urgent to grasp the IP network performance and status parameters, as well as the network's operational performance and behavior characteristics in order to optimize network applications and improve service efficiency. Inter-node delay is one of the key parameters that can reflect network performance and state, and many Internet applications rely on accurate delay measurement, such as distributed overlay network multicast [1,2], content addressable overlay network [3], P2P file sharing [4], online games and IP positioning based on network coordinate system [5,6] and so forth. However, due to the large-scale, high-dynamic, self-organizing complexity of the network, it is extremely difficult to accurately and completely measure the inter-node delay.…”

Section: Introductionmentioning

confidence: 99%

A Survey on Network Coordinate Systems

Cheng

Wang

2018

MATEC Web Conf.

View full text Add to dashboard Cite

Network coordinate systems play an important role in applications such as P2P file sharing, online network games, and IP positioning. Many network applications require a large amount of network delay data. However, plenty of network delay measurements will cause the network heavily loaded and unreachable problems between network nodes. The proposed network coordinate system provides an important means to solve these problems. Firstly the concept and application of the network coordinate system are introduced. Secondly, the existing representative network coordinate systems are elaborated in detail, such as system based on Euclidean distance and matrix decomposition, and then the advantages of each system are compared. Finally, the factors affecting the accuracy of network coordinate system prediction are analyzed, and the problems are pointed out which the network coordinate system is worth researching in the next step.

show abstract

Section: Introductionmentioning

confidence: 99%

A Survey on Network Coordinate Systems

Cheng

Wang

2018

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…Many studies have been undertaken on building a super-peer overlay [7,8,10,12,14,[18][19][20][21][22]. The principles and guidance of designing a super-peer overlay were addressed by Kirk [3] and Yang et al [14], but no experimental results were reported.…”

Section: Introductionmentioning

confidence: 99%

“…The principles and guidance of designing a super-peer overlay were addressed by Kirk [3] and Yang et al [14], but no experimental results were reported. Some efforts utilized network proximity for building a super-peer overlay, e.g., [8,12,18,21]. Client peers are connected with super-peers based on their distances.…”

Section: Introductionmentioning

confidence: 99%

An efficient selection algorithm for building a super-peer overlay

Liu

Harjula

Ylianttila

2013

J Internet Serv Appl

View full text Add to dashboard Cite

Super-peer overlay provides an efficient way to run applications by exploring the heterogeneity of nodes in a Peerto-Peer overlay network. Identifying nodes with high capacity as super-peers plays an important role in improving the performance of P2P applications, such as live streaming. In this paper, we present a super-peer selection algorithm (SPS) to select super-peers for quickly building a super-peer overlay. In the SPS, each peer periodically builds its set of super-peer candidates through gossip communication with its neighbors, in order to select superpeers and client peers. Simulation results demonstrate that the SPS is efficient in selecting super-peers, and in quickly building a super-peer overlay. The proposed SPS also possesses good scalability and robustness to failure of super-peers.

show abstract

“…In [21], Keong Lua et al propose an accurate and scalable Internet subspace geometry to embed the nodes onto a geometric plane by measuring delay latencies between some nodes and assign geometric coordinates to all nodes in such a way that the geometric distances between node coordinates closely approximate their delay latencies. These authors also design a network-aware SuperPeers-Peers geometric overlay hierarchy maintained locally in a distributed manner allowing self-organization.…”

Section: Overlay Multicastmentioning

confidence: 99%