DocumentCode
3392762
Title
Securing distance-vector routing protocols
Author
Smith, Bradley R. ; Murthy, Shree ; Garcia-Luna-Aceves, J.J.
Author_Institution
California Univ., Santa Cruz, CA, USA
fYear
1997
fDate
10-11 Feb 1997
Firstpage
85
Lastpage
92
Abstract
We analyze the security requirements of distance-vector routing protocols, identify their vulnerabilities, and propose countermeasures to these vulnerabilities. The innovation we propose involves the use of mechanisms from the path-finding class of distance-vector protocols as a solution to the security problems of distance-vector protocols. The result is a proposal that effectively and efficiently secures distance-vector protocols in constant space
Keywords
protocols; security of data; telecommunication network routing; constant space; countermeasures; distance-vector routing protocols; path-finding class; security problems solution; security requirements; vulnerabilities; Computer security; IP networks; Information security; Instruction sets; Proposals; Robustness; Routing protocols; Sun; Telecommunication traffic; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Network and Distributed System Security, 1997. Proceedings., 1997 Symposium on
Conference_Location
San Diego, CA
Print_ISBN
0-8186-7767-8
Type
conf
DOI
10.1109/NDSS.1997.579225
Filename
579225
Link To Document