{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:01:44Z","timestamp":1725465704893},"publisher-location":"Boston","reference-count":11,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"0387308156"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-31170-x_3","type":"book-chapter","created":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T20:43:22Z","timestamp":1149626602000},"page":"31-41","source":"Crossref","is-referenced-by-count":0,"title":["Tunable Least Served First"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Serrano","sequence":"first","affiliation":[]},{"given":"David","family":"Larrabeiti","sequence":"additional","affiliation":[]},{"given":"\u00c1ngel","family":"Le\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bennett, J. C. R. and Zhang, H. (1996). Wf2q: Worst-case fair weighted fair queueing. In In Proc. IEEE INFOCOM 96, San Francisco, CA, Man 1996."},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/90.958328","volume":"9","author":"B. Bensaou","year":"2001","unstructured":"Bensaou, B., Tsang, D.H.K., and Chan, King Tung (2001). Credit-based fair queueing (cbfq): a simple service-scheduling algorithm for packet-switched networks. In IEEE\/ACM Trans. Netw., Volume: 9, Issue: 5, Oct. 2001 Pages:591\u2013604.","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TNET.2003.815290","volume":"11","author":"H. M. Chaskar","year":"2003","unstructured":"Chaskar, Hemant M. and Madhow, Upamanyu (2003). Fair scheduling with tunable latency: a round-robin approach. IEEE\/ACM Trans. Netw., 11(4):592\u2013601.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR4","volume-title":"Calculo infinitesimal de una variable","author":"J. Burgos de","year":"1995","unstructured":"de Burgos, Juan (1995). Calculo infinitesimal de una variable. McGraw-Hill, Madrid."},{"key":"3_CR5","unstructured":"Demers, A., Keshav, S., and Shenker, S. (1990). Analysis and simulation of a fair queueing algorithm. In Journal of Internetworking Research and Experience, pages 3\u201326, October 1990. Also in Proceedings of ACM SIGCOMM89, pp 3\u201312."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Golestani, S. (1994). A self-clocked fair queueing scheme for broadband applications. In Proceedings of IEEE INFOCOM 94, pages 636\u2013646, Toronto, CA, June 1994.","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"3_CR7","unstructured":"Hahne, E. (1986). Round robin scheduling for fair flow control. In Ph.D. thesis, Dept. Elect. Eng. And Comput. Sci., M.I.T., Dec. 1986."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A. K. Parekh","year":"1993","unstructured":"Parekh, Abhay K. and Gallager, Robert G. (1993). A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE\/ACM Trans. Netw., 1(3):344\u2013357.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Shreedhar, M. and Varghese, George (1995). Efficient fair queueing using deficit round robin. In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pages 231\u2013242. ACM Press.","DOI":"10.1145\/217382.217453"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, L. (1990). Virtual clock: a new traffic control algorithm for packet switching networks. In Proceedings of the ACM symposium on Communications architectures & protocols, pages 19\u201329. ACM Press.","DOI":"10.1145\/99508.99525"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/4234.975493","volume":"6","author":"Y. Zhou","year":"2002","unstructured":"Zhou, Y. and Sethu, H. (2002). On the relationship between absolute and relative fairness bounds. In IEEE Comm. Letters, vol. 6, no. 1, pp. 37\u201339, Jan. 2002.","journal-title":"IEEE Comm. Letters"}],"container-title":["IFIP International Federation for Information Processing","EUNICE 2005: Networks and Applications Towards a Ubiquitously Connected World"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-31170-X_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T01:08:59Z","timestamp":1619485739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-31170-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387308156"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/0-387-31170-x_3","relation":{},"subject":[]}}