Simulation-based stability of a representative, large-scale ATM network for a distributed call processing architecture

被引:0
|
作者
Citro, R [1 ]
Ghosh, S
机构
[1] Intel Corp, Chandler, AZ 85226 USA
[2] Stevens Inst Technol, Dept Elect & Comp Engn, Hoboken, NJ 07030 USA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In response to the lack of realistic performance guarantees in "store and forward" networks, the asynchronous transfer mode (ATM) network has resurrected the idea of connection oriented calls. Thus, for every user call, the ATM network first determines and verifies a route, where possible, that meets the user's quality of service (QoS) requirements, and then transports the traffic along the route. In classic telephony, a typical call processing event P, requires 200 ms; while an average call duration C-d lasts 90 s. The ratio P-e/C-d = 450, is large enough to render the call processing effort meaningful, While the link bandwidth in classic telephony is 64 Kb/s and each user call is allocated an identical 8 Kb/s bandwidth, links bandwidths in ATM equal or exceed 155 Mb/s and users may be allocated, in general, much higher, variable bandwidths depending on need and availability. This paper projects that the trend of short call durations, of ftp, http, image retrieval, and email messages type, will gain increasing processing prominence in the future, fueled by our impatience and the rapid growth in the backbone link bandwidths that is already outpacing the expected increase in the average message size transported across the networks. As backbone speeds increase and call durations decrease, networks will be perceived as more responsive and potentially attract a very high rate of users interacting with the networks. Under these circumstances, it is unlikely for the traditional uniprocessor based ATM node architecture to successfully address the increased call processing demand, resulting in overall performance degradation. Therefore, new call processing architectures for ATM node are necessary. An efficient distributed call processor architecture has been presented in [1] to accelerate the call setup process. Since the architecture is designed to address a highly stressed network, just short of driving it into "instability," it is imperative that while preserving the quality of service (QoS) guarantees, the distributed call processing architecture prevent perturbations on the network during peek traffic hours. This need translates into the stability of the network in the presence of user call requests and QoS metrics. Network stability is viewed as a condition that must be satisfied so that a large scale decentralized representative high speed network will consistently perform without degradation in the presence of unexpected perturbation. This paper presents the stability study for a representative, large-scale, Private Network Network Interface (PNNI) ATM network under the distributed call processing introduced in [1].
引用
收藏
页码:538 / 548
页数:11
相关论文
共 50 条
  • [41] Hyperscale FPGA-as-a-Service Architecture for Large-Scale Distributed Graph Neural Network
    Li, Shuangchen
    Niu, Dimin
    Wang, Yuhao
    Han, Wei
    Zhang, Zhe
    Guan, Tianchan
    Guan, Yijin
    Liu, Heng
    Huang, Linyong
    Du, Zhaoyang
    Xue, Fei
    Fang, Yuanwei
    Zheng, Hongzhong
    Xie, Yuan
    PROCEEDINGS OF THE 2022 THE 49TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA '22), 2022, : 946 - 961
  • [42] Simulation-Based Performance Evaluation of an Energy-Aware Heuristic for the Scheduling of HPC Applications in Large-Scale Distributed Systems
    Stavrinides, Georgios L.
    Karatza, Helen D.
    ICPE'17: COMPANION OF THE 2017 ACM/SPEC INTERNATIONAL CONFERENCE ON PERFORMANCE ENGINEERING, 2017, : 49 - 54
  • [43] Large-scale network intrusion detection algorithm based on distributed learning
    College of Computer Science and Technology, Jilin University, Changchun 130012, China
    不详
    Ruan Jian Xue Bao/Journal of Software, 2008, 19 (04): : 993 - 1003
  • [44] Large-scale network intrusion detection based on distributed learning algorithm
    Tian, Daxin
    Liu, Yanheng
    Xiang, Yang
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2009, 8 (01) : 25 - 35
  • [45] Large-scale network intrusion detection based on distributed learning algorithm
    Daxin Tian
    Yanheng Liu
    Yang Xiang
    International Journal of Information Security, 2009, 8 : 25 - 35
  • [46] IMPLEMENTATION OF DEVS BASED DISTRIBUTED NETWORK SIMULATOR FOR LARGE-SCALE NETWORKS
    Cobanoglu, B.
    Zengin, A.
    Ekiz, H.
    Celik, F.
    Kiraz, A.
    Kayaalp, F.
    INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2014, 13 (02) : 147 - 158
  • [47] Aegis: A simulation grid oriented to large-scale distributed simulation
    Wu, W
    Zhou, Z
    Wang, SF
    Zhao, QP
    GRID AND COOPERATIVE COMPUTING GCC 2004, PROCEEDINGS, 2004, 3251 : 413 - 422
  • [48] On the predictive performance of queueing network models for large-scale distributed transaction processing systems
    Huehn, Oliver
    Markl, Christian
    Bichler, Martin
    INFORMATION TECHNOLOGY & MANAGEMENT, 2009, 10 (2-3): : 135 - 149
  • [49] On the predictive performance of queueing network models for large-scale distributed transaction processing systems
    Oliver Hühn
    Christian Markl
    Martin Bichler
    Information Technology and Management, 2009, 10 : 135 - 149
  • [50] Large-scale neural network for sentence processing
    Cooke, A
    Grossman, M
    DeVita, C
    Gonzalez-Atavales, J
    Moore, P
    Chen, W
    Gee, J
    Detre, J
    BRAIN AND LANGUAGE, 2006, 96 (01) : 14 - 36