Abstract
In this paper, we study scheduling problems in bufferless time slotted WDM optical interconnects with wavelength conversion ability. We consider the case when the connection requests have different priorities and give algorithms that are aware of the Quality of Service (QoS) requirements. The wavelength conversion considered in this paper is the general case of limited range wavelength conversion with arbitrary wavelength conversion capability, as limited range wavelength conversion is easier to implement and more cost effective than full range wavelength conversion, and it also includes full range wavelength conversion as a special case. We show that the problem of maximizing network throughput and giving service differentiation can be formalized as finding an optimal matching in a weighted bipartite graph. We then give an optimal distributed scheduling algorithm called the Downwards Expanding Algorithm that runs in O(k2) time to find such a matching, where k is the number of wavelengths per fiber.
| Original language | English |
|---|---|
| Pages (from-to) | 301-308 |
| Number of pages | 8 |
| Journal | Proceedings of the International Conference on Parallel Processing |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004 - Montreal, Que, Canada Duration: Aug 15 2004 → Aug 18 2004 |
Keywords
- Limited range wavelength conversion
- Matching
- Optical interconnects
- Scheduling
- Wavelength conversion
- Wavelength-division-multiplexing (WDM)
- Weighted bipartite graphs
Fingerprint
Dive into the research topics of 'Distributed QoS-aware scheduling algorithm for WDM optical interconnects with arbitrary wavelength conversion capability'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver