Back to Current Issues

Robust Resource Allocation in Relay Node Networks for Optimization Process

G.Lalitha, Lakshmi Viveka K, Leelavathy Narkedamilly

Affiliations
Dept of CSE, Pragati Engineering College, Kakinada
:under process


Abstract
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.


Citation
G.Lalitha et.al," Robust Resource Allocation in Relay Node Networks for Optimization Process”, International Journal of Computer Engineering In Research Trends, 3(11):589-595,November-2016.


Keywords : Relay Node Networks ,One-jump Overlay Multipath Routing ,OVERLAY ROUTING

References
[1] D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, “Resilient overlay networks,” Proceedings of SOSP 2001, Oct. 2001.
 [2] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, “Construction of an efficient overlay multicast infrastructure for real-time applications,” Proceedings of INFOCOM 2003, April 2003.
 [3] D. G. Andersen, A. C. Snoeren, and H. Balakrishnan, “Best-path vs. multi-path overlay routing,” Proceedings of IMC 2003, Oct. 2003.
 [4] C.L.T. Man, G. Hasegawa, and M. Murata, “Monitoring overlay path bandwidth using an inline measurement technique,” IARIA International Journal on Advances in Systems and Measurements, vol.1, no.1, pp.50–60, Feb. 2008. 
[5] P. Rodriguez, S.M. Tan, and C. Gkantsidis, “On the feasibility of commercial, legal P2P content distribution,” SIGCOMM Computer Communication Review, vol.36, no.1, pp.75–78, Jan. 2006.
[6] S. Seetharaman and M. Ammar, “Characterizing and mitigating inter-domain policy violations in overlay routes,” Proceedings of ICNP 2006, pp.259–268, Nov. 2006.
 [7] T. Karagiannis, P. Rodriguez, and K. Papagiannaki, “Should Internet service providers fear peer-assisted content distribution?,” Proceedings of IMC 2005, pp.6–6, Oct. 2005. 
[8] IETF ALTO Working Group web site. available at http:// datatracker.ietf.org/wg/alto/.
 [9] H. Xie, Y. R. Yang, A. Krishnamurthy, Y. G. Liu, and A. Silberschatz, “P4P: Provider portal for applications,” SIGCOMM Computer Communication Review, vol.38, no.4, pp.351–362, Oct. 2008. 
[10] Planet Lab web site. available at http://www.planet-lab.org/. 
[11] G. Hasegawa, Y. Hiraoka, and M. Murata, “Effectiveness of overlay routing based on delay and bandwidth information,”  
[12] S. J. Lee, S. Banerjee, P. Sharma, P. Yalagandula, and S. Basu, “Bandwidth-aware routing in overlay networks,” Proceedings of INFOCOM 2008, pp.1732–1740, April 2008. 
[13] G. Smaragdakis, V. Lekakis, N. Laoutaris, A. Bestavros, J.W. Byers, and M. Roussopoulos, “EGOIST: overlay routing using selfish neighbor selection,” Proceedings of CoNEXT 2008, pp.1–12, Dec. 2008.
 [14] Z. Li and P. Mohapatra, “QRON: QoS-aware routing in overlay networks,” IEEE Journal on Selected Areas in Communications, vol.22, no.1, pp.29–40, Jan. 2004.
[15] M. Kamel, C. Scoglio, and T. Easton, “Optimal topology design for overlay networks,” Proceedings of NETWORKING 2007, pp.714– 725, May 2007.
[16] R. Cohen and D. Raz, “Cost effective resource allocation of overlay routing relay nodes,” Proceedings of INFOCOM 2011, 2011.


DOI Link : Not yet assigned

Download :
  V3I1105.pdf


Refbacks :

Quick Links


DOI:10.22362/ijcert


Science Central

Score: 13.30



Submit your paper to editorijcert@gmail.com

>