Optimal routing for multiclass networks

DOI10.1155/2011/645954MaRDI QIDQ666417zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hisao Kameda, Jie Li, Eitan Altman

Publication date 8 March 2012

Published in Advances in Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2011/645954

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Review text

Summary: Overall optimal routing is considered along with individually optimal routing for networks with nodes interconnected in a generally configured manner and with multiple classes of users. The two problems are formulated, and we discuss the mutual equivalence between the problems, the existence and uniqueness of solutions, and the relation between the formulations with path and link flow patterns. We show that a link-traffic loop-free property holds within each class for both individually and overall optimal routing for a wide range of networks, and we show the condition that characterizes the category of networks for which the property holds.

Recommendations

• scientific article; zbMATH DE number 2202834
• Optimal Dynamic Routing in Multidestination Networks
• Optimal dynamic routing in communication networks with continuous traffic
• scientific article; zbMATH DE number 934460
• Routeing in a Network with Multi-Class Links

Cites work

• A Minimum Delay Routing Algorithm Using Distributed Computation
• Braess-like paradoxes in distributed computer systems
• Convex Analysis
• scientific article; zbMATH DE number 3954640 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 2202834 (Why is no real title available?)
• Mathematical optimization and economic theory
• On the convergence of descent methods for monotone variational inequalities
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Optimal static load balancing in distributed computer systems
• Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
• Potential games
• The flow deviation method: An approach to store‐and‐forward communication network design
• Traffic assignment problem for a general network

Cited in

(6)

• Routeing in a Network with Multi-Class Links
• scientific article; zbMATH DE number 3872452 (Why is no real title available?)
• Optimal Dynamic Routing in Multidestination Networks
• scientific article; zbMATH DE number 934460 (Why is no real title available?)
• scientific article; zbMATH DE number 2202834 (Why is no real title available?)
• Multi-path routing and resource allocation in active network

This page was built for publication: Optimal routing for multiclass networks

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