Name
Abstract | ||
|---|---|---|
Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multipath maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/CCNC.2007.100 | Las Vegas, NV, USA |
Keywords | DocType | ISBN |
network topology,bandwidth,flow control,resource management,routing,quality of service,communication networks,throughput | Conference | 1-4244-0667-6 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsai, Dan-Han | 1 | 0 | 0.34 |
| Wei K. Tsai | 2 | 103 | 11.47 |
| P. Huang | 3 | 47 | 3.38 |