Abstract
The enormous increase in Internet traffic usage has been leading to problems such as increased complexity of routing topology, explosion in routing table entries, provider-dependent addressing, which reduce the speed of network service. The emerging new techniques such as CDN, P2P, VPN, etc. speed up the network from different perspectives. A new speed up system called CANR, content aware and name based routing, is proposed in this paper, which integrates benefits of several existing mehanisms. CANR consists of a cluster of proxy peers deployed in different network domains, which can work as collaborative routers, forwarding requests to each other to speed up the cross-domain visits. CANR can automatically aware the changes of network and re-construct name-based routing table based on a new multi objectie k shortest algoritm by itself, finding a set of cheapest and most fast k routing paths, which is different from current static preconfigured systems.
This work is financially supported by the National Natural Science Foundation of China(Grant No.61072060); the National Key project of Scientific and Technical Supporting Programs of China under Grant No.2009BAH39B03,2012BAH01F02; the National High Technology Research and Development Program of China Grant No.2011AA010601, 2011AA100706; the Research Fund for the Doctoral Program of Higher Education (Grant No. 20110005120007).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pallis, G., Vakali, A.: Insight and Perspectives for Content Delivery Networks. Communications of the ACM 49(1), 101–106 (2006)
Lei, M., Vrbsky, S.V., Hong, X.: An on-line replication strategy to increase availability in Data Grids. Future Generation Computer Systems 24(2), 85–98 (2008)
Pérez, J., García-Carballeira, F., Carretero, J., Calderón, A., Fernández, J.: Branch Replication Scheme: A New Model for Data Replication in Large Scale Data Grids. Future Generation Computer Systems 26(1), 12–20 (2010)
Tu, M., Li, P., Yen, I.-L., Thuraisingham, B., Khan, L.: Secure Data Objects Replication in Data Grid. IEEE Transactions on Dependable and Secure Computing 7(1), 50–64 (2010)
Furfaro, F., Mazzeo, G.M., Pugliese, A.: Managing Multi-dimensional Historical Aggregate Data in Unstructured P2P Networks. IEEE Transactions on Knowledge and Data Engineering 22(9), 1313–1330 (2010)
Agneeswaran, V.S., Janakiram, D.: Node-Capability-Aware Replica Management for Peer-to-Peer Grids. IEEE Transactions on Systems, Man, and Cybernetics—PART A: Systems and Humans 39(4), 807–818 (2009)
Ahlgren, et al.: A survey of information-centric networking. IEEE Communications Magazine, 26–36 (July 2012)
Choi, J., et al.: A Survey on content-oriented networking for efficient content delivery. IEEE Communications Magazine 49(3), 121–127
Jacobson, V., et al.: Networking Named Content. In: Proc. CoNEXT, Rome, Italy, pp. 1–12 (2009), http://doi.acm.org/10.1145/1658939.1658941
Jacobson, V., et al.: Networking Named Content. In: CoNEXT 2009, New York, NY, pp. 1–12 (2009)
Koponen, T., et al.: A Data-Oriented (and Beyond) Network Architecture. In: SIGCOMM 2007, pp. 181–192 (2007)
Visala, K., et al.: An Inter-Domain Data-Oriented Routing Architecture. In: ReArch 2009: Proc. 2009 Wksp. Rearchitecting the Internet, New York, NY, pp. 55–60. PSIRP (2009)
Gritter, M., Cheriton, D.R.: An Architecture for Content Routing Support in the Internet. In: 3rd Usenix
Carzaniga, A., et al.: A Routing Scheme for Content-Based Networking. In: IEEE INFOCOM 2004, Hong Kong (2004)
Hwang, H., Ata, S., Murata, M.: A Feasibility Evaluation on Name-Based Routing. In: Nunzi, G., Scoglio, C., Li, X. (eds.) IPOM 2009. LNCS, vol. 5843, pp. 130–142. Springer, Heidelberg (2009)
Dijkstra, E.W.: A note on two problems in connection with graphs. Number Math. 1, 269–271 (1959)
Cai, X., et al.: Time varying shortest path problems algorithm for problems with constraints. Networks 31, 193–204 (1998)
Mirchandani, P.: A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. Networks 27, 215–217 (1996)
Burton, D., et al.: On an instance of the inverse shortest pairs problem. Mathematical Programming 53, 45–61 (1992)
Brumbaugh, S.J., et al.: An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43, 216–224 (1989)
Granata, J., et al.: The interactive analysis of the multi criteria shortest path problem by the reference point method. European Journal of Operational Research 151, 103–118 (2003)
Martins, E.Q.V.: On a multicriteria shortest path problem. European Journal of Operational Research 16, 236–245 (1984)
Azvedo, J., et al.: An algorithm for the multiobjective shortest path problem on acyclic networks. Investigacao Operational 11, 52–69 (1991)
Martins, E.Q.V., et al.: The labeling algorithm for the multiobjective shortest path problem. Coimbra, Portugal: CISUC Technical Report TR99/005, University of Coimbra (1999)
Hoffman, W., Pavley, R.: A method of solution of the Nth best path problem. Journal of the ACM 6, 506–514 (1959)
Fox, B.L.: Calculating kth shortest paths. INFOR; Canadian Journal of Operational Research 11(1), 66–70 (1973)
Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 28(2), 652–673 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, K., Zhang, H., Song, M., Song, J. (2013). A Content Aware and Name Based Routing Network Speed Up System. In: Zu, Q., Hu, B., Elçi, A. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2012. Lecture Notes in Computer Science, vol 7719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37015-1_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-37015-1_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37014-4
Online ISBN: 978-3-642-37015-1
eBook Packages: Computer ScienceComputer Science (R0)