An investigation of geographic mapping techniques for internet hosts
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Some findings on the network performance of broadband hosts
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Constraint-based geolocation of internet hosts
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Exploiting internet route sharing for large scale available bandwidth estimation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Octant: a comprehensive framework for the geolocalization of internet hosts
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Application-Level versus network-level proximity
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
IDES: An Internet Distance Estimation Service for Large Networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
We introduce in this paper CHESS, an application-aware space for enhanced scalable (In our context, the scalability feature is satisfied when the system overhead is linear with the number of its nodes.) services in overlay networks. In this new space, the proximity of peers is determined according to a utility function that considers the network parameters (e.g., delay, bandwidth, and loss rate) impacting application performance. We motivate the need for this new notion by showing that the proximity in the delay space does not automatically lead to a proximity in another space (e.g., space of the bandwidth). For determining the proximity in CHESS, network parameters must be estimated easily and scalably. Therefore, we use the matrix factorization approach for estimating the delay and loss parameters. Besides, we propose a scalable model that estimates the bandwidth among peers using the bandwidth of the indirect paths that join them via a set of landmarks. Our idea is that an indirect path shares the same tight link with the direct path with a probability that depends on the location of the corresponding landmark with respect to the direct path or any of the two peers subject to bandwidth inference. The results show that characterizing the proximity in CHESS provides a much better quality than that obtained when using the delay proximity for large file transfer applications. The whole study is supported by real measurements carried out over Planetlab.