{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:08:50Z","timestamp":1767773330044,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1109\/tc.2014.2329695","type":"journal-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T14:41:20Z","timestamp":1405089680000},"page":"1-1","source":"Crossref","is-referenced-by-count":8,"title":["A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9140-6898","authenticated-orcid":false,"given":"Baoxian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xili","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luo","family":"Junzhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020831"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920344"},{"key":"ref12","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","author":"birkhoff","year":"1946","journal-title":"Univ Nac Tucuman Rev Ser A"},{"key":"ref13","first-page":"5","article-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem","author":"von neumann","year":"1953","journal-title":"Contributions to the Theory of Games"},{"key":"ref14","first-page":"1614","article-title":"Birkhoff-von Neumann input buffered crossbar switches","author":"chang","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/90.958324"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"article-title":"SS\/TDMA scheduling of real-time periodic messages, in Proc. Intl. Conf. on Telecomm. Systems , Mar. 1996, pp. 244–251.","year":"0","author":"philp","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/90.958329"},{"key":"ref19","first-page":"691","article-title":"Scheduling multirate periodic traffic in a packet switch","author":"giles","year":"0","journal-title":"Proc Johns Hopkins Conf Inform Sci Syst"},{"key":"ref4","first-page":"331","article-title":"ATM input-buffered switches with guaranteed rate property","author":"hung","year":"0","journal-title":"Proc IEEE 3rd Symp Comput Comput Commun"},{"key":"ref3","first-page":"792","article-title":"A practical scheduling algorithm to achieve 100% throughput in input-queued switches","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.222"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1995.515971"},{"key":"ref5","first-page":"1147","article-title":"A framework for differential frame-based matching algorithms in input-queued switches","author":"bianco","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890097"},{"key":"ref7","first-page":"235","article-title":"Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup","author":"charny","year":"0","journal-title":"Proc Int Workshop Quality of Service"},{"key":"ref2","first-page":"296","article-title":"Achieving 100% throughput in an input-queued switch","author":"mckeown","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.013"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/161541.161736"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094297"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/49.898750"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/26.87220"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref24"},{"journal-title":"Graph Algorithms","year":"1979","author":"even","key":"ref23"},{"key":"ref26","first-page":"1","article-title":"An optimal algorithm for time-slot assignment in ss\/tdma satellite systems","author":"wan","year":"0","journal-title":"Proc"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7104223\/06853339.pdf?arnumber=6853339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:57Z","timestamp":1641987717000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6853339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2329695","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2014]]}}}