Fairness considerations with algorithms for elastic traffic routing
| Autor: | Tibor Cinkler, Péter Laborczi, Michał Pióro |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2004 |
| Předmět: | |
| Zdroj: | Journal of Telecommunications and Information Technology, Iss 2 (2004) |
| Druh dokumentu: | article |
| ISSN: | 1509-4553 1899-8852 |
| DOI: | 10.26636/jtit.2004.2.246 |
| Popis: | The bit rate of modern applications typically varies in time. We consider the traffic elastic if the rate of the sources can be controlled as a function of free resources along the route of that traffic. The objective is to route the demands optimally in sense of increasing the total network throughput while setting the rates of sources in a fair way. We propose a new fairness definition the relative fairness that handles lower and upper bounds on the traffic rate of each source and we compare it with two other known fairness definitions, namely, the max-min and the proportional rate fairness. We propose and compare different routing algorithms, all with three types of fairness definitions. The algorithms are all a tradeoff between network throughput, fairness and computational time. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|