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
相关论文
共 50 条
  • [22] IMPROVED WINDOWING RULE FOR INPUT BUFFERED PACKET SWITCHES
    THOMAS, G
    MAN, J
    ELECTRONICS LETTERS, 1993, 29 (04) : 393 - 395
  • [23] Throughput analysis for input-buffered ATM switches with multiple FIFO queues per input port
    Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong
    Electron Lett, 19 (1604-1606):
  • [24] MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup
    Tabatabaee, V
    Tassiulas, L
    IEEE INFOCOM 2003: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2003, : 1406 - 1413
  • [25] Generalization of the Pollaczek-Khinchin formula for throughput analysis of input-buffered switches
    Chang, CS
    Lee, DS
    Yu, CL
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 960 - 970
  • [26] Discrete-time queueing models with feedback for input-buffered ATM switches
    Laevens, K
    Bruneel, H
    PERFORMANCE EVALUATION, 1996, 27-8 : 71 - 87
  • [27] Discrete-time queueing models with feedback for input-buffered ATM switches
    Laevens, K.
    Bruneel, H.
    Performance Evaluation, 1996, 27-28 : 71 - 87
  • [28] Stochastic neural scheduler for real-time input-buffered packet switching
    Rodríguez-Hernández, PS
    González-Castaño, FJ
    Pousada-Carballo, JM
    García-Palomares, UM
    ELECTRONICS LETTERS, 1999, 35 (16) : 1313 - 1314
  • [29] PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches
    Oki, E
    Rojas-Cessa, R
    Chao, HJ
    GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 35 - 39
  • [30] Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch
    Kitsuwan, Nattapong
    Oki, Eiji
    Rojas-Cessa, Roberto
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (08) : 2176 - 2179