Routing and capacity assignment in backbone communication networks under time varying traffic conditions

DOI10.1016/S0377-2217(98)00162-3zbMath0998.90507OpenAlexW2137485197MaRDI QIDQ1847143

Ali Amiri, Hasan Pirkul

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00162-3

zbMATH Keywords

response timecommunication networksheuristictime varying traffic conditions

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items

Survivable network design with demand uncertainty, A tabu search algorithm for the routing and capacity assignment problem in computer networks, An efficient heuristic to dimension large-scale hybrid optoelectronic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Design of private backbone networks. I: Time varying traffic
• Routing and capacity assignment in backbone communication networks
• Network design and dynamic routing under queueing demand
• On the selection of primary paths for a communication network
• A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
• A linear programming model for design of communications networks with time varying probabilistic demands
• Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
• Backbone Network Design Tools with Economic Tradeoffs
• A Descent Algorithm for the Multihour Sizing of Traffic Networks
• Primary and Secondary Route Selection in Backbone Computer Networks
• Synthesis of a Communication Network