弹性分组环分组排队时间及传输延时的研究  

Transfer Delay and Queueing Time of RPR Network

作　　者：史国炜[1] 方洪波[1] 王洪元[1] 曾烈光[1] 

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

出　　处：《北京邮电大学学报》2004年第3期43-47,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家"863计划"项目(2002AA121041)

摘　　要：建立了弹性分组环(RPR)的业务排队模型,提出分组传输延时的定量分析方法,并对各类业务的平均传输延时进行了仿真分析.分析表明,低优先级业务的排队时间均长于高优先级业务;高优先级业务(A类)在单队列环中的传输延时要高于在双队列环中的传输延时,而低优先级业务(B类、C类)在单队列环中的传输延时要低于在双队列环中的传输延时.A traffic queueing model for resilient packet ring (RPR) networks was built, and a method for quantitatively analyzing the packet transfer delays in RPR network was presented as well. Based on this method, the average queueing time and transfer delay of the different priority traffic were obtained. It is concluded from the quantitative analysis that the lower priority traffic in transmit buffer has longer queueing time than that of higher priority traffic. On the other hand, the highest priority traffic (class-A) in single-queue ring is delayed more time than that in dual-queue ring. In contrary, the lower priority traffic (class-B and class-C) in single-queue ring is delayed less time than that in dual-queue ring.

关 键 词：弹性分组环 排队时间 分组传输延时 

分 类 号：TN915.04[电子电信—通信与信息系统]