{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:47:58Z","timestamp":1740894478977,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230342"},{"type":"electronic","value":"9783540259787"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25978-7_51","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T20:45:17Z","timestamp":1294519517000},"page":"503-513","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Fair Round Robin Scheduling in WDM Packet Switching Networks"],"prefix":"10.1007","author":[{"given":"Deming","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann-Hang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoonmee","family":"Doh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"51_CR1","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1109\/5.469298","volume":"83","author":"H. Zhang","year":"1995","unstructured":"Zhang, H.: Service disciplines for guaranteed performance service in packetswitching networks. Proceeding of the IEEE\u00a083(10), 1374\u20131396 (1995)","journal-title":"Proceeding of the IEEE"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Liu, D., Lee, Y.-H.: An efficient scheduling discipline for packet switching networks using earliest deadline first round robin. In: The 12th International Conference on Computer Communicaitons and Networks (October 2003)","DOI":"10.1109\/ICCCN.2003.1284142"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J., et al.: Parallel switching in connection-oriented networks. In: Proceedings of the 20th IEEE Real-Time Systems Symposium, pp. 200\u2013209 (1999)","DOI":"10.1109\/REAL.1999.818843"},{"issue":"5","key":"51_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MC.2002.999778","volume":"35","author":"L.E. Jackson","year":"2002","unstructured":"Jackson, L.E., Rouskas, G.N.: Deterministic preemptive scheduling of real-time tasks. Computer\u00a035(5), 72\u201379 (2002)","journal-title":"Computer"},{"issue":"6","key":"51_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"S. Baruah","year":"1996","unstructured":"Baruah, S., Cohen, N., Plaxton, C.G., Varvel, D.: Proportionate progress: A notation of fairness in resource allocation. Algorithmica\u00a015(6), 600\u2013625 (1996)","journal-title":"Algorithmica"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Baruah, S., et al.: Fairness in periodic real-time scheduling. In: Proceedings of 16th Annual IEEE Real-Time Systems Symposium, December 1995, pp. 200\u2013209 (1995)","DOI":"10.1109\/REAL.1995.495210"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Baruah, S., Gehrke, J., Plaxton, C.G., Stoica, I.: Fast scheduling of periodic tasks on multiple resources. In: Proceedings of the 9th International Parallel Processing Symposium, April 1996, pp. 280\u2013288 (1996)","DOI":"10.1109\/IPPS.1995.395946"},{"key":"51_CR8","unstructured":"Anderson, J., Srinivasan, A.: A new look at pfair priorities, Technical report, Dept. of Computer Science, Univ. of North Carolina (1999)"},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/18.669170","volume":"44","author":"J.-Y. Boudec Le","year":"1998","unstructured":"Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory\u00a044(3), 1087\u20131096 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"51_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45318-0","volume-title":"Network Calculus: A Theory of Deterministic Queuing Systems for the Internet","author":"J.-Y. Boudec Le","year":"2001","unstructured":"Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, Heidelberg (2001)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Anderson, J., Srinivasan, A.: Mixed pfair\/Erfair scheduling of asynchronous periodic tasks. In: Proceedings of the 13th Euromicro Conference on Real-Time Systems, June 2001, pp. 76\u201385 (2001)","DOI":"10.1109\/EMRTS.2001.934004"}],"container-title":["Lecture Notes in Computer Science","Information Networking. Networking Technologies for Broadband and Mobile Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25978-7_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:13:24Z","timestamp":1740842004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25978-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230342","9783540259787"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25978-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}