Routing and capacity assignment in backbone communication networks under time varying traffic conditions
type: Item
instance of: scholarly article
title: Routing and capacity assignment in backbone communication networks under time varying traffic conditions
zbMATH Open document ID: 0998.90507
DOI: 10.1016/S0377-2217(98)00162-3
author: Ali Amiri
author: Hasan Pirkul
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 1829860
zbMATH Keywords: communication networks
zbMATH Keywords: time varying traffic conditions
zbMATH Keywords: response time
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: Routing and capacity assignment in backbone communication networks
cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
cites work: Design of private backbone networks. I: Time varying traffic
cites work: A Descent Algorithm for the Multihour Sizing of Traffic Networks
cites work: Backbone Network Design Tools with Economic Tradeoffs
cites work: Synthesis of a Communication Network
cites work: Q4101255
cites work: A linear programming model for design of communications networks with time varying probabilistic demands
cites work: Network design and dynamic routing under queueing demand
cites work: Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
cites work: Primary and Secondary Route Selection in Backbone Computer Networks
cites work: Q5566712
cites work: A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
cites work: Q3693257
cites work: On the selection of primary paths for a communication network
full work available at URL: s0377-2217(98)00162-3
OpenAlex ID: W2137485197
description: scientific article; zbMATH DE number 1829860