24 July 2001 Impact of polarized traffic on scheduling algorithms for high-speed optical switches
Author Affiliations +
Proceedings Volume 4523, Internet Performance and Control of Network Systems II; (2001) https://doi.org/10.1117/12.434308
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Abstract
The problem of maintaining high throughput of a slotted switch matrix while observing data transit time limits involves balancing two contradictory requirements. It is desired to transmit only full packets through the matrix whenever possible, even when traffic is unevenly distributed among the input queues. However, to prevent loss of data due to timeout it will be necessary to transmit some incomplete packets from queues that have light traffic. Our scheme for scheduling the switch matrix takes into account the conflicting requirements of data timeout and switch matrix efficiency. Using only elementary queue state information (data content and age), this scheme works by presenting ideal service requests to the central scheduler. The scheduler does not incorporate any priority scheme and can use any of a number of available scheduling algorithms that provide efficient matrix operation and fairness of service for the input data queues. Simulations of a switch system using our scheme demonstrate that polarized (unevenly distributed) traffic can be handled with a loss of only a few percent of the switch matrix capacity.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John Blanton, John Blanton, Hal Badt, Hal Badt, Gerard Damm, Gerard Damm, Prasad Golla, Prasad Golla, } "Impact of polarized traffic on scheduling algorithms for high-speed optical switches", Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434308; https://doi.org/10.1117/12.434308
PROCEEDINGS
9 PAGES


SHARE
Back to Top