弹性分组环网络中最大接入延时  

Maximum access delay in resilient packet ring

作　　者：巩艳蓉[1] 曾烈光[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《清华大学学报（自然科学版）》2007年第1期32-35,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家"八六三"高技术项目(2002AA121041)

摘　　要：为了研究弹性分组环的网络性能,特别是业务的最大接入延时,为网络配置提供有效的参考,基于网络演算理论建立了弹性分组环业务传输模型,分析了弹性分组环网络中各类业务在网络中的最大接入延时,并提出在特定条件下各类业务最大接入延时的计算方法。仿真结果表明:弹性分组环网络中高优先级业务的最大接入延时小于低优先级业务的最大接入延时;业务最大接入延时与环路站点无关,不受环路规模的影响;环路业务量、整形器容量以及最大分组长度的增加都会使得业务最大接入延时增大。该计算方法易于实现,便于在工程环境下对性能快速估算,具有较好的实用性。The resilient packet ring （RPR） is a new technology for metropolitan area networks. A RPR packet transfer model was developed using network calculus to study the performance of RPR networks, especially the service access delay as a reference for network configurations. The maximum access delay for each class of service in a constrained environment are analyzed based on the model. Simulation results show that services with higher priorities have smaller access delay. The through put, the shaper size and the packet length all affect the maximum access delay while the number of the stations in the ring has no effect on its. This algorithm provides better accuracy and ease of implementation than previous methods.

关 键 词：计算机网络理论 城域网 弹性分组环 接入延时 网络演算 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]