{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:53Z","timestamp":1740548093915,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280637"},{"type":"electronic","value":"9783540316749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533962_10","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T18:02:10Z","timestamp":1285524130000},"page":"98-117","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Framework of RR Scheduler to Ensure Priority, Low Complexity and Delay with Relative Fairness"],"prefix":"10.1007","author":[{"given":"John","family":"Tsiligaridis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ferrari, D.: Client requirements for real time communication services. IEEE Communication Magazine\u00a028(11) (1990)","DOI":"10.1109\/35.60379"},{"key":"10_CR2","unstructured":"Cheung, S., Pencea, C.: BSFQ: Bin Sort Fair Queuing. In: Infocom 2002, NY (June 2002)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, J., Zhang, H.: WF2Q: Worst-case Fair Weighted Fair Queueing. In: Proc. IEEE Infocom 1996, pp. 120\u2013128 (March 1996)","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"10_CR4","unstructured":"Zhang, L.: A new Architecture for Packet Switched Network Protocols, PhD Dissertation, MIT (July 1989)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: IEEE Infocom 1994, Toronto, CA, pp. 636\u2013646 (June 1994)","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Suri, S., Vargese, G., Chandranmenon, G.: Leap Forward Virtual Clock: A new fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. In: IEEE Infocom 1997, pp. 557\u2013565 (1997)","DOI":"10.1145\/259380.259482"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/90.649514","volume":"5","author":"P. Goyal","year":"1997","unstructured":"Goyal, P., Vin, H.: Start time Fair Queueing: A scheduling Algorithm for Integrated Services Packet Switching Networks. IEEE\/ACM Trans. On Networking\u00a05(4), 561\u2013571 (1997)","journal-title":"IEEE\/ACM Trans. On Networking"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/90.502236","volume":"4","author":"M. Shreedhar","year":"1996","unstructured":"Shreedhar, M., Vargese, G.: Efficient Fair Queuing using deficit Round Robin. ACM\/IEEE Trans. on Networking\u00a04(3), 375\u2013385 (1996)","journal-title":"ACM\/IEEE Trans. on Networking"},{"key":"10_CR9","unstructured":"Eug, T.: Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors. In: IEEE Infocom 1998, pp. 1103\u20131111 (March 1998)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Bennett, J., Stephens, D., Zhang, H.: High Speed, Scalable, and Accurate Implementation of Packet Fair Queuing Algorithms in ATM Networks. In: ICNP 1997, Atlanta,GA, pp. 7\u201314 (October 1997)","DOI":"10.1109\/ICNP.1997.643677"},{"issue":"10","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1145\/63039.63045","volume":"31","author":"R. Brown","year":"1988","unstructured":"Brown, R.: Calendar Queues: A Fast Priority Queue Implementation for the Simulation Event Set Problem. Comm. of the ACM\u00a031 (10), 1220\u20131227 (1988)","journal-title":"Comm. of the ACM"},{"key":"10_CR12","unstructured":"Wrikson, K., Ladner, R., LaMarca, A.: Optimizing Static Calendar Queues. In: Proceedings of IEEE Symp. on Foundation of Computer Science, November 20-22 (1994)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Rexford, J., Greengerg, A., Bonomi, F.: Hardware-Efficient Fair Queueing Architectures for High-Speed Networks. In: IEEE Infocom 1996, pp. 638\u2013646 (1996)","DOI":"10.1109\/INFCOM.1996.493359"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/71.993210","volume":"13","author":"S. Kanhere","year":"2000","unstructured":"Kanhere, S., Setha, H., Parekh, A.: Fair and Efficient Packet Scheduling using Elastic Round Robin. IEEE Trans. On Parallel and Distributed Systems\u00a013(3), 324\u2013336 (2000)","journal-title":"IEEE Trans. On Parallel and Distributed Systems"},{"key":"10_CR15","volume-title":"Computer Networks","author":"A. Tanenbaum","year":"1996","unstructured":"Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Stiliadis, D., Varma, A.: Latency-Rate Servers: A general Model for Analysis of Traffic Scheduling Algorithms. IEEE\/ACM Trans. on Networking\u00a06 (5) (1998)","DOI":"10.1109\/90.731196"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Ramabhadram, S., Pasquale, J.: Stratified Round Robin: A low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay. In: Sigcomm 2003, Germany (August 2003)","DOI":"10.1145\/863955.863983"},{"key":"10_CR18","unstructured":"Carpita, B., Chan, W., Nieh, J.: Group Round Robin: Improving the Fairness and complexity of Packet Scheduling. Dept of Computer Science, Columbia Univesrity, Technical Report CUCS-018-03 (June 2003)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Chuanxiong, G.: SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks. In: Sigcomm 2001, San Diego, USA ( August 2001)","DOI":"10.1145\/383059.383076"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TNET.2004.833131","volume":"12","author":"L. Lenzini","year":"2004","unstructured":"Lenzini, L., Mingozzi, E., Stea, G.: Tradeoffs Between Low Complexity, Low Latency, and Fairness with Deficit Round-Robin Schedulers. IEEE\/ACM Transactions on Networking\u00a012(4), 681\u2013693 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Advanced Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533962_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T02:23:50Z","timestamp":1740536630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533962_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280637","9783540316749"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11533962_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}