DOC PREVIEW
MASON ECE 646 - SR-1 Comparison of Schemes for Security of Routing Protocols

This preview shows page 1-2-3-4-5 out of 16 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

AbstractTable of ContentsSR-1 Comparison of Schemes for Security of Routing Protocols ECE 646 Project Research Paper SR-1 Comparison of Schemes for Security of Routing Protocols William M. Banick III December 12, 2003 Abstract The rapid growth of the Internet and Internet based technologies over the last decade is due, in large part, to the rapid convergence of networks and networking technologies. Computer networks allow applications running on various computers to communicate with one another. Networks facilitate this communication whether the computers are in the same building or on different continents. Due to the ever-increasing scope of network communications, securing the data that is transferred over the network infrastructure is an important consideration in designing today’s networks. Routing protocols are the mechanism with which data is transferred through the network hardware and channels. There are different classes of routing protocols that service different type and sizes of networks. But regardless of the type of routing protocol, all have the same drawback that they are difficult to secure efficiently. In this paper, I will review the different types of current mechanisms available for securing these routing protocols. I will also review new mechanisms proposed in the literature to enhance the security of routing protocols. 1SR-1 Comparison of Schemes for Security of Routing Protocols Table of Contents 1. Introduction……………………………………………………………………………………..1 1.1 OSI Reference Model………………………………………………………….……...2 1.1.1 OSI Reference Model – Network Layer………………………….………...2 1.1.2 OSI Reference Model – Transport Layer…………….………….…………3 1.2 Network Organizations……………………………………………………..…………3 2. Evaluation Assumptions……………………………….……………………………..…………4 3. Routing Protocol Overview………………………………………………………..……………4 3.1 Distance Vector Routing Protocols……………………………………………………4 3.1.1 RIP Overview………………………………………………………………5 3.1.2 EIGRP Overview…………………………………………………………...5 3.2 Path Vector Routing Protocols………………………………………………………..6 4. Threats and Attacks to Routing Protocols………………………………………………………6 4.1 Threats to Distance Vector Routing Protocols…………………….………………….7 4.2 Threats to Path Vector Routing Protocols…………………………….………………7 5. Current Security Mechanisms for Routing Protocols……………………….………………….8 5.1 MD5 Message Digest……………………………………………….….……………..8 5.2 Public Key Cryptosystems……………………………………………....….…………9 6. New Mechanisms for Securing Routing Protocols…………………………….…....…………10 6.1 Securing Routing Protocols with One-Way Hash Chains………………….………..10 6.2 Securing Routing Protocols with Hash Tree Chains…………………….…………..10 6.3 Securing Routing Protocols with Skiplists……………………………….………….10 6.4 Securing Routing Protocols with MW Chains………………………………………11 6.5 Securing Routing Protocols with Sequence Information in Routing Updates………11 6.6 Securing Routing Protocols with Predecessor Information in Routing Updates……11 7. Cost and Effectiveness of Routing Protocol Security Mechanisms…………………………...12 7.1 Effectiveness of Routing Protocol Security Mechanisms……………….…..………12 7.2 Cost of Routing Protocol Security Mechanisms…………………………………….12 8. Conclusion…………………………………………………………………………………….12 9. References……………………………………………………………………………………..13 2SR-1 Comparison of Schemes for Security of Routing Protocols 1. Introduction Computer networks allow applications running on various computers to communicate with one another. These computers can be across the room from one another or can be on different continents but still have the ability to communicate because of the network infrastructure that is in place. Computer networks are a combination of hardware and software, which together allow devices to communicate. There is no one-classification scheme for computer networks, but there are two dimensions to computer networks, which are important: (1) Transmission technology and (2) Scale. There are two types of transmission technology in place for computer networks: (1) Broadcast links and point-to-point links. Broadcast links have a single communication channel that is shared by all machines on the network. The machines communicate with each other by sending data in packets. All other machines on the link receive the packets sent by one machine on a network. The machine reads the packet for the address field. If the address field contains the receiving machines address, then the machine will process the packet otherwise the packet will be ignored by the machine. Small and geographically localized networks tend to be broadcast. Point-to-point networks consist of many connections between individual pairs of machines. Data, transmitted in packets, must traverse several intermediate machines before arriving at its final destination. Large computer networks tend to be point-to-point [6]. Networks can also be classified according to their scale. A factor used in scaling networks is the distance between computer processors on a network. In this classification scheme, networks can be classified as shown in Table 1. Distance Between Processors in Network Location of Processors Examples of Such Networks 10 meters Same room Personal Network 100 meters Building Local Area Network 10 kilometers City Metropolitan Area Network 100 kilometers Country Wide Area Network Table 1. Scaling Classification of Computer Networks An


View Full Document

MASON ECE 646 - SR-1 Comparison of Schemes for Security of Routing Protocols

Documents in this Course
Load more
Download SR-1 Comparison of Schemes for Security of Routing Protocols
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view SR-1 Comparison of Schemes for Security of Routing Protocols and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view SR-1 Comparison of Schemes for Security of Routing Protocols 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?