IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 4 - Issue 2, February 2015 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Performance Analysis Between Distance Vector Algorithm (DVA) & Link State Algorithm (LSA) For Routing Network

[Full Text]

 

AUTHOR(S)

Asmaa Shaker Ashoor

 

KEYWORDS

Index terms: LSA, DVA, routing, network traffic, comparison, simulation, analysis.

 

ABSTRACT

Abstract: In this paper, we survey the public presentation between two adaptive routing algorithms: Link state algorithm (LSA), which is centralized algorithm and Distance vector algorithm (DVA), which is distributed algorithm. The primary purpose of this paper is to compare two dynamic routing algorithms. Besides, we represent an overview of these algorithms distinguish similarities and differences between (LSD) & (DVA). A major part of this paper is surveys of these algorithms, and analysis the results.

 

REFERENCES

[1] Larry L. Peterson, Bruce S. Davie, "Computer Networks: A Systems Approach," 3rd Edition, Morgan Kaufmann, MIT, 2003.

[2] Andrew S. Tanenbaum, "Computer Networks, "Fourth Edition, New jersey, Prentice Hall, Inc., 2003.

[3] James F. Kurose & K. W. Ross, "Computer Networking: A Top-down Approach Featuring the internet," 2nd Ed, Peaison Education Asia, 2003.

[4] V. Gambiroza, P. Yuan, L. Balzano, Y. Liu, S. Sheafor, and E. Knightly, "Design, Analysis, and Implementation of DVSR: A Fair High-Performance Protocol for packet Rings," In IEEE/ACM Transaction on Network, Vol. 12, No. 1, 2004.

[5] William Stalling, "Data and Computer Communications, pearson Education, Inc., Publishing as Prentice Hall, New Jersey, 2011.

[6] Z.Xu and et.al, "A more Efficient Distance Vector Routing Algorithm," In proc. IEEE MILCOM '97 Proceeding, Vol.2, 1997.

[7] Roch Guerin and Ariel Orda, " Computing Shortest Paths for any Number of Hops," In IEEE Transaction on Network, Vol. 10, No. 5, 2002.

[8] T.H Comrmen, C.E. Leiserson, and R.L. Rivest, "An Introduction to Algorithms," Second Edition, MIT Press, Boston, 2002.

[9] Y. Mourtada,"Routing Basics & Protocol," Internet draft, 2000.

[10] D. Bertsekas And R. Gallager, "Data Network," Prentice-Hall Inc, 2nd edition, 1992.

[11] Distributed Scalable Routing Based on Link State Vectorsí, Jochen Behrens, J.J.Garcia-Luna-Aceves, 1994.

[12] S. Keshav. An Engineering Approach to Computer Networks. Addison-Wesley Publishing Company, 1997.

[13] Udaya Shankar, Cengiz Alaettinoglu, Ibrahim Matta,and Klaudia Dussa-Zieger. Performance comparison of routing protocols using mars: Distance-vector versus linkstate. At ACM SIGMETRICS Conference on Performance, June 1992.

[14] Labovitz, G. Malan, and F. Jahanian. Internet routing instability. IEEE/ACM transactions on Networking, 1998.

[15] Craig Labovitz, Abha Ahuja, and Farnam Jahanian. Experimental study of internet stability and wide-area backbone failures. In FTCS, 1999.

[16] K. Varadhan, R. Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 2000.