Network design and dynamic routing under queueing demand

DOI10.1007/BF01920306MaRDI QIDQ3696826zbMATH OpenFDO

Authors

Publication date 1985

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

Full work available at URL https://doi.org/10.1007/BF01920306

zbMATH Keywords

capacityDantzig-Wolfe decompositiondeterministic dynamic routingErlang difference distribution methodmulticommodity networknonhierarchical networkoptimalrandom flowrouting and design methodsinkstochastic dynamic routingtelecommunications networkstime-varying flow requirementstrunk

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Linear programming (90C05) Applications of mathematical programming (90C90)

Recommendations

• A model for the design of a minimum-cost telecommunications network
• scientific article; zbMATH DE number 3934740
• Multicommodity network flow models and algorithms in telecommunications
• Optimization of dynamic routing networks
• Optimal choice of the capacities of telecommunication networks to provide QoS-routing

Cites work

• A linear programming model for design of communications networks with time varying probabilistic demands
• A suggested computation for maximal multi-commodity network flows
• An Application of Generalized Linear Programming to Network Flows
• Graph theory with applications
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3497598 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3430330 (Why is no real title available?)
• Multi-Terminal Network Flows
• Multicommodity network flows—A survey
• On Characterizing the Extrema of a Function of Two Variables, One of Which is Discrete
• Synthesis of a Communication Network

Cited in

(20)

• 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
• rDAN: toward robust demand-aware network designs
• Deterministic flow routing and oligopolistic competition in dynamic data networks: modeling and numerical solution using multigrid optimization techniques
• Optimal routing parameters for queueing networks: their determination methods
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions
• Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
• Dynamic online QoS routing schemes: Performance and bounds
• A model for the design of a minimum-cost telecommunications network
• Lexicographical minimization of routing hops in telecommunication networks
• scientific article; zbMATH DE number 1003291 (Why is no real title available?)
• Internet protocol network design with uncertain demand
• scientific article; zbMATH DE number 2064383 (Why is no real title available?)
• Optimal network design with end-to-end service requirements
• scientific article; zbMATH DE number 822904 (Why is no real title available?)
• scientific article; zbMATH DE number 6403125 (Why is no real title available?)
• Queuing networks with routing calls at nodes

This page was built for publication: Network design and dynamic routing under queueing demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696826)