Search

OVPN（光虚拟专用网）中软管模型的提出带来了一个最优化的问题,即怎样在保证服务质量的前提下尽量减少为OVPN用户预留的总带宽。文章基于传统HIST（分层迭代生成树）算法,提出了名为BCST（带宽限制生成树）的近似求解算法。该算法通过迭代算法遍历整个网络的物理拓扑的所有生成树,并采取剪枝方案找到代价和时延都相对较小的生成树。最后,通过实例仿真对比验证了BCST算法的可行性。

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)