{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:13:32Z","timestamp":1742400812684,"version":"3.38.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":[[2002,9]]},"DOI":"10.1109\/tc.2002.1032622","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"1011-1025","source":"Crossref","is-referenced-by-count":5,"title":["A unifying service discipline for providing rate-based guaranteed and fair queuing services based on the Timed Token protocol"],"prefix":"10.1109","volume":"37","author":[{"given":"L.","family":"Lenzini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mingozzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Stea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"ANSI Standard X3.139","article-title":"FDDI Token Ring Media Access Control","year":"1987","key":"ref1"},{"article-title":"A Timed Token Protocol for Local Area Networks","volume-title":"Proc. Electro \u201982, Token Access Protocols","author":"Grow","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233169"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(96)90037-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/32.57628"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.272433"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1992.242663"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.392393"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/icccn.1997.623355"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/lcn.1999.802016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.926157"},{"key":"ref12","article-title":"Progettazione e Valutazione delle Prestazioni di un Algoritmo di Allocazione delle Risorse per una Rete di Calcolatori","volume-title":"Laurea thesis (in Italian), Univ. of Pisa","author":"Stea","year":"1999"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02341920"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/217391.217433"},{"key":"ref17","first-page":"120","article-title":"$\\big. {\\rm WF^2Q}\\bigr.$: Worst-Case Fair Weighted Fair Queueing","volume-title":"Proc. IEEE Infocom \u201996","author":"Bennet"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.659665"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347400"},{"journal-title":"Traffic Management Specification, Version 4.1","year":"1999","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1117\/12.264293"},{"article-title":"Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation","year":"1995","author":"Stoica","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/5.469298"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1633"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2475"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2598"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2597"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/90.649568"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00312-7"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/22177\/01032622.pdf?arnumber=1032622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:37:19Z","timestamp":1742017039000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1032622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,9]]}},"URL":"https:\/\/doi.org\/10.1109\/tc.2002.1032622","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}