Route selection in backbone data communication networks
Computer Networks and ISDN Systems
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Deterministic and adaptive routing policies in packet-switched computer networks
DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
Research: Routing in packet-switched communication networks
Computer Communications
Topology design and bandwidth allocation in ATM nets
IEEE Journal on Selected Areas in Communications
Joint optimization of data network design and facility selection
IEEE Journal on Selected Areas in Communications
Appia: Automatic Storage Area Network Fabric Design
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
A tabu search algorithm for the routing and capacity assignment problem in computer networks
Computers and Operations Research
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
ICCS'03 Proceedings of the 2003 international conference on Computational science
Appia: automatic storage area network fabric design
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Designing data storage tier using Integer Programing
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Discrete capacity and flow assignment algorithms with performance guarantee
Computer Communications
A genetic algorithm based approach to route selection and capacity flow assignment
Computer Communications
Users' responsiveness in the price-controlled best-effort QoS model
Computer Communications
| Hi-index | 0.24 |
This paper studies the problem of designing a packet-switched communication network with tradeoffs between link costs and response time to users. It consists of assigning capacities to links in the network and determining the routes used by messages for all communicating node pairs in order to minimize total link fixed and variable costs. A tradeoff between link costs and response time to users is achieved by including a constraint that sets an upper limit on the average link queueing delay in the network. The topology of the network and the end-to-end traffic requirements are given. The problem is formulated as a nonlinear integer programming model. Unlike most of previous models, where the best route for a communicating node pair is restricted to a set of prespecified candidate routes, our model considers all possible routes for every communicating node pair. An efficient heuristic based on a Lagrangean relaxation of the problem is developed to generate feasible solutions. The results of extensive computational experiments across a variety of previously used networks are reported. These results indicate that the solution procedure is effective for a wide range of traffic loads and cost structures.