Network design and dynamic routing under queueing demand

DOI10.1007/BF01920306zbMath0576.90030MaRDI QIDQ3696826

No author found.

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

capacity; Dantzig-Wolfe decomposition; optimal; sink; telecommunications networks; trunk; multicommodity network; random flow; deterministic dynamic routing; Erlang difference distribution method; nonhierarchical network; routing and design method; stochastic dynamic routing; time-varying flow requirements

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C05: Linear programming

90B15: Stochastic network models in operations research

90B22: Queues and service in operations research

90B10: Deterministic network models in operations research

Related Items

A polynomial-time algorithm for message routing in hierarchical communication networks, Design of private backbone networks. I: Time varying traffic, Design of private backbone networks. II: Time varying grouped traffic, Algorithms for network piecewise-linear programs: A comparative study, Routing and capacity assignment in backbone communication networks under time varying traffic conditions

Cites Work

• A Suggested Computation for Maximal Multi-Commodity Network Flows
• An Application of Generalized Linear Programming to Network Flows
• Multi-Terminal Network Flows
• A linear programming model for design of communications networks with time varying probabilistic demands
• On Characterizing the Extrema of a Function of Two Variables, One of Which is Discrete
• Multicommodity network flows—A survey
• Synthesis of a Communication Network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item