弹性分组环网的分组延时性能研究  

Study on Packet Transfer Delay of Resilient Packet Ring

作　　者：蒋铭[1] 曾庆济[1] 朱栩[1] 张治中[1] 屈劲[2] 

机构地区：[1]上海交通大学宽带光网研究中心,上海200030 [2]西安电子科技大学ISN国家重点实验室,西安710071

出　　处：《光子学报》2004年第1期47-52,共6页Acta Photonica Sinica

基　　金：86 3计划基金项目 (2 0 0 1AA12 10 73)

摘　　要：本文采用了M/G/ 1/K排队模型对Darwin标准草案中建议的弹性分组环网的分组传输延时进行了性能分析 ,结果表明不同优先级的业务等待延时不同 ,高优先级分组在网络中传输延时最低 ,中优先级分组的延时仅略低于低优先级分组 ,当网络规模增加时 ,这种差距逐渐减小甚至可以忽略 ;并且从理论上推导出网络最大吞吐量 ,这对于制定相关标准。In this paper, based on queuing theory and M/G/1/K queuing system, the average packet transfer delay for Darwin preliminary draft is analyzed. The results show that high priority traffic gets the lowest delay and the difference between medium priority traffic and low priority traffic is small. In addition, the larger the network, the less is the difference. Maximum network throughput is also obtained in theory, which is instructive to further promote the related standard and even to design network in real system.

关 键 词：弹性分组环 M/G/1/K模型 排队论 分组平均延时 分组优先级 

分 类 号：TN913[电子电信—通信与信息系统] TN393[电子电信—信息与通信工程]