Name
Abstract | ||
|---|---|---|
This paper studies the performance difference of joint routing and congestion control when either single-path routes or multipath routes are used. Our performance metric is the total utility achieved by jointly optimizing transmission rates using congestion control and paths using source routing. In general, this performance difference is strictly positive and hard to determine--in fact an NP-hard problem. To better estimate this performance gap, we develop analytical bounds to this "cost of not splitting" in routing. We prove that the number of paths needed for optimal multipath routing differs from that of optimal single-path routing by no more than the number of links in the network. We provide a general bound on the performance loss, which is independent of the number of source-destination pairs when the latter is larger than the number of links in a network. We also propose a vertex projection method and combine it with a greedy branch-and-bound algorithm to provide progressively tighter bounds on the performance loss. Numerical examples are used to show the effectiveness of our approximation technique and estimation algorithms. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TNET.2011.2150761 | IEEE/ACM Trans. Netw. |
Keywords | DocType | Volume |
Routing,Resource management,Aggregates,Loss measurement,Estimation,Upper bound,Joints | Journal | 19 |
Issue | ISSN | Citations |
6 | 1063-6692 | 9 |
PageRank | References | Authors |
0.51 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meng Wang | 1 | 9 | 0.51 |
| Chee Wei Tan | 2 | 1369 | 92.01 |
| Weiyu Xu | 3 | 563 | 54.45 |
| Ao Tang | 4 | 254 | 18.74 |