A content aware and name based routing network speed up system
作者： Ke Xu , Hui Zhang , Meina Song , Junde Song
DOI: 10.1007/978-3-642-37015-1_59
关键词:
摘要: The enormous increase in Internet traffic usage has been leading to problems such as increased complexity of routing topology, explosion table entries, provider-dependent addressing, which reduce the speed network service. emerging new techniques CDN, P2P, VPN, etc. up from different perspectives. A system called CANR, content aware and name based routing, is proposed this paper, integrates benefits several existing mehanisms. CANR consists a cluster proxy peers deployed domains, can work collaborative routers, forwarding requests each other cross-domain visits. automatically changes re-construct name-based on multi objectie k shortest algoritm by itself, finding set cheapest most fast paths, current static preconfigured systems.
springer.com
sci-hub.st 参考文章(24)
Haesung Hwang, Shingo Ata, Masayuki Murata, A Feasibility Evaluation on Name-Based Routing IP Operations and Management. pp. 130- 142 ,(2009) , 10.1007/978-3-642-04968-2_11
Mark Gritter, David R. Cheriton, An architecture for content routing support in the internet usenix symposium on internet technologies and systems. pp. 4- 4 ,(2001)
D. Burton, Ph. L. Toint, On an instance of the inverse shortest paths problem Mathematical Programming. ,vol. 53, pp. 45- 61 ,(1992) , 10.1007/BF01585693
José M Pérez, Félix García-Carballeira, Jesús Carretero, Alejandro Calderón, Javier Fernández, None, Branch replication scheme: A new model for data replication in large scale data grids Future Generation Computer Systems. ,vol. 26, pp. 12- 20 ,(2010) , 10.1016/J.FUTURE.2009.05.015
Ming Lei, Susan V. Vrbsky, Xiaoyan Hong, An on-line replication strategy to increase availability in Data Grids Future Generation Computer Systems. ,vol. 24, pp. 85- 98 ,(2008) , 10.1016/J.FUTURE.2007.04.009
Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. Braynard, Networking named content Proceedings of the 5th international conference on Emerging networking experiments and technologies - CoNEXT '09. pp. 1- 12 ,(2009) , 10.1145/1658939.1658941
Janusz Granat, Francesca Guerriero, The interactive analysis of the multicriteria shortest path problem by the reference point method European Journal of Operational Research. ,vol. 151, pp. 103- 118 ,(2003) , 10.1016/S0377-2217(02)00594-5
Ernesto Queirós Vieira Martins, On a multicriteria shortest path problem European Journal of Operational Research. ,vol. 16, pp. 236- 245 ,(1984) , 10.1016/0377-2217(84)90077-8
Irina Ioachim, Sylvie G�linas, Fran�ois Soumis, Jacques Desrosiers, A dynamic programming algorithm for the shortest path problem with time windows and linear node costs Networks. ,vol. 31, pp. 193- 204 ,(1998) , 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A
Kari Visala, Dmitrij Lagutin, Sasu Tarkoma, LANES Proceedings of the 2009 workshop on Re-architecting the internet - ReArch '09. pp. 55- 60 ,(2009) , 10.1145/1658978.1658992