DocumentCode
3129430
Title
Networking link enhancement with minimum costs
Author
Yang, Chyan ; Kung, Chih-Fu
Author_Institution
Dept. of Electr. & Comput. Eng., US Naval Postgraduate Sch., Monterey, CA, USA
fYear
1990
fDate
30 Sep-3 Oct 1990
Firstpage
1125
Abstract
One-, two-, and three-way linear search algorithms that are used to find the optimal link enhancement strategy for a given investment are discussed, and solutions to examples of each are presented. The best-of-group heuristic algorithm (BGH), which finds sets of solutions and selects the best one, is proposed. A comparison of solutions found using the heuristic algorithm to those found using the optimal algorithm indicates that the heuristic provides exactly the same solution as the optimal algorithm does in 79.68% of the cases
Keywords
computer networks; search problems; telecommunications computing; best-of-group heuristic algorithm; computer network; linear search algorithms; minimum costs; networking link enhancement; optimal link enhancement strategy; Communication networks; Computer networks; Costs; Investments; Joining processes; NP-complete problem; Operations research; Robustness; Testing; Time sharing computer systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 1990. MILCOM '90, Conference Record, A New Era. 1990 IEEE
Conference_Location
Monterey, CA
Type
conf
DOI
10.1109/MILCOM.1990.117587
Filename
117587
Link To Document