PROJECT TITLE :

An Overlay Architecture for Throughput Optimal Multipath Routing - 2017

ABSTRACT:

Legacy networks are usually designed to work with easy single-path routing, just like the shortest path, that is understood to be throughput suboptimal. On the opposite hand, previously proposed throughput optimal policies (i.e., backpressure) need each device in the network to make dynamic routing decisions. In this paper, we tend to study an overlay design for dynamic routing, such that solely a subset of devices (overlay nodes) need to make the dynamic routing decisions. We have a tendency to verify the essential collection of nodes that has to bifurcate traffic for achieving the most multi-commodity network throughput. We have a tendency to apply our optimal node placement algorithm to many graphs and the results show that a little fraction of overlay nodes is sufficient for achieving maximum throughput. Finally, we propose a threshold-based mostly policy (BP-T) and a heuristic policy (OBP), that dynamically management traffic bifurcations at overlay nodes. Policy BP-T is proved to maximise throughput for the case when underlay paths do no overlap. In all studied simulation scenarios, OBP not only achieves full throughput but additionally reduces delay compared to the throughput optimal backpressure routing.