{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:07:45Z","timestamp":1748318865096,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimedia Tools and Applications"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1015817800471","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T01:08:46Z","timestamp":1041124126000},"page":"55-83","source":"Crossref","is-referenced-by-count":0,"title":["QoS-Aware Fair Queuing: A Low Overhead Packet Scheduling Discipline for Networked Multimedia Environments"],"prefix":"10.1007","volume":"18","author":[{"given":"Michael S.","family":"Boykin","sequence":"first","affiliation":[]},{"given":"Taieb F.","family":"Znati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5088563_CR1","unstructured":"J. Bennett and H. Zhang, \u201cWF2Q:Worst-case fair weighted fair queuing, \u201d in Proceedings of INFOCOM '96, 1996."},{"key":"5088563_CR2","unstructured":"J. Bennett and H. Zhang, \u201cWhy WFQ is not good enough for integrated services networks?\u201d in Proceedings of NOSSDAV '96, 1996."},{"key":"5088563_CR3","unstructured":"M. Boykin, \u201cA network framework for QoS-aware traffic scheduling and management in integrated services networks, \u201d Ph.D. Thesis, Department of Computer Science, University of Pittsburgh, 1999, http:\/\/www.cs.pitt.edu\/boykin1."},{"key":"5088563_CR4","doi-asserted-by":"crossref","unstructured":"D.C. Clark, S. Shenker, and L. Zhang, \u201cSupporting real-time applications in an integrated services packet network: Architecture and mechanism, \u201d in SIGCOMM '92, 1992, pp. 14-26.","DOI":"10.1145\/144179.144199"},{"key":"5088563_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/JHS-1992-1201","volume":"2","author":"R.L. Cruz","year":"1992","unstructured":"R.L. Cruz, \u201cService burstiness and dynamic burstiness measures: A framework, \u201d Journal of High Speed Networks, Vol. 2, pp. 105-127, 1992.","journal-title":"Journal of High Speed Networks"},{"key":"5088563_CR6","unstructured":"N. Duffield, T. Lakshman, and D. Stiliadis, \u201cOn adaptive bandwidth sharing with rate guarantees, \u201d in Proceedings of Infocom, 1998."},{"key":"5088563_CR7","doi-asserted-by":"crossref","unstructured":"S.J. Golestani, \u201cA self-clocked fair queueing scheme for broadband applications, \u201d in Proc. IEEE INFOCOM, 1994, pp. 636-646.","DOI":"10.1109\/INFCOM.1994.337677"},{"issue":"4","key":"5088563_CR8","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/90.649514","volume":"5","author":"P. Goyal","year":"1997","unstructured":"P. Goyal and H. Vin, \u201cGeneralized guaranteed rate scheduling algorithms: A framework, \u201d IEEE\/ACM Transactions on Networking, Vol. 5, No. 4, pp. 561-571, 1997.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5088563_CR9","unstructured":"P. Goyal and H.M. Vin, \u201cFair airport scheduling algorithms, \u201d in Proceedings of NOSSDAV '97, St. Louis, Missouri, 1997."},{"key":"5088563_CR10","unstructured":"W.I. Grosky, R. Jain, and R.M. (Eds.), The Handbook of Multimedia Information Management, Prentice-Hall, 1997."},{"key":"5088563_CR11","doi-asserted-by":"crossref","unstructured":"S. Lam and G. Xie, \u201cBurst scheduling networks: Flow specification and performance guarantees, \u201d in Proceedings of NOSSDAV '95, Durham, New Hampshire, 1995.","DOI":"10.1007\/BFb0019280"},{"key":"5088563_CR12","doi-asserted-by":"crossref","unstructured":"C. McCann, R.Vaswani, and J. Zahorjan, \u201cAdynamic processor allocation policy for multiprogrammed shared memory multiprocessors, \u201d ACM Transactions on Computer Systems, pp. 146-178, 1993.","DOI":"10.1145\/151244.151246"},{"issue":"3","key":"5088563_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/49.53015","volume":"8","author":"C. Nicolaou","year":"1990","unstructured":"C. Nicolaou, \u201cAn architecture for real-time multimedia communication systems, \u201d IEEE Journal on Selected Areas in Communications, Vol. 8, No. 3, pp. 391-400, 1990.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"5088563_CR14","doi-asserted-by":"crossref","unstructured":"A. Parekh, \u201cA generalized processor sharing approach to flow control in integrated services networks, \u201d Ph.D. Thesis, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1992.","DOI":"10.1109\/INFCOM.1992.263509"},{"issue":"3","key":"5088563_CR15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A.K. Parekh","year":"1993","unstructured":"A.K. Parekh and R.G. Gallager, \u201cA generalized processor sharing approach to flow control in integrated services networks: The single node case, \u201d IEEE\/ACM Trans. on Networking, Vol. 1, No. 3, pp. 344-357, 1993.","journal-title":"IEEE\/ACM Trans. on Networking"},{"issue":"2","key":"5088563_CR16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/90.298432","volume":"2","author":"A.K. Parekh","year":"1994","unstructured":"A.K. Parekh and R.G. Gallager, \u201cA generalized processor sharing approach to flow control in integrated services networks: The multiple node case, \u201d IEEE\/ACM Trans. on Networking, Vol. 2, No. 2, pp. 137-150, 1994.","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"5088563_CR17","doi-asserted-by":"crossref","unstructured":"H. Sariowan, R. Cruz, and G. Polyzos, \u201cSCED: A generalized scheduling policy for guaranteeing quality-ofservice, \u201d IEEE\/ACM Transactions on Networking, Vol. 7, No. 5, 1999.","DOI":"10.1109\/90.803382"},{"key":"5088563_CR18","volume-title":"Local and Metropolitan Area Networks","author":"W. Stallings","year":"1993","unstructured":"W. Stallings, Local and Metropolitan Area Networks, 4th edn., Macmillan: New York, 1993.","edition":"4th edn."},{"key":"5088563_CR19","volume-title":"Mulitmedia: Computing, Communication and Applications","author":"R. Steinmetz","year":"1995","unstructured":"R. Steinmetz and K. Nahrstedt, Mulitmedia: Computing, Communication and Applications, Prentice Hall: Upper Saddle River, NJ, 1995."},{"key":"5088563_CR20","doi-asserted-by":"crossref","unstructured":"S. Suri, G. Varghese, and G. Chandranmenon, \u201cLeap forward virtual clock: A new fair queueing scheme with guaranteed delays and throughput fairness, \u201d Technical Report WUCS-96-10, Washington University in St. Louis, 1996.","DOI":"10.1145\/259380.259482"},{"key":"5088563_CR21","doi-asserted-by":"crossref","unstructured":"A. Varma and D. Stiliadis, \u201cDesign and analysis of frame-based fair queueing: A new traffic scheduling algorithm for packet switched networks, \u201d in Proc. ACM SIGMETRICS, 1996.","DOI":"10.1145\/233008.233030"},{"key":"5088563_CR22","unstructured":"G.G. Xie and S.S. Lam, \u201cAn efficient adaptive search algorithm for scheduling real-time traffic, \u201d in Proceeding of ICNP '96, Columbus, Ohio, 1996."},{"key":"5088563_CR23","doi-asserted-by":"crossref","unstructured":"D.Yates, J.Kurose, D. Towsley, and M.G. Hluchyj, \u201cOn per-session end-to-end delay distributions and the call admission problem for real-time applications with QoS requirements, \u201d in Proceedings of ACM SIGCOMM, 1993, pp. 2-12.","DOI":"10.1145\/166237.166238"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015817800471.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015817800471\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015817800471.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T06:32:55Z","timestamp":1748241175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015817800471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5088563"],"URL":"https:\/\/doi.org\/10.1023\/a:1015817800471","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}