Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets |
| |
Authors: | Callegati F Cerroni W Corazza G Develder C Pickavet M Demeester P |
| |
Affiliation: | (1) Department of Electronics, Computer Science and Systems (DEIS), University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;(2) Department of Information Technology (INTEC), Ghent University—IMEC, Sint-Pietersnieuwstraat 41, 9000 Ghent, Belgium |
| |
Abstract: | We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently. |
| |
Keywords: | IP-over-WDM optical packet switching optical packet router contention resolution |
本文献已被 SpringerLink 等数据库收录! |
|