A new secure multipath routing using sub-set of overlay nodes to minimize delay

We study 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 segment of overlay nodes is sufficient for achieving maximum throughput. 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