Fair matching algorithm: fixed-length frame scheduling in all-photonic networks

TitleFair matching algorithm: fixed-length frame scheduling in all-photonic networks
Publication TypeConference Proceedings
Year of Publication2006
AuthorsSaberi, N., and M. J. Coates
Conference NameIASTED Int. Conf. Optical Comm. Sys. and Networks
Date Published07/2006
Conference LocationBanff, AB, Canada
Keywordsmatching algorithms, max-min fairness, Optical networks, Scheduling, star topology
Abstract

Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but they introduce network scheduling challenges. In this paper we focus on scheduling fixed-length frames in all-photonic star-topology networks. We describe the Fair Matching (FMA) and Equal Share (ESA) algorithms, novel scheduling procedures that result in maxmin fair allocation of extra demand and achieve zero rejection for admissible demands. We analyze through simulation the delay and throughput performance.

AttachmentSize
PDF621.25 KB