Browsing by Author "LIN, RY"

Now showing 1 - 3 of 3

BUDGET MANAGEMENT OF NETWORK CAPACITY PLANNING BY SEARCHING CONSTRAINED RANGE AND DOMINANT SET
(1994-08-01)
YANG, CY
;
LIN, RY
;
交大名義發表
;
管理學院
;
National Chiao Tung University
A communication network's reliability, survivability, and interconnectivity are primarily based on the degree of interconnection between the existing nodes of the network. Enhancement of these characteristics can be obtained by adding direct communication links between nodes of the network. This process is generally subject to a budget constraint. From the service provider's perspective, enhancing the interconnectivity of heterogeneous networks is part of operations evolution. However, the interconnectivity or link enhancement problem, for a given budget, is NP-complete. Decisions by considering multiple criteria improve previous work and may search only the constrained range. The constrained range is determined by a dominant set of multiple criteria. A review of pertinent previous work, problem formulation, algorithm presentation, and discussion of improving the computation time with compromising the optimality by using the multiple-criteria constrained range are also provided.
LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES - A REVISION
(1995-09-01)
LIN, RY
;
YANG, CY
;
管理科學系
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Management Science
This paper revises the CRCS algorithm proposed by Yang(1). In the constrained range search, we use the cost and performance of candidate links to obtain the exact link range of the optimal solution. Moreover, we use the concept of variable dominance to reduce the number of candidate links without loss of optimality. A comparison of results obtained using Yang's and the revised CRCS algorithm shows that the revised CRCS algorithm is superior to Yang's original version.
LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES - A REVISION
(1995-09-01)
LIN, RY
;
YANG, CY
;
管理科學系
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Management Science
This paper revises the CRCS algorithm proposed by Yang(1). In the constrained range search, we use the cost and performance of candidate links to obtain the exact link range of the optimal solution. Moreover, we use the concept of variable dominance to reduce the number of candidate links without loss of optimality. A comparison of results obtained using Yang's and the revised CRCS algorithm shows that the revised CRCS algorithm is superior to Yang's original version.