首页 | 本学科首页   官方微博 | 高级检索  
     检索      

弹性分组环网的分组延时性能研究
引用本文:蒋铭,曾庆济,朱栩,张治中,屈劲.弹性分组环网的分组延时性能研究[J].光子学报,2004,33(1):47-52.
作者姓名:蒋铭  曾庆济  朱栩  张治中  屈劲
作者单位:上海交通大学宽带光网研究中心,上海,200030;西安电子科技大学ISN国家重点实验室,西安,710071
基金项目:86 3计划基金项目 (2 0 0 1AA12 10 73)
摘    要:本文采用了M/G/1/K排队模型对Darwin标准草案中建议的弹性分组环网的分组传输延时进行了性能分析,结果表明不同优先级的业务等待延时不同,高优先级分组在网络中传输延时最低,中优先级分组的延时仅略低于低优先级分组,当网络规模增加时,这种差距逐渐减小甚至可以忽略;并且从理论上推导出网络最大吞吐量,这对于制定相关标准、设计和规划实用网络具有重要指导作用.

关 键 词:弹性分组环  M/G/1/K模型  排队论  分组平均延时  分组优先级
收稿时间:2003-02-26
修稿时间:2003年2月26日

Study on Packet Transfer Delay of Resilient Packet Ring

.Study on Packet Transfer Delay of Resilient Packet Ring[J].Acta Photonica Sinica,2004,33(1):47-52.
Authors:
Institution:(1 Center for Broadband Optical Networking Tech., Shanghai Jiaotong University,Shanghai 200030,China)
(2 National Key Lab of ISN, Xidian University, Xi′an, Shaanxi 710071, China)
Abstract: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.
Keywords:Resilient Packet Ring  M/G/1/K queuing system  Queuing theory  Packet transfer delay  Packet priority  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《光子学报》浏览原始摘要信息
点击此处可从《光子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号