* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download ppt - Suraj @ LUMS
Wireless security wikipedia , lookup
Internet protocol suite wikipedia , lookup
Asynchronous Transfer Mode wikipedia , lookup
Deep packet inspection wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
Distributed firewall wikipedia , lookup
Piggybacking (Internet access) wikipedia , lookup
Computer network wikipedia , lookup
Multiprotocol Label Switching wikipedia , lookup
Zero-configuration networking wikipedia , lookup
Network tap wikipedia , lookup
List of wireless community networks by region wikipedia , lookup
Wake-on-LAN wikipedia , lookup
IP Routing: OSPF Network Protocols and Standards Autumn 2004-2005 Nov 11, 2004 CS573: Network Protocols and Standards 1 Issues  Design of OSPF     Separating hosts and routers Broadcast networks (Ethernet, FDDI, …) Non-broadcast networks (ATM, X.25, …) Splitting very large networks into areas Nov 11, 2004 CS573: Network Protocols and Standards 2 Separating Hosts and Routers Instead of link-state records for hosts: R-H1 R-H2 R-H3 R H1 H2 H3 Use simplification based on subnet model - One link between the router and the subnet: “link to stub network” - Identified by its subnet number Nov 11, 2004 CS573: Network Protocols and Standards 3 Stub Networks RT RT N  N Graph Representation Multiaccess/broadcast stub network   Single router attached to the network N is network IP address and associated mask Nov 11, 2004 CS573: Network Protocols and Standards 4 Point to Point Networks RT1 RT2 RT1 RT2 Graph Representation  Unnumbered point-to-point network  Interfaces to point-to-point network not assigned IP addresses Nov 11, 2004 CS573: Network Protocols and Standards 5 Point to Point Networks RT1 Ia Ib RT2 RT1 RT2 Ia Ib Graph Representation  Numbered point-to-point network  Ia and Ib are interface IP addresses Nov 11, 2004 CS573: Network Protocols and Standards 6 Stub Networks RT RT Host  Host Graph Representation Host directly attached to a router   Host route Mask is 0xFFFF FFFF (255.255.255.255) Nov 11, 2004 CS573: Network Protocols and Standards 7 Broadcast Networks  Such networks characterized by:    Full connectivity Broadcast capability Issues (when N routers coexist on a broadcast network):   # Adjacencies: N(N-1)/2 Each router would advertise:    N-1 links to other routers One link to the subnetwork Solution: reduce number of adjacencies to N   One router is designated through election Election of the designated router is through “Hello Protocol” Nov 11, 2004 CS573: Network Protocols and Standards 8 Broadcast Networks   Reducing the number of link state records using designated router Database will include two links per router  One link from router to virtual node     Called router link type 2 (transit network) Advertised by the router itself Appropriate metric Link from virtual node to router    Nov 11, 2004 Called network link Advertised by designated router Network links have a null metric CS573: Network Protocols and Standards 9 Broadcast Networks RT2 RT1 RT2 N RT1 RT3 RT3 RT4 Multiaccess/broadcast transit network - 3 or more routers attached to the network Nov 11, 2004 CS573: Network Protocols and Standards RT4 10 Broadcast Networks  Simplifying flooding   A router sends a link state advertisement to the designated router only using 224.0.0.6 “all designated routers” multicast address If advertisement is new, designated router floods the link state on all its interfaces (including the network on which it is received!) using 224.0.0.5 “all OSPF routers” multicast address Nov 11, 2004 CS573: Network Protocols and Standards 11 Broadcast Networks   Designated router forms adjacencies with all routers in the broadcast network For reliability, there is one backup designated router     Backup designated router also forms adjacencies with all routers in the broadcast network Listens to 224.0.0.6 but remains silent in terms of flooding, etc. Failure of designated router is discovered by means of Hello protocol Smoother transition occurs since the backup router has already formed all the adjacencies Nov 11, 2004 CS573: Network Protocols and Standards 12 Non-broadcast Networks  IP over X.25 networks   Popular in Europe in 1980’s IP over ATM   Static configurations Avoid N(N-1)/2 overhead    Use designated router On-demand circuits Permanent circuits are for links between routers and the “designated router” Nov 11, 2004 CS573: Network Protocols and Standards 13 Link State DB records  Five types of link state records 1. 2. 3. 4. 5.  Router link Network link Summary link (IP network) Summary link (to a border router) External link Types 3 and 4 are used when OSPF areas are used Nov 11, 2004 CS573: Network Protocols and Standards 14 OSPF Router ID  Each OSPF router is assigned an OSPF router ID   32 bit number uniquely identifying the router within the OSPF domain When the router interfaces have IP addresses assigned to them, then the OSPF router ID is one of the router’s IP address Nov 11, 2004 CS573: Network Protocols and Standards 15 LSA Header OSPF HEADER TYPE=4 ADVERTISEMENT 1 LS AGE OPTIONS LS TYPE LINK STATE ID ADVERTISING ROUTER LS SEQUENCE NUMBER … LS CHECKSUM LENGTH Advertisement Header #ADVERTISEMENTS 4 BYTES ADVERTISEMENT DATA (LINKS) ADVERTISEMENT N Nov 11, 2004 CS573: Network Protocols and Standards 16 LSA Header Fields  Link state Type   Link state ID    Identifies one particular advertisement Checksum   Chosen by the advertising router Generally an IP address Sequence Number   Type of LS record (1, 2, 3, 4, or 5) Protects header as well as content Length  Total length of the record (including the 20-byte header) Nov 11, 2004 CS573: Network Protocols and Standards 17 LSA Header Fields  Advertising router   Age   The OSPF ID of the sender 16-bit unsigned integer indicating the time in seconds since the link state record was first advertised Options:   E T RFC 1583 Definition Type of Service External Links E: used in Hello protocol T: Set when router supports nonzero TOS  Nov 11, 2004 Removed from the latest version of the standard (RFC2328) CS573: Network Protocols and Standards 18 Multiple Areas  Hierarchical routing  Decreased routing overhead     Size of link state DB Duration of route computation Volume of messages exchanged Split the network into set of independent parts by a backbone  Each area operates like an independent network     Database includes only the state of the area’s links Flooding stops at the boundaries Routers compute routes within the area Cost of routing proportional to the size of the area Nov 11, 2004 CS573: Network Protocols and Standards 19 Multiple Areas   How to glue the network together? Some routers belong to several areas    Typically to the backbone and to one lower-level area At least one area border router in each area Area border routers   Maintain several link state databases (one for each area to which they belong) Emit special link state records (summaries) to signal reachability of networks in each area Nov 11, 2004 CS573: Network Protocols and Standards 20 Stub Areas   Areas where there is only one exit point, or the exit point is not a function of the external destination Stub area does not need to know the topology of the rest of the AS   All external traffic goes to the exit point Obviously, no AS boundary router can be internal to the stub areas R Nov 11, 2004 CS573: Network Protocols and Standards 21 OSPF Packet Formats   OSPF directly over IP, using protocol number 89 OSPF does not explicitly support fragmentation, but protocol messages can generally be split      This should be used rather than IP fragmentation OSPF packets are sent with an IP TOS of 0 OSPF packets are sent with IP precedence set to Internetwork control All OSPF packets use the same OSPF header OSPF Multicast addresses (sent with TTL=1)   224.0.0.5: All OSPF routers 224.0.0.6: OSPF designated and backup routers Nov 11, 2004 CS573: Network Protocols and Standards 22 The Common OSPF Header VERSION # TYPE PACKET LENGTH ROUTER ID AREA ID CHECKSUM AUTYPE AUTHENTICATION AUTHENTICATION Nov 11, 2004 CS573: Network Protocols and Standards 23 OSPF Header Fields Version #: set to 2 (current version) Type: The OSPF packet type   Hello Database description Link state request Link state update Link state acknowledgement 1. 2. 3. 4. 5.     Packet length: Number of bytes in the header including the header Router ID: The IP selected for identifying the router Area ID: The value 0 is reserved for backbone area. Commonly, an IP address is used to identify the areas Checksum: Computed on the whole OSPF packet, excluding the 8-octet authentication field Nov 11, 2004 CS573: Network Protocols and Standards 24 OSPF Header Fields  AUTYPE: Identifies the authentication algorithm. Only three values are identified in the standard itself:  0: No authentication    1: Simple authentication    Exchanges not authenticated Authentication field ignored; can be set to anything “Clear password” type of authentication; all packets must contain the right value, pre-configured for that area Used to prevent unconfigured routers from joining in 2: Cryptographic authentication    Nov 11, 2004 Secret key is used to generate a digest of the packet Digest is added at the end of the packet; size not included in the header 64-bit field is restructured to contain digest size, key ID, and sequence number (to protect against replay attacks) CS573: Network Protocols and Standards 25
 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
									 
                                             
                                             
                                             
                                             
                                             
                                             
                                             
                                             
                                             
                                             
                                            