Maximum Throughput Routing of Traffic in the Hose Model
| Autor: | S. Sengupta, T. V. Lakshman, M. Kodialam |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Mathematical optimization
Polynomial Linear programming Robustness (computer science) business.industry Computer science Hose model ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Computer Science::Programming Languages Astrophysics::Earth and Planetary Astrophysics business Computer network |
| Zdroj: | INFOCOM |
| DOI: | 10.1109/infocom.2006.91 |
| Popis: | A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|