{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:25:33Z","timestamp":1722943533616},"reference-count":22,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2016]]},"DOI":"10.12720\/jcm.11.6.579-585","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T09:01:16Z","timestamp":1480582876000},"source":"Crossref","is-referenced-by-count":1,"title":["Minimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control"],"prefix":"10.12720","author":[{"name":"College of Information Science and Technology, Nanjing Agricultural University, Nanjing 210095, China","sequence":"first","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yi","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Ding","sequence":"additional","affiliation":[]}],"member":"4977","published-online":{"date-parts":[[2016]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"[1] P. Francesco, \"Percolation-based routing in the Internet,\" Journal of Systems and Software, vol. 85, no. 11, pp. 2559-2573, 2012.","key":"ref0","DOI":"10.1016\/j.jss.2012.05.094"},{"unstructured":"[2] J. Wang, X. X. Xiong, and X. W. Zheng, \" Deterministic random walk: A new preconditioner for power grid analysis,\" IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 23, no. 11, pp. 2606-2616, 2015.","key":"ref1"},{"doi-asserted-by":"crossref","unstructured":"[3] X. Zhang, E. Miller-Hooks, and K. Denny, \"Assessing the role of network topology in transportation network resilience,\" Journal of Transport Geography, vol. 46, pp. 35-45, 2015.","key":"ref2","DOI":"10.1016\/j.jtrangeo.2015.05.006"},{"doi-asserted-by":"crossref","unstructured":"[4] S. Boccaletti, V. Latorab, Y. Moreno, M. Chavez, and D. U. Hwang, \"Complex networks: Structure and dynamics,\" Physics Reports, vol. 424, no. 4, pp. 175-308, 2006.","key":"ref3","DOI":"10.1016\/j.physrep.2005.10.009"},{"doi-asserted-by":"crossref","unstructured":"[5] H. W. Wang and C. Yu, \"Design of congestion control scheme for uncertain discrete network systems,\" INT J. Comput. Commun, vol. 8, no. 6, pp. 901-906, 2013.","key":"ref4","DOI":"10.15837\/ijccc.2013.6.765"},{"doi-asserted-by":"crossref","unstructured":"[6] Z. Y. Jiang, J. F. Ma, and X. Jing, \"Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy,\" Physica A, vol. 422, no. 8, pp. 181-186, 2015.","key":"ref5","DOI":"10.1016\/j.physa.2014.12.016"},{"doi-asserted-by":"crossref","unstructured":"[7] C. Jiao, W. Yang, Y. Xia, and M. Zhu, \"A fast heuristic algorithm for minimizing congestion in the MPLS networks,\" International Journal of Communications, Network & System Sciences, vol. 7, no. 8, pp. 294-302, 2014.","key":"ref6","DOI":"10.4236\/ijcns.2014.78032"},{"doi-asserted-by":"crossref","unstructured":"[8] P. Potier and L. J. Qian, \"Management of cognitive radio ad hoc networks using a congestion-based metric,\" International Journal of Network Management, vol. 23, no. 5, pp. 325-349, 2013.","key":"ref7","DOI":"10.1002\/nem.1835"},{"doi-asserted-by":"crossref","unstructured":"[9] Z. X. Gao, Y. Shi, and S. Z. Chen, \"Identifying influential nodes for efficient routing in opportunistic networks,\" Journal of Communications, vol. 10, no. 1, pp. 48-54, 2015.","key":"ref8","DOI":"10.12720\/jcm.10.1.48-54"},{"doi-asserted-by":"crossref","unstructured":"[10] R. Guimer\u00e0, A. Arenas, A. D. Guilera, and F. Giralt, \"Dynamical properties of model communication networks,\" Phys. Rev. E, vol. 66, no. 2, pp. 1-8, 2002.","key":"ref9","DOI":"10.1103\/PhysRevE.66.026704"},{"doi-asserted-by":"crossref","unstructured":"[11] D. D. Martino, L. D. Asta, G. Bianconi, and M. Marsili, \"Congestion phenomena on complex networks, \"Phys. Rev. E, vol. 79, no. 1, pp. 1-4, 2009.","key":"ref10","DOI":"10.1103\/PhysRevE.79.015101"},{"doi-asserted-by":"crossref","unstructured":"[12] W. Huang and T. W. S. Chow, \"Investigation of both local and global topological ingredients on transport efficiency in scale-free networks,\" Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 19, no. 4, pp. 1-8, 2009.","key":"ref11","DOI":"10.1063\/1.3272217"},{"doi-asserted-by":"crossref","unstructured":"[13] W. B. Du, Z. X. Wu, and K. Q. Cai, \"Effective usage of shortest paths promotes transportation efficiency on scale-free networks,\" Physica A, vol. 392, no. 17, pp. 3505-3512, 2013.","key":"ref12","DOI":"10.1016\/j.physa.2013.03.032"},{"doi-asserted-by":"crossref","unstructured":"[14] G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B. H. Wang, \"Efficient routing on complex networks,\" Phys. Rev. E, vol. 73, no. 4, pp. 1-5, 2006.","key":"ref13","DOI":"10.1103\/PhysRevE.73.046108"},{"doi-asserted-by":"crossref","unstructured":"[15] B. Danila, Y. Yu, J. A. Marsh, and K. E. Bassler, \"Transport optimization on complex networks,\" Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 17, no. 2, pp. 1-10, 2007.","key":"ref14","DOI":"10.1063\/1.2731718"},{"doi-asserted-by":"crossref","unstructured":"[16] Z. Y. Jiang, J. F. Ma, and X. Jing, \"Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy,\" Physica A, vol. 422, no.5, pp. 181-186, 2015.","key":"ref15","DOI":"10.1016\/j.physa.2014.12.016"},{"unstructured":"[17] B. R. Musicus, Levinson and Fast Choleski Algorithms for Toeplitz and Almost Toeplitz Matrices, Boston: MIT RLE, 1988, no. 538.","key":"ref16"},{"doi-asserted-by":"crossref","unstructured":"[18] M. Small, Y. Li, T. Stemler, and K. Judd, \"Growing optimal scale-free networks via likelihood,\" Physical review. E, vol. 91, no. 4, 2015.","key":"ref17","DOI":"10.1103\/PhysRevE.91.042801"},{"doi-asserted-by":"crossref","unstructured":"[19] A. Barab\u00e1si and R. Albert, \"Emergence of scaling in random networks,\" Science, vol. 286, no. 5439, pp. 509-512, 1999.","key":"ref18","DOI":"10.1126\/science.286.5439.509"},{"unstructured":"[20] E. Zhang and L. Gao, \"A novel vertex separator based circuit partitioning algorithm,\" Chinese Journal of Computers, vol. 37, no. 7, pp. 1528-1537, 2014.","key":"ref19"},{"doi-asserted-by":"crossref","unstructured":"[21] T. N. Bui and C. Jones, \"Finding good approximate vertex and edge partitions is NP-hard,\" Inf. Proc. Lett., vol. 42, no. 153, 1992.","key":"ref20","DOI":"10.1016\/0020-0190(92)90140-Q"},{"unstructured":"[22] CAIDA: Center for applied Internet data analysis. [Online]. Available: http:\/\/www.caida.org\/data\/router-adjacencies\/","key":"ref21"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2016\/0624\/20160624031511130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T04:25:23Z","timestamp":1568607923000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=162&id=991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"URL":"https:\/\/doi.org\/10.12720\/jcm.11.6.579-585","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2016]]}}}