Abstract
Assuming data traffic of fixed-length cells, we propose a frame-oriented scheduling discipline, PFRR (parallel fair round robin), for WDM optical switches by applying pfair (proportionate fairness) scheduling so that deterministic communication performance is guaranteed. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a two-dimension frame, which is transferred iteratively over the multiple channels in an optical fiber. To determine the transmission order of cells in a frame, pfair scheduling is used so that the cells belonging to a session are distributed over the frame as uniformly as possible. Through the analysis by network calculus and by network simulator, it is shown that PFRR possesses tight delay bounds and lenient buffer requirements. Also, with a minor modification to PFRR, a new service discipline called MPFRR is proposed that can be used as traffic regulator to support sessions with jitter requirements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, H.: Service disciplines for guaranteed performance service in packetswitching networks. Proceeding of the IEEE 83(10), 1374–1396 (1995)
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)
Anderson, J., et al.: Parallel switching in connection-oriented networks. In: Proceedings of the 20th IEEE Real-Time Systems Symposium, pp. 200–209 (1999)
Jackson, L.E., Rouskas, G.N.: Deterministic preemptive scheduling of real-time tasks. Computer 35(5), 72–79 (2002)
Baruah, S., Cohen, N., Plaxton, C.G., Varvel, D.: Proportionate progress: A notation of fairness in resource allocation. Algorithmica 15(6), 600–625 (1996)
Baruah, S., et al.: Fairness in periodic real-time scheduling. In: Proceedings of 16th Annual IEEE Real-Time Systems Symposium, December 1995, pp. 200–209 (1995)
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–288 (1996)
Anderson, J., Srinivasan, A.: A new look at pfair priorities, Technical report, Dept. of Computer Science, Univ. of North Carolina (1999)
Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory 44(3), 1087–1096 (1998)
Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, Heidelberg (2001)
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–85 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, D., Lee, YH., Doh, Y. (2004). Parallel Fair Round Robin Scheduling in WDM Packet Switching Networks. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive