CFP last date
20 May 2024
Reseach Article

Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP

by Sheetal Dadhich, S.s. Joshi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 118 - Number 2
Year of Publication: 2015
Authors: Sheetal Dadhich, S.s. Joshi
10.5120/20720-3065

Sheetal Dadhich, S.s. Joshi . Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP. International Journal of Computer Applications. 118, 2 ( May 2015), 27-29. DOI=10.5120/20720-3065

@article{ 10.5120/20720-3065,
author = { Sheetal Dadhich, S.s. Joshi },
title = { Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 118 },
number = { 2 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 27-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume118/number2/20720-3065/ },
doi = { 10.5120/20720-3065 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:00:37.952057+05:30
%A Sheetal Dadhich
%A S.s. Joshi
%T Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP
%J International Journal of Computer Applications
%@ 0975-8887
%V 118
%N 2
%P 27-29
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

From last many years traffic in internet is increasing very rapidly. But as internet in growing up we required to maintain quality and have to increase the efficiency of network. Also we should concentrate on efficient mechanism of flooding, load balancing & resource utilization. In today's internet world mostly Link state routing protocols like Open Shortest Path First (OSPF) routing protocol is used which is based on link weighs, as optimizing link weight in OSPF to the group traffic is well-know NP-Hard problem. In the consideration of current situation of the network we introduce a new method called Real time traffic splitting & efficient flooding mechanism in network with the help of OSPF. We will reduce the time required to compute the weight on link and find the best links to forward the packet within short time. The concept is to first minimize link state advertisement packets & split the traffic over first few multiple shortest paths to reach to destination. As traffic increases our protocol automatically sends packet through next shortest path present in the network. We can increase the performance of network & achieve optimal traffic engineering. As compare with the OSPF packet forwarding mechanism is same which is destination based & hop by hop forwarding just difference is in splitting mechanism.

References
  1. Mr. R. S. Dayama and Prof. S. P. Pingat "Optimal TE in LSRP", IJCA, Vol 68-NO. 18 April 2013
  2. D. Xu, M. Chiang, and J. Rexford, DEFT: Distributed exponentially weighted flow splitting, in INFOCOM07, Anchorage, AK, May 2007.
  3. Dahai Xu, Member, IEEE, Mung Chiang, Senior Member, Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering, IEEE, and Jennifer Rexford, Senior Member, IEEE, Fellow, ACM, 2011.
  4. Seung Hwan Lee and Seung Hyong Rhee Efficient for Reliability in Link state routing protocol IEEE 978-1-4673-4828-7/12/ 2012.
  5. B. Fortz and M. Thorup, Increasing Internet capacity using local search, Computational Optimization and Applications, vol. 29, no. 1, pp. 1348, 2004.
  6. Antic, M. Sch. of Electr. Eng. , Belgrade Univ. , Belgrade, Serbia Two phase load balanced routing using OSPF, , IEEE Journal Jan 2010.
  7. Shekhar Srivastava, Gaurav Agrawal, Michal Pioro and Deepa Medhi, Determining Link Weight System under Various Objectives for OSPF Networks using a Lagrangian Relazation-Based Approach, IEEE transactions on Network and servicemanagement, 2005.
  8. Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss, Better Alternatives to OSPF Routing, Dec 2004.
  9. Ari Lappetelainen, Equal Cost Multipath Routing in IP Networks, Faculty of Electronics, Communications and Automation, March 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Open Shortest Path First (OSPF) Efficient flooding Traffic Engineering.