{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:25:40Z","timestamp":1725524740280},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791270"},{"type":"electronic","value":"9783540791287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79128-7_21","type":"book-chapter","created":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T11:01:46Z","timestamp":1234177306000},"page":"355-360","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks"],"prefix":"10.1007","author":[{"given":"Wenqing","family":"Dou","sequence":"first","affiliation":[]},{"given":"Frank K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1_21","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V.E. Bene\u0161","year":"1965","unstructured":"Bene\u0161, V.E. (1965). Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic."},{"key":"21_CR2_21","volume-title":"Blocking in the NAIU networks","author":"V.E. Bene\u0161","year":"1985","unstructured":"Bene\u0161, V.E. (1985). Blocking in the NAIU networks. AT&T Bell Labs Tech. Memo."},{"key":"21_CR3_21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2005.10.048","volume":"352","author":"F.H. Chang","year":"2006","unstructured":"Chang, F.H., Guo, J.Y., & Hwang, F.K. (2006). Wide-sense nonblocking for multi-Log\n                    d\n                    N networks under various routing strategies. Theoretical Computer Science A, 352, 232\u2013239.","journal-title":"Theoretical Computer Science A"},{"key":"21_CR4_21","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.tcs.2003.12.021","volume":"314","author":"F.H. Chang","year":"2004","unstructured":"Chang, F.H., Guo, J.Y., Hwang, F.K., & Lin, C.K. (2004). Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. Theoretical Computer\n                    Science A, 314, 375\u2013386.","journal-title":"Theoretical Computer Science A"},{"key":"21_CR5_21","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1137\/S0895480102414806","volume":"17","author":"W.R. Chen","year":"2004","unstructured":"Chen, W.R., Hwang, F.K., & Zhu, X. (2004). Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks. SIAM Journal on Discrete Mathematics, 17, 446\u2013452.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"21_CR6_21","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C. Clos","year":"1953","unstructured":"Clos, C. (1953). A study of nonblocking switching networks. Bell System Technical Journal, 32, 406\u2013424.","journal-title":"Bell System Technical Journal"},{"key":"21_CR7_21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(97)00016-4","volume":"78","author":"P. Fishburn","year":"1997","unstructured":"Fishburn, P., Hwang, F.K., Du, D.Z., & Gao, B. (1997). On 1-rate wide-sense nonblocking for 3-stage Clos networks. Discrete Applied Mathematics, 78, 75\u201387.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR8_21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0304-3975(96)00151-X","volume":"182","author":"B. Gao","year":"1997","unstructured":"Gao, B. & Hwang, F.K. (1997). Wide-sense nonblocking for multirate 3-stage Clos networks. Theoretical computer Science, 182, 171\u2013182.","journal-title":"Theoretical computer Science"},{"key":"21_CR9_21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1137\/0218021","volume":"18","author":"R. Melen","year":"1989","unstructured":"Melen, R. & Turner, J.S. (1989). Nonblocking multirate networks. SIAM Journal on Computing, 18, 301\u2013313.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR10_21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(00)00147-X","volume":"261","author":"K.-H. Tsai","year":"2001","unstructured":"Tsai, K.-H., Wang, D.-W., & Hwang, F.K. (2001). Lower bounds for wide-sense nonblocking clos network. Theoret. Comput. Sci. 261, 323\u2013328.","journal-title":"Theoret. Comput. Sci"}],"container-title":["Studies in Choice and Welfare","The Mathematics of Preference, Choice and Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79128-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:30Z","timestamp":1619521890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79128-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791270","9783540791287"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79128-7_21","relation":{},"ISSN":["1614-0311"],"issn-type":[{"type":"print","value":"1614-0311"}],"subject":[]}}