| The Internet Protocol Suite | |
|---|---|
| Application Layer | |
| BGP · DHCP · DNS · FTP · GTP · HTTP · IMAP · IRC · Megaco · MGCP · NNTP · NTP · POP · RIP · RPC · RTP · RTSP · SDP · SIP · SMTP · SNMP · SOAP · SSH · Telnet · TLS/SSL · XMPP · (more) | |
| Transport Layer | |
| TCP · UDP · DCCP · SCTP · RSVP · ECN · (more) | |
| Internet Layer | |
| IP (IPv4, IPv6) · ICMP · ICMPv6 · IGMP · IPsec · (more) | |
| Link Layer | |
| ARP · RARP · NDP · OSPF · Tunnels (L2TP) · PPP · Media Access Control (Ethernet, MPLS, DSL, ISDN, FDDI) · (more) | |
 |
This article may be confusing or unclear to readers. Please help clarify the article; suggestions may be found on the talk page. (February 2009) |
An interior gateway protocol (IGP) is a routing protocol that is used within an autonomous system (AS).
In contrast an Exterior Gateway Protocol (EGP) is for determining network reachability between autonomous systems and makes use of IGPs to resolve routes within an AS.
The interior gateway protocols can be divided into two categories: 1) Distance-vector routing protocol and 2) Link-state routing protocol.
Contents |
Types of Interior gateway protocols
Distance-vector routing protocol
They use the Bellman-Ford algorithm. In Distance-vector routing protocols each router does not possess information about the full network topology. It advertises its distances to other routers and receives similar advertisements from other routers. Using these routing advertisements each router populates its routing table. In the next advertisement cycle, a router advertises updated information from its routing table. This process continues until the routing tables of each router converge to stable values.
Some of these protocols have a disadvantages of slow convergence..
some of the examples of Distance vector routing protocol
- Routing Information Protocol (RIP)
- Interior Gateway Routing Protocol (IGRP)
- Enhanced Interior Gateway Routing Protocol (EIGRP)
Link-state routing protocol
In the case of Link-state routing protocols, each node possesses information about the complete network topology. Each node then independently calculates the best next hop from it for every possible destination in the network using local information of the topology. The collection of best next hops forms the routing table for the node.
This contrasts with distance-vector routing protocols, which work by having each node share its routing table with its neighbors. In a link-state protocol, the only information passed between the nodes is information used to construct the connectivity maps.
Example of Link-state routing protocols are:
See also
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
