{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:10:03Z","timestamp":1737335403274,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442561"},{"type":"electronic","value":"9783540458036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45803-4_21","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T05:37:11Z","timestamp":1185860231000},"page":"226-236","source":"Crossref","is-referenced-by-count":0,"title":["Shortest and Oldest First Non-interleaving Packet Switching Scheduling Algorithm"],"prefix":"10.1007","author":[{"given":"Young-Ki","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungchang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeong-Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"issue":"12","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1109\/26.809713","volume":"47","author":"M.A. Marsan","year":"1999","unstructured":"M. A. Marsan, A. Bianco, E. Leonardi, and L. Mila, \u201cRPA: A flexible scheduling algorithm for input buffered switches,\u201d IEEE Trans. On Communications, vol. 47, no. 12, Dec. 1999, pp. 1921\u20131933.","journal-title":"IEEE Trans. On Communications"},{"key":"21_CR2","unstructured":"A. Mekkittikul, and N. McKeown \u201cA starvation free algorithm for achieving 100% throughput in an input queued switch,\u201d in Proc. ICCCN\u201996, Rockville, MA, Oct. 1996, pp. 226\u2013229"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"N. McKeown, V. Anantharam, and J. Walrand, \u201cAchieving 100% throughput in an input-queued switch,\u201d in Proc. IEEE INFOCOM\u2019 96, San Francisco, CA. pp. 296\u2013302.","DOI":"10.1109\/INFCOM.1996.497906"},{"issue":"7","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/49.103551","volume":"9","author":"M. J. Karol","year":"1991","unstructured":"M. J. Karol, M. G. Hluchyj and S. P. Morgan, \u201cInput versus output queueing switch,\u201d IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, Sep. 1991, pp. 1347\u20131355.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"21_CR5","unstructured":"M. Hluchyj, and M. Karol, \u201cQueueing in High Performance Packet Switching,\u201d IEEE SAC-6.9, pp. 1587\u20131597, Dec. 1988."},{"key":"21_CR6","unstructured":"R. Schoen, G. Post, and G. Sander, \u201cWeighted arbitration algorithms with priorities for input-queued switches with 100% throughput,\u201d in Proceedings of IEEE Broadband Switching Systems, 1999."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"T. Anderson, S. Owicki, J. Saxe, and C. Thacker, \u201cHigh speed switch scheduling for local area networks,\u201d ACM Trans. On Computer Systems, Nov. 1993.","DOI":"10.1145\/161541.161736"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"R. LaMaire and D. Serpanos, \u201cTwo dimensional round-robin schedulers for packet switches with multiple input queues,\u201d IEEE\/ACM Trans. Networking, vol. 2, pp. 471\u2013482, Oct. 1994.","DOI":"10.1109\/90.336324"},{"key":"21_CR9","unstructured":"N. McKeown, \u201cScheduling algorithms for input-queued cell switches,\u201d Ph.D. Thesis, University of California at Berkeley, 1995."},{"issue":"25","key":"21_CR10","doi-asserted-by":"publisher","first-page":"2174","DOI":"10.1049\/el:19931459","volume":"29","author":"N. Mckeown","year":"1993","unstructured":"N. Mckeown, P. Varaiya, and J. Walrand, \u201cScheduling cells in an input-queued switch,\u201d Electron. Lett.., vol. 29, no. 25, pp. 2174\u20132175, Dec. 1993.","journal-title":"Electron. Lett.."},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/90.769767","volume":"7","author":"N. McKeown","year":"1999","unstructured":"N. McKeown, \u201cThe iSLIP Scheduling Algorithm for Input-Queued Switches,\u201d IEEE\/ACM Trans. Networking, vol. 7, no. 2, pp. 188\u2013201, April 1999.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"D.N. Serpanos and P.I. Antoniadis \u201cFIRM: A Class of Distributed Scheduling Algorithms for high-speed ATM switches with Multiple input queues,\u201d IEEE INFOCOM 2000, pages 548\u2013555, 2000","DOI":"10.1109\/INFCOM.2000.832228"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/71.205650","volume":"4","author":"Y. Tamir","year":"1993","unstructured":"Y. Tamir, H.-C. Chi, \u201cSymmetric Cross Bar Arbiters for VLSI Communication Switches,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, Jan. 1993, pp. 13\u201327.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"21_CR14","first-page":"792","volume":"2","author":"A. Mekkittikul","year":"1998","unstructured":"A. Mekkittikul, N. McKeown, \u201cA practical scheduling algorithm to achieve 100% throughput in input-queued switches\u201d, IEEE INFOCOM\u201998, vol. 2, 1998, pp. 792\u2013799","journal-title":"IEEE INFOCOM\u201998"},{"key":"21_CR15","unstructured":"A. Mekkittikul, \u201cScheduling Non-uniform Traffic in High Speed Packet Switches and Routers,\u201d Ph.D. Thesis, Stanford University, Nov.1998"},{"key":"21_CR16","unstructured":"V. Paxson, \u201cFast approximation of self-similar network traffic,\u201d Tech. Rep. LBL-36750\/UC-405, April 1995"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Yijun Xiong, Marc Vandenhoute, and Hakki C. Cankaya, \u201cControl Architecture in Optical Burst-Switched WDM Networks,\u201d IEEE Journal on Selected Areas in Communications, Vol. 18, No. 10, Oct. 2000.","DOI":"10.1109\/49.887906"},{"key":"21_CR18","unstructured":"K. Claffy, G. Miller, and K. Thompson, The nature of the beast: Recent Traffic measurements from an Internet backbone.[Online]. Available: http:\/\/www.caida.org\/outreach\/papers\/1998\/Inet98\/ )"}],"container-title":["Lecture Notes in Computer Science","Information Networking: Wired Communications and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45803-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:57:11Z","timestamp":1737334631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45803-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442561","9783540458036"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45803-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}