Overflow probability in shared cell switched buffers

被引:6
|
作者
Schormans, JA [1 ]
Pitts, JM [1 ]
机构
[1] Queen Mary Univ London, Dept Elect Engn, London E1 4NS, England
关键词
ATM switching; queueing theory; shared buffer analysis;
D O I
10.1109/4234.846500
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The ubiquity of the cell switching technique is a clear indication of its continued importance for the future of telecommunications worldwide, The performance of shared buffers in cell switches provides substantial improvement over switches with separate output buffers. The conventional approach to shared buffer analysis is numerical convolution; however recent work provides an analytical solution based on the Chernoff bound. In this letter we develop a new closed-form expression for the cell loss probability in the shared buffer that offers superior accuracy, enhanced simplicity, and better generality.
引用
收藏
页码:167 / 169
页数:3
相关论文
共 50 条
  • [2] On the ε-overflow probability of lossless codes
    Nomura, Ryo
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 441 - +
  • [3] A note on the ε-overflow probability of lossless codes
    Nomura, Ryo
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (12) : 2965 - 2970
  • [4] On the overflow probability of deterministically constrained traffic
    Su, CF
    deVeciana, G
    [J]. ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 1704 - 1708
  • [5] Performance of cell loss priority management schemes in shared buffers with Poisson arrivals
    Van Mieghem, P
    David, J
    Petit, GH
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1998, 9 (03): : 245 - 258
  • [6] PROCESSOR-SHARED BUFFERS WITH RENEGING
    COFFMAN, EG
    PUHALSKII, AA
    REIMAN, MI
    WRIGHT, PE
    [J]. PERFORMANCE EVALUATION, 1994, 19 (01) : 25 - 46
  • [7] EVALUATING THE OVERFLOW PROBABILITY USING THE INFINITE QUEUE
    SAKASEGAWA, H
    MIYAZAWA, M
    YAMAZAKI, G
    [J]. MANAGEMENT SCIENCE, 1993, 39 (10) : 1238 - 1245
  • [8] COMPUTING THE PROBABILITY OF HASH TABLE URN OVERFLOW
    RAMAKRISHNA, MV
    [J]. COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1987, 16 (11) : 3343 - 3353
  • [9] On the variance and the probability of length overflow of lossless codes
    Nomura, R
    Matsushima, T
    Hirasawa, S
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 44 - 44
  • [10] Estimation of buffer overflow probability by OPNET modeling
    Kulikovs, Mihails
    Petersons, Ernests
    [J]. INFORMATION TECHNOLOGIES' 2008, PROCEEDINGS, 2008, : 145 - 149