DocumentCode :
3273466
Title :
Packet Scheduling in Optical FIFO Buffers
Author :
Beheshti, Neda ; Ganjali, Yashar
Author_Institution :
Stanford Univ., Stanford
fYear :
2007
fDate :
11-11 May 2007
Firstpage :
63
Lastpage :
66
Abstract :
Recent advances in optical technology show the possibility of building all-optical buffers in the near future. These buffers are usually composed of a number of fiber delay lines (FDLs) and optical switches. Incoming packets are stored for a limited time by going through optical delay lines. Optical switches transfer these packets among different delay lines, or send them towards the output line if a packet is to leave the system. As a direct consequence of using optical technology, one of the major constraints in this setting is that the size of switch needs to be small. In this paper, we show the feasibility of constructing a FIFO queue of size N by using only O(log N) 2times2 switches. A simple scheduling algorithm that achieves this bound is developed. The proposed structure provides an efficient way of storing optical packets using a minimal number of delay lines and switches.
Keywords :
optical communication equipment; optical delay lines; optical fibre networks; optical switches; packet switching; queueing theory; FIFO queue; fiber delay lines; optical buffers; optical packets; optical switches; optical technology; packet scheduling; packet-switched communication networks; scheduling algorithm; Communication switching; Delay effects; Delay lines; Emulation; Multiplexing; Optical buffering; Optical design; Optical packet switching; Optical switches; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High-Speed Networks Workshop, 2007
Conference_Location :
Anchorage, AK
Print_ISBN :
1-4244-1580-2
Electronic_ISBN :
1-4244-1580-2
Type :
conf
DOI :
10.1109/HSNW.2007.4290548
Filename :
4290548
Link To Document :
بازگشت