网络坐标计算模型与应用研究
|
摘要
大规模分布式网络应用技术是当前互联网领域的研究热点之一,准确地获取互联网节点之间距离并基于邻近原则选择链路是提高这些应用系统整体性能的关键因素。网络坐标系统是一种互联网距离预测方法,具有高可扩展性和低测量开销,其理论和方法研究具有重要的理论意义和实用价值。
提高距离预测的准确性是网络坐标系统研究的核心问题,本论文基于对互联网非最短路径路由和互联网节点抖动这两个影响距离预测准确性的关键因素的深入分析,针对网络坐标系统的计算模型、预测算法、体系结构以及应用开展研究,提出了提高距离预测准确性的解决方案。论文的主要贡献与创新点如下:
首先,针对互联网非最短路径路由影响基于欧氏距离网络坐标系统预测准确性的问题,对基于矩阵分解的网络坐标计算模型进行了分析。通过引入矢量权重,构建了基于矩阵分解的非中心式网络坐标系统Phoenix。仿真实验表明,与已有系统比较,Phoenix系统显著降低了距离预测相对误差。
其次,为了保证在提高距离预测准确性的前提下,实现和已有的基于欧氏距离的网络坐标系统的兼容,提出了一种非中心式分层网络坐标计算模型,并构建了分层网络坐标系统Pharos。仿真实验表明,Pharos系统相比Vivaldi系统有更小的距离预测相对误差。在最近邻居选择和覆盖网络组播等应用中,采用Pharos系统比Vivaldi系统有更好的性能。
第三,针对普遍存在的互联网节点抖动对于非中心式网络坐标系统预测准确性的影响,提出了一种对节点抖动鲁棒的非中心式网络坐标计算模型,并设计实现了网络坐标系统Myth。仿真实验表明,在节点抖动情况下Myth系统能够用比Vivaldi系统更低的测量开销获得更高的距离预测准确性。
最后,设计实现了基于网络坐标的应用层任播原型系统Proxima并在互联网上进行了实际部署。实际互联网测试表明,该系统能够基于低延迟、高带宽的原则进行任播候选服务器选择,实现全球范围内的高性能任播服务。
Large scale Internet application is a hot topic in today’s Internet research. Obtain-ing the distance accurately between the Internet hosts and doing locality-aware Internetpath selection is an important factor in improving the performance of such application.Network Coordinate (NC) System is a manner for Internet distance prediction withhigh scalability and low measurement overhead.
The key problem of NC related research is the improvement of the predictionaccuracy. This thesis focuses on the following two important problems: sub-optimalrouting and node churn. Extensive studies are done for the computational model, algo-rithm, architecture and applications of NC systems and solutions with high predictionaccuracy are proposed. The main contributions and innovations are as follows.
First, for the sub-optimal routing problem, extensive analyses have been donefor the matrix factorization based NC computational model. By introducing weightedmodel, a decentralized NC system called Phoenix is proposed. According to our ex-periments, Phoenix can reduce the relative error of distance prediction greatly fromexisting NC systems.
Second, to guarantee the compatibility with the existing Euclidean distance basedNC system, a decentralized hierarchical NC computational model is proposed. A de-centralized and hierarchical NC system called Pharos is designed and implementedby using this model. The experimental results show that Pharos greatly outperformsVivaldi in Internet distance prediction. Our extensive evaluation results also demon-strate that Pharos can significantly improve the performance from Vivaldi in distributedInternet applications, such as closest neighbor selection and overlay multicast.
Third, for the node churn problem, a decentralized NC computational modelwhich is robust to node churn is proposed. A decentralized NC system called Mythis designed and implemented by using this model. Our experimental results show thatMyth is a cost-e?ective way to achieve higher prediction accuracy, it will not only improve the prediction accuracy but also save the communication overhead.
Last, A NC based application layer anycast system called Proxima is proposed.We have implemented and deployed Proxima in Internet. By using Pharos NC system,Proxima can achieve low latency, high bandwidth server selection from the anycastgroup. Proxima is a promising solution to achieve high performance global anycastservice.
提高距离预测的准确性是网络坐标系统研究的核心问题,本论文基于对互联网非最短路径路由和互联网节点抖动这两个影响距离预测准确性的关键因素的深入分析,针对网络坐标系统的计算模型、预测算法、体系结构以及应用开展研究,提出了提高距离预测准确性的解决方案。论文的主要贡献与创新点如下:
首先,针对互联网非最短路径路由影响基于欧氏距离网络坐标系统预测准确性的问题,对基于矩阵分解的网络坐标计算模型进行了分析。通过引入矢量权重,构建了基于矩阵分解的非中心式网络坐标系统Phoenix。仿真实验表明,与已有系统比较,Phoenix系统显著降低了距离预测相对误差。
其次,为了保证在提高距离预测准确性的前提下,实现和已有的基于欧氏距离的网络坐标系统的兼容,提出了一种非中心式分层网络坐标计算模型,并构建了分层网络坐标系统Pharos。仿真实验表明,Pharos系统相比Vivaldi系统有更小的距离预测相对误差。在最近邻居选择和覆盖网络组播等应用中,采用Pharos系统比Vivaldi系统有更好的性能。
第三,针对普遍存在的互联网节点抖动对于非中心式网络坐标系统预测准确性的影响,提出了一种对节点抖动鲁棒的非中心式网络坐标计算模型,并设计实现了网络坐标系统Myth。仿真实验表明,在节点抖动情况下Myth系统能够用比Vivaldi系统更低的测量开销获得更高的距离预测准确性。
最后,设计实现了基于网络坐标的应用层任播原型系统Proxima并在互联网上进行了实际部署。实际互联网测试表明,该系统能够基于低延迟、高带宽的原则进行任播候选服务器选择,实现全球范围内的高性能任播服务。
Large scale Internet application is a hot topic in today’s Internet research. Obtain-ing the distance accurately between the Internet hosts and doing locality-aware Internetpath selection is an important factor in improving the performance of such application.Network Coordinate (NC) System is a manner for Internet distance prediction withhigh scalability and low measurement overhead.
The key problem of NC related research is the improvement of the predictionaccuracy. This thesis focuses on the following two important problems: sub-optimalrouting and node churn. Extensive studies are done for the computational model, algo-rithm, architecture and applications of NC systems and solutions with high predictionaccuracy are proposed. The main contributions and innovations are as follows.
First, for the sub-optimal routing problem, extensive analyses have been donefor the matrix factorization based NC computational model. By introducing weightedmodel, a decentralized NC system called Phoenix is proposed. According to our ex-periments, Phoenix can reduce the relative error of distance prediction greatly fromexisting NC systems.
Second, to guarantee the compatibility with the existing Euclidean distance basedNC system, a decentralized hierarchical NC computational model is proposed. A de-centralized and hierarchical NC system called Pharos is designed and implementedby using this model. The experimental results show that Pharos greatly outperformsVivaldi in Internet distance prediction. Our extensive evaluation results also demon-strate that Pharos can significantly improve the performance from Vivaldi in distributedInternet applications, such as closest neighbor selection and overlay multicast.
Third, for the node churn problem, a decentralized NC computational modelwhich is robust to node churn is proposed. A decentralized NC system called Mythis designed and implemented by using this model. Our experimental results show thatMyth is a cost-e?ective way to achieve higher prediction accuracy, it will not only improve the prediction accuracy but also save the communication overhead.
Last, A NC based application layer anycast system called Proxima is proposed.We have implemented and deployed Proxima in Internet. By using Pharos NC system,Proxima can achieve low latency, high bandwidth server selection from the anycastgroup. Proxima is a promising solution to achieve high performance global anycastservice.
引文
[1] Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service forinternet applications. Proceedings of the 2001 conference on Applications, technologies,architectures, and protocols for computer communications (SIGCOMM’01), New York,NY, USA: ACM, 2001. 149–160.
[2] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of IFIP/ACM International Conference on Dis-tributed Systems Platforms (Middleware’01), 2001. 329–350.
[3] Zhao B, Huang L, Stribling J, et al. Tapestry: a resilient global-scale overlay for servicedeployment. IEEE Journal on Selected Areas in Communications, 2004, 22(1):41–53.
[4] Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. Proceed-ings of the 2001 conference on Applications, technologies, architectures, and protocols forcomputer communications (SIGCOMM’01), New York, NY, USA: ACM, 2001. 161–172.
[5] Zhang X Y, Zhang Q, Zhang Z, et al. A construction of locality-aware overlay network:mOverlay and its performance. , IEEE Journal on Selected Areas in Communications, 2004,22(1):18–28.
[6]田瑞雄.自组织覆盖网络建模与优化[博士学位论文].北京:清华大学, 2005.
[7] BitTorrent, 2009. http://www.bittorrent.com/.
[8] eMule Project, 2009. http://www.emule-project.net/.
[9] Lian Q, Zhang Z, Yang M, et al. An Empirical Study of Collusion Behavior in the MazeP2P File-Sharing System. Proceedings of the 27th International Conference on DistributedComputing Systems (ICDCS’07), Washington, DC, USA: IEEE Computer Society, 2007.56.
[10] Huang Y, Fu T Z, Chiu D M, et al. Challenges, design and analysis of a large-scale p2p-vod system. Proceedings of the ACM SIGCOMM 2008 conference on Data communication(SIGCOMM’08), New York, NY, USA: ACM, 2008. 375–388.
[11] Chu Y H, Rao S G, Zhang H. A case for end system multicast (keynote address). Pro-ceedings of the 2000 ACM SIGMETRICS international conference on Measurement andmodeling of computer systems (SIGMETRICS’00), New York, NY, USA: ACM, 2000.1–12.
[12] Chu Y H, Ganjam A, Ng T S E, et al. Early experience with an internet broadcast systembased on overlay multicast. Proceedings of the annual conference on USENIX AnnualTechnical Conference (ATEC’04), Berkeley, CA, USA: USENIX Association, 2004.
[13] Xie S, Li B, Keung G, et al. Coolstreaming: Design, Theory, and Practice. IEEE Transac-tions on Multimedia, 2007, 9(8):1661–1671.
[14] Liao X, Jin H, Liu Y, et al. AnySee: Peer-to-Peer Live Streaming. Proceedings of 25th IEEEInternational Conference on Computer Communications (INFOCOM’06), 2006. 1–10.
[15] Abraham I, Malkhi D. Compact routing on euclidian metrics. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC’04), NewYork, NY, USA: ACM, 2004. 141–149.
[16] Ledlie J, Pietzuch P, Mitzenmacher M, et al. Wired Geometric Routing. Proceedings of theSixth International Workshop on Peer-to-Peer Systems (IPTPS’07), 2007.
[17] Wong B, Slivkins A, Sirer E G. Meridian: a lightweight network location service withoutvirtual coordinates. Proceedings of the 2005 conference on Applications, technologies, ar-chitectures, and protocols for computer communications (SIGCOMM’05), New York, NY,USA: ACM, 2005. 85–96.
[18] Kwon G I, Byers J. ROMA: reliable overlay multicast with loosely coupled TCP connec-tions. Proceedings of Twenty-third AnnualJoint Conference of the IEEE Computer andCommunications Societies (INFOCOM’04), volume 1, 2004.
[19] Bindal R, Cao P, Chan W, et al. Improving Tra?c Locality in BitTorrent via Biased NeighborSelection. Proceedings of the 26th IEEE International Conference on Distributed ComputingSystems (ICDCS’06), Washington, DC, USA: IEEE Computer Society, 2006. 66.
[20] Xie H, Yang Y R, Krishnamurthy A, et al. P4P: provider portal for applications. Proceedingsof the ACM SIGCOMM 2008 conference on Data communication (SIGCOMM’08), NewYork, NY, USA: ACM, 2008. 351–362.
[21] All pair Ping project, 2009. http://pdos.csail.mit.edu/～strib/pl app/.
[22] PlanetLab Testbed, 2009. http://www.planet-lab.org/.
[23] Ng T, Zhang H. Predicting Internet network distance with coordinates-based approaches.Proceedings of Twenty-First Annual Joint Conference of the IEEE Computer and Commu-nications Societies (INFOCOM’02), New York, NY, USA, 2002.
[24] H Lehman L. PCoord: A Decentralized Network Coordinate System for Internet DistancePrediction[D]. Cambridge, MA, USA: Massachusetts Institute of Technology, May, 2005.
[25] Lehman L, Lerman S. A Decentralized Network Coordinate System for Robust InternetDistance. Proceedings of Third International Conference on Information Technology: NewGenerations (ITNG’06), 2006. 631–637.
[26] Tang L, Crovella M. Virtual landmarks for the internet. Proceedings of the 3rd ACMSIGCOMM conference on Internet measurement (IMC’03), New York, NY, USA: ACM,2003. 143–152.
[27] Lim H, Hou J C, Choi C H. Constructing internet coordinate system based on delay mea-surement. Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement(IMC’03), New York, NY, USA: ACM, 2003. 129–142.
[28] Dabek F, Cox R, Kaashoek F, et al. Vivaldi: a decentralized network coordinate system.Proceedings of the 2004 conference on Applications, technologies, architectures, and pro-tocols for computer communications (SIGCOMM’04), New York, NY, USA: ACM, 2004.15–26.
[29] Costa M, Castro M, Rowstron A, et al. PIC: Practical Internet Coordinates for DistanceEstimation. Proceedings of the 24th International Conference on Distributed ComputingSystems (ICDCS’04), Washington, DC, USA: IEEE Computer Society, 2004. 178–187.
[30] Ng T S E, Zhang H. A network positioning system for the internet. Proceedings of theannual conference on USENIX Annual Technical Conference (ATEC’04), Berkeley, CA,USA: USENIX Association, 2004. 11–11.
[31] Shi X h, Chen Y, Deng B x, et al. Network Distance Prediction based on Network CoordinateSystem. Proceedings of the Fifth International Conference on Grid and Cooperative Com-puting Workshops (GCCW’06), Washington, DC, USA: IEEE Computer Society, 2006.170–175.
[32] Lim H, Hou J C, Choi C H. Constructing internet coordinate system based on delay mea-surement. IEEE/ACM Trans. on Networking, 2005, 13(3):513–525.
[33] Rhea S, Geels D, Roscoe T, et al. Handling churn in a DHT. Proceedings of the annualconference on USENIX Annual Technical Conference (ATEC’04: ), Berkeley, CA, USA:USENIX Association, 2004.
[34] Godfrey P B, Shenker S, Stoica I. Minimizing churn in distributed systems. Proceedingsof the 2006 conference on Applications, technologies, architectures, and protocols for com-puter communications (SIGCOMM’06), New York, NY, USA: ACM, 2006. 147–158.
[35] Zheng H, Lua E K, Pias M, et al. Internet Routing Policies and Round-Trip-Times. Pro-ceedings of the 6th anuual Passive & Active Measurement Workshop (PAM’05), 2005.
[36] Lee S, Zhang Z L, Sahu S, et al. On suitability of Euclidean embedding of internet hosts.Proceedings of the joint international conference on Measurement and modeling of com-puter systems (SIGMETRICS’06/Performance’06), New York, NY, USA: ACM, 2006.157–168.
[37] Lumezanu C, Levin D, Spring N. PeerWise Discovery and Negotiation of Faster Paths.Proceedings of Sixth Workshop on Hot Topics in Networks (HotNets-VI), 2007.
[38] Kaafar M A, Cantitin F, Gueye B, et al. Detecting Triangle Inequality Violations for InternetCoordinate Systems. Proceedings of International Workshop on the Network of the Future(FN’09), 2009.
[39] Mao Y, Saul L K. Modeling distances in large-scale networks by matrix factorization. Pro-ceedings of the 4th ACM SIGCOMM conference on Internet measurement (IMC’04), NewYork, NY, USA: ACM, 2004. 278–287.
[40] Mao Y, Saul L, Smith J. IDES: An Internet Distance Estimation Service for Large Networks., IEEE Journal on Selected Areas in Communications, 2006, 24(12):2273–2284.
[41] Lumezanu C, Spring N. Measurement Manipulation and Space Selection in Network Coor-dinates. Proceedings of the 2008 The 28th International Conference on Distributed Comput-ing Systems (ICDCS’08), Washington, DC, USA: IEEE Computer Society, 2008. 361–368.
[42] Ledlie J, Gardner P, Seltzer M. Network Coordinates in the Wild. Proceedings of the 4rdconference on Networked Systems Design & Implementation (NSDI’07), Berkeley, CA,USA: USENIX Association, 2007.
[43] Zhang R, Tang C, Hu Y, et al. Impact of the Inaccuracy of Distance Prediction Algorithmson Internet Applications - an Analytical and Comparative Study. Proceedings of 25th IEEEInternational Conference on Computer Communications (INFOCOM’06), 2006. 1–12.
[44] Launois C d, Uhlig S, Bonaventure O. Scalable Route Selection for IPv6 Multihomed Sites.Proceedings of IFIP Networking’05, volume 3462 of Lecture Notes in Computer Science.Springer-Verlag, 2005. 1357–1361.
[45] Zhang B, Ng T S E, Nandi A, et al. Measurement based analysis, modeling, and synthesisof the internet delay space. Proceedings of the 6th ACM SIGCOMM conference on Internetmeasurement (IMC’06), New York, NY, USA: ACM, 2006. 85–98.
[46] Francois Cantin M A K G L. Overlay Routing using Coordinate Systems. Proceedings ofProceedings of ACM CoNEXT Student Workshop 2008, 2008.
[47] Lua E K, Zhou X, Crowcroft J, et al. Scalable multicasting with network-aware geometricoverlay. Computer Communications, 2008, 31(3):464–488.
[48] Ledlie J, Seltzer M, Pietzuch P. Proxy Network Coordinates. Technical report, 2008/4,Department of Computing, Imperial College London, United Kingdom, 2008.
[49]吴唯瑜.基于节点位置的P2P覆盖网络算法研究与系统设计[硕士学位论文].北京:清华大学, 2008.
[50] Szymaniak M, Presotto D, Pierre G, et al. Practical large-scale latency estimation. ComputerNetworks, 2008, 52(7):1343–1364.
[51] Pietzuch P, Ledlie J, Shneidman J, et al. Network-Aware Operator Placement for Stream-Processing Systems. Proceedings of the 22nd International Conference on Data Engineering(ICDE’06), Washington, DC, USA: IEEE Computer Society, 2006.
[52] Azureus - now called Vuze - Bittorrent Client, 2009. http://azureus.sourceforge.net/.
[53] Kaafar M A, Mathy L, Turletti T, et al. Real attacks on virtual networks: Vivaldi out of tune.Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense (LSAD’06),New York, NY, USA: ACM, 2006. 139–146.
[54] Kaafar M A, Mathy L, Turletti T, et al. Virtual networks under attack: disrupting internetcoordinate systems. Proceedings of Proceedings of the 2006 ACM CoNEXT conference(CoNEXT’06), New York, NY, USA: ACM, 2006. 1–12.
[55] Kaafar M A, Mathy L, Barakat C, et al. Securing internet coordinate embedding systems.Proceedings of the 2007 conference on Applications, technologies, architectures, and pro-tocols for computer communications (SIGCOMM’07), New York, NY, USA: ACM, 2007.61–72.
[56] Saucez D, Donnet B, Bonaventure O. A Reputation-Based Approach for Securing VivaldiEmbedding System. Proceedings of Proc. 13th EUNICE Open European Summer Schooland IFIP TC6.6 Workshop on Dependable and Adaptable Networks and Service, Twente,The Netherlands, 2007.
[57] Ledlie J T. A Locality-Aware Approach to Distributed Systems[D]. Cambridge, MA, USA:Harvard University, September, 2007.
[58]哈佛大学的网络坐标研究课题组主页, 2009. http://www.eecs.harvard.edu/～syrah/nc/.
[59] Steiner M, Biersack E W. Where is my Peer? Evaluation of the Vivaldi Network CoordinateSystem in Azureus. Proceedings of 8th International IFIP-TC6 Networking Conference(Networking’09), volume 5550 of Lecture Notes in Computer Science. Springer-Verlag,2009. 145–156.
[60] Ratnasamy S, Handley M, Karp R, et al. Topologically-aware overlay construction andserver selection. Proceedings of Twenty-First Annual Joint Conference of the IEEE Com-puter and Communications Societies (INFOCOM’02), volume 3, 2002. 1190–1199 vol.3.
[61] Cong L, Yang B, Chen Y, et al. NTS6: IPv6 based Network Topology Service System ofCERNET2. Proceedings of the 2007 International Conference on Multimedia and Ubiqui-tous Engineering (MUE’07), Washington, DC, USA: IEEE Computer Society, 2007. 1010–1015.
[62] Cong L, Chen Y, Shi X, et al. Telemeter: Network Distance Prediction Base on NetworkTopology. Proceedings of the Sixth International Conference on Grid and Cooperative Com-puting (GCC’07), Washington, DC, USA: IEEE Computer Society, 2007. 34–41.
[63]第二代中国教育和科研计算机网, 2009. http://www.cernet2.edu.cn/.
[64] Coltun R, Ferguson D, Moy J, et al. OSPF for IPv6. RFC 5340 (Proposed Standard), July,2008. http://www.ietf.org/rfc/rfc5340.txt.
[65] Rekhter Y, Li T, Hares S. A Border Gateway Protocol 4 (BGP-4). RFC 4271 (Draft Stan-dard), January, 2006. http://www.ietf.org/rfc/rfc4271.txt.
[66] Harrington D, Presuhn R, Wijnen B. An Architecture for Describing Simple Network Man-agement Protocol (SNMP) Management Frameworks. RFC 3411 (Standard), December,2002. http://www.ietf.org/rfc/rfc3411.txt. Updated by RFC 5343.
[67] Nelder J A, Mead R. A Simplex Method for Function Minimization. The Computer Journal,1965, 7(4):308–313.
[68] Pietzuch P, Ledlie J, Mitzenmacher M, et al. Network-Aware Overlays with Network Coor-dinates. Proceedings of the 26th IEEE International Conference Workshops on DistributedComputing Systems (ICDCSW’06), Washington, DC, USA: IEEE Computer Society, 2006.12.
[69] Zage D J, Nita-Rotaru C. On the accuracy of decentralized virtual coordinate systems inadversarial networks. Proceedings of the 14th ACM conference on Computer and commu-nications security (CCS’07), New York, NY, USA: ACM, 2007. 214–224.
[70] Sherr M, Loo B T, Blaze M. Veracity: A Fully Decentralized Service for Securing NetworkCoordinate Systems. Proceedings of Proceedings of the Internaltional Workshop on Peer-to-Peer Systems (IPTPS’08), 2008.
[71] Wang G, Ng T E. Distributed algorithms for stable and secure network coordinates. Pro-ceedings of the 8th ACM SIGCOMM conference on Internet measurement (IMC’08), NewYork, NY, USA: ACM, 2008. 131–144.
[72] Ledlie J, Pietzuch P, Seltzer M. Stable and Accurate Network Coordinates. Proceedings ofthe 26th IEEE International Conference on Distributed Computing Systems (ICDCS’06),Washington, DC, USA: IEEE Computer Society, 2006. 74.
[73] Zhao X, Song X, Wang X, et al. Attacks against Network Coordinate System: VulnerablePIC. Proceedings of the International Symposium on Computer Science and its Applications(CSA’08), Washington, DC, USA: IEEE Computer Society, 2008. 251–256.
[74] Zhao X, Lua E K, Chen Y, et al. Sniper: Social-link Defense for Network Coordinate Sys-tems. Proceedings of the 28th IEEE Conference on Computer Communications Studentworkshop (INFOCOM’09), 2009.
[75] Lua E K, Gri?n T, Pias M, et al. On the accuracy of embeddings for internet coordinatesystems. Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement(IMC’05), Berkeley, CA, USA: USENIX Association, 2005.
[76] Lua E K. The Structure of Internet Latency[D]. London, United Kingdom: University ofCambridge, August, 2006.
[77] Zhang R, Hu C, Lin X, et al. A Hierarchical Approach to Internet Distance Prediction.Proceedings of the 26th IEEE International Conference on Distributed Computing Systems(ICDCS’06), Washington, DC, USA: IEEE Computer Society, 2006. 73.
[78] Tang L, Crovella M. Geometric Exploration of the Landmark Selection Problem. Proceed-ings of the 5th anuual Passive & Active Measurement Workshop (PAM’04), 2004.
[79] Pias M, Crowcroft J, Wilbur S, et al. Lighthouses for Scalable Distributed Location. Pro-ceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
[80] Elmokashfi A, Kleis M, Popescu A. NetForecast: A Delay Prediction Scheme for ProviderControlled Networks. Proceedings of IEEE Global Telecommunications Conference(GLOBECOM’07), 2007. 502–507.
[81] Lumezanu C, Baden R, Spring N, et al. Triangle Inequality and Routing Policy Violationsin the Internet. Proceedings of the 10th anuual Passive & Active Measurement Workshop(PAM’09), 2009.
[82] Wang G, Zhang B, Ng T S E. Towards network triangle inequality violation aware dis-tributed systems. Proceedings of the 7th ACM SIGCOMM conference on Internet measure-ment (IMC’07), New York, NY, USA: ACM, 2007. 175–188.
[83] Oran D. OSI IS-IS Intra-domain Routing Protocol. RFC 1142 (Informational), February,1990. http://www.ietf.org/rfc/rfc1142.txt.
[84] Moy J. OSPF Version 2. RFC 2328 (Standard), April, 1998.http://www.ietf.org/rfc/rfc2328.txt.
[85]麻省理工学院P2PSim课题组主页, 2009. http://pdos.csail.mit.edu/p2psim/.
[86] Shavitt Y, Tankel T. Hyperbolic Embedding of Internet Graph for Distance Estimation andOverlay Construction..
[87] Lua E K, Gri?n T. Embeddable Overlay Networks. Proceedings of the 12th IEEE Sympo-sium on Computers and Communications (ISCC’07), 2007. 1099–1106.
[88] IDES网络坐标系统仿真器, 2009. http://www.cis.upenn.edu/～maoy/pub/ides-0.1.tar.gz.
[89] Lee D D, Seung S H. Learning the parts of objects by non-negative matrix factorization.Nature, 1999, 401(6755):788–791.
[90] Boutsidisa C, Gallopoulosb E. SVD based initialization: A head start for nonnegative matrixfactorization. Pattern Recognition, 2008, 41(4):1350–1362.
[91] Chen Y, Wang X, Song X, et al. Phoenix: Towards an Accurate, Practical and Decentral-ized Network Coordinate System. Proceedings of 8th International IFIP-TC6 NetworkingConference (Networking’09), volume 5550 of Lecture Notes in Computer Science. Springer-Verlag, 2009. 313–325.
[92] Lawson C, Hanson R J. Solving Least Squares Problems. Prentice-Hall, 1974: 161.
[93] Route Views Project Homepage, 2009. http://www.routeviews.org/.
[94] Chen K, Nahrstedt K. E?ective location-guided tree construction algorithms for small groupmulticast in MANET. Proceedings of Twenty-First Annual Joint Conference of the IEEEComputer and Communications Societies (INFOCOM’02), volume 3, 2002. 1180–1189vol.3.
[95] Wang F, Xiong Y, Liu J. mTreebone: A Hybrid Tree/Mesh Overlay for Application-LayerLive Video Multicast. Proceedings of the 27th International Conference on DistributedComputing Systems (ICDCS’07), Washington, DC, USA: IEEE Computer Society, 2007.49.
[96] Wang F, Liu J, Xiong Y. Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming. Proceedings of The 27th IEEE Conference on ComputerCommunications (INFOCOM’08), 2008. 1364–1372.
[97]刘鑫.基于任播的分布式服务模型与分布式隧道代理系统[硕士学位论文].北京:清华大学, 2005.
[98] Chun B G, Wu P, Weatherspoon H, et al. ChunkCast: An Anycast Service for Large Con-tent Distribution. Proceedings of the 7th International Workshop on Peer-to-Peer Systems(IPTPS’06), 2006.
[99] Kostic′D, Rodriguez A, Albrecht J, et al. Bullet: high bandwidth data dissemination usingan overlay mesh. SIGOPS Oper. Syst. Rev., 2003, 37(5):282–297.
[100] Karbhari P, Ammar M, Dhamdhere A, et al. Bootstrapping in Gnutella: A MeasurementStudy. Proceedings of the 5th anuual Passive & Active Measurement Workshop (PAM’04),2004.
[101] Ballani H, Francis P. Towards a deployable IP Anycast service. Proceedings of First Work-shop on Real, Large Distributed Systems (WORLDS’04), 2004.
[102] Ballani H, Francis P. Towards a global IP anycast service. Proceedings of the 2005 confer-ence on Applications, technologies, architectures, and protocols for computer communica-tions (SIGCOMM’05), New York, NY, USA: ACM, 2005. 301–312.
[103] Andersen D, Balakrishnan H, Kaashoek F, et al. Resilient overlay networks. Proceedings ofthe eighteenth ACM symposium on Operating systems principles (SOSP’01), New York,NY, USA: ACM, 2001. 131–145.
[104] Partridge C, Mendez T, Milliken W. Host Anycasting Service. RFC 1546 (Informational),November, 1993. http://www.ietf.org/rfc/rfc1546.txt.
[105] AS112 Project Home Page, 2009. http://www.as112.net/.
[106] Zegura E W, Ammar M H, Fei Z, et al. Application-layer anycasting: a server selectionarchitecture and use in a replicated Web service. IEEE/ACM Trans. on Networking, 2000,8(4):455–466.
[107] Freedman M J, Lakshminarayanan K, Mazie`res D. OASIS: anycast for any service. Proceed-ings of the 3rd conference on Networked Systems Design & Implementation (NSDI’06),Berkeley, CA, USA: USENIX Association, 2006.
[108] Freedman M J, Freudenthal E, Mazie`res D. Democratizing content publication with coral.Proceedings of the 1st conference on Symposium on Networked Systems Design and Im-plementation (NSDI’04), Berkeley, CA, USA: USENIX Association, 2004. 18–18.
[109] Rhea S, Godfrey B, Karp B, et al. OpenDHT: a public DHT service and its uses. Proceed-ings of the 2005 conference on Applications, technologies, architectures, and protocols forcomputer communications (SIGCOMM’05), New York, NY, USA: ACM, 2005. 73–84.
[110]中国教育和科研计算机网, 2009. http://www.cernet.edu.cn/.
[111] Google Maps, 2009. http://maps.google.com/.
[112] Chimera DHT, 2009. http://current.cs.ucsb.edu/projects/chimera/.
[113] IPerf, 2009. http://sourceforge.net/projects/iperf.
[114] 6PlanetLab, 2009. http://core.cgeni.edu.cn/.
[2] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of IFIP/ACM International Conference on Dis-tributed Systems Platforms (Middleware’01), 2001. 329–350.
[3] Zhao B, Huang L, Stribling J, et al. Tapestry: a resilient global-scale overlay for servicedeployment. IEEE Journal on Selected Areas in Communications, 2004, 22(1):41–53.
[4] Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. Proceed-ings of the 2001 conference on Applications, technologies, architectures, and protocols forcomputer communications (SIGCOMM’01), New York, NY, USA: ACM, 2001. 161–172.
[5] Zhang X Y, Zhang Q, Zhang Z, et al. A construction of locality-aware overlay network:mOverlay and its performance. , IEEE Journal on Selected Areas in Communications, 2004,22(1):18–28.
[6]田瑞雄.自组织覆盖网络建模与优化[博士学位论文].北京:清华大学, 2005.
[7] BitTorrent, 2009. http://www.bittorrent.com/.
[8] eMule Project, 2009. http://www.emule-project.net/.
[9] Lian Q, Zhang Z, Yang M, et al. An Empirical Study of Collusion Behavior in the MazeP2P File-Sharing System. Proceedings of the 27th International Conference on DistributedComputing Systems (ICDCS’07), Washington, DC, USA: IEEE Computer Society, 2007.56.
[10] Huang Y, Fu T Z, Chiu D M, et al. Challenges, design and analysis of a large-scale p2p-vod system. Proceedings of the ACM SIGCOMM 2008 conference on Data communication(SIGCOMM’08), New York, NY, USA: ACM, 2008. 375–388.
[11] Chu Y H, Rao S G, Zhang H. A case for end system multicast (keynote address). Pro-ceedings of the 2000 ACM SIGMETRICS international conference on Measurement andmodeling of computer systems (SIGMETRICS’00), New York, NY, USA: ACM, 2000.1–12.
[12] Chu Y H, Ganjam A, Ng T S E, et al. Early experience with an internet broadcast systembased on overlay multicast. Proceedings of the annual conference on USENIX AnnualTechnical Conference (ATEC’04), Berkeley, CA, USA: USENIX Association, 2004.
[13] Xie S, Li B, Keung G, et al. Coolstreaming: Design, Theory, and Practice. IEEE Transac-tions on Multimedia, 2007, 9(8):1661–1671.
[14] Liao X, Jin H, Liu Y, et al. AnySee: Peer-to-Peer Live Streaming. Proceedings of 25th IEEEInternational Conference on Computer Communications (INFOCOM’06), 2006. 1–10.
[15] Abraham I, Malkhi D. Compact routing on euclidian metrics. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC’04), NewYork, NY, USA: ACM, 2004. 141–149.
[16] Ledlie J, Pietzuch P, Mitzenmacher M, et al. Wired Geometric Routing. Proceedings of theSixth International Workshop on Peer-to-Peer Systems (IPTPS’07), 2007.
[17] Wong B, Slivkins A, Sirer E G. Meridian: a lightweight network location service withoutvirtual coordinates. Proceedings of the 2005 conference on Applications, technologies, ar-chitectures, and protocols for computer communications (SIGCOMM’05), New York, NY,USA: ACM, 2005. 85–96.
[18] Kwon G I, Byers J. ROMA: reliable overlay multicast with loosely coupled TCP connec-tions. Proceedings of Twenty-third AnnualJoint Conference of the IEEE Computer andCommunications Societies (INFOCOM’04), volume 1, 2004.
[19] Bindal R, Cao P, Chan W, et al. Improving Tra?c Locality in BitTorrent via Biased NeighborSelection. Proceedings of the 26th IEEE International Conference on Distributed ComputingSystems (ICDCS’06), Washington, DC, USA: IEEE Computer Society, 2006. 66.
[20] Xie H, Yang Y R, Krishnamurthy A, et al. P4P: provider portal for applications. Proceedingsof the ACM SIGCOMM 2008 conference on Data communication (SIGCOMM’08), NewYork, NY, USA: ACM, 2008. 351–362.
[21] All pair Ping project, 2009. http://pdos.csail.mit.edu/～strib/pl app/.
[22] PlanetLab Testbed, 2009. http://www.planet-lab.org/.
[23] Ng T, Zhang H. Predicting Internet network distance with coordinates-based approaches.Proceedings of Twenty-First Annual Joint Conference of the IEEE Computer and Commu-nications Societies (INFOCOM’02), New York, NY, USA, 2002.
[24] H Lehman L. PCoord: A Decentralized Network Coordinate System for Internet DistancePrediction[D]. Cambridge, MA, USA: Massachusetts Institute of Technology, May, 2005.
[25] Lehman L, Lerman S. A Decentralized Network Coordinate System for Robust InternetDistance. Proceedings of Third International Conference on Information Technology: NewGenerations (ITNG’06), 2006. 631–637.
[26] Tang L, Crovella M. Virtual landmarks for the internet. Proceedings of the 3rd ACMSIGCOMM conference on Internet measurement (IMC’03), New York, NY, USA: ACM,2003. 143–152.
[27] Lim H, Hou J C, Choi C H. Constructing internet coordinate system based on delay mea-surement. Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement(IMC’03), New York, NY, USA: ACM, 2003. 129–142.
[28] Dabek F, Cox R, Kaashoek F, et al. Vivaldi: a decentralized network coordinate system.Proceedings of the 2004 conference on Applications, technologies, architectures, and pro-tocols for computer communications (SIGCOMM’04), New York, NY, USA: ACM, 2004.15–26.
[29] Costa M, Castro M, Rowstron A, et al. PIC: Practical Internet Coordinates for DistanceEstimation. Proceedings of the 24th International Conference on Distributed ComputingSystems (ICDCS’04), Washington, DC, USA: IEEE Computer Society, 2004. 178–187.
[30] Ng T S E, Zhang H. A network positioning system for the internet. Proceedings of theannual conference on USENIX Annual Technical Conference (ATEC’04), Berkeley, CA,USA: USENIX Association, 2004. 11–11.
[31] Shi X h, Chen Y, Deng B x, et al. Network Distance Prediction based on Network CoordinateSystem. Proceedings of the Fifth International Conference on Grid and Cooperative Com-puting Workshops (GCCW’06), Washington, DC, USA: IEEE Computer Society, 2006.170–175.
[32] Lim H, Hou J C, Choi C H. Constructing internet coordinate system based on delay mea-surement. IEEE/ACM Trans. on Networking, 2005, 13(3):513–525.
[33] Rhea S, Geels D, Roscoe T, et al. Handling churn in a DHT. Proceedings of the annualconference on USENIX Annual Technical Conference (ATEC’04: ), Berkeley, CA, USA:USENIX Association, 2004.
[34] Godfrey P B, Shenker S, Stoica I. Minimizing churn in distributed systems. Proceedingsof the 2006 conference on Applications, technologies, architectures, and protocols for com-puter communications (SIGCOMM’06), New York, NY, USA: ACM, 2006. 147–158.
[35] Zheng H, Lua E K, Pias M, et al. Internet Routing Policies and Round-Trip-Times. Pro-ceedings of the 6th anuual Passive & Active Measurement Workshop (PAM’05), 2005.
[36] Lee S, Zhang Z L, Sahu S, et al. On suitability of Euclidean embedding of internet hosts.Proceedings of the joint international conference on Measurement and modeling of com-puter systems (SIGMETRICS’06/Performance’06), New York, NY, USA: ACM, 2006.157–168.
[37] Lumezanu C, Levin D, Spring N. PeerWise Discovery and Negotiation of Faster Paths.Proceedings of Sixth Workshop on Hot Topics in Networks (HotNets-VI), 2007.
[38] Kaafar M A, Cantitin F, Gueye B, et al. Detecting Triangle Inequality Violations for InternetCoordinate Systems. Proceedings of International Workshop on the Network of the Future(FN’09), 2009.
[39] Mao Y, Saul L K. Modeling distances in large-scale networks by matrix factorization. Pro-ceedings of the 4th ACM SIGCOMM conference on Internet measurement (IMC’04), NewYork, NY, USA: ACM, 2004. 278–287.
[40] Mao Y, Saul L, Smith J. IDES: An Internet Distance Estimation Service for Large Networks., IEEE Journal on Selected Areas in Communications, 2006, 24(12):2273–2284.
[41] Lumezanu C, Spring N. Measurement Manipulation and Space Selection in Network Coor-dinates. Proceedings of the 2008 The 28th International Conference on Distributed Comput-ing Systems (ICDCS’08), Washington, DC, USA: IEEE Computer Society, 2008. 361–368.
[42] Ledlie J, Gardner P, Seltzer M. Network Coordinates in the Wild. Proceedings of the 4rdconference on Networked Systems Design & Implementation (NSDI’07), Berkeley, CA,USA: USENIX Association, 2007.
[43] Zhang R, Tang C, Hu Y, et al. Impact of the Inaccuracy of Distance Prediction Algorithmson Internet Applications - an Analytical and Comparative Study. Proceedings of 25th IEEEInternational Conference on Computer Communications (INFOCOM’06), 2006. 1–12.
[44] Launois C d, Uhlig S, Bonaventure O. Scalable Route Selection for IPv6 Multihomed Sites.Proceedings of IFIP Networking’05, volume 3462 of Lecture Notes in Computer Science.Springer-Verlag, 2005. 1357–1361.
[45] Zhang B, Ng T S E, Nandi A, et al. Measurement based analysis, modeling, and synthesisof the internet delay space. Proceedings of the 6th ACM SIGCOMM conference on Internetmeasurement (IMC’06), New York, NY, USA: ACM, 2006. 85–98.
[46] Francois Cantin M A K G L. Overlay Routing using Coordinate Systems. Proceedings ofProceedings of ACM CoNEXT Student Workshop 2008, 2008.
[47] Lua E K, Zhou X, Crowcroft J, et al. Scalable multicasting with network-aware geometricoverlay. Computer Communications, 2008, 31(3):464–488.
[48] Ledlie J, Seltzer M, Pietzuch P. Proxy Network Coordinates. Technical report, 2008/4,Department of Computing, Imperial College London, United Kingdom, 2008.
[49]吴唯瑜.基于节点位置的P2P覆盖网络算法研究与系统设计[硕士学位论文].北京:清华大学, 2008.
[50] Szymaniak M, Presotto D, Pierre G, et al. Practical large-scale latency estimation. ComputerNetworks, 2008, 52(7):1343–1364.
[51] Pietzuch P, Ledlie J, Shneidman J, et al. Network-Aware Operator Placement for Stream-Processing Systems. Proceedings of the 22nd International Conference on Data Engineering(ICDE’06), Washington, DC, USA: IEEE Computer Society, 2006.
[52] Azureus - now called Vuze - Bittorrent Client, 2009. http://azureus.sourceforge.net/.
[53] Kaafar M A, Mathy L, Turletti T, et al. Real attacks on virtual networks: Vivaldi out of tune.Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense (LSAD’06),New York, NY, USA: ACM, 2006. 139–146.
[54] Kaafar M A, Mathy L, Turletti T, et al. Virtual networks under attack: disrupting internetcoordinate systems. Proceedings of Proceedings of the 2006 ACM CoNEXT conference(CoNEXT’06), New York, NY, USA: ACM, 2006. 1–12.
[55] Kaafar M A, Mathy L, Barakat C, et al. Securing internet coordinate embedding systems.Proceedings of the 2007 conference on Applications, technologies, architectures, and pro-tocols for computer communications (SIGCOMM’07), New York, NY, USA: ACM, 2007.61–72.
[56] Saucez D, Donnet B, Bonaventure O. A Reputation-Based Approach for Securing VivaldiEmbedding System. Proceedings of Proc. 13th EUNICE Open European Summer Schooland IFIP TC6.6 Workshop on Dependable and Adaptable Networks and Service, Twente,The Netherlands, 2007.
[57] Ledlie J T. A Locality-Aware Approach to Distributed Systems[D]. Cambridge, MA, USA:Harvard University, September, 2007.
[58]哈佛大学的网络坐标研究课题组主页, 2009. http://www.eecs.harvard.edu/～syrah/nc/.
[59] Steiner M, Biersack E W. Where is my Peer? Evaluation of the Vivaldi Network CoordinateSystem in Azureus. Proceedings of 8th International IFIP-TC6 Networking Conference(Networking’09), volume 5550 of Lecture Notes in Computer Science. Springer-Verlag,2009. 145–156.
[60] Ratnasamy S, Handley M, Karp R, et al. Topologically-aware overlay construction andserver selection. Proceedings of Twenty-First Annual Joint Conference of the IEEE Com-puter and Communications Societies (INFOCOM’02), volume 3, 2002. 1190–1199 vol.3.
[61] Cong L, Yang B, Chen Y, et al. NTS6: IPv6 based Network Topology Service System ofCERNET2. Proceedings of the 2007 International Conference on Multimedia and Ubiqui-tous Engineering (MUE’07), Washington, DC, USA: IEEE Computer Society, 2007. 1010–1015.
[62] Cong L, Chen Y, Shi X, et al. Telemeter: Network Distance Prediction Base on NetworkTopology. Proceedings of the Sixth International Conference on Grid and Cooperative Com-puting (GCC’07), Washington, DC, USA: IEEE Computer Society, 2007. 34–41.
[63]第二代中国教育和科研计算机网, 2009. http://www.cernet2.edu.cn/.
[64] Coltun R, Ferguson D, Moy J, et al. OSPF for IPv6. RFC 5340 (Proposed Standard), July,2008. http://www.ietf.org/rfc/rfc5340.txt.
[65] Rekhter Y, Li T, Hares S. A Border Gateway Protocol 4 (BGP-4). RFC 4271 (Draft Stan-dard), January, 2006. http://www.ietf.org/rfc/rfc4271.txt.
[66] Harrington D, Presuhn R, Wijnen B. An Architecture for Describing Simple Network Man-agement Protocol (SNMP) Management Frameworks. RFC 3411 (Standard), December,2002. http://www.ietf.org/rfc/rfc3411.txt. Updated by RFC 5343.
[67] Nelder J A, Mead R. A Simplex Method for Function Minimization. The Computer Journal,1965, 7(4):308–313.
[68] Pietzuch P, Ledlie J, Mitzenmacher M, et al. Network-Aware Overlays with Network Coor-dinates. Proceedings of the 26th IEEE International Conference Workshops on DistributedComputing Systems (ICDCSW’06), Washington, DC, USA: IEEE Computer Society, 2006.12.
[69] Zage D J, Nita-Rotaru C. On the accuracy of decentralized virtual coordinate systems inadversarial networks. Proceedings of the 14th ACM conference on Computer and commu-nications security (CCS’07), New York, NY, USA: ACM, 2007. 214–224.
[70] Sherr M, Loo B T, Blaze M. Veracity: A Fully Decentralized Service for Securing NetworkCoordinate Systems. Proceedings of Proceedings of the Internaltional Workshop on Peer-to-Peer Systems (IPTPS’08), 2008.
[71] Wang G, Ng T E. Distributed algorithms for stable and secure network coordinates. Pro-ceedings of the 8th ACM SIGCOMM conference on Internet measurement (IMC’08), NewYork, NY, USA: ACM, 2008. 131–144.
[72] Ledlie J, Pietzuch P, Seltzer M. Stable and Accurate Network Coordinates. Proceedings ofthe 26th IEEE International Conference on Distributed Computing Systems (ICDCS’06),Washington, DC, USA: IEEE Computer Society, 2006. 74.
[73] Zhao X, Song X, Wang X, et al. Attacks against Network Coordinate System: VulnerablePIC. Proceedings of the International Symposium on Computer Science and its Applications(CSA’08), Washington, DC, USA: IEEE Computer Society, 2008. 251–256.
[74] Zhao X, Lua E K, Chen Y, et al. Sniper: Social-link Defense for Network Coordinate Sys-tems. Proceedings of the 28th IEEE Conference on Computer Communications Studentworkshop (INFOCOM’09), 2009.
[75] Lua E K, Gri?n T, Pias M, et al. On the accuracy of embeddings for internet coordinatesystems. Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement(IMC’05), Berkeley, CA, USA: USENIX Association, 2005.
[76] Lua E K. The Structure of Internet Latency[D]. London, United Kingdom: University ofCambridge, August, 2006.
[77] Zhang R, Hu C, Lin X, et al. A Hierarchical Approach to Internet Distance Prediction.Proceedings of the 26th IEEE International Conference on Distributed Computing Systems(ICDCS’06), Washington, DC, USA: IEEE Computer Society, 2006. 73.
[78] Tang L, Crovella M. Geometric Exploration of the Landmark Selection Problem. Proceed-ings of the 5th anuual Passive & Active Measurement Workshop (PAM’04), 2004.
[79] Pias M, Crowcroft J, Wilbur S, et al. Lighthouses for Scalable Distributed Location. Pro-ceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
[80] Elmokashfi A, Kleis M, Popescu A. NetForecast: A Delay Prediction Scheme for ProviderControlled Networks. Proceedings of IEEE Global Telecommunications Conference(GLOBECOM’07), 2007. 502–507.
[81] Lumezanu C, Baden R, Spring N, et al. Triangle Inequality and Routing Policy Violationsin the Internet. Proceedings of the 10th anuual Passive & Active Measurement Workshop(PAM’09), 2009.
[82] Wang G, Zhang B, Ng T S E. Towards network triangle inequality violation aware dis-tributed systems. Proceedings of the 7th ACM SIGCOMM conference on Internet measure-ment (IMC’07), New York, NY, USA: ACM, 2007. 175–188.
[83] Oran D. OSI IS-IS Intra-domain Routing Protocol. RFC 1142 (Informational), February,1990. http://www.ietf.org/rfc/rfc1142.txt.
[84] Moy J. OSPF Version 2. RFC 2328 (Standard), April, 1998.http://www.ietf.org/rfc/rfc2328.txt.
[85]麻省理工学院P2PSim课题组主页, 2009. http://pdos.csail.mit.edu/p2psim/.
[86] Shavitt Y, Tankel T. Hyperbolic Embedding of Internet Graph for Distance Estimation andOverlay Construction..
[87] Lua E K, Gri?n T. Embeddable Overlay Networks. Proceedings of the 12th IEEE Sympo-sium on Computers and Communications (ISCC’07), 2007. 1099–1106.
[88] IDES网络坐标系统仿真器, 2009. http://www.cis.upenn.edu/～maoy/pub/ides-0.1.tar.gz.
[89] Lee D D, Seung S H. Learning the parts of objects by non-negative matrix factorization.Nature, 1999, 401(6755):788–791.
[90] Boutsidisa C, Gallopoulosb E. SVD based initialization: A head start for nonnegative matrixfactorization. Pattern Recognition, 2008, 41(4):1350–1362.
[91] Chen Y, Wang X, Song X, et al. Phoenix: Towards an Accurate, Practical and Decentral-ized Network Coordinate System. Proceedings of 8th International IFIP-TC6 NetworkingConference (Networking’09), volume 5550 of Lecture Notes in Computer Science. Springer-Verlag, 2009. 313–325.
[92] Lawson C, Hanson R J. Solving Least Squares Problems. Prentice-Hall, 1974: 161.
[93] Route Views Project Homepage, 2009. http://www.routeviews.org/.
[94] Chen K, Nahrstedt K. E?ective location-guided tree construction algorithms for small groupmulticast in MANET. Proceedings of Twenty-First Annual Joint Conference of the IEEEComputer and Communications Societies (INFOCOM’02), volume 3, 2002. 1180–1189vol.3.
[95] Wang F, Xiong Y, Liu J. mTreebone: A Hybrid Tree/Mesh Overlay for Application-LayerLive Video Multicast. Proceedings of the 27th International Conference on DistributedComputing Systems (ICDCS’07), Washington, DC, USA: IEEE Computer Society, 2007.49.
[96] Wang F, Liu J, Xiong Y. Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming. Proceedings of The 27th IEEE Conference on ComputerCommunications (INFOCOM’08), 2008. 1364–1372.
[97]刘鑫.基于任播的分布式服务模型与分布式隧道代理系统[硕士学位论文].北京:清华大学, 2005.
[98] Chun B G, Wu P, Weatherspoon H, et al. ChunkCast: An Anycast Service for Large Con-tent Distribution. Proceedings of the 7th International Workshop on Peer-to-Peer Systems(IPTPS’06), 2006.
[99] Kostic′D, Rodriguez A, Albrecht J, et al. Bullet: high bandwidth data dissemination usingan overlay mesh. SIGOPS Oper. Syst. Rev., 2003, 37(5):282–297.
[100] Karbhari P, Ammar M, Dhamdhere A, et al. Bootstrapping in Gnutella: A MeasurementStudy. Proceedings of the 5th anuual Passive & Active Measurement Workshop (PAM’04),2004.
[101] Ballani H, Francis P. Towards a deployable IP Anycast service. Proceedings of First Work-shop on Real, Large Distributed Systems (WORLDS’04), 2004.
[102] Ballani H, Francis P. Towards a global IP anycast service. Proceedings of the 2005 confer-ence on Applications, technologies, architectures, and protocols for computer communica-tions (SIGCOMM’05), New York, NY, USA: ACM, 2005. 301–312.
[103] Andersen D, Balakrishnan H, Kaashoek F, et al. Resilient overlay networks. Proceedings ofthe eighteenth ACM symposium on Operating systems principles (SOSP’01), New York,NY, USA: ACM, 2001. 131–145.
[104] Partridge C, Mendez T, Milliken W. Host Anycasting Service. RFC 1546 (Informational),November, 1993. http://www.ietf.org/rfc/rfc1546.txt.
[105] AS112 Project Home Page, 2009. http://www.as112.net/.
[106] Zegura E W, Ammar M H, Fei Z, et al. Application-layer anycasting: a server selectionarchitecture and use in a replicated Web service. IEEE/ACM Trans. on Networking, 2000,8(4):455–466.
[107] Freedman M J, Lakshminarayanan K, Mazie`res D. OASIS: anycast for any service. Proceed-ings of the 3rd conference on Networked Systems Design & Implementation (NSDI’06),Berkeley, CA, USA: USENIX Association, 2006.
[108] Freedman M J, Freudenthal E, Mazie`res D. Democratizing content publication with coral.Proceedings of the 1st conference on Symposium on Networked Systems Design and Im-plementation (NSDI’04), Berkeley, CA, USA: USENIX Association, 2004. 18–18.
[109] Rhea S, Godfrey B, Karp B, et al. OpenDHT: a public DHT service and its uses. Proceed-ings of the 2005 conference on Applications, technologies, architectures, and protocols forcomputer communications (SIGCOMM’05), New York, NY, USA: ACM, 2005. 73–84.
[110]中国教育和科研计算机网, 2009. http://www.cernet.edu.cn/.
[111] Google Maps, 2009. http://maps.google.com/.
[112] Chimera DHT, 2009. http://current.cs.ucsb.edu/projects/chimera/.
[113] IPerf, 2009. http://sourceforge.net/projects/iperf.
[114] 6PlanetLab, 2009. http://core.cgeni.edu.cn/.