基于时延Max—Min相似的多路径公平带宽分配
多路径传输可以提高网络性能，同时也使资源分配的公平性问题复杂化，单路径下能够良好工作的诸多机制无法轻易移植到多路径环境中。根据带宽分配和排队分组、排队时延的内在联系，提出了时延相似性的概念。设计了一种端到端分布式带宽分配算法，将流和传输路径两个层面的控制相分离，动态调整流的排队分组在其各传输路径上的分配，达到相似排队时延，进而实现公平带宽分配。在单瓶颈限定下证明了相似排队时延为公平带宽分配的充分条件。最后，通过两组仿真实验验证了算法的有效性。...
Saved in:
| Published in | 计算机应用研究 Vol. 34; no. 6; pp. 1830 - 1834 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
解放军理工大学指挥信息系统学院,南京,210007%解放军理工大学信息管理中心,南京,210007
2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2017.06.052 |
Cover
| Summary: | 多路径传输可以提高网络性能，同时也使资源分配的公平性问题复杂化，单路径下能够良好工作的诸多机制无法轻易移植到多路径环境中。根据带宽分配和排队分组、排队时延的内在联系，提出了时延相似性的概念。设计了一种端到端分布式带宽分配算法，将流和传输路径两个层面的控制相分离，动态调整流的排队分组在其各传输路径上的分配，达到相似排队时延，进而实现公平带宽分配。在单瓶颈限定下证明了相似排队时延为公平带宽分配的充分条件。最后，通过两组仿真实验验证了算法的有效性。 |
|---|---|
| Bibliography: | 51-1196/TP Song Lihua1, Wang Haitao2 , Zhang Guomin1, Wang Chenyu2 （1. College of Command Information Systems, 2. Information Management Center, PLA University of Science ＆ Technology, Nanjing 210007, China） fair bandwidth allocation; multi-path routing; queuing delay; queuing packets; Max-Min 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 propose |
| ISSN: | 1001-3695 |
| DOI: | 10.3969/j.issn.1001-3695.2017.06.052 |