摘要
生存性是光传送网络中亟待解决的问题。研究了光传送Ｍｅｓｈ网的工作流量及所需的空闲容量的最佳分布问题，对问题进行了形式化描述，其目的是对给定的恢复需求使得后备容量最小，并根据后备容量的价值对不同的恢复策略进行比较，为实际网络的设计提供了一定的指导。
Survivability is an important issue in OTN. This paper studies the capacity and flow assignment problem. The problem is formulated as a linear programming problem. The objective is to minimize the spare capacity for given restoration requirement.This paper compares several restoration strategies in term of spare cost. This provides useful guidance for real network design.
出处
《计算机工程与设计》
CSCD
2002年第4期38-41,共4页
Computer Engineering and Design
