计算机应用研究2017，Vol.34Issue(6)：1830-1834,5.DOI:10.3969/j.issn.1001-3695.2017.06.052
基于时延Max-Min相似的多路径公平带宽分配
Max-Min similar queuing delay directed fair bandwidth allocation for multi-path networks
摘要
Abstract
Multi-path transmission complicates the problem of fair resource allocation while improving network performance.Few techniques working well in single-path conditions can be smoothly transplanted to a multipath environment.Perceiving the close interactions between queuing packets,delay and bandwidth allocation,this paper proposed a concept of Max-Min delay similarity and based on the concept designed an algorithm for distributed end-to-end bandwidth allocation.By separating control on flow level from on path level,and dynamically reallocating a flow's queuing packets on its transmission path,the network could achieve fair bandwidth allocation by achieving similar delays.It validated the effectiveness of the proposed algorithm by two groups of numeric simulation experiments.Also,given all flows suffer no more than one bottleneck on each path,it proves that delay similarity is a sufficient condition for implementing fair bandwidth allocation.关键词
公平带宽分配/多路径路由/排队时延/排队分组/Max-MinKey words
fair bandwidth allocation/multi-path routing/queuing delay/queuing packets/Max-Min分类
信息技术与安全科学引用本文复制引用
宋丽华,王海涛,张国敏,王陈雨..基于时延Max-Min相似的多路径公平带宽分配[J].计算机应用研究,2017,34(6):1830-1834,5.基金项目
国家自然科学基金资助项目(61072043,61402521) （61072043,61402521）
