The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
A Survey of Algorithms for Convex Multicommodity Flow Problems
Management Science
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A system for the design of packet-switched communication networks with economic tradeoffs
Computer Communications
Research: Combined channel allocation and routing algorithms in packet switched networks
Computer Communications
Bounds for global optimization of capacity expansion and flow assignment problems
Operations Research Letters
| Hi-index | 0.24 |
The joint problem of selecting routing and a capacity value for each link in networks is considered. We apply an alternative approach for some models that have been addressed to (store-and-forward) packet-switched computer network discrete capacity allocation and routing problems. The network topology and traffic characteristics are supposed to be given. The goal is to obtain a feasible solution with minimum total cost, where the total cost include both leasing capacity and congestion costs. Heuristic algorithms with performance guarantee based on lower bounds and on the separability of the objective function are proposed. Experiments were conducted to verify the performance and to confirm the efficiency of the proposed algorithms.