On probabilistic model of the statistical multiplexing and queueing buffer in ATM switch system

被引:0
|
作者
Vinh, PC [1 ]
Lan, NK [1 ]
Tue, L [1 ]
机构
[1] Vietnam Posts & Telecoms Inst Technol, Hochiminh City, Vietnam
来源
DIGITAL CONVERGENCE FOR CREATIVE DIVERGENCE, VOL 2: TECHNICAL INTERACTIVE SESSIONS | 1999年
关键词
statistical multiplexer; queueing buffer; ATM switch; Markov chain; probabilistic model;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Broadband integrated services digital network (B-ISDN) is a telecommunications technology that is designed to integrate all kinds of services (e.g., voice, data, image and video) into a universal all-purpose digital network. Asynchronous transfer mode (ATM) is a packet-oriented switching and multiplexing technique which is believed to have the technical capability to handle many types of services encompassed by B-ISDNs. At an ATM switch, ATM cells coming from heterogeneous sources are multiplexed together and stored temporarily in the multiplexer buffer before they are transmitted to their designated output ports through the switching fabric. Our works are interested in modeling performance measures such as the throughput of the ATM switch, buffer overflow probability, cell loss ratio, average delay of ATM cells, variation in the delay, etc. Although the performance analysis of ATM switches depends significantly on the switch architectures and could be very complex, the modeling and evaluation of the statistical multiplexer and multiplexer buffers in an ATM switch system is useful for understanding whether the switching system is practical for some applications, and if so, what multiplexing efficiency and cell-loss regimes may be expected in such systems. We will focus on the modeling of the statistical multiplexer and multiplexer buffer overflow probability as an approach to probabilistic model throughout this paper.
引用
收藏
页码:269 / 274
页数:6
相关论文
共 44 条
  • [1] Dynamic buffer allocation in an ATM switch
    Yaprak, E
    Chronopoulos, AT
    Psarris, K
    Xiao, Y
    COMPUTER NETWORKS, 1999, 31 (18) : 1927 - 1933
  • [3] Adaptive buffer threshold updating for an ATM switch
    Yaprak, E
    Chronopoulos, AT
    Psarris, K
    Xiao, Y
    THIRD IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 1998, : 400 - 405
  • [4] Performance analysis of an input queueing ATM switch with two priority classes
    Lee, JW
    Choi, JS
    Un, CK
    PERFORMANCE EVALUATION, 1998, 32 (02) : 137 - 149
  • [5] Space division approach to implement a shared buffer in an ATM switch
    Pao, DCW
    Leung, SC
    COMPUTER COMMUNICATIONS, 1997, 20 (01) : 29 - 37
  • [6] Performance analysis of an output queueing ATM switch with heterogeneous traffic and multiple QoS
    Park, CY
    Chung, H
    Un, CK
    IEE PROCEEDINGS-COMMUNICATIONS, 1996, 143 (06): : 356 - 362
  • [7] A FLEXIBLE SHARED-BUFFER SWITCH FOR ATM AT GB/S RATES
    DENZEL, WE
    ENGBERSEN, APJ
    ILIADIS, I
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1995, 27 (04): : 611 - 624
  • [8] Input and output queueing two stage ATM switch with hot-spot route
    Shiokawa, S
    Sasase, I
    IEICE TRANSACTIONS ON COMMUNICATIONS, 1998, E81B (02) : 194 - 200
  • [9] Performance analysis of space-priority mechanisms in an input and output queueing ATM switch
    Lee, JY
    Un, CK
    IEE PROCEEDINGS-COMMUNICATIONS, 1997, 144 (04): : 229 - 236
  • [10] Methods for storing arriving cells in a shared multi-buffer ATM switch
    Shibata, A
    Inai, H
    Yamakita, J
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 1999, 82 (02): : 39 - 47