Replacing Network Coordinate System with Internet Delay Matrix Service (IDMS): A Case Study in Chinese Internet

Network distance (Round Trip Time, RTT) is an important parameter for many Internet distributed systems to optimize their performances. Network Coordinate System (NCS) is assumed as a lightweight and scalable mechanism to predict network distance between any two Internet hosts without explicit measurements. Though many NCSes have been proposed in the literatures, they are not satisfactory in terms of accuracy. In this paper, we propose to use delay matrix to replace the NCS. This paper makes three contributions. First, we show that not all the hosts need an independent network coordinate (NC). On the contrary, most hosts can be represented as one or several nodes in NCS. Second, we present an Internet Delay Matrix Service (IDMS) for representing network distances without explicit measurements in Internet. Third, we describe two delay matrices up to date delay matrix (UDM) and previous delay matrices (PDM) for representing the network distances. Extensive simulations on our collected Chinese Internet data sets show that IDMS is an accurate, efficient, scalable and practical method for Chinese Internet. The performance of IDMS is better than other existing approaches.

[1]  Bobby Bhattacharjee,et al.  Triangle inequality variations in the internet , 2009, IMC '09.

[2]  Gang Wang,et al.  A Novel Supernodes Election Scheme in Structured P2P Network , 2011 .

[3]  Piet Van Mieghem,et al.  Scalable multicasting with network-aware geometric overlay , 2008, Comput. Commun..

[4]  Cláudio L. Amorim,et al.  D1HT: a distributed one hop hash table , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[5]  Moritz Steiner,et al.  Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus , 2009, Networking.

[6]  Xiao Wang,et al.  Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization , 2011, IEEE Transactions on Network and Service Management.

[7]  Xiaodong Zhang,et al.  ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[8]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[9]  Dan Li,et al.  Taming the triangle inequality violations with network coordinate system on real internet , 2010, ReARCH '10.

[10]  Gang Wang,et al.  An efficient relay node selection scheme to improve the performance of P2P-based VoIP applications in Chinese internet , 2011, Multimedia Tools and Applications.

[11]  Hyuk Lim,et al.  Constructing internet coordinate system based on delay measurement , 2005, IMC '03.

[12]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[13]  Jacob R. Lorch,et al.  Matchmaking for online games and other latency-sensitive P2P systems , 2009, SIGCOMM '09.

[14]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[15]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[16]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[17]  Songqing Chen,et al.  TopBT: A Topology-Aware and Infrastructure-Independent BitTorrent Client , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Bo Zhang,et al.  Towards network triangle inequality violation aware distributed systems , 2007, IMC '07.

[19]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[20]  Henning Schulzrinne,et al.  Peer-to-peer internet telephony using SIP , 2005, NOSSDAV '05.

[21]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[22]  Jonathan M. Smith,et al.  IDES: An Internet Distance Estimation Service for Large Networks , 2006, IEEE Journal on Selected Areas in Communications.

[23]  Venkata N. Padmanabhan,et al.  Some findings on the network performance of broadband hosts , 2003, IMC '03.

[24]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[25]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[26]  Amin Vahdat,et al.  Detour: a Case for Informed Internet Routing and Transport , 2007 .

[27]  Zhi-Li Zhang,et al.  On suitability of Euclidean embedding of internet hosts , 2006, SIGMETRICS '06/Performance '06.

[28]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[29]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[31]  Tao Ma,et al.  Locality-Aware Peer-to-Peer SIP , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[32]  Bobby Bhattacharjee,et al.  Symbiotic Relationships in Internet Routing Overlays , 2009, NSDI.

[33]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[34]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[35]  Hyuk Lim,et al.  Constructing Internet coordinate system based on delay measurement , 2003, IEEE/ACM Transactions on Networking.

[36]  Dan R. K. Ports,et al.  Census: Location-Aware Membership Management for Large-Scale Distributed Systems , 2009, USENIX Annual Technical Conference.