CONFIGURING BOTH BACKBONE AND LOGICAL NETWORKS OF A RECONFIGURABLE NETWORK WITH LINK FAILURES ALLOWED

This paper considers a problem of configuring both backbone and logical networks in a reconfigurable circuit-switched network where links are subject to failures. The objective is to design feasible backbone and logical networks at least cost where the cost includes backbone link capacity expansion...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering optimization Ročník 26; číslo 3; s. 227 - 249
Hlavní autoři: SUNG, CHANG SUP, LEE, JONG HYUP
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.06.1996
Témata:
configuration
heuristic algorithm
Lagrangean relaxation
Net work design
reliability
telecommunication networks
ISSN:0305-215X, 1029-0273
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers a problem of configuring both backbone and logical networks in a reconfigurable circuit-switched network where links are subject to failures. The objective is to design feasible backbone and logical networks at least cost where the cost includes backbone link capacity expansion cost, lost-call traffic penalty, and hop cost (nodal processing cost). The problem is formulated as a zero-one non-linear mixed integer programming problem, for which a solution procedure is developed by use of a Lagrangean relaxation technique and heuristic methods exploited for improving the lower and upper bounds of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.
ISSN:0305-215X
1029-0273
DOI:10.1080/03052159608941120