An Overlay Architecture for Throughput Optimal Multipath Routing
Abstract of An Overlay Architecture for Throughput Optimal Multipath Routing
An Overlay Architecture for Throughput Optimal Multipath Routing
An Overlay Architecture for Throughput Optimal Multipath Routing.On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions.
We apply our optimal node placement algorithm to several graphs and the results show that a small fraction of overlay nodes is sufficient for achieving maximum throughput.
Finally, we propose a threshold-based policy (BP-T) and a heuristic policy (OBP), which dynamically control traffic bifurcations at overlay nodes.
Policy BP-T is proved to maximize throughput for the case when underlay paths do no overlap.
In all studied simulation scenarios, OBP not only achieves full throughput but also reduces delay in comparison to the throughput optimal backpressure routing.
Conclusion
An Overlay Architecture for Throughput Optimal Multipath Routing,We study optimal routing in legacy networks where only a subset of nodes can make dynamic routing decisions, while the legacy nodes can forward packets only on pre-specified shortest-paths.We propose a necessary and sufficient condition for the overlay node placement to enable the full multicommodity throughput region.
Based on this condition, we devise an algorithm for optimal controllable node placement. We run the algorithm on large random graphs to show that very often a small number of intelligent nodes suffices for full throughput.
