Fair Matching Algorithm: Fixed-Length Frame Scheduling in All-Photonic Networks

N. Saberi and M. Coates (Canada)


scheduling, star topology, max-min fairness, matching al gorithms, optical networks.


Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby elim inating a potential capacity bottleneck, but they intro duce network scheduling challenges. In this paper we fo cus on scheduling fixed-length frames in all-photonic star topology networks. We describe the Fair Matching (FMA) and Equal Share (ESA) algorithms, novel scheduling pro cedures that result in max-min fair allocation of extra de mand and achieve zero rejection for admissible demands. We analyze through simulation the delay and throughput performance.

Important Links:

Go Back