摘要
OVPN(光虚拟专用网)中软管模型的提出带来了一个最优化的问题,即怎样在保证服务质量的前提下尽量减少为OVPN用户预留的总带宽。文章基于传统HIST(分层迭代生成树)算法,提出了名为BCST(带宽限制生成树)的近似求解算法。该算法通过迭代算法遍历整个网络的物理拓扑的所有生成树,并采取剪枝方案找到代价和时延都相对较小的生成树。最后,通过实例仿真对比验证了BCST算法的可行性。
The introduction of a hose model to the Optical Virtual Private Network（OVPN）brings about a topic of optimization,i.e.minimizing the total bandwidth reserved for its users on the premise of ensuring the QoS.On the basis of the traditional Hierarchical Iterative Spanning Tree（HIST）algorithm,this paper proposes an approximate solution algorithm,named Bandwidth Constraint Spanning Tree（BCST）,which traverses all the spanning trees of the entire network physical topology by using the iterative method,and by adopting apruning scheme,finds the spanning trees with relatively smaller cost and time delay.Finally,it verifies the feasibility of the BCST algorithm by practical case simulation and comparison.
出处
《光通信研究》
北大核心
2014年第4期20-23,共4页
Study on Optical Communications
