期刊文献+

分段式全带宽动态分配算法研究

On the Algorithm of Staged Dynamic Full-bandwidth Allocation
下载PDF
导出
摘要 为提高多业务分组系统的带宽利用效率,提出了一种分段式全带宽动态分配算法,该算法允许单业务流最大可用带宽超出其公平共享范围。分析和实践结果表明,在保持常规算法的带宽利用率、公平性和满足用户QoS指标的同时,该算法使有需求链路在系统处于非饱和状态时可占用全部剩余带宽(直至全带宽),显著提高系统的总带宽利用率。 To improve the bandwidth utilization for multi-service packet transporting system,a dynamic bandwidth allo-cation algorithm is presented which allows a single stream beyond its fair share bandwidth.The results of analyses and experiments show that in addition to have the same performance with the normal in bandwidth utilization,fairness,de-mand for QoS etc.,the algorithm makes the link in need use all the rest of the bandwidth(up to full-bandwidth),and therefore the total bandwidth utilization of the system is improved.
出处 《计算机工程与应用》 CSCD 北大核心 2004年第32期148-151,161,共5页 Computer Engineering and Applications
基金 国家863高技术研究发展计划"信息技术领域通信技术主题重大课题"(编号:863-317-01-01-01-99)
关键词 全利用度 动态带宽分配 公平性 带宽利用率 full-bandwidth utilization,dynamic allocation algorithm,fairness,bandwidth utilization
  • 相关文献

参考文献14

  • 1F RISSO.Quality of Service on Packet Switched Networks[D].PHD thesis.http://netgroup.polito.it/fulvio.risso/pubs/thesis.pdf, 2000-01
  • 2E LEONARDI,M MELLIA,F NERI.Bounds on average delays and queue size averages and variances in input-queued cell-based switches[C].In: Proc IEEE INFOCOM, 2001; 2:1095~1103
  • 3H SARIOWAN,R L CRUZ,G C POLYZOS.SCED:A generalized Scheduling Policy for Guaranteeing Quality-of-Service[J].IEEE/ACM Trans On Networking, 1999;7(5) :669~684
  • 4R PAN,B PRABHAKAR,K PSOUNIS.A stateless active queue management scheme for approximating fair bandwidth allocation[C].In:
  • 5E HAHNE.Round-Robin scheduling for max-min fairness in data networks[J].IEEE Journal on Selected Areas in Communications,1991-09 ;9:1024~1039
  • 6JON C R BENNETT,H ZHANG.Hierarchical Packet Fair Queuing Algorithms[J].IEEE/ACM Transactions on Networking, 1997; 5 (5):675~689
  • 7N NI,L N BHUYAN.Fair scheduling and buffer management in Internet routers[C].In:IEEE INFOCOM,Yew York,2002-06
  • 8L ZHANG.Virtual Clock:A New Traffic Control Algorithm for Packet-Switched Networks[J].ACM Trans Computer Systems, 1991 ;9(2):101~124
  • 9I STOICA et al.A Hierarchical fair service curve algorithm for linksharing real-time and priority services[J].IEEE/ACM Trans on Networking,2000; 8 (2): 185~199
  • 10AMOTZ B,YISHAY M,BARUCH S.Competitive dynamic bandwidth allocation[C].In:Proceedings of the 7th annual ACM symposium on Principles of distributed computing,Puerto Vallarta,Mexico, 1998: 31~39

二级参考文献9

  • 1MCKEOWN N, IZZARD M, MEKKITTIKUL A. The tiny tera: a packet switch core [J]. IEEE Micro 1997, 1997, 17(1): 26-33.
  • 2GUPTA P, LIN S, MACKEOWN N. Routing lookups in hardware at memory access speeds [A]. Proc of IEEE INFOCOM[C]. 1998.3:1241-1248.
  • 3NILSSON S. KARLSSON G. Fast address look-up for Internet routers [A]. Proceedings of the 4th IFIP International Conference on Broadband Communication[C]. 1998.
  • 4LAKSHMAN T V, STILIADIS D. High speed policy-based packet forwarding using efficient mulii-dimemional range matching [J].Computer Communication Review (ACM SIGCOMM), 1998, 28(4): 203-214.
  • 5DUFFIELD N G, LAKSHMAN T V, STILIADIS D. On adaptivc bandwidth sharing with rate guanmtees [A]. Proc IEEE INFOCOM[C]. 1998. 3: 1122-1130.
  • 6KAR IC Scheduling of Variable Size Packets in Input Queued Switches [D]. University of Maryland at College Park, 1999.
  • 7KATEVENIS M, SIDIROPOULOS S, COURCOUBETIS C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip [J]. IEEE Journal on Selected Areas in Communications, 1991, 9(3): 1265-1279.
  • 8CASETTI C, KUROSE J, TOWSLEY D. A New Algorithm for Measurement-based Admission Control in Integrated Services Packet Networks[R].Proc of the Protocols for High Speed Networks Workshop,1996.
  • 9KIM J H. Bandwidth and Latency Guarantees in Low-cost High Performance Networks[D].Department of Computer Sciences,University of Illinois, Urbana-Champaign, 1997.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部