Optimal routing for multiclass networks (Q666417): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57691382, #quickstatements; #temporary_batch_1710897659913
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the convergence of descent methods for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow deviation method: An approach to store‐and‐forward communication network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimum Delay Routing Algorithm Using Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5314907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment problem for a general network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess-like paradoxes in distributed computer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Optimization and Economic Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal static load balancing in distributed computer systems / rank
 
Normal rank

Latest revision as of 00:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimal routing for multiclass networks
scientific article

    Statements

    Optimal routing for multiclass networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 March 2012
    0 references
    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.
    0 references
    0 references
    0 references
    0 references