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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
