Affiliations Dept of CSE, Pragati Engineering College, Kakinada
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.
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.
 D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, â€œResilient overlay networks,â€ Proceedings of SOSP 2001, Oct. 2001.
 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.
 D. G. Andersen, A. C. Snoeren, and H. Balakrishnan, â€œBest-path vs. multi-path overlay routing,â€ Proceedings of IMC 2003, Oct. 2003.
 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.
 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.
 S. Seetharaman and M. Ammar, â€œCharacterizing and mitigating inter-domain policy violations in overlay routes,â€ Proceedings of ICNP 2006, pp.259â€“268, Nov. 2006.
 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.
 IETF ALTO Working Group web site. available at http:// datatracker.ietf.org/wg/alto/.
 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.
 Planet Lab web site. available at http://www.planet-lab.org/.
 G. Hasegawa, Y. Hiraoka, and M. Murata, â€œEffectiveness of overlay routing based on delay and bandwidth information,â€
 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.
 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.
 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.
 M. Kamel, C. Scoglio, and T. Easton, â€œOptimal topology design for overlay networks,â€ Proceedings of NETWORKING 2007, pp.714â€“ 725, May 2007.
 R. Cohen and D. Raz, â€œCost effective resource allocation of overlay routing relay nodes,â€ Proceedings of INFOCOM 2011, 2011.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.