{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:31:44Z","timestamp":1773945104318,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572191"],"award-info":[{"award-number":["61572191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402170"],"award-info":[{"award-number":["61402170"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002767","name":"Hunan Provincial Science and Technology Program Project of China","doi-asserted-by":"publisher","award":["2013FJ4051"],"award-info":[{"award-number":["2013FJ4051"]}],"id":[{"id":"10.13039\/501100002767","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hunan Provincial Education Department Scientific Research Fund of China","award":["13B065"],"award-info":[{"award-number":["13B065"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2682501","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T01:44:11Z","timestamp":1489628651000},"page":"4048-4056","source":"Crossref","is-referenced-by-count":20,"title":["A Box-Covering-Based Routing Algorithm for Large-Scale SDNs"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8956-6144","authenticated-orcid":false,"given":"Lianming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiheng","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2567-4354","authenticated-orcid":false,"given":"Yao","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.172501399"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633047"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316231"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2005.1541715"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390241"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/505733.505735"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2013.6461198"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2012.144"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2015.7113223"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2015.1044003"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"289","DOI":"10.11591\/ijece.v5i2.pp289-296","article-title":"The extended Dijkstra’s-based load balancing for openflow network","volume":"5","author":"yahya","year":"2015","journal-title":"Int J Elect Comput Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.250"},{"key":"ref27","first-page":"1","article-title":"Extending Dijkstra’s shortest path algorithm for software defined networking","author":"jiang","year":"2014","journal-title":"Proc Asia-Pacific Netw Oper Manage Symp"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2014.012214.00180"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/srep03049"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/EUROCON.2015.7313698"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2007\/03\/P03006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1058"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2602204.2602219"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TNET.2009.2016390","article-title":"Quantifying path exploration in the Internet","volume":"17","author":"ricardo","year":"2009","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2619287.2619299"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342445"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1384609.1384625"},{"key":"ref24","first-page":"8","article-title":"Research and verifi-cation on SDN-based on-demand smart routing system","volume":"30","author":"wang","year":"2014","journal-title":"Telecom Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2002396.2002405"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2014.6914322"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2538718"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07879231.pdf?arnumber=7879231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T22:40:40Z","timestamp":1750113640000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7879231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2682501","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}