Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A Hierarchical Approach to Internet Distance Prediction
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Network monitoring and diagnosis based on available bandwidth measurement
Network monitoring and diagnosis based on available bandwidth measurement
Hyperbolic embedding of internet graph for distance estimation and overlay construction
IEEE/ACM Transactions on Networking (TON)
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
NPA-BT: a network performance aware BitTorrent traffic optimization mechanism
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Using the last-mile model as a distributed scheme for available bandwidth prediction
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Network latency prediction using high accuracy prediction tree
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Future Generation Computer Systems
Hi-index | 0.00 |
Internet path available bandwidth is an important metric for distributed application performance optimization. However, current network coordinate system causes large errors when being used to predict such performance metric. In this paper, based on theoretical and Internet measurement data analysis result, we show that though not strictly satisfy the constraint, Internet path available bandwidth does have some degree of ultra metric space feature. Then we propose an available bandwidth prediction mechanism PathGuru based on this feature. In PathGuru, each node obtains an outgoing and an incoming bandwidth vector using measurement data to and from landmarks, and the available bandwidth between any two nodes is predicted according to the two vectors as well as ultra metric space constraint. Experimental results on Internet measurement dataset show that PathGuru has reasonable prediction accuracy and can also deal with the available bandwidth symmetry violation problem.