CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting

by R. S. Dayama, P. S. Swami, N. K. Sonkatale, S. G. Potdar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 16
Year of Publication: 2013
Authors: R. S. Dayama, P. S. Swami, N. K. Sonkatale, S. G. Potdar
10.5120/14246-2273

R. S. Dayama, P. S. Swami, N. K. Sonkatale, S. G. Potdar . Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting. International Journal of Computer Applications. 82, 16 ( November 2013), 12-14. DOI=10.5120/14246-2273

@article{ 10.5120/14246-2273,
author = { R. S. Dayama, P. S. Swami, N. K. Sonkatale, S. G. Potdar },
title = { Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 16 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 12-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number16/14246-2273/ },
doi = { 10.5120/14246-2273 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:57:53.485096+05:30
%A R. S. Dayama
%A P. S. Swami
%A N. K. Sonkatale
%A S. G. Potdar
%T Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 16
%P 12-14
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

To find out the shortest path from source to destination, Link State Routing Protocol (LSRP) uses the Open shortest path first algorithm, in OSPF if there is change in network topology, the LSRP generates the Link State Advertisement (LSA) packets. This LSA packet is send to every neighbor node except from which it accept. This mechanism is called the Flooding mechanism , due to this flooding mechanism all the node's will have the same database. If there are N nodes in the network then there is N (N-1) LSA packets are required for database synchronization. In this proposed System, it just not tied to reduce the number of LSA packets flooded into the network by constructing the minimal spanning tree but also it uses the traffic splitting mechanism to send the data. Also to achieve the stability in network it add the extra flooding link at the node, who have the degree of one. So this proposed method , minimize the LSA Overhead.

References
  1. A. Zinin & M. Shand ," Flooding optimizations in link-state routing protocols" IETF, draft-ietf-ospf-isis-flood-opt-01. txt.
  2. R. S. Dayama & S. P. Pingat ," Optimal Traffic Engineering in Link State Routing Protocols" International Journal of Computer Applications (0975 – 8887) Volume 68– No. 18, April 2013.
  3. Ari Lappetel•ainen, "Equal Cost Multipath Routing in IP Networks", Faculty of Electronics, Communications and Automation, March 2011.
  4. D. Xu, M. Chiang, and J. Rexford, "DEFT: Distributed exponentially weighted flow splitting," in INFOCOM'07, Anchorage, AK, May 2007.
  5. 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.
  6. B. Fortz and M. Thorup, "Increasing Internet capacity using local search," Computational Optimization and Applications, vol. 29, no. 1, pp. 13–48, 2004.
  7. Antic, M. Sch. of Electr. Eng. , Belgrade Univ. , Belgrade, Serbia " Two phase load balanced routing using OSPF", IEEE Journal Jan 2010.
  8. 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 service management, 2005.
  9. T. Miyamura , T. Kurimoto and M. Akoi ,"Enhancing the network Scalability of Link-State Routing Protocols by Reducing their Flooding Overhead," High Performance Switching and Routing 2003,pp263-268
Index Terms

Computer Science
Information Sciences

Keywords

Open Shortest Path First (OSPF) Link State Routing Protocol Link State Advertisement (LSA) Equal cost Multipath (ECMP) Flooding.

Powered by PhDFocusTM