{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T20:03:17Z","timestamp":1750363397954},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11432-011-4435-0","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T06:17:05Z","timestamp":1330064225000},"page":"689-700","source":"Crossref","is-referenced-by-count":1,"title":["Achieving fair service with a hybrid scheduling scheme for CICQ switches"],"prefix":"10.1007","volume":"55","author":[{"given":"HongChao","family":"Hu","sequence":"first","affiliation":[]},{"given":"YunFei","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Yi","sequence":"additional","affiliation":[]},{"given":"JuLong","family":"Lan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"4435_CR1","first-page":"737","volume":"E83-B","author":"M. Nabeshima","year":"2000","unstructured":"Nabeshima M. Performance evaluation of a combined input- and crosspoint-queued switch. IEICE Trans Commun, 2000, E83-B: 737\u2013741","journal-title":"IEICE Trans Commun"},{"key":"4435_CR2","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TCOMM.2005.858667","volume":"53","author":"R. Rojas-Cessa","year":"2005","unstructured":"Rojas-Cessa R, Oki E, Jing Z, et al. On the combined input-crosspoint buffered switch with round-robin arbitration. IEEE Trans Commun, 2005, 53: 1945\u20131951","journal-title":"IEEE Trans Commun"},{"key":"4435_CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/LCOMM.2003.815665","volume":"7","author":"L. Mhamdi","year":"2003","unstructured":"Mhamdi L, Hamdi M. MCBF: A high-performance scheduling algorithm for buffered crossbar switches. IEEE Commun Lett, 2003, 7: 451\u2013453","journal-title":"IEEE Commun Lett"},{"key":"4435_CR4","first-page":"1168","volume-title":"Proc. of the IEEE Globecom","author":"X. Zhang","year":"2004","unstructured":"Zhang X, Bhuyan L. An efficient scheduling algorithm for combined input-crosspoint-queued (CICQ) switches. In: Proc. of the IEEE Globecom. New York: IEEE Communications Society, 2004. 1168\u20131173"},{"key":"4435_CR5","first-page":"1586","volume-title":"Proceedings of the IEEE Int\u2019l Conf. on Communications (ICC)","author":"T. Javidi","year":"2001","unstructured":"Javidi T, Magill R, Hrabik T. A high-throughput scheduling algorithm for a buffered crossbar switch fabric. In: Proceedings of the IEEE Int\u2019l Conf. on Communications (ICC). New York: IEEE Communications Society, 2001. 1586\u20131591"},{"key":"4435_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.2008.140","volume":"58","author":"D. Pan","year":"2009","unstructured":"Pan D, Yang Y. Localized independent packet scheduling for buffered crossbar switches. IEEE Trans Comput, 2009, 58: 260\u2013274","journal-title":"IEEE Trans Comput"},{"key":"4435_CR7","first-page":"738","volume-title":"Proceedings of IEEE INFOCOM","author":"C. Chang","year":"2009","unstructured":"Chang C, Hsu Y, Cheng J, et al. A dynamic frame sizing algorithm for CICQ switches with 100% throughput. In: Proceedings of IEEE INFOCOM. New York: IEEE Communications Society, 2009. 738\u2013746"},{"key":"4435_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSAC.2003.810532","volume":"21","author":"B. Magill","year":"2003","unstructured":"Magill B, Rohrs C, Stevenson R. Output-queued switch emulation by fabrics with limited memory. IEEE J Select Areas Commun, 2003, 21: 606\u2013615","journal-title":"IEEE J Select Areas Commun"},{"key":"4435_CR9","first-page":"981","volume-title":"Proceedings of IEEE INFOCOM","author":"S. T. Chuang","year":"2005","unstructured":"Chuang S T, Iyer S, McKeown N. Practical algorithms for performance guarantees in buffered crossbars. In: Proceedings of IEEE INFOCOM. New York: IEEE Communications Society, 2005. 981\u2013991"},{"key":"4435_CR10","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1109\/TNET.2008.2006221","volume":"17","author":"J. Turner","year":"2009","unstructured":"Turner J. Strong performance guarantees for asynchronous crossbar schedulers. IEEE\/ACM Trans Netw, 2009, 17: 1017\u20131028","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4435_CR11","first-page":"454","volume-title":"Proceedings of IEEE INFOCOM","author":"X. Zhang","year":"2007","unstructured":"Zhang X, Mohanty S, Bhuyan L. Adaptive max-min fair scheduling in buffered crossbar switches without speedup. In: Proceedings of IEEE INFOCOM. New York: IEEE Communications Society, 2007. 454\u2013462"},{"key":"4435_CR12","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TNET.2007.900402","volume":"16","author":"S. He","year":"2008","unstructured":"He S, Sun S, Guan H, et al. On guaranteed smooth switching for buffered crossbar switches. IEEE\/ACM Trans Netw, 2008, 16: 718\u2013731","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4435_CR13","first-page":"297","volume-title":"Proc ICST QShine","author":"D. Pan","year":"2009","unstructured":"Pan D, Yang Z, Makki K, et al. Providing performance guarantees for buffered crossbar switches without speedup. In: Proc ICST QShine. Berlin: Springer, 2009. 297\u2013314"},{"key":"4435_CR14","first-page":"1","volume-title":"ACM SIGCOMM\u201989","author":"A. Demers","year":"1999","unstructured":"Demers A, Keshav S, Shenker S. Analysis and simulation of a fair queuing algorithm. In: ACM SIGCOMM\u201989. New York: ACM Press, 1999. 1\u201312"},{"key":"4435_CR15","first-page":"120","volume-title":"IEEE INFOCOM\u201999","author":"J. C. R. Bennett","year":"1996","unstructured":"Bennett J C R, Zhang H. WF2Q: Worst-case fair weighted fair queuing. In: IEEE INFOCOM\u201999. New York: IEEE Communications Society, 1996. 120\u2013128"},{"key":"4435_CR16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A. Parekh","year":"1993","unstructured":"Parekh A, Gallager R. A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE\/ACM Trans Netw, 1993, 1: 344\u2013357","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4435_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TC.2008.176","volume":"58","author":"X. Yuan","year":"2009","unstructured":"Yuan X, Duan Z. FRR: a proportional and worst-case fair round robin scheduler. IEEE Trans Comput, 2009, 58: 365\u2013379","journal-title":"IEEE Trans Comput"},{"key":"4435_CR18","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/90.502236","volume":"4","author":"M. Shreedhar","year":"1996","unstructured":"Shreedhar M, Varghese G. Efficient fair queuing using deficit round robin. IEEE\/ACM Trans Netw, 1996, 4: 375\u2013385","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4435_CR19","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/90.649568","volume":"5","author":"J. C. R. Bennett","year":"1997","unstructured":"Bennett J C R, Zhang H. Hierarchical packet fair queueing algorithms. IEEE\/ACM Trans Netw, 1997, 5: 675\u2013689","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4435_CR20","volume-title":"Proceedings of IEEE INFOCOM","author":"S. Golestani","year":"1994","unstructured":"Golestani S. A self-clocked fair queuing scheme for broadband applications. In: Proceedings of IEEE INFOCOM, New York: IEEE Communications Society, 1994"},{"key":"4435_CR21","unstructured":"Hu H C, Guo Y F, Yi P. Design and implementation of fair scheduling algorithms in combined input and crosspoint queued switches, Technical Report, National Digital Switching System Engineering & Technological R&D Center, Zhengzhou, 2010"},{"key":"4435_CR22","first-page":"1036","volume":"19","author":"H. C. Hu","year":"2008","unstructured":"Hu H C, Yi P, Guo Y F. Design and implementation of high performance simulation platform for switching and scheduling. J Software, 2008, 19: 1036\u20131050","journal-title":"J Software"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4435-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4435-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4435-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:42Z","timestamp":1559403462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4435-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["4435"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4435-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,25]]}}}