检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《Journal of Electronics(China)》1997年第2期133-139,共7页电子科学学刊(英文版)
基 金:Supported by the National Natural Science Foundation of China;Foundation of the Acadency of Electronic Science,China;the National Postdoctoral Science Fund of China
摘 要:Traditional packet switching networks have typically employed window-based congestion control schemes in order to regulate traffic flow. In ATM networks, the high speed of the communication links and the varied nature of the carried traffic make such schemes inappropriate. Therefore, simpler and more efficient schemes have to be proposed to improve the congestion control for ATM switching. This paper presents an exact performance analysis of ATM switching whose inputs consist of Continuous-Bit-Rate(CBR) and bursty traffic. The CBR traffic and bursty traffic are described by Bernoulli process and the Interrupted Bernoulli Process(IBP), respectively. Bursty traffic smoothing mechanism is analyzed. With the use of a recursive algorithm, the cell loss probability and the average delay for ATM switching of mixed CBR and bursty traffic are exactly calculated. Traffic smoothing could be implemented at a slower peak rate keeping the average rate constant or decreasing the average bursty length. Both numericalTraditional packet switching networks have typically employed window-based congestion control schemes in order to regulate traffic flow. In ATM networks, the high speed of the communication links and the varied nature of the carried traffic make such schemes inappropriate. Therefore, simpler and more efficient schemes have to be proposed to improve the congestion control for ATM switching. This paper presents an exact performance analysis of ATM switching whose inputs consist of Continuous-Bit-Rate(CBR) and bursty traffic. The CBR traffic and bursty traffic are described by Bernoulli process and the Interrupted Bernoulli Process(IBP), respectively. Bursty traffic smoothing mechanism is analyzed. With the use of a recursive algorithm, the cell loss probability and the average delay for ATM switching of mixed CBR and bursty traffic are exactly calculated. Traffic smoothing could be implemented at a slower peak rate keeping the average rate constant or decreasing the average bursty length. Both numerical analysis and simulation results show that the performance of ATM switching with traffic smoothing function is improved.
关 键 词:ATM Interrupted BERNOULLI process BURSTINESS TRAFFIC SMOOTHING RECURSIVE algorithm
分 类 号:TP274.4[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7