Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0140-3664(03)00037-9 | Computer Communications |
Keywords | Field | DocType |
Routing,Capacity and flow assignment,Separable convexification,Nonconvex multicommodity flow problem,Discrete capacity allocation | Mathematical optimization,Heuristic,Computer science,Flow (psychology),Performance guarantee,Algorithm,Network topology,Total cost,Minimum-cost flow problem | Journal |
Volume | Issue | ISSN |
26 | 10 | Computer Communications |
Citations | PageRank | References |
3 | 0.55 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. P. M. Ferreira | 1 | 29 | 4.01 |
| H. P. Luna | 2 | 55 | 7.39 |