In this paper, survivable VP planning is considered for preplanned restoration in ATM networks. Four restoration schemes are evaluated and compared. Both link protection and node protection are studied. Problems are formulated as several combinatorial optimization problems in which the objective is to minimize the bandwidth usage and the constraints are required to satisfy the survivability, end-to-end hop number and physical capacity limitations. Lagrangian relaxation and subgradient methods are used to obtain heuristic solutions and provide a lower bound to assess the quality of the solutions. Numerical results are reported, and the advantages and disadvantages of different protection schemes are discussed.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。