帧中继骨干节点的公平高效拥塞控制和调度算法  

Fair&Efficient Congest Control and Schedule Algorithm of Frame Relay Backbone Node

作　　者：彭双庭 张根度[1] 贾彬[1] 

机构地区：[1]复旦大学网络信息与工程中心,上海200433

出　　处：《计算机工程》1997年第S1期115-118,共4页Computer Engineering

摘　　要：信息时代对网络技术在质与量上提出了更高的要求,在这种背景下,吸收了传统网络技术精髓的Frame Relay技术应运而生,实现了高速LAN生命在WAN上的进一步延伸。为了进一步发挥Frame Relay支持高速突发业务这一特色,以满足实际应用的迫切带宽需求,文中提出了优化网络拥塞控制和调度这一网络核心技术,即以浮动多优先级队列和传输延迟因子实现网络拥塞控制和调度,实现了根据用户所购的优先级和CIR(Commited lnformation Rate)合理分配带宽同时高效地调度负载的输出,并很好地支持突发性传输业务。Information time makes more elaborate demand on both quality and quantity of network service. Thus Frame Relay come into existance after assimilating traditional computer network technique, extending high-speed LAN to WAN. In order to further deploy the feature of Frame Relay supporting high-speed and burst-out service and meet practical broad band application, this dissertation submits to optimize network core technique on how to control congest and schedule burdon fairly and efficiently in Frame Relay Switch. That is to combine dynamic prior polyqueue with Transmitting Delay Factor to implement schedulment and control congest according to priority and CIR subscribed by user, realizing to allocate band fairly and schedule output efficiently and support burst-out service perfectly.

关 键 词：帧中继 永久虚电路 用户网络接口 定购信息速率 延迟因子 帧中继交换机 

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