Path packing problems in a telecommunication network통신 네트위크에서 경로선택 문제에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 443
  • Download : 0
This thesis considers two types of path packing problems which arise in a telecommunication network. One is the bandwidth packing problem and the other is the primary path selection problem. It is shown that the latter can be transformed to the former. The bandwidth packing problem can be formulated as a 0-1 integer programming problem with exponentially many variables. After we initially formulate the problem by finding k-shortest paths for each call, we use the delayed column generation technique to solve the formulation optimally. We find minimal cover inequalities violated by the current solution and do lifting to strengthen the inequalities found. We add the constraints found to the formulation and use the column generation technique iteratively. The algorithm is tested on problems of several network configurations. Computational results show that the algorithm performs well in solving the bandwidth packing problem. Moreover, the approach can be used in solving other problems arising in communication networks which include path selection as subproblem.
Advisors
Park, Sung-Sooresearcher박성수researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1994
Identifier
69459/325007 / 000923004
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1994.2, [ 47 p. ]

URI
http://hdl.handle.net/10203/41416
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=69459&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
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