Share Email Print

Proceedings Paper

Impact of polarized traffic on scheduling algorithms for high-speed optical switches
Author(s): John Blanton; Hal Badt; Gerard Damm; Prasad Golla
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 24 July 2001
PDF: 9 pages
Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434308
Show Author Affiliations
John Blanton, Alcatel USA (United States)
Hal Badt, Alcatel USA (United States)
Gerard Damm, Alcatel USA (Canada)
Prasad Golla, Alcatel USA (United States)

Published in SPIE Proceedings Vol. 4523:
Internet Performance and Control of Network Systems II
Robert D. van der Mei; Frank Huebner-Szabo de Bucs, Editor(s)

© SPIE. Terms of Use
Back to Top