A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution

被引:16
作者
Rogiest, W. [1 ]
Lambert, J. [2 ,3 ]
Fiems, D. [1 ]
Van Houdt, B. [2 ,3 ]
Bruneel, H. [1 ]
Blondia, C. [2 ,3 ]
机构
[1] Univ Ghent, TELIN Dept, SMACS Res Grp, B-9000 Ghent, Belgium
[2] Univ Antwerp, B-2020 Antwerp, Belgium
[3] IBBT, PATS Res Grp, B-2020 Antwerp, Belgium
关键词
Optical burst switching; Optical packet switching; Markov chains; Fiber delay line buffers; Optical buffers; OPTICAL BUFFERS; INTER-ARRIVAL; PERFORMANCE; SERVICE; QUEUES; TIMES;
D O I
10.1016/j.peva.2009.01.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Novel switching approaches like Optical Burst/Packet Switching have buffering implemented with Fiber Delay Lines (FDLs). Previous performance models of the resulting buffer only allowed for solution by numerical means, and only for one time setting: continuous, or discrete. With a Markov chain approach, we constructed a generic framework that encompasses both time settings. The output includes closed-form expressions of loss probabilities and waiting times for a rather realistic setting. This allows for exact performance comparison of the classic M/D/1 buffer and FDL M/D/1 buffer, revealing that waiting times are (more than) doubled in the case of FDL buffering. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:343 / 355
页数:13
相关论文
共 21 条
[1]   A generic-traffic optical buffer modeling for asynchronous optical switching networks [J].
Almeida, RC ;
Pelegrini, JU ;
Waldman, H .
IEEE COMMUNICATIONS LETTERS, 2005, 9 (02) :175-177
[2]  
ALMEIDA RC, 2004, IEEE INT C COMMUNICA, V3, P1771
[3]   Analytical solution of finite capacity M/D/1 queues [J].
Brun, O ;
Garcia, JM .
JOURNAL OF APPLIED PROBABILITY, 2000, 37 (04) :1092-1098
[4]  
Bruneel H., 1993, Discrete-Time Models for Communication Systems Including ATM
[5]   Optical buffers for variable length packets [J].
Callegati, F .
IEEE COMMUNICATIONS LETTERS, 2000, 4 (09) :292-294
[6]   Optical burst switching: A new area in optical networking research [J].
Chen, Y ;
Qiao, CM ;
Yu, X .
IEEE NETWORK, 2004, 18 (03) :16-23
[7]  
Kleinrock L., 1975, QUEUEING SYSTEMS 1
[8]  
KOBA EV, 2000, DOPOVIDI NAN UKRAINI, V6, P101
[9]  
LAEVENS K, 2003, P INF 2003 SAN FRANC
[10]  
LAKATOS L, 1998, J MATH SCI NEW YORK, V4, P4031