Optimal Routing for Multiclass Networks

Hisao Kameda, Jie Li and Eitan Altman

Advances in Operations Research, 2011, vol. 2011, 1-21

Abstract:

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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2011/645954.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2011/645954.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:645954

DOI: 10.1155/2011/645954

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().