Efficient overlaynodes selection for data transmission through multipath in network

Damisetty Bhagya Tulasi, V. Aditya Ramalingeswararao


We control the vital collection of nodes that must bifurcate traffic for attaining the maximum multi commodity net throughput. We put on our optimal node placement algorithm to numerous graphs and the consequences show that a small portion of overlay nodes is adequate for attaining maximum throughput. To conclude, we suggest a heuristic policy (OBP), which enthusiastically controls traffic bifurcations at overlay nodes. In all premeditated simulation scenarios, OBP not only accomplishes full throughput, but also diminishes delay in judgment to the throughput optimal backpressure routing.


D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. ACM SOSP, Oct. 2001.

L. Bui, R. Srikant, and A. Stolyar. Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing. In Proc. IEEE INFOCOM, April 2009.

B. Fortz and M. Thorup. Internet traffic engineering by optimizing ospf weights. In IEEE INFOCOM, 2000.

J. Han, D. Watson, and F. Jahanian. Topology aware overlay networks. In Proc. IEEE INFOCOM, March 2005.

W. Khan, L. B. Le, and E. Modiano. Autonomous routing algorithms for networks with wide-spread failures.In Proc. IEEE MILCOM, Oct. 2009.

M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic power allocation and routing for time varying wireless networks.In Proc. IEEE INFOCOM, April 2003.

M. E. J Newman. Networks: An Introduction. Oxford University Press, Inc., New York, NY, USA, 2010.

L. L. Peterson and B. S. Davie. Computer Networks: A Systems Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 4th edition, 2007.

J. Ryu, L. Ying, and S. Shakkottai. Back-pressure routing for intermittently connected networks. In Proc. IEEE INFOCOM, March 2010.

L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio

networks. IEEE Trans. Auto. Control, pages 1936–1948, Dec. 1992.

D. Xu, M. Chiang, and J. Rexford. Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering. IEEE/ACM Transactions on Networking, 19(6):1717–1730, 2011.

L. Ying, S. Shakkottai, and A. Reddy.On combining shortest-path and back-pressure routing over multihop wireless networks.In Proc. IEEE INFOCOM, April 2009.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.