An analytical model for input-buffered optical packet switches with reconfiguration overhead

被引:0
作者
Chou, Kuan-Hung [1 ]
Lin, Woei [1 ]
机构
[1] Natl Chung Hsing Univ, Dept Comp Sci & Engn, Taichung 40227, Taiwan
关键词
Stochastic analysis; Stochastic decomposition; Discrete-time system; Batch arrival; Optical communication; STOCHASTIC DECOMPOSITIONS; SCHEDULING ALGORITHM; QUEUE; VACATIONS; SYSTEMS; SERVICE; LATENCY;
D O I
10.1007/s11107-011-0320-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The overhead associated with reconfiguring a switch fabric in optical packet switches is an important issue in relation to the packet transmission time and can adversely affect switch performance. The reconfiguration overhead increases the mean waiting time of packets and reduces throughput. The scheduling of packets must take into account the reconfiguration frequency. This work proposes an analytical model for input-buffered optical packet switches with the reconfiguration overhead and analytically finds the optimal reconfiguration frequency that minimizes the mean waiting time of packets. The analytical model is suitable for several round-robin (RR) scheduling schemes in which only non-empty virtual output queues (VOQs) are served or all VOQs are served and is used to examine the effects of the RR scheduling schemes and various network parameters on the mean waiting time of packets. Quantitative examples demonstrate that properly balancing the reconfiguration frequency can effectively reduce the mean waiting time of packets.
引用
收藏
页码:209 / 220
页数:12
相关论文
共 29 条
[2]   Multihop Control Schemes in Switches With Reconfiguration Latency [J].
Alaria, Valentina ;
Bianco, Andrea ;
Giaccone, Paolo ;
Leonardi, Emilio ;
Neri, Fabio .
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2009, 1 (03) :B40-B55
[3]   WAITING-TIMES IN DISCRETE-TIME CYCLIC-SERVICE SYSTEMS [J].
BOXMA, OJ ;
GROENENDIJK, WP .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (02) :164-170
[4]  
Bruneel H, 1992, DISCRETE TIME MODELS
[5]   Optical buffers for variable length packets [J].
Callegati, F .
IEEE COMMUNICATIONS LETTERS, 2000, 4 (09) :292-294
[6]   A latency-aware scheduling algorithm for all-optical packet switching networks with FDL buffers [J].
Chou, Kuan-Hung ;
Lin, Woei .
PHOTONIC NETWORK COMMUNICATIONS, 2011, 21 (01) :45-55
[7]   STOCHASTIC DECOMPOSITIONS IN THE M/G/1 QUEUE WITH GENERALIZED VACATIONS [J].
FUHRMANN, SW ;
COOPER, RB .
OPERATIONS RESEARCH, 1985, 33 (05) :1117-1129
[8]   QUEUING IN HIGH-PERFORMANCE PACKET SWITCHING [J].
HLUCHYJ, MG ;
KAROL, MJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (09) :1587-1597
[9]   1100 x 1100 port MEMS-based optical crossconnect with 4-dB maximum loss [J].
Kim, J ;
Nuzman, CJ ;
Kumar, B ;
Lieuwen, DF ;
Kraus, JS ;
Weiss, A ;
Lichtenwalner, CP ;
Papazian, AR ;
Frahm, RE ;
Basavanhally, NR ;
Ramsey, DA ;
Aksyuk, VA ;
Pardo, F ;
Simon, ME ;
Lifton, V ;
Chan, HB ;
Haueis, M ;
Gasparyan, A ;
Shea, HR ;
Arney, S ;
Bolle, CA ;
Kolodner, PR ;
Ryf, R ;
Neilson, DT ;
Gates, JV .
IEEE PHOTONICS TECHNOLOGY LETTERS, 2003, 15 (11) :1537-1539
[10]   THE ANALYSIS OF RANDOM POLLING SYSTEMS [J].
KLEINROCK, L ;
LEVY, H .
OPERATIONS RESEARCH, 1988, 36 (05) :716-732