Optimal Routing for Multiclass Networks

Joint Authors

Li, Jie
Altman, Eitan
Kameda, Hisao

Source

Advances in Operations Research

Issue

Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-21, 21 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2011-07-06

Country of Publication

Egypt

No. of Pages

21

Main Subjects

Information Technology and Computer Science

Abstract EN

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.

American Psychological Association (APA)

Kameda, Hisao& Li, Jie& Altman, Eitan. 2011. Optimal Routing for Multiclass Networks. Advances in Operations Research،Vol. 2011, no. 2011, pp.1-21.
https://search.emarefa.net/detail/BIM-487825

Modern Language Association (MLA)

Kameda, Hisao…[et al.]. Optimal Routing for Multiclass Networks. Advances in Operations Research No. 2011 (2011), pp.1-21.
https://search.emarefa.net/detail/BIM-487825

American Medical Association (AMA)

Kameda, Hisao& Li, Jie& Altman, Eitan. Optimal Routing for Multiclass Networks. Advances in Operations Research. 2011. Vol. 2011, no. 2011, pp.1-21.
https://search.emarefa.net/detail/BIM-487825

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-487825