標題: LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES
作者: YANG, C
管理科學系
資訊管理與財務金融系 註:原資管所+財金所
Department of Management Science
Department of Information Management and Finance
關鍵字: COMMUNICATION NETWORK;LINK ENHANCEMENT;CANDIDATE SET SEARCH;CONSTRAINED RANGE SEARCH
公開日期: 1-Nov-1992
摘要: A communication network's survivability and routability 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 We show that the link enhancement problem, for a given investment, is NP-complete. Explanation of the proposed heuristic, for near-optimal solution, is presented with several examples. Improvements on previous work using constrained range and reduced candidate set searches are introduced and clarified A review of pertinent previous work, problem formulation, algorithm presentation, and discussion of computational issues are also provided.
URI: http://hdl.handle.net/11536/3248
ISSN: 0140-3664
期刊: COMPUTER COMMUNICATIONS
Volume: 15
Issue: 9
起始頁: 573
結束頁: 580
Appears in Collections:Articles