{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:08:45Z","timestamp":1742634525425},"reference-count":22,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3483,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1999,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>On the Behavior of Input Queuing Switch Architectures<\/jats:p><jats:p>Many proposals of input queuing cell switch architectures have recently appeared in the literature. Some have found application in commercial very high speed IP routers. In this paper we discuss the pros and cons of input and output queuing switch architectures, we provide a taxonomy of scheduling algorithms for input queuing switches, and we present comparative performance results for some of the recent proposals of input queuing cell switches. Performance is measured in terms of cell loss probability, as well as average, standard deviation, and 99\u2010\u2010th quantile of the cell delay with different traffic patterns. The complexity of the algorithms, and the amount of control information to be exchanged inside the switch for their execution, are also discussed.<\/jats:p>","DOI":"10.1002\/ett.4460100203","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T14:39:58Z","timestamp":1221230398000},"page":"111-124","source":"Crossref","is-referenced-by-count":25,"title":["On the Behavior of Input Queuing Switch Architectures"],"prefix":"10.1002","volume":"10","author":[{"given":"Marco Ajmone","family":"Marsan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Bianco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Giaccone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Neri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrica","family":"Filippi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096719"},{"issue":"3","key":"e_1_2_1_3_2","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","article-title":"A generalized processor sharing approach to flow control in integrated services networks","volume":"1","author":"Parekh A. K.","journal-title":"IEEE\/ACM Transactions on Networking."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.469298"},{"key":"e_1_2_1_5_2","unstructured":"McKeownN. MekkittikulA. A pratical scheduling algorithm to achieve 100% throughput in input\u2010queued switches. InIEEE INFOCOM 98 1998."},{"key":"e_1_2_1_6_2","first-page":"27","article-title":"The Tiny Tera: a packet switch core","volume":"17","author":"McKeown N.","year":"1997","journal-title":"IEEE Micro Magazine"},{"key":"e_1_2_1_7_2","unstructured":"McKeownN. Scheduling algorithms for input\u2010queued cell switches Ph.D. Thesis University of California at Berkeley 1995."},{"key":"e_1_2_1_8_2","unstructured":"McKeownN. AndersonT. E. quantitative comparison of scheduling algorithms for input\u2010queued switches.tiny\u2010tera.stanford.edu\/\u223cnickm\/papers.html."},{"key":"e_1_2_1_9_2","unstructured":"McKeownN. MekkittikulA. A starvation free algorithm for achieving 100% throughput in an input queued switch. InICCCN 96 1996."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.336324"},{"key":"e_1_2_1_11_2","unstructured":"ChenH. LambertJ. PitsilledcsA. RC\u2010BB switch A high performance switching network for B\u2010ISDN. InIEEE GLOBECOM 95 1995."},{"key":"e_1_2_1_12_2","unstructured":"DuanH. LockwoodJ. W. KangS. M. WillJ. D. A high performance OC12\/OC48 queue design prototype for input buffered ATM switches. InIEEE INFOCOM 97 1997."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.585804"},{"key":"e_1_2_1_14_2","unstructured":"Ajmone MarsanM. BiancoA. LeonardiE. MiliaL. Quasi optimal algorithms for input buffered ATM switches. In3rdIEEE Symposium on Computers & Communications (IS\u2010CC '98) 1998."},{"key":"e_1_2_1_15_2","unstructured":"GiacconeP. Tecniche di accodamento e trasferimento in architetture di commutazione a larga banda Laurea Thesis Politecnico di Torino May1998 in Italian."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(94)00081-4"},{"key":"e_1_2_1_17_2","unstructured":"D.Stiliadis A.Varma Providing bandwidth guarantees in an input\u2010buffered crossbar switch. InIEEE INFOCOM 95 1995."},{"key":"e_1_2_1_18_2","unstructured":"StephensD. C. ZhangH. Implementing distributed packet fair queueing in a scalable switch architecture. InIEEE INFOCOM 98 1998."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"e_1_2_1_20_2","first-page":"225","article-title":"An n \n                  2.5 algorithm for maximum matching in bipartite graphs. Society for Industrial and Applied Mathematics","volume":"2","author":"Hopcroft J. E.","year":"1973","journal-title":"J. Comput."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/78919.78921"},{"key":"e_1_2_1_22_2","unstructured":"TassiulasL. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. InIEEE INFOCOM 98 1998."},{"key":"e_1_2_1_23_2","unstructured":"StoicaI. ZhangH. Exact emulation of an output queueing switch by a combined input output queueing switch. In 6thInternational Workshop on Quality of Service (IWQoS 98) 1998."}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460100203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460100203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T15:26:33Z","timestamp":1698506793000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460100203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["10.1002\/ett.4460100203"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460100203","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}