Abstract
Optical Burst Switching (OBS) is a promising paradigm for the next-generation Internet infrastructure. In OBS, a key problem is to schedule bursts on channels with both fast and bandwidth efficient algorithms so as to reduce burst loss. To date, most scheduling algorithms avoid burst contention locally (or reactively). In this paper, we propose several novel algorithms for scheduling bursts in OBS networks with and without wavelength conversion capability. The basic idea of our algorithms is to serialize the bursts on an outgoing link to reduce the number of bursts that may arrive at downstream nodes simultaneously (and thus pro-actively reduce the burst contention and burst loss probability at downstream nodes). This can be accomplished by judiciously delaying locally assembled bursts beyond a pre-determined offset time at an ingress node using the electronic memory. Compared with the existing algorithms, our proposed algorithms can significantly reduce the loss rate while ensuring that maximum delay of a burst does not exceed its prescribed limit.
| Original language | English |
|---|---|
| Pages (from-to) | 617-629 |
| Number of pages | 13 |
| Journal | Computer Networks |
| Volume | 44 |
| Issue number | 5 |
| DOIs | |
| State | Published - Apr 5 2004 |
Keywords
- Ingress node
- Optical burst switching
- Proactive
- Scheduling algorithm
Fingerprint
Dive into the research topics of 'Schedule burst proactively for optical burst switched networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver