{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:55:28Z","timestamp":1784134528877,"version":"3.55.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,12,20]],"date-time":"2014-12-20T00:00:00Z","timestamp":1419033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11276-014-0878-8","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T11:22:05Z","timestamp":1418988125000},"page":"1713-1732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Routing algorithm of minimizing maximum link congestion on grid networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Jun","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengcheng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yann-Hang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duo","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,20]]},"reference":[{"key":"878_CR1","doi-asserted-by":"crossref","unstructured":"Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., & Xiao, X. (2002). Overview and principles of internet traffic engineering. Tech. rep., RFC 3272.","DOI":"10.17487\/rfc3272"},{"key":"878_CR2","unstructured":"Siripongwutikorn, P., Banerjee, S. & Tipper, D. (2002). Traffic engineering in the internet: A survey of load balanced routing. White paper."},{"issue":"2","key":"878_CR3","first-page":"151","volume":"4","author":"NSC Ravindra Kumar Singh","year":"2012","unstructured":"Ravindra Kumar Singh, N. S. C., & Saxena, K. (2012). Load balancing in ip\/mpls networks: A survey. Computer Science and Communications, 4(2), 151\u2013156.","journal-title":"Computer Science and Communications"},{"issue":"2","key":"878_CR4","first-page":"119","volume":"3","author":"C Askarian","year":"2012","unstructured":"Askarian, C., & Beigy, H. (2012). A survey for load balancing in mobile wimax networks. Advanced Computing: An International Journal, 3(2), 119\u2013137.","journal-title":"Advanced Computing: An International Journal"},{"key":"878_CR5","first-page":"456","volume":"2","author":"D Wajgi","year":"2012","unstructured":"Wajgi, D., & Thakur, N. V. (2012). Load balancing algorithms in wireless sensor network: A survey. International Journal of Computer Networks and Wireless Communications (IJCNWC), 2, 456\u2013460.","journal-title":"International Journal of Computer Networks and Wireless Communications (IJCNWC)"},{"key":"878_CR6","unstructured":"Yao, Y., Cao, Q., & Vasilakos, A. V. (2013). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In: MASS (pp. 182\u2013190)."},{"issue":"12","key":"878_CR7","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1109\/JPROC.2011.2165330","volume":"99","author":"Zhijie Shen","year":"2011","unstructured":"Shen, Zhijie, et al. (2011). Peer-to-peer media streaming: Insights and new developments. Proceedings of the IEEE, 99(12), 2089\u20132109.","journal-title":"Proceedings of the IEEE"},{"issue":"3","key":"878_CR8","first-page":"495","volume":"2","author":"PK Suri","year":"2012","unstructured":"Suri, P. K., & Kaur, S. (2012). A survey of load balancing algorithms in manet. Engineering Science and Technology: An International Journal, 2(3), 495\u2013504.","journal-title":"Engineering Science and Technology: An International Journal"},{"issue":"16","key":"878_CR9","doi-asserted-by":"crossref","first-page":"44","DOI":"10.5120\/9636-4437","volume":"59","author":"D Maheshwari","year":"2012","unstructured":"Maheshwari, D., & Nedunchezhian, R. (2012). Load balancing in mobile ad hoc networks: A survey. International Journal of Computer Applications, 59(16), 44\u201349.","journal-title":"International Journal of Computer Applications"},{"issue":"3","key":"878_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"FP Kelly","year":"1998","unstructured":"Kelly, F. P., Maulloo, A. K., & Tan, D. K. (1998). Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3), 237\u2013252.","journal-title":"Journal of the Operational Research Society"},{"key":"878_CR11","doi-asserted-by":"crossref","unstructured":"Firoiu, V. & Borden, M. (2000). A study of active queue management for congestion control. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 3, pp. 1435\u20131444).","DOI":"10.1109\/INFCOM.2000.832541"},{"issue":"12","key":"878_CR12","doi-asserted-by":"crossref","first-page":"2538","DOI":"10.1109\/JPROC.2013.2257631","volume":"101","author":"Mo Li","year":"2013","unstructured":"Li, Mo, et al. (2013). A survey on topology control in wireless sensor networks: Taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538\u20132557.","journal-title":"Proceedings of the IEEE"},{"key":"878_CR13","unstructured":"Chen, L., Low, S. H. & Doyle, J. C. (2005). Joint congestion control and media access control design for ad hoc wireless networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (Vol. 3, pp. 2212\u20132222)."},{"issue":"2","key":"878_CR14","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/s11277-012-0723-2","volume":"70","author":"JG Kewei Sha","year":"2013","unstructured":"Kewei Sha, J. G., & Greve, J. G. (2013). Multipath routing techniques in wireless sensor networks: A survey. Wireless Personal Communications, 70(2), 807\u2013829.","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"878_CR15","doi-asserted-by":"crossref","first-page":"650","DOI":"10.3390\/s120100650","volume":"12","author":"M Radi","year":"2012","unstructured":"Radi, M., Dezfouli, B., Bakar, K. A., & Lee, M. (2012). Multipath routing in wireless sensor networks: Survey and research challenges. Sensors, 12(1), 650\u2013685.","journal-title":"Sensors"},{"key":"878_CR16","doi-asserted-by":"crossref","unstructured":"Piratla, N. M. & Jayasumana, A. P. (2006). Reordering of packets due to multipath forwarding-an analysis. In ICC\u201906 (Vol. 2, pp. 829\u2013834).","DOI":"10.1109\/ICC.2006.254810"},{"key":"878_CR17","doi-asserted-by":"crossref","unstructured":"Robinson, J. & Knightly, E. W. (2007). A performance study of deployment factors in wireless mesh networks. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE (pp. 2054\u20132062).","DOI":"10.1109\/INFCOM.2007.238"},{"key":"878_CR18","doi-asserted-by":"crossref","unstructured":"Busch, C., Kannan, R., & Samman, A. (2012). Bottleneck routing games on grids. In Game Theory for Networks (Vol. 75 LNICST, pp. 294\u2013307).","DOI":"10.1007\/978-3-642-30373-9_21"},{"issue":"2","key":"878_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"FT Leighton","year":"1994","unstructured":"Leighton, F. T., Maggs, B. M., & Rao, S. B. (1994). Packet routing and job-shop scheduling in O (congestion\u00a0+\u00a0dilation) steps. Combinatorica, 14(2), 167\u2013186.","journal-title":"Combinatorica"},{"issue":"6","key":"878_CR20","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner, R., & Orda, A. (2007). Bottleneck routing games in communication networks. IEEE Journal on Selected Areas in Communications, 25(6), 1173\u20131179.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"878_CR21","doi-asserted-by":"crossref","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2008) Quality of routing congestion games in wireless sensor networks. In Proceedings of the 4th Annual International Conference on Wireless Internet. no. p. 71.","DOI":"10.4108\/ICST.WICON2008.4914"},{"issue":"36","key":"878_CR22","doi-asserted-by":"crossref","first-page":"3337","DOI":"10.1016\/j.tcs.2009.04.015","volume":"410","author":"C Busch","year":"2009","unstructured":"Busch, C., & Magdon-Ismail, M. (2009). Atomic routing games on maximum congestion. Theoretical Computer Science, 410(36), 3337\u20133347.","journal-title":"Theoretical Computer Science"},{"key":"878_CR23","doi-asserted-by":"crossref","unstructured":"Rajgopal Kannan,et al. \u201cOptimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games.\u201d GAMENETS. pp. 308-320, 2011.","DOI":"10.1007\/978-3-642-30373-9_22"},{"issue":"9","key":"878_CR24","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"Costas Busch","year":"2012","unstructured":"Busch, Costas, et al. (2012). Approximating congestion\u00a0+\u00a0dilation in networks via \u2018quality of routing\u2019 games. IEEE Transactions on Computers, 61(9), 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"878_CR25","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., et al. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"issue":"2","key":"878_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"1","key":"878_CR27","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., et al. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"7","key":"878_CR28","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1049\/iet-com.2009.0164","volume":"4","author":"Y Liu","year":"2010","unstructured":"Liu, Y., et al. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810\u2013816.","journal-title":"IET Communications"},{"issue":"4","key":"878_CR29","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MNET.2011.5958002","volume":"25","author":"Kai Chen","year":"2011","unstructured":"Chen, Kai, et al. (2011). Survey on routing in data centers: Insights and future directions. IEEE Network, 25(4), 6\u201310.","journal-title":"IEEE Network"},{"key":"878_CR30","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM (pp. 100\u2013108)."},{"issue":"1","key":"878_CR31","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/TSMCC.2003.818500","volume":"34","author":"Panagiotis Demestichas","year":"2004","unstructured":"Demestichas, Panagiotis, et al. (2004). Service configuration and traffic distribution in composite radio environments. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 34(1), 69\u201381.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C"},{"key":"878_CR32","unstructured":"Britta, P., Martin, S., & Andreas, W. (2010). Packet routing on the grid. In Theoretical Informatics\u20149th Latin American Symposium, Proceedings (Vol. 6034 LNCS, pp. 120\u2013130)."},{"issue":"10","key":"878_CR33","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/12.35831","volume":"38","author":"HG Badr","year":"1989","unstructured":"Badr, H. G., & Podar, S. (1989). An optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Transactions on Computers, 38(10), 1362\u20131371.","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"878_CR34","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1109\/12.293267","volume":"43","author":"T Weller","year":"1994","unstructured":"Weller, T., & Hajek, B. (1994). Comments on\u201dan optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Transactions on Computers, 43(7), 862\u2013863.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"878_CR35","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/24.799848","volume":"48","author":"J Wu","year":"1999","unstructured":"Wu, J. (1999). Maximum-shortest-path (msp): An optimal routing policy for mesh-connected multicomputers. IEEE Transactions on Reliability, 48(3), 247\u2013255.","journal-title":"IEEE Transactions on Reliability"},{"key":"878_CR36","doi-asserted-by":"crossref","unstructured":"Takatsu, S., Ooshita, F., Kakugawa, H., & Masuzawa, T. (2013). Zigzag: Local-information-based self-optimizing routing in virtual grid networks. In International Conference on Distributed Computing Systems, 33rd IEEE (pp. 357\u2013368).","DOI":"10.1109\/ICDCS.2013.63"},{"key":"878_CR37","unstructured":"Liu, J. W. (2000). Real-time systems (pp.115\u2013189). Upper Saddle River, NJ: Prentice Hall PTR."},{"key":"878_CR38","first-page":"1","volume":"2009","author":"DC Dhanapala","year":"2009","unstructured":"Dhanapala, D. C., Jayasumana, A. P., & Han, Q. (2009). Performance of random routing on grid-based sensor networks. CCNC, 2009, 1\u20135.","journal-title":"CCNC"},{"key":"878_CR39","unstructured":"Rajasekaran, S. (1991). Randomized algorithms for packet routing on the mesh. Technical Reports (CIS). Paper 328. http:\/\/repository.upenn.edu\/cis_reports\/328 ."},{"issue":"5","key":"878_CR40","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.2008.23","volume":"57","author":"C Busch","year":"2008","unstructured":"Busch, C., Magdon-lsmail, M., & Xi, J. (2008). Optimal oblivious path selection on the mesh. IEEE Transactions on Computers, 57(5), 660\u2013671.","journal-title":"IEEE Transactions on Computers"},{"key":"878_CR41","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications (pp. 649\u2013684). Upper Saddle River, NJ: Prentice Hall PTR."},{"key":"878_CR42","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms (Vol. 2). Cambridge: MIT press."},{"key":"878_CR43","unstructured":"Kaibel, V., & Peinhardt, M. (2006). On the bottleneck shortest path problem. Technical Reports."},{"issue":"3","key":"878_CR44","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM), 34(3), 596\u2013615.","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-014-0878-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-014-0878-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-014-0878-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T16:13:57Z","timestamp":1566144837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-014-0878-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,20]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["878"],"URL":"https:\/\/doi.org\/10.1007\/s11276-014-0878-8","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,20]]}}}