An overlay architecture for throughput optimal multipath routing java project
Legacy networks are often designed to operate
with simple single-path routing, like the shortest path, which is known to be
throughput suboptimal. On the other hand, previously proposed throughput
optimal policies (i.e., backpressure) require every device in the network to
make dynamic routing decisions. In this paper, we study an overlay architecture
for dynamic routing, such that only a subset of devices (overlay nodes) need to
make the dynamic routing decisions. We determine the essential collection of nodes
that must bifurcate traffic for achieving the maximum multi-commodity network
throughput. 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.
OUTPUT :
1 comments:
commentsvery informative blog and very useful for readers. making us to learn more from your blog.thanks for sharing this information
ReplyJava Training in Chennai
Dot Net Training in Chennai
Cloud Computing Training in Chennai
Digital Marketing Training in Chennai
thank you for your comment
pls call me on 8125424511