DocumentCode
1748237
Title
Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch
Author
Kurimoto, Takashi ; Oki, Eiji ; Nakai, Kohei ; Yamanaka, Naoaki
Author_Institution
NTT Network Service Syst. Labs., Midori, Japan
Volume
4
fYear
2001
fDate
2001
Firstpage
985
Abstract
A new scheduling algorithm that concatenates data blocks to increase switching throughput is proposed. The algorithm controls the degree of concatenation and reduces the number of switching instances to improve switch utilization. The switch architecture uses virtual output queue switching architecture where the core switch fabric is an optical matrix switch. The optical matrix switch requires the guard-time overhead needed for optical switch control. By reducing the number of switching instances, guard-time overhead can be reduced and switch utilization can be improved. Computer simulations show that efficiency is dramatically increased and that fairness in terms of data throughput among output ports is achieved
Keywords
electro-optical switches; packet switching; queueing theory; computer simulations; concatenated data block; concatenating-weight algorithm; data throughput; guard-time overhead; guard-time reduction; optical matrix switch; optical switch control; optical switch rearrangement; opto-electronic packet switch; output ports; switch architecture; switch fabric; switch utilization; switching scheduling algorithm; switching throughput; virtual output queue switching architecture; Bandwidth; Computer architecture; Computer simulation; Concatenated codes; Fabrics; Optical packet switching; Optical switches; Packet switching; Scheduling algorithm; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location
Helsinki
Print_ISBN
0-7803-7097-1
Type
conf
DOI
10.1109/ICC.2001.936742
Filename
936742
Link To Document