{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:37:54Z","timestamp":1736573874776,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540459071"},{"type":"electronic","value":"9783540459095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881223_52","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T15:45:14Z","timestamp":1158939914000},"page":"428-437","source":"Crossref","is-referenced-by-count":2,"title":["Probability Based Weighted Fair Queueing Algorithm with Adaptive Buffer Management for High-Speed Network"],"prefix":"10.1007","author":[{"given":"De-Bin","family":"Yin","sequence":"first","affiliation":[]},{"given":"Jian-Ying","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"52_CR1","first-page":"3","volume":"1","author":"A. Demers","year":"1990","unstructured":"Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. Internetworking: Research and Experience\u00a01(1), 3\u201326 (1990)","journal-title":"Internetworking: Research and Experience"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1109\/49.105173","volume":"9","author":"M. Katevenis","year":"1991","unstructured":"Katevenis, M., Sidiropoulos, S., Courcoubetis, C.: Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Select. Areas Commun.\u00a09, 1265\u20131279 (1991)","journal-title":"IEEE J. Select. Areas Commun."},{"doi-asserted-by":"crossref","unstructured":"Parekb, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE\/ ACM Trans. on Networking, 344\u2013357 (June 1993)","key":"52_CR3","DOI":"10.1109\/90.234856"},{"doi-asserted-by":"crossref","unstructured":"Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: Proc. IEEE INFOCOM 1994, Toronto, Ont., Canada, pp. 636\u2013646 (April 1994)","key":"52_CR4","DOI":"10.1109\/INFCOM.1994.337677"},{"doi-asserted-by":"crossref","unstructured":"Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. In: Proc. ACM SIGCOMM 1995, Cambridge, MA, September 1995, pp. 231\u2013242 (1995)","key":"52_CR5","DOI":"10.1145\/217382.217453"},{"doi-asserted-by":"crossref","unstructured":"Bennett, R., Zhang, H.: WF2Q: Worst-case fair weighted fair Queueing. In: IEEE INFOCOM 1996, March 1996, pp. 120\u2013128 (1996)","key":"52_CR6","DOI":"10.1109\/INFCOM.1996.497885"},{"doi-asserted-by":"crossref","unstructured":"Goyal, P., Vin, H.M., Chen, H.: Start-time fair queueing: A scheduling algorithm for integrated services. In: Proc. ACM-IGCOMM 1996, Palo Alto, CA, pp. 157\u2013168 (1996)","key":"52_CR7","DOI":"10.1145\/248157.248171"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/90.649568","volume":"5","author":"J..C.R. Bennett","year":"1997","unstructured":"Bennett, J.C.R., Zhang, H.: Hierarchical packet fair Queueing algorithms. IEEE\/ ACM Trans. on Networking\u00a05, 675\u2013689 (1997)","journal-title":"IEEE\/ ACM Trans. on Networking"},{"doi-asserted-by":"crossref","unstructured":"Altintas, O., et al.: Urgency-based round robin: A new scheduling discipline for packet switching networks. In: IEEE INFOCOMM 1998, pp. 1183\u20131197 (1998)","key":"52_CR9","DOI":"10.1109\/ICC.1998.685195"},{"issue":"6","key":"52_CR10","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/49.772449","volume":"17","author":"D.C. Stephens","year":"1999","unstructured":"Stephens, D.C., Bennett, J.C.R., Zhang, H.: Implementing scheduling algorithms in high-speed networks. IEEE Journal on Selected Areas in Communications\u00a017(6), 1145\u20131158 (1999)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"unstructured":"Jiang, Y., Tham, C.K., Ko, C.C.: A probabilistic priority scheduling discipline for multi-service networks. In: IEEE ISCC 2001 (July 2001)","key":"52_CR11"},{"issue":"1","key":"52_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TNET.2002.808414","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Shenker, S., Zhang, H.: Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks. IEEE\/ACM Transactions on Networking\u00a011(1), 33\u201346 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"unstructured":"Network Simulator - ns-2 (2.28), http:\/\/www.isi.edu\/nsnam\/ns\/","key":"52_CR13"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881223_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T23:40:14Z","timestamp":1736552414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881223_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459071","9783540459095"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11881223_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}