{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:10Z","timestamp":1740148870619,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s12083-019-00855-8","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T14:02:54Z","timestamp":1577973774000},"page":"932-939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Path optimization of box-covering based routing to minimize average packet delay in software defined network"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2042-2708","authenticated-orcid":false,"given":"UmaMaheswari","family":"Gurusamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Hariharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S. K.","family":"Manikandan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,2]]},"reference":[{"issue":"1","key":"855_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/COMST.2014.2330903","volume":"17","author":"W Xia","year":"2015","unstructured":"Xia W, Wen Z, Foh CH, Niyato D, Xie H (2015) A survey on software defined networking. IEEE Commun Surveys Tuts 17(1):27\u201351","journal-title":"IEEE Commun Surveys Tuts"},{"issue":"2","key":"855_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/MCOM.2013.6461198","volume":"51","author":"SH Yeganeh","year":"2013","unstructured":"Yeganeh SH, Tootoonchian A, Ganjali Y (2013) On scalability of software defined networking. IEEE Commun Mag 51(2):136\u2013141","journal-title":"IEEE Commun Mag"},{"issue":"1","key":"855_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/CC.2017.7839762","volume":"14","author":"G Cheng","year":"2017","unstructured":"Cheng G, Chen H, Hu H, Wang Z (2017) Toward a scalable SDN control mechanism via switch migration. China Communications 14(1):111\u2013123","journal-title":"China Communications"},{"key":"855_CR4","unstructured":"Tootoonchian A, Ganjali Y (2010) Hyperflow: A distributed control plane for OpenFlow. Proc. Internet Netw. Manag. Conf. Res. Enterprise Netw (INM). 1\u20136"},{"key":"855_CR5","unstructured":"Cheng L-W, Wang S-Y (2015) Application-aware SDN routing for big data networking. 2015 IEEE Global Communications Conference (GLOBECOM) 1\u20136"},{"key":"855_CR6","unstructured":"Quan W, Cheng N, Qin M, Zhang H, Chan HA, Shen X (2018) Adaptive transmission control for software defined vehicular networks. IEEE Wireless Communications Letters:1\u20134"},{"issue":"8","key":"855_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/MCOM.2017.1601162","volume":"55","author":"W Quan","year":"2017","unstructured":"Quan W, Liu Y, Zhang H, Yu S (2017) Enhancing crowd collaborations for software defined vehicular networks. IEEE Commun Mag 55(8):80\u201386","journal-title":"IEEE Commun Mag"},{"key":"855_CR8","doi-asserted-by":"publisher","first-page":"6859","DOI":"10.1109\/ACCESS.2016.2636247","volume":"5","author":"A Iqbal","year":"2017","unstructured":"Iqbal A, Javed U, Saleh S, Kim J, Alowibdi JS, Ilyas MU (2017) Analytical modeling of end-to-end delay in OpenFlow based networks. IEEE Access 5:6859\u20136871","journal-title":"IEEE Access"},{"issue":"3","key":"855_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TNSM.2016.2585759","volume":"13","author":"M Caria","year":"2016","unstructured":"Caria M, Jukan A, Hoffmann M (2016) SDN partitioning: a centralized control plane for distributed routing protocols. IEEE Trans Netw Serv Manag 13(3):381\u2013393","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"855_CR10","doi-asserted-by":"publisher","first-page":"17045","DOI":"10.1109\/ACCESS.2017.2743697","volume":"5","author":"R Challa","year":"2017","unstructured":"Challa R, Jeon S, Kim DS, Choo H (2017) CentFlow: centrality-based flow balancing and traffic distribution for higher network utilization. IEEE Access 5:17045\u201317058","journal-title":"IEEE Access"},{"key":"855_CR11","doi-asserted-by":"publisher","first-page":"64533","DOI":"10.1109\/ACCESS.2018.2877686","volume":"6","author":"C Yu","year":"2018","unstructured":"Yu C, Lan J, Guo Z, Hu Y (2018) DROM: optimizing the routing in software-defined networks with deep reinforcement learning. IEEE Access 6:64533\u201364539","journal-title":"IEEE Access"},{"issue":"4","key":"855_CR12","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/TNSM.2018.2874051","volume":"15","author":"S Achleitner","year":"2018","unstructured":"Achleitner S, Bartolin N, He T, La Porta T, Tootaghaj DZ (2018) Fast network configuration in software defined networking. IEEE Trans Netw Serv Manag 15(4):1249\u20131263","journal-title":"IEEE Trans Netw Serv Manag"},{"issue":"1","key":"855_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TNSM.2018.2865204","volume":"16","author":"D Chemodanov","year":"2019","unstructured":"Chemodanov D, Esposito F, Calyam P, Sukhov A (2019) A constrained shortest path scheme for virtual network service management. IEEE Trans Netw Serv Manag 16(1):127\u2013142","journal-title":"IEEE Trans Netw Serv Manag"},{"issue":"6","key":"855_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/CC.2018.8398509","volume":"15","author":"Z Li","year":"2018","unstructured":"Li Z, Ji L, Huang R, Liu S (2018) Improving centralized path calculation based on graph compression. China Communications 15(6):120\u2013124","journal-title":"China Communications"},{"key":"855_CR15","doi-asserted-by":"publisher","first-page":"4048","DOI":"10.1109\/ACCESS.2017.2682501","volume":"5","author":"L Zhang","year":"2017","unstructured":"Zhang L, Deng Q, Su Y, Hu Y (2017) A box-covering-based routing algorithm for large-scale SDNs. IEEE Access 5:4048\u20134056","journal-title":"IEEE Access"},{"key":"855_CR16","volume-title":"Network routing algorithms, Protocols and Architectures","author":"D Medhi","year":"2007","unstructured":"Medhi D, Ramasamy K (2007) Network routing algorithms, Protocols and Architectures. Elsevier Inc., Amsterdam"},{"key":"855_CR17","volume-title":"Routing, flow, and capacity Design in Communication and Computer Networks","author":"M Pioro","year":"2004","unstructured":"Pioro M, Medhi D (2004) Routing, flow, and capacity Design in Communication and Computer Networks. Elsevier Inc., Amsterdam"},{"key":"855_CR18","volume-title":"Network analysis, architecture, and design","author":"JD McCabe","year":"2007","unstructured":"McCabe JD (2007) Network analysis, architecture, and design. Elsevier Inc., Amsterdam"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-019-00855-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-019-00855-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-019-00855-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T01:30:05Z","timestamp":1609464605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-019-00855-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,2]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s12083-019-00855-8","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2020,1,2]]},"assertion":[{"value":"17 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}