Analysis of Randomized Scheduling Algorithm for a Practical Bufferless Optical Network

We evaluate a plausible bufferless star-based packet-switched optical network. A randomized scheduling algorithm is used to resolve contention, alleviating the need for a centralized controller to coordinate the edge nodes. A bipartite graph matching algorithm is proposed to be used at the core node to minimize the packet drop rate. We examine the performance of the system via simulation, to establish the potential of this architecture for practical packet-switched optical networks.