FQLP:ATM网中一种新的实时业务调度算法

被引:5
作者
黄立群
黄载禄
谢晓明
杨宗凯
机构
[1] 武汉东湖新技术开发区管理委员会!武汉
[2] 华中理工大学电子与信息工程系!武汉
关键词
ATM; 调度算法; 实时业务; 时延;
D O I
暂无
中图分类号
TN915 [通信网];
学科分类号
0810 ; 081001 ;
摘要
本文提出了基于丢失优先权公平队列 (FQLP)调度算法 .理论分析和仿真实验表明FQLP调度算法能保证实时业务获得的网络资源不小于预约带宽 ,为实时业务提供确定的时延上界 .FQLP调度算法利用ATM网络中的信元优先权机制 ,提高了网络资源的利用率 .同时FQLP调度策略能保证信元的发送顺序 .
引用
收藏
页码:20 / 23
页数:4
相关论文
共 9 条
[1]  
W2 FQ :worst casefairweightedfairqueuing. J.Bennett,H .Zhang. proc .IEEEINFOCOM’’96 . Mar 1 996
[2]  
Priority management in ATM switching node. Kroner H. et al. IEEE Journal on Selected Areas in Communications . 1991
[3]  
A scheme for real-time channel establishment in wide-area networks.IEEE Journal on selected area in communication. D. Ferrari,D. Verma. Apr . 1990
[4]  
Exact admission control for networks with bounded delay services.IEEE/ACM Trans. on Networking. J. Liebeherr,D. Wrege et al. Decision . 1996
[5]  
A generalized processor sharing approach to flow control in integrated services networks: The single-node case.IEEE/ACM transactions on networking. A. Parekh. Decision . 1993
[6]  
A calculus for network delay, part I: network element in isolation.IEEE Transaction on information Theory. R. Cruz. JANAC . 1991
[7]  
Deterministic delay bounds for VBR video in packetswitching networks: Fundamental limits and practical trade-off. Wrege D,et al. IEEE ACM Transactions on Networking . 1996
[8]  
Schedulingpolicesforreal timeandnon real timetrafficinastatisticalmultiplexes. ChiopalkatttiR .etal. ProcIEEEINFOCOM’’89 . 1 989
[9]  
Delayguaranteeofvirtualclockserver. G .G .Xie,S .Lam. IEEE/ACMTrans.onnetworking . 1 995