Design of reconfigurable networks with link failures allowed링크 고장을 고려한 재구성 가능망의 설계

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 991
  • Download : 0
This thesis investigates three different models of configuring both backbone and logical networks in various reconfigurable networks with unreliable links. In those models, the network reliability issue, as well as the network capacity expansion issue, is analytically treated to take into account routing and rerouting polices desired at each link failure occurrence. Moreover, the models consider economic trade-offs between backbone link capacity expansion cost and inferior network performance penalty in a situation where the associated networks are subject to link failures. The first model considers the problem of configuring backbone and logical networks in a reconfigurable circuit-switched network where network topological states are subject to link failures, which is formulated as a zero-one nonlinear mixed integer programming problem. The objective of the problem is to find jointly the link capacities of the backbone network, the physical paths for logical links on the backbone network, the capacities of the logical links, and the routings on the logical network that minimize the network cost, given the topology of a backbone network and its associated logical network topologies for each network operation (failure) state, and the traffic demand between each origin-destination pair. In the problem, the network cost includes the backbone link capacity expansion cost, the expected lost-call traffic cost and the hop cost. The expected lost-call traffic and the number of hops are incorporated to reflect the network performance in circuit-switched networks. A solution procedure is derived based on a Lagrangean relaxation that generates feasible solutions, together with lower bounds on the optimal objective function value. Two heuristic methods, for generating a good initial primal feasible solution and for improving the upper bounds, are also incorporated into the solution procedure. The solution procedures are exploited and their efficiencies are tested with va...
Advisors
Sung, Chang-Supresearcher성창섭researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1996
Identifier
108872/325007 / 000845246
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업공학과, 1996.8, [ vii, 123 p. ]

Keywords

Logical configuration; 휴리스틱 알고리즘; 용량 확장; 백본 망; 재구성 가능망; 논리망 구성; Heuristic algorithm; Reconfigurable network; Backbone network; Capacity expansion

URI
http://hdl.handle.net/10203/40456
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=108872&flag=dissertation
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0