{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:23:32Z","timestamp":1745987012264,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370144"},{"type":"electronic","value":"9783642370151"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37015-1_59","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T04:34:18Z","timestamp":1362458058000},"page":"672-688","source":"Crossref","is-referenced-by-count":0,"title":["A Content Aware and Name Based Routing Network Speed Up System"],"prefix":"10.1007","author":[{"given":"Ke","family":"Xu","sequence":"first","affiliation":[]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Meina","family":"Song","sequence":"additional","affiliation":[]},{"given":"Junde","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"59_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1107458.1107462","volume":"49","author":"G. Pallis","year":"2006","unstructured":"Pallis, G., Vakali, A.: Insight and Perspectives for Content Delivery Networks. Communications of the ACM\u00a049(1), 101\u2013106 (2006)","journal-title":"Communications of the ACM"},{"issue":"2","key":"59_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.future.2007.04.009","volume":"24","author":"M. Lei","year":"2008","unstructured":"Lei, M., Vrbsky, S.V., Hong, X.: An on-line replication strategy to increase availability in Data Grids. Future Generation Computer Systems\u00a024(2), 85\u201398 (2008)","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"59_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.future.2009.05.015","volume":"26","author":"J. P\u00e9rez","year":"2010","unstructured":"P\u00e9rez, J., Garc\u00eda-Carballeira, F., Carretero, J., Calder\u00f3n, A., Fern\u00e1ndez, J.: Branch Replication Scheme: A New Model for Data Replication in Large Scale Data Grids. Future Generation Computer Systems\u00a026(1), 12\u201320 (2010)","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"59_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TDSC.2008.19","volume":"7","author":"M. Tu","year":"2010","unstructured":"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\u00a07(1), 50\u201364 (2010)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"9","key":"59_CR5","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TKDE.2009.160","volume":"22","author":"F. Furfaro","year":"2010","unstructured":"Furfaro, F., Mazzeo, G.M., Pugliese, A.: Managing Multi-dimensional Historical Aggregate Data in Unstructured P2P Networks. IEEE Transactions on Knowledge and Data Engineering\u00a022(9), 1313\u20131330 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"59_CR6","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TSMCA.2009.2015960","volume":"39","author":"V.S. Agneeswaran","year":"2009","unstructured":"Agneeswaran, V.S., Janakiram, D.: Node-Capability-Aware Replica Management for Peer-to-Peer Grids. IEEE Transactions on Systems, Man, and Cybernetics\u2014PART A: Systems and Humans\u00a039(4), 807\u2013818 (2009)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2014PART A: Systems and Humans"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Ahlgren, et al.: A survey of information-centric networking. IEEE Communications Magazine, 26\u201336 (July 2012)","DOI":"10.1109\/MCOM.2012.6231276"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Choi, J., et al.: A Survey on content-oriented networking for efficient content delivery. IEEE Communications Magazine\u00a049(3), 121\u2013127","DOI":"10.1109\/MCOM.2011.5723809"},{"key":"59_CR9","unstructured":"Jacobson, V., et al.: Networking Named Content. In: Proc. CoNEXT, Rome, Italy, pp. 1\u201312 (2009), http:\/\/doi.acm.org\/10.1145\/1658939.1658941"},{"key":"59_CR10","unstructured":"http:\/\/www.named-data.org"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Jacobson, V., et al.: Networking Named Content. In: CoNEXT 2009, New York, NY, pp. 1\u201312 (2009)","DOI":"10.1145\/1658939.1658941"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Koponen, T., et al.: A Data-Oriented (and Beyond) Network Architecture. In: SIGCOMM 2007, pp. 181\u2013192 (2007)","DOI":"10.1145\/1282380.1282402"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"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\u201360. PSIRP (2009)","DOI":"10.1145\/1658978.1658992"},{"key":"59_CR14","unstructured":"Gritter, M., Cheriton, D.R.: An Architecture for Content Routing Support in the Internet. In: 3rd Usenix"},{"key":"59_CR15","unstructured":"Carzaniga, A., et al.: A Routing Scheme for Content-Based Networking. In: IEEE INFOCOM 2004, Hong Kong (2004)"},{"key":"59_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-04968-2_11","volume-title":"IP Operations and Management","author":"H. Hwang","year":"2009","unstructured":"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.\u00a05843, pp. 130\u2013142. Springer, Heidelberg (2009)"},{"key":"59_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Number Math.\u00a01, 269\u2013271 (1959)","journal-title":"Number Math."},{"key":"59_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","volume":"31","author":"X. Cai","year":"1998","unstructured":"Cai, X., et al.: Time varying shortest path problems algorithm for problems with constraints. Networks\u00a031, 193\u2013204 (1998)","journal-title":"Networks"},{"key":"59_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<215::AID-NET6>3.0.CO;2-L","volume":"27","author":"P. Mirchandani","year":"1996","unstructured":"Mirchandani, P.: A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. Networks\u00a027, 215\u2013217 (1996)","journal-title":"Networks"},{"key":"59_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D., et al.: On an instance of the inverse shortest pairs problem. Mathematical Programming\u00a053, 45\u201361 (1992)","journal-title":"Mathematical Programming"},{"key":"59_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"S.J. Brumbaugh","year":"1989","unstructured":"Brumbaugh, S.J., et al.: An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research\u00a043, 216\u2013224 (1989)","journal-title":"European Journal of Operational Research"},{"key":"59_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0377-2217(02)00594-5","volume":"151","author":"J. Granata","year":"2003","unstructured":"Granata, J., et al.: The interactive analysis of the multi criteria shortest path problem by the reference point method. European Journal of Operational Research\u00a0151, 103\u2013118 (2003)","journal-title":"European Journal of Operational Research"},{"key":"59_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. European Journal of Operational Research\u00a016, 236\u2013245 (1984)","journal-title":"European Journal of Operational Research"},{"key":"59_CR24","first-page":"52","volume":"11","author":"J. Azvedo","year":"1991","unstructured":"Azvedo, J., et al.: An algorithm for the multiobjective shortest path problem on acyclic networks. Investigacao Operational\u00a011, 52\u201369 (1991)","journal-title":"Investigacao Operational"},{"key":"59_CR25","unstructured":"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)"},{"key":"59_CR26","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/320998.321004","volume":"6","author":"W. Hoffman","year":"1959","unstructured":"Hoffman, W., Pavley, R.: A method of solution of the Nth best path problem. Journal of the ACM\u00a06, 506\u2013514 (1959)","journal-title":"Journal of the ACM"},{"issue":"1","key":"59_CR27","first-page":"66","volume":"11","author":"B.L. Fox","year":"1973","unstructured":"Fox, B.L.: Calculating kth shortest paths. INFOR; Canadian Journal of Operational Research\u00a011(1), 66\u201370 (1973)","journal-title":"INFOR; Canadian Journal of Operational Research"},{"issue":"2","key":"59_CR28","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a028(2), 652\u2013673 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Pervasive Computing and the Networked World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37015-1_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:57:06Z","timestamp":1745967426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37015-1_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370144","9783642370151"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37015-1_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}