{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T01:40:02Z","timestamp":1751679602868,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935539"},{"type":"electronic","value":"9783319935546"}],"license":[{"start":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:00:00Z","timestamp":1528416000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-93554-6_59","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T14:15:20Z","timestamp":1528380920000},"page":"610-619","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Channel Congestion of the Shortest-Path Routing for Unidirectional Hypercube Networks"],"prefix":"10.1007","author":[{"given":"Tzu-Liang","family":"Kung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Nan","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Hsiang","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"issue":"4","key":"59_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"59_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s00493-010-2455-9","volume":"30","author":"M Andrews","year":"2010","unstructured":"Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485\u2013520 (2010)","journal-title":"Combinatorica"},{"issue":"3","key":"59_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/TPDS.2013.95","volume":"25","author":"JA Aroca","year":"2014","unstructured":"Aroca, J.A., Anta, A.F.: Bisection (band)width of product networks with application to data centers. IEEE Trans. Parallel Distrib. Syst. 25(3), 570\u2013580 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"59_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/71.824643","volume":"11","author":"C-P Chang","year":"2000","unstructured":"Chang, C.-P., Sung, T.-Y., Hsu, L.-H.: Edge congestion and topological properties of crossed cubes. IEEE Trans. Parallel Distrib. Syst. 11(1), 64\u201380 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"59_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/060674442","volume":"39","author":"C Chekuri","year":"2009","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Comput. 39(1), 281\u2013301 (2009)","journal-title":"SIAM J. Comput."},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/net.20084","volume":"46","author":"E Cheng","year":"2005","unstructured":"Cheng, E., Lindsey, W.A., Stey, D.E.: Maximal vertex-connectivity of $$S_{n, k}$$. Networks 46, 154\u2013162 (2005)","journal-title":"Networks"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0020-0190(99)00155-6","volume":"73","author":"E Cheng","year":"2000","unstructured":"Cheng, E., Lipman, M.J.: On the Day-Tripathi orientation of the star graphs: connectivity. Inf. Process. Lett. 73, 5\u201310 (2000)","journal-title":"Inf. Process. Lett."},{"key":"59_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<139::AID-NET4>3.0.CO;2-E","volume":"5","author":"E Cheng","year":"2000","unstructured":"Cheng, E., Lipman, M.J.: Orienting split-stars and alternating group graphs. Networks 5, 139\u2013144 (2000)","journal-title":"Networks"},{"key":"59_CR9","first-page":"490","volume-title":"Lecture Notes in Computer Science","author":"Shyh-Chain Chern","year":"1995","unstructured":"Chern, S.C., Jwo, J.S., Tuan, T.C.: Uni-directional alternating group graphs. In: Lecture Notes in Computer Science, vol. 959, pp. 490\u2013495 (1995)"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Chou, C.H., Du, D.H.C.: Unidirectional hypercubes. In: Proceedings of the Supercomputing 1990, pp. 254\u2013263 (1990)","DOI":"10.1109\/SUPERC.1990.130028"},{"key":"59_CR11","volume-title":"Principles and Practices of Interconnection Networks","author":"WJ Dally","year":"2004","unstructured":"Dally, W.J., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann, San Francisco (2004)"},{"issue":"5","key":"59_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","volume":"42","author":"K Day","year":"1992","unstructured":"Day, K., Tripathi, A.: Arrangement graphs: a class of generalized star graphs. Inf. Process. Lett. 42(5), 235\u2013241 (1992)","journal-title":"Inf. Process. Lett."},{"key":"59_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(93)90013-Y","volume":"45","author":"K Day","year":"1993","unstructured":"Day, K., Tripathi, A.: Unidirectional star graphs. Inf. Process. Lett. 45, 123\u2013129 (1993)","journal-title":"Inf. Process. Lett."},{"key":"59_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe, K.: The crossed cube architecture for parallel computing. IEEE Trans. Parallel Distrib. Syst. 3, 513\u2013524 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"59_CR15","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1109\/71.629487","volume":"8","author":"CM Fiduccia","year":"1997","unstructured":"Fiduccia, C.M., Hedrick, P.J.: Edge congestion of shortest path systems for all-to-all communication. IEEE Trans. Parallel Distrib. Syst. 8(10), 1043\u20131054 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"59_CR16","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPDS.2009.132","volume":"21","author":"M Flahive","year":"2010","unstructured":"Flahive, M., Bose, B.: The topology of Gaussian and Eisenstein-Jacobi interconnection networks. IEEE Trans. Parallel Distrib. Syst. 21(8), 1132\u20131142 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"59_CR17","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays $$\\cdot $$ Trees $$\\cdot $$ Hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays $$\\cdot $$ Trees $$\\cdot $$ Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"issue":"2","key":"59_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1142\/S0219265900000081","volume":"1","author":"T-K Li","year":"2000","unstructured":"Li, T.-K., Tan, J.J.M., Hsu, L.-H., Sung, T.-Y.: Optimum congested routing strategy on twisted cubes. J. Interconnection Netw. 1(2), 115\u2013134 (2000)","journal-title":"J. Interconnection Netw."},{"issue":"9","key":"59_CR19","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TPDS.2005.113","volume":"16","author":"PKK Loh","year":"2005","unstructured":"Loh, P.K.K., Hsu, W.J., Pan, Y.: The exchanged hypercube. IEEE Trans. Parallel Distrib. Syst. 16(9), 866\u2013874 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"59_CR20","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1109\/TC.2008.57","volume":"57","author":"C Mart\u00ednez","year":"2008","unstructured":"Mart\u00ednez, C., Beivide, R., Stafford, E., Moret\u00f3, M., Gabidulin, E.M.: Modeling toroidal networks with the Gaussian integers. IEEE Trans. Comput. 57(8), 1046\u20131056 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"59_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.disc.2004.02.009","volume":"285","author":"MI Ostrovskii","year":"2004","unstructured":"Ostrovskii, M.I.: Minimal congestion trees. Discrete Math. 285, 219\u2013226 (2004)","journal-title":"Discrete Math."},{"key":"59_CR22","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad, Y., Shultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37, 867\u2013872 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"59_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"J-M Xu","year":"2001","unstructured":"Xu, J.-M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht\/Boston\/London (2001)"}],"container-title":["Advances in Intelligent Systems and Computing","Innovative Mobile and Internet Services in Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93554-6_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T01:06:41Z","timestamp":1751677601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93554-6_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"ISBN":["9783319935539","9783319935546"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93554-6_59","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,6,8]]}}}