ABSTRACT
In this chapter, we consider packet scheduling in wavelength-division-multiplexing (WDM) optical interconnects with limited range wavelength conversion and shared buffer. We will describe how an optimal packet schedule, by which packet loss and packet delay can be minimized, can be found by a parallel algorithm. We will formalize the problem as a matching problem in a bipartite graph and show step-by-step how the algorithm is derived on the basis of properties of the special bipartite graph.
