服务覆盖网络的路由算法研究
|
摘要
目前,互联网已经成为一个由大量网络自治域连接起来的异构的、巨型的复杂系统,随着高速网络,通信技术和流媒体技术的发展,出现了大量的各种新型应用,使传统的尽最大努力传递型的互联网服务体系设计遇到了严峻的挑战。随着网络规模越来越大,通信数据流穿越的异构自治域也越来越多,单纯依靠ISP之间的协作已经无法控制跨域的服务质量。为此,IETF开发了一系列提高Internet服务质量的RFC标准,但是,迄今为止,这些成果都没有大规模地实际应用于互联网,因此,在目前的Internet中尚没有有效的端到端的QoS保证。我们需要一种机制打破现在的域间互相独立、互相制约的局面,为此,学者们提出了一种实现端到端QoS服务的技术:服务覆盖网络(SON)。SON是由被称为服务网关(SG)的SON节点及虚拟链路构成。这些服务网关是由SON经营商统一部署的独立于底层AS的网络节点,这些节点具有数据转发和其他控制功能,它们之间通过虚拟链路建立起逻辑连接,虚拟链路是由底层IP网络提供的具有QoS保证的物理链路组成。由于SON节点与底层网络相分离,由SON经营商统一管理,屏蔽了底层网络的技术细节,也就解决了长期困扰我们的难以跨越异构网络向网络用户提供QoS的问题,同时也降低了管理和控制SON服务的复杂性,尤其是控制QoS的复杂性。
SON路由是解决SON的关键问题,国内外学者对此提出了多种路由算法。本文首先介绍了服务覆盖网络相关的概念并对服务覆盖网络的路由研究现状进行了综述,对比分析了各种覆盖路由算法,然后综合分析Wardrop原理及其在通信网络中的应用,并在此基础上提出了两种SON中的Wardrop路由算法。本文提出的路由算法一方面满足了网络用户QoS的需求,提高了网络的服务质量;另一方面均衡网络负载提高了网络资源的利用率。因此提出的路由算法具有较高的理论价值和十分重要的现实意义。
本文综合考虑了网络延时和带宽等多种影响网络性能的因素,通过对Wardrop原理UE模型的研究,从网络用户的角度出发,提出了基于UE模型的服务覆盖网络路由算法(UERSON)以达到提高网络服务质量的目的。在NS2的仿真环境中通过导入真实网络数据流验证了算法的可行性,对仿真实验结果的分析表明该算法的性能在一定程度上要优于已有的路由算法。但UERSON路由算法是一种自私路由算法而且该算法没有综合考虑SON经营商的收益,可能会影响SON经营商继续为网络用户提供优质的接入SON的服务。因此本文又在Wardrop原理SO模型的基础上提出了一种多下一跳路由算法(MNHRSON),该算法综合考虑SON经营商的利益和网络用户的服务需求,从网络全局作出路由选择。该算法的提出一方面保证了用户的QoS需求提高了网络的服务质量,另一方面最大化SON经营商的收益。在NS2的仿真环境中通过导入真实网络数据流验证了算法的可行性,对仿真实验结果的分析表明该算法的性能在一定程度上优于UERSON算法。
Currently, the Internet has become a heterogeneous giant complex system connected by quantities of autonomous domains, with the development of high-speed networks and communication technologies and streaming media technology, a large variety of new applications has arisen; the traditional Internet service system design of trying best effort delivery type has encountered serious challenges. With the scale of networks increasing and the number of heterogeneous autonomous domains for communication data stream to cross increasing, relying on the collaboration among the ISP has not been able to control the quality of services across domains, for which, IETF Internet developed a series of the RFC standards to improve the quality of service, however, so far, these results have not been a large-scale practical application to the Internet, till now , Internet hasn’t had an effective guarantee of an end to end QoS. We need a mechanism to break the situation of current inter-domain independence of each other and checking each other, thus, scholars have put forward a technique which can achieve end to end QoS services: Service Overlay Network (SON). SON consists of what is called SON nodes of Service Gateway and virtual links. These service gateways deployed by the SON operator and independent of the underlying unified network are AS nodes of Internet, these nodes have data forwarding and other control functions, they establish a logical connection through a virtual link, virtual link consists of the QoS guarantee physical link provided by the underlying IP network. The separation of SON nodes and the underlying network as well as the unified management by the SON operator, mask the technical details of the underlying network, which solves the difficult long-term problems for our network users across heterogeneous networks to provide QoS, meanwhile reducing the complexity of the management and control the SON, especially the complexity of the control the QoS.
SON routing is the key to SON. Domestic and foreign scholars have proposed a variety of routing algorithms. This paper introduces the relative concept of service network coverage and reviews the present study situation of service network coverage, comparative analysis of the various overlay routing algorithm, and comprehensive analysis of Wardrop Principle and its application in the communication network, and on this basis the two Wardrop routing algorithms in SON are put forward based on Wardrop principle. On the one hand, the proposed routing algorithms meet the QoS requirements of network users and improve the quality of network service; on the other hand, they balance the network load and improve network resource utilization. Therefore, the proposed routing algorithm has higher theoretical value and very important practical significance.
This paper, considering the network delay and bandwidth and other factors that affect network performance, through the study of the principle of Wardrop and EU model, from the perspective of network users, puts forward the service overlay network routing algorithm (UERSON )based on UE model in order to achieve the purpose of improving the quality of network services. In NS2 simulated environment through the introduction of the real network data streams, the algorithm is proved feasible, the analysis of simulated experimental results shows that the performance of the algorithm is better than the existing routing algorithms to some extent. But UERSON routing algorithm is a selfish routing algorithm and the algorithm does not consider the benefits of SON operators, which may affect that the network operators continue to provide quality services to access to SON. Therefore this article puts forward a multi-hop routing algorithm (MNHRSON) based on SO model of the Wardrop principle, the algorithm considers the interests of SON operators and the network service needs of users, the network route is chosen from the global internet. On the one hand, the proposed algorithm guarantees the user's QoS requirements and improves the quality of network service, on the other hand it maximizes the revenues of SON operators. In NS2 simulated environment through the introduction of the real network data streams, the algorithm is proved feasible, the analysis of simulated experimental results show that the performance of this algorithm is superior to UERSON algorithm to a certain extent.
SON路由是解决SON的关键问题,国内外学者对此提出了多种路由算法。本文首先介绍了服务覆盖网络相关的概念并对服务覆盖网络的路由研究现状进行了综述,对比分析了各种覆盖路由算法,然后综合分析Wardrop原理及其在通信网络中的应用,并在此基础上提出了两种SON中的Wardrop路由算法。本文提出的路由算法一方面满足了网络用户QoS的需求,提高了网络的服务质量;另一方面均衡网络负载提高了网络资源的利用率。因此提出的路由算法具有较高的理论价值和十分重要的现实意义。
本文综合考虑了网络延时和带宽等多种影响网络性能的因素,通过对Wardrop原理UE模型的研究,从网络用户的角度出发,提出了基于UE模型的服务覆盖网络路由算法(UERSON)以达到提高网络服务质量的目的。在NS2的仿真环境中通过导入真实网络数据流验证了算法的可行性,对仿真实验结果的分析表明该算法的性能在一定程度上要优于已有的路由算法。但UERSON路由算法是一种自私路由算法而且该算法没有综合考虑SON经营商的收益,可能会影响SON经营商继续为网络用户提供优质的接入SON的服务。因此本文又在Wardrop原理SO模型的基础上提出了一种多下一跳路由算法(MNHRSON),该算法综合考虑SON经营商的利益和网络用户的服务需求,从网络全局作出路由选择。该算法的提出一方面保证了用户的QoS需求提高了网络的服务质量,另一方面最大化SON经营商的收益。在NS2的仿真环境中通过导入真实网络数据流验证了算法的可行性,对仿真实验结果的分析表明该算法的性能在一定程度上优于UERSON算法。
Currently, the Internet has become a heterogeneous giant complex system connected by quantities of autonomous domains, with the development of high-speed networks and communication technologies and streaming media technology, a large variety of new applications has arisen; the traditional Internet service system design of trying best effort delivery type has encountered serious challenges. With the scale of networks increasing and the number of heterogeneous autonomous domains for communication data stream to cross increasing, relying on the collaboration among the ISP has not been able to control the quality of services across domains, for which, IETF Internet developed a series of the RFC standards to improve the quality of service, however, so far, these results have not been a large-scale practical application to the Internet, till now , Internet hasn’t had an effective guarantee of an end to end QoS. We need a mechanism to break the situation of current inter-domain independence of each other and checking each other, thus, scholars have put forward a technique which can achieve end to end QoS services: Service Overlay Network (SON). SON consists of what is called SON nodes of Service Gateway and virtual links. These service gateways deployed by the SON operator and independent of the underlying unified network are AS nodes of Internet, these nodes have data forwarding and other control functions, they establish a logical connection through a virtual link, virtual link consists of the QoS guarantee physical link provided by the underlying IP network. The separation of SON nodes and the underlying network as well as the unified management by the SON operator, mask the technical details of the underlying network, which solves the difficult long-term problems for our network users across heterogeneous networks to provide QoS, meanwhile reducing the complexity of the management and control the SON, especially the complexity of the control the QoS.
SON routing is the key to SON. Domestic and foreign scholars have proposed a variety of routing algorithms. This paper introduces the relative concept of service network coverage and reviews the present study situation of service network coverage, comparative analysis of the various overlay routing algorithm, and comprehensive analysis of Wardrop Principle and its application in the communication network, and on this basis the two Wardrop routing algorithms in SON are put forward based on Wardrop principle. On the one hand, the proposed routing algorithms meet the QoS requirements of network users and improve the quality of network service; on the other hand, they balance the network load and improve network resource utilization. Therefore, the proposed routing algorithm has higher theoretical value and very important practical significance.
This paper, considering the network delay and bandwidth and other factors that affect network performance, through the study of the principle of Wardrop and EU model, from the perspective of network users, puts forward the service overlay network routing algorithm (UERSON )based on UE model in order to achieve the purpose of improving the quality of network services. In NS2 simulated environment through the introduction of the real network data streams, the algorithm is proved feasible, the analysis of simulated experimental results shows that the performance of the algorithm is better than the existing routing algorithms to some extent. But UERSON routing algorithm is a selfish routing algorithm and the algorithm does not consider the benefits of SON operators, which may affect that the network operators continue to provide quality services to access to SON. Therefore this article puts forward a multi-hop routing algorithm (MNHRSON) based on SO model of the Wardrop principle, the algorithm considers the interests of SON operators and the network service needs of users, the network route is chosen from the global internet. On the one hand, the proposed algorithm guarantees the user's QoS requirements and improves the quality of network service, on the other hand it maximizes the revenues of SON operators. In NS2 simulated environment through the introduction of the real network data streams, the algorithm is proved feasible, the analysis of simulated experimental results show that the performance of this algorithm is superior to UERSON algorithm to a certain extent.
引文
[1] Zhenhai Duan, Zhi-Li Zhang, and Yiwei T. Hou. Service overlay networks: SLA, QoS, and bandwidth provisioning[J]. IEEE/ACM Transactions on Networking, 2003, 11(6): 870 - 883.
[2] Y. Amir and C. Danilov. Reliable communication in overlay networks[A]. In Proceedings of the IEEE International Conference on Dependable Systems and Networks[C]. San Francisco, California. 2003. 511- 520.
[3] Y. Amir, C. Danilov, and C. Nita-Rotaru. High performance, robust, secure and transparent overlay network service[A]. In Proceedings of International Workshop on Future Directions in Distributed Computing (FuDiCo)[C]. Berlin. 2002. 52-55.
[4] Jun-Hong Cui and Swapna Gokhale. Towards integrated provisioning of QoS overlay networks[R], UCONN CSE Technical Report: BECAT/CSE-TR-05-3, January 2005. http://www.engr.uconn.edu /~jcui/ publica tions.html
[5] Next Generation Service Overlay Network (NGSON) Working Group. IEEE Next Generation Services Overlay Network– P1903 project, http://grouper.ieee.org/groups/ngson.
[6] Zhi Li, Prasant Mohapatra. QRON: QoS-aware routing in overlay networks[J]. IEEE Journal onSelected Areas in Communications 2004.22(1): 29-40.
[7] Capone, J. Elias, F. MARTIGNON. Optimal design of service overlay networks[A], in Proceedings of the Fourth International Workshop on QoS in Multiservice IP Networks (QoS-IP 2008)[C], Venice, Italy.2008. 337-349
[8]郑明春,杨寿保.基于博弈论的服务覆盖网络资源定价方法[J],中国科技大学学报,2010,4,431-438.
[9] Andersen, D., et al. Resilient overlay networks[A]. Proceedings of the eighteenth ACM symposium on Operating systems principles[C]:ACM.Banff, Canada. 2001. 131-145.
[10] Andersen, D. G., Balakrishnan, H., Kaashoek, M. F., and Rao, R. Improving web availability for clients with MONET[A]. In Proceedings of 2nd Symposium on Networked Systems Design and Implementation (NSDI)[C]. Boston, MA, USA. 2005. 203– 216.
[11] X. Gu, K. Nahrstedt, R. Chang, and C. Ward. Qos-assured service composition in managed service overlay networks[A]. In Proceedings of IEEE 23rd International Conference on Distributed Computing Systems[C], Hachioji, Tokyo.2003. 194-203.
[12] S. Rewaskar and J. Kaur. Testing the scalability of overlay routing infrastructures[A]. 5th Anuual Passive & Active Measurement Workshop PAM2004[C], 2004.v3015:33–42.
[13] QBone. Qbone: A test bed for differentiated services. http://www.isoc.org/inet99/proceedings.
[14] Subramanian, L., Stoica, I., Balakrishnan, H., and Katz, R.. OverQoS: An overlay based architecture for enhancing Internet QoS[A]. In Proceedings of 1st Symposium on Networked Systems Design and Implementation (NSDI’04)[C]. San Fransico, CA, USA. 2004.71-84.
[15] H. T. Tran and T. Ziegler. Adaptive bandwidth provisioning with explicit respect to QoS requirements[A]. In LNCS 2811, Proceedings of the 4th COST 263 International Workshop on Quality of Future Internet Services, QoFIS[C], 2003. 83–92.
[16] T. Murase, H. Shimonishi, and Y. Hasegawa. TCP overlay network architecture[A]. Proc. Commun. Conf. IEICE'02[C], 2002. B-7-49.
[17] Yamanegi, K. Hama, T. Hasegawa, G. Murata, M. Shimonishi, H. Murase, T. Implementation experiments of the TCP proxy mechanism. Information and Telecommunication Technologies[A], Proceedings. 6th Asia-Pacific Symposium on APSITT. Yangon[C]. 2005.17-22.
[18] S. Dawkins, G. Montenegro, M. Kojo, V. Magret, and N. Vaidya. End-to-end performance implications of links with errors[EB/OL].RFC 3155. http://www.rfc -editor. org /rfc/rfc3135.txt
[19] Border, J., Kojo, M., Griner, J., et al. Performance Enhancing Proxies Intended to Mitigate Link-Related Degradations[EB/OL]. RFC3135.http://www.rfc-editor.org/rfc/rfc3135. txt.2001.
[20] Y. Yamasaki, T. Murase, G. Hasegawa. Congestion prevention buffer management in TCP proxy[R].IEICE Technical Report, IN2003-136, Dec. 2003.
[21] David Harrison, Edge-to-edge Control: A Congestion Control and Service Differentiation Architecture for the Internet[D]. Ph.D. Dissertation, Computer Science Department, Rensselaer Polytechnic Institute.2002.
[22] Z.Li and P.Mohapa.The Impact of Topology 0n Overlay Routing Service.IEEE INFOCOM.2004
[23] A.Young,J.Chen,Z.Ma,A.Krisnamurthy,L.Peterson,R.Y.Wang.Overlay Mesh Construction Using Interleaved Spanning Tree.Proc,INFOCOM 2004,2004.3.
[24] Thomax Fuhrmann, T.: On the Topology of Overlay Networks. In: Proceedings of 11th IEEE International Conference on Networks (ICON), pp. 271-276 (2003).
[25] S. Vieira and J. Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees. IEEE IWQoS 2004, June 2004.
[26] Pi R.and Song J.,Multi-Path Transmission Based on Overlay Network,18th International Conference on Advanced Information Networking and Application AINA’04, Fukuoka, Japan, 2004.
[27] Yair Amir and Claudiu Danilov, "Reliable communication in overlay networks," in Proceedings of the IEEE DSN 2003, June 2003, pp. 511--520.
[28] N.S.V. Rao. Overlay networks of in-situ instruments for probabilistic guarantees on message delays in wide-area networks. IEEE Journal on Selected Areas in Communications, 22(1): 79–90, Jan. 2004.
[29] Curtius, J. and T. McGregor. "Review of bandwidth estimation techniques", in Proceedings ofthe New Zealand computer science research students' conference, University of Canterbuty, New Zealand. 2001. pp. 172-174.
[30] Constantinos Dovrolis , Parameswaran Ramanathan , David Moore, Packet-dispersion techniques and a capacity-estimation methodology, IEEE/ACM Transactions on Networking (TON), v.12 n.6, p.963-977, December 2004
[31] M. Jain and C. Dovrolis,“End-to-end available bandwidth:measurement methodology, dynamics, and relation with TCP throughput,”Proc. ACM SIGCOMM, 2002.
[32]薛峰,赵问道,陈惠芳.基于最大网络收益的DNS内容路由算法[J],浙江大学学报,2004.10,1270-1274.
[33] Gary Miller.Overlay routing network.MIT 18.996,MIT technical report,2002
[34] Wardrop, J.G. Some theoretical aspects of road traffic research[C], Proceedings of The Institution of Civil Engineers. Webster.1952,(2):325-378.
[35] S. C. Dafermos and F. T. Sparrow,“The traffic assignment problem for a general network,”Journal of Research of the National Bureau of Standards B, vol. 73, pp. 91–118, 1969.
[36] Y. Korilis, A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications, 13(7):1241–1251, 1995.
[37] S. Fischer and B. Vocking. Adaptive routing with stale information. In Proc. 24th Ann. ACMSIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 276-283, 2005.
[38] S. Fischer, H. Racke, and B. Vocking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th Ann. ACM. Symp. on Theory of Comput.(STOC), Seattle, WA, USA, May 2006. ACM.
[39] P. Gupta and P. R. Kumar, A system and traffic independent adaptive routing algorithm for ad hoc networks, in Proceedings of the IEEE CDC, 1997, pp. 2375-2380.
[40] V.S.Borkar and P.R.Kumar,“Dynamic Cesaro-Wardrop equilibration in networks,”IEEE Transactions on Automatic Control, vol. 48, pp.382–396, 2003.
[41] Fischer, S., Kammenhuber, N., Feldmann, A.: Replex: dynamic traffic engineering based on wardrop routing policies. In: CoNEXT 2006, pp. 1–12 (2006)
[42] F. Larroca and J.L. Rougier,“Minimum-Delay Load-Balancing Through Non-Parametric Regression”, in Networking’09, 2009.
[43] HAURIE, A., MARCOTTE, P.. On the relationship between Nash-Cournot and Wardrop Equilibria[J]. Networks, 1985.15:295-308.
[44] M. J. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale Uni-versity Press, New Haven, CT, 1956
[45] M. Florian. Untangling traffic congestion: Application of network equilibrium models in transportation plan-ning. OR/MS Today, 26(2):52–57, April 1999.
[46] Y. Sheffi. Urban Transportation Networks. Prentice-Hall, Englewood, NJ, 1985.
[47] L.J.Leblanc,E.K.Morlok AND W.P.Rierskalla,“An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem”,Trans.Res.9,309-318(1975).
[48] Dijkstra,E.W.A note on two problems in connection with graphs.Numer.Math.,1,269-271(1959).
[49] S. Savage,“Sting: A TCP-based nework performance measurement tools,”in Proc. 2nd USENIX Symp. Internet Technologies and Systems,Oct. 1999, pp. 71–79.
[50] V. Paxson,“End-to-end Internet packet dynamics,”IEEE/ACM Trans.Networking, vol. 7, pp. 277–292, June 1999.
[51] Y. Zhang, N. Duffield, V. Paxson, and S. Shenker,“On the constancy of internet path peroperties,”in Proc. 1st ACM SIGCOMM Internet Measurement Workshop, Nov. 2001, pp. 197–211.
[52] R. Carter and M. Crovella,“Measuring bottleneck link speed in packetswitched networks,”presented at the Performance’96, the Int. Conf. Performance Theory, Measurement and Evaluation of Computer and Communication Systems, Lausanne, Switzerland, Oct. 1996.
[53] L.Kleinrock,Queueing Systems.Wiley-Interscience,1975.
[54] Z. Cao, Z. Wang, and E. W. Zegura, "Performance of hashing-based schemes for Internet load balancing," in Proc. IEEE INFOCOM, 2000, pp. 332-341.
[55] http://www.wand.net.nz/wits/auck/9/20080327-160000-0.php
[56] Andersen DG, Balakrishnan H, Kaashoek MF, Rao RN. Improving Web availability for clientswith MONET. In: Vahdat A, Wetherall D, eds. Proc. of the 2nd Conf. on Symp. on Networked Systems Design & Implementation (NSDI 2005). Berkeley: USENIX Association, 2005. 115?128.
[57] Zhu Y, Dovrolis C, Ammar M. Combining multihoming with overlay routing (or, how to be a better ISP without owning a network). In: Proc. of the IEEE INFOCOM 2007. Piscataway:IEEE, 2007. 839?847.
[58]王旸旸,毕军,吴建平.互联网覆盖路由技术研究[J],软件学报,2009,20(11)2988-3000.
[2] Y. Amir and C. Danilov. Reliable communication in overlay networks[A]. In Proceedings of the IEEE International Conference on Dependable Systems and Networks[C]. San Francisco, California. 2003. 511- 520.
[3] Y. Amir, C. Danilov, and C. Nita-Rotaru. High performance, robust, secure and transparent overlay network service[A]. In Proceedings of International Workshop on Future Directions in Distributed Computing (FuDiCo)[C]. Berlin. 2002. 52-55.
[4] Jun-Hong Cui and Swapna Gokhale. Towards integrated provisioning of QoS overlay networks[R], UCONN CSE Technical Report: BECAT/CSE-TR-05-3, January 2005. http://www.engr.uconn.edu /~jcui/ publica tions.html
[5] Next Generation Service Overlay Network (NGSON) Working Group. IEEE Next Generation Services Overlay Network– P1903 project, http://grouper.ieee.org/groups/ngson.
[6] Zhi Li, Prasant Mohapatra. QRON: QoS-aware routing in overlay networks[J]. IEEE Journal onSelected Areas in Communications 2004.22(1): 29-40.
[7] Capone, J. Elias, F. MARTIGNON. Optimal design of service overlay networks[A], in Proceedings of the Fourth International Workshop on QoS in Multiservice IP Networks (QoS-IP 2008)[C], Venice, Italy.2008. 337-349
[8]郑明春,杨寿保.基于博弈论的服务覆盖网络资源定价方法[J],中国科技大学学报,2010,4,431-438.
[9] Andersen, D., et al. Resilient overlay networks[A]. Proceedings of the eighteenth ACM symposium on Operating systems principles[C]:ACM.Banff, Canada. 2001. 131-145.
[10] Andersen, D. G., Balakrishnan, H., Kaashoek, M. F., and Rao, R. Improving web availability for clients with MONET[A]. In Proceedings of 2nd Symposium on Networked Systems Design and Implementation (NSDI)[C]. Boston, MA, USA. 2005. 203– 216.
[11] X. Gu, K. Nahrstedt, R. Chang, and C. Ward. Qos-assured service composition in managed service overlay networks[A]. In Proceedings of IEEE 23rd International Conference on Distributed Computing Systems[C], Hachioji, Tokyo.2003. 194-203.
[12] S. Rewaskar and J. Kaur. Testing the scalability of overlay routing infrastructures[A]. 5th Anuual Passive & Active Measurement Workshop PAM2004[C], 2004.v3015:33–42.
[13] QBone. Qbone: A test bed for differentiated services. http://www.isoc.org/inet99/proceedings.
[14] Subramanian, L., Stoica, I., Balakrishnan, H., and Katz, R.. OverQoS: An overlay based architecture for enhancing Internet QoS[A]. In Proceedings of 1st Symposium on Networked Systems Design and Implementation (NSDI’04)[C]. San Fransico, CA, USA. 2004.71-84.
[15] H. T. Tran and T. Ziegler. Adaptive bandwidth provisioning with explicit respect to QoS requirements[A]. In LNCS 2811, Proceedings of the 4th COST 263 International Workshop on Quality of Future Internet Services, QoFIS[C], 2003. 83–92.
[16] T. Murase, H. Shimonishi, and Y. Hasegawa. TCP overlay network architecture[A]. Proc. Commun. Conf. IEICE'02[C], 2002. B-7-49.
[17] Yamanegi, K. Hama, T. Hasegawa, G. Murata, M. Shimonishi, H. Murase, T. Implementation experiments of the TCP proxy mechanism. Information and Telecommunication Technologies[A], Proceedings. 6th Asia-Pacific Symposium on APSITT. Yangon[C]. 2005.17-22.
[18] S. Dawkins, G. Montenegro, M. Kojo, V. Magret, and N. Vaidya. End-to-end performance implications of links with errors[EB/OL].RFC 3155. http://www.rfc -editor. org /rfc/rfc3135.txt
[19] Border, J., Kojo, M., Griner, J., et al. Performance Enhancing Proxies Intended to Mitigate Link-Related Degradations[EB/OL]. RFC3135.http://www.rfc-editor.org/rfc/rfc3135. txt.2001.
[20] Y. Yamasaki, T. Murase, G. Hasegawa. Congestion prevention buffer management in TCP proxy[R].IEICE Technical Report, IN2003-136, Dec. 2003.
[21] David Harrison, Edge-to-edge Control: A Congestion Control and Service Differentiation Architecture for the Internet[D]. Ph.D. Dissertation, Computer Science Department, Rensselaer Polytechnic Institute.2002.
[22] Z.Li and P.Mohapa.The Impact of Topology 0n Overlay Routing Service.IEEE INFOCOM.2004
[23] A.Young,J.Chen,Z.Ma,A.Krisnamurthy,L.Peterson,R.Y.Wang.Overlay Mesh Construction Using Interleaved Spanning Tree.Proc,INFOCOM 2004,2004.3.
[24] Thomax Fuhrmann, T.: On the Topology of Overlay Networks. In: Proceedings of 11th IEEE International Conference on Networks (ICON), pp. 271-276 (2003).
[25] S. Vieira and J. Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees. IEEE IWQoS 2004, June 2004.
[26] Pi R.and Song J.,Multi-Path Transmission Based on Overlay Network,18th International Conference on Advanced Information Networking and Application AINA’04, Fukuoka, Japan, 2004.
[27] Yair Amir and Claudiu Danilov, "Reliable communication in overlay networks," in Proceedings of the IEEE DSN 2003, June 2003, pp. 511--520.
[28] N.S.V. Rao. Overlay networks of in-situ instruments for probabilistic guarantees on message delays in wide-area networks. IEEE Journal on Selected Areas in Communications, 22(1): 79–90, Jan. 2004.
[29] Curtius, J. and T. McGregor. "Review of bandwidth estimation techniques", in Proceedings ofthe New Zealand computer science research students' conference, University of Canterbuty, New Zealand. 2001. pp. 172-174.
[30] Constantinos Dovrolis , Parameswaran Ramanathan , David Moore, Packet-dispersion techniques and a capacity-estimation methodology, IEEE/ACM Transactions on Networking (TON), v.12 n.6, p.963-977, December 2004
[31] M. Jain and C. Dovrolis,“End-to-end available bandwidth:measurement methodology, dynamics, and relation with TCP throughput,”Proc. ACM SIGCOMM, 2002.
[32]薛峰,赵问道,陈惠芳.基于最大网络收益的DNS内容路由算法[J],浙江大学学报,2004.10,1270-1274.
[33] Gary Miller.Overlay routing network.MIT 18.996,MIT technical report,2002
[34] Wardrop, J.G. Some theoretical aspects of road traffic research[C], Proceedings of The Institution of Civil Engineers. Webster.1952,(2):325-378.
[35] S. C. Dafermos and F. T. Sparrow,“The traffic assignment problem for a general network,”Journal of Research of the National Bureau of Standards B, vol. 73, pp. 91–118, 1969.
[36] Y. Korilis, A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications, 13(7):1241–1251, 1995.
[37] S. Fischer and B. Vocking. Adaptive routing with stale information. In Proc. 24th Ann. ACMSIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 276-283, 2005.
[38] S. Fischer, H. Racke, and B. Vocking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th Ann. ACM. Symp. on Theory of Comput.(STOC), Seattle, WA, USA, May 2006. ACM.
[39] P. Gupta and P. R. Kumar, A system and traffic independent adaptive routing algorithm for ad hoc networks, in Proceedings of the IEEE CDC, 1997, pp. 2375-2380.
[40] V.S.Borkar and P.R.Kumar,“Dynamic Cesaro-Wardrop equilibration in networks,”IEEE Transactions on Automatic Control, vol. 48, pp.382–396, 2003.
[41] Fischer, S., Kammenhuber, N., Feldmann, A.: Replex: dynamic traffic engineering based on wardrop routing policies. In: CoNEXT 2006, pp. 1–12 (2006)
[42] F. Larroca and J.L. Rougier,“Minimum-Delay Load-Balancing Through Non-Parametric Regression”, in Networking’09, 2009.
[43] HAURIE, A., MARCOTTE, P.. On the relationship between Nash-Cournot and Wardrop Equilibria[J]. Networks, 1985.15:295-308.
[44] M. J. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale Uni-versity Press, New Haven, CT, 1956
[45] M. Florian. Untangling traffic congestion: Application of network equilibrium models in transportation plan-ning. OR/MS Today, 26(2):52–57, April 1999.
[46] Y. Sheffi. Urban Transportation Networks. Prentice-Hall, Englewood, NJ, 1985.
[47] L.J.Leblanc,E.K.Morlok AND W.P.Rierskalla,“An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem”,Trans.Res.9,309-318(1975).
[48] Dijkstra,E.W.A note on two problems in connection with graphs.Numer.Math.,1,269-271(1959).
[49] S. Savage,“Sting: A TCP-based nework performance measurement tools,”in Proc. 2nd USENIX Symp. Internet Technologies and Systems,Oct. 1999, pp. 71–79.
[50] V. Paxson,“End-to-end Internet packet dynamics,”IEEE/ACM Trans.Networking, vol. 7, pp. 277–292, June 1999.
[51] Y. Zhang, N. Duffield, V. Paxson, and S. Shenker,“On the constancy of internet path peroperties,”in Proc. 1st ACM SIGCOMM Internet Measurement Workshop, Nov. 2001, pp. 197–211.
[52] R. Carter and M. Crovella,“Measuring bottleneck link speed in packetswitched networks,”presented at the Performance’96, the Int. Conf. Performance Theory, Measurement and Evaluation of Computer and Communication Systems, Lausanne, Switzerland, Oct. 1996.
[53] L.Kleinrock,Queueing Systems.Wiley-Interscience,1975.
[54] Z. Cao, Z. Wang, and E. W. Zegura, "Performance of hashing-based schemes for Internet load balancing," in Proc. IEEE INFOCOM, 2000, pp. 332-341.
[55] http://www.wand.net.nz/wits/auck/9/20080327-160000-0.php
[56] Andersen DG, Balakrishnan H, Kaashoek MF, Rao RN. Improving Web availability for clientswith MONET. In: Vahdat A, Wetherall D, eds. Proc. of the 2nd Conf. on Symp. on Networked Systems Design & Implementation (NSDI 2005). Berkeley: USENIX Association, 2005. 115?128.
[57] Zhu Y, Dovrolis C, Ammar M. Combining multihoming with overlay routing (or, how to be a better ISP without owning a network). In: Proc. of the IEEE INFOCOM 2007. Piscataway:IEEE, 2007. 839?847.
[58]王旸旸,毕军,吴建平.互联网覆盖路由技术研究[J],软件学报,2009,20(11)2988-3000.