Measurement-based analysis, modeling, and synthesis of the internet delay space
暂无分享,去创建一个
Peter Druschel | Bo Zhang | Rudolf H. Riedi | Guohui Wang | Animesh Nandi | Tze Sing Eugene Ng | P. Druschel | Animesh Nandi | T. Ng | R. Riedi | Guohui Wang | Bo Zhang
[1] Arun Venkataramani,et al. iPlane: an information plane for distributed services , 2006, OSDI '06.
[2] Zhi-Li Zhang,et al. On suitability of Euclidean embedding of internet hosts , 2006, SIGMETRICS '06/Performance '06.
[3] Krishna P. Gummadi,et al. The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.
[4] M. Frans Kaashoek,et al. Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.
[5] Bobby Bhattacharjee,et al. Scalable application layer multicast , 2002, SIGCOMM 2002.
[6] Yuval Shavitt,et al. Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[7] Yuval Shavitt,et al. On the curvature of the Internet and its usage for overlay construction and distance estimation , 2004, IEEE INFOCOM 2004.
[8] Marcel Waldvogel,et al. Efficient topology-aware overlay network , 2003, CCRV.
[9] Walter Willinger,et al. A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM 2004.
[10] Jon Crowcroft,et al. On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.
[11] Rolf-Dieter Reiss,et al. A Course on Point Processes , 1992 .
[12] Miguel Castro,et al. PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..
[13] Bo Zhang,et al. Measurement-Based Analysis, Modeling, and Synthesis of the Internet Delay Space , 2006, IEEE/ACM Transactions on Networking.
[14] Emin Gün Sirer,et al. Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays , 2004, NSDI.
[15] Jon M. Kleinberg,et al. Triangulation and Embedding Using Small Sets of Beacons , 2004, FOCS.
[16] Atul Singh,et al. Eclipse Attacks on Overlay Networks: Threats and Defenses , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[17] Aleksandrs Slivkins,et al. Distributed approaches to triangulation and embedding , 2005, SODA '05.
[18] 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.
[19] David Mazières,et al. OASIS: Anycast for Any Service , 2006, NSDI.
[20] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[21] Mark Crovella,et al. Virtual landmarks for the internet , 2003, IMC '03.
[22] Miguel Castro,et al. Security for Structured Peer-to-peer Overlay Networks , 2004 .
[23] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[24] Hyuk Lim,et al. Constructing internet coordinate system based on delay measurement , 2005, IMC '03.
[25] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.
[26] David R. Karger,et al. Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.
[27] J. Møller,et al. Statistical Inference and Simulation for Spatial Point Processes , 2003 .
[28] D. Saha,et al. On Suitability of Euclidean Embedding for Host-Based Network Coordinate Systems , 2010, IEEE/ACM Transactions on Networking.
[29] Eng Keong Lua,et al. Internet Routing Policies and Round-Trip-Times , 2005, PAM.
[30] John Kubiatowicz,et al. Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks , 2003, DISC.
[31] A. Acharya,et al. A Study of Internet Round-trip Delay , 1998 .
[32] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[33] Sugih Jamin,et al. Inet-3.0: Internet Topology Generator , 2002 .
[34] Supranamaya Ranjan,et al. Wide area redirection of dynamic content by Internet data centers , 2004, IEEE INFOCOM 2004.
[35] Emin Gün Sirer,et al. Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.
[36] Peter Druschel,et al. Exploiting network proximity in peer-to-peer overlay networks , 2002 .
[37] Ben Y. Zhao,et al. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .
[38] Matthew Doar,et al. A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[39] Stefan Savage,et al. The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.
[40] Miguel Castro,et al. Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.
[41] Jon Crowcroft,et al. Lighthouses for Scalable Distributed Location , 2003, IPTPS.
[42] Krishna P. Gummadi,et al. King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.
[43] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[44] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[45] Peter Druschel,et al. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays , 2003 .