Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
Mobile IP: the Internet unplugged
Mobile IP: the Internet unplugged
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
An architecture for large scale Internet measurement
IEEE Communications Magazine
CC-Buddy: an adaptive framework for maintaining cache coherency using peers
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Integrated location management and location-aided routing system for mobile ad hoc networks
Journal of Parallel and Distributed Computing
USING AUTONOMOUS SYSTEM TOPOLOGICAL INFORMATION IN A WEB SERVER PERFORMANCE PREDICTION
Cybernetics and Systems
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
There is an increasing trend in the Internet that a set of replicated providers are qualified for a service or resource request from a client. In this case, it is advantageous to select the best provider considering some distance measures, such as hop count or path latency. In this paper, we present a group-based distance measurement service (GDMS), which estimates and disseminates distance information of node-pairs in large-scale wide area networks. GDMS is fully distributed and does not rely on any centralized servers; thus is particularly suitable for the rapidly popularized peer-to-peer applications. The key concept in GDMS is measurement groups (MGroups). Nodes are self-organized into MGroups to form a hierarchical structure. A set of algorithms are proposed to handle network dynamics and optimize the group organization to reduce system costs as well as improve estimation accuracy. Moreover, a novel multicast-based algorithm is used for both intra- and inter-group performance measurements. Performance evaluation over different network topologies shows that GDMS is scalable and provides effective distance information to upper-layer applications at a relatively low cost.