Scribd
Upload
16 views

Unit 5 - Classifications of MAC Protocols - Classifications of Routing Protocols - Classifications of Transport Layer Protocols

Uploaded by

Shabhana Pirjade
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Unit 5 - Classifications of MAC Protocols - Classifications of Routing Protocols - Classifications of Transport Layer Protocols

Uploaded by

Shabhana Pirjade
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Classification of MAC protocols

MAC protocol is the first protocol layer above the Physical Layer in ad hoc .The primary
task of any MAC protocol is to control the access of the nodes to shared medium.

Classification of MAC protocols :


These are as following below.
1. Contention-based protocols without reservation/scheduling –
 Bandwidth are not reserved.
 No guarantees.
2. Contention-based protocols with reservation mechanisms –
 Bandwidth is reserved for transmission.
 Guarantees can be given.
3. Contention-based protocols with scheduling mechanisms –
 Distributed scheduling is done between nodes.
 Guarantees can be given.
4. Other protocols –
 Combine multiple features of other protocols.
 It can also use a completely new approach.
Classification of Routing Protocols

1. Path Vector:

Dynamic routing protocols use metric, cost, and hop count to identify the best path
from the path available for the destination network.

2. Distance Vector Routing Protocol :


These protocols select the best path on the basis of hop counts to reach a destination
network in a particular direction. Dynamic protocol like RIP is an example of a distance
vector routing protocol. Hop count is each router that occurs in between the source and
the destination network. The path with the least hop count will be chosen as the best
path.
Features –
 Updates of the network are exchanged periodically.
 Updates (routing information) is not broadcasted but shared to neighbouring nodes
only.
 Full routing tables are not sent in updates but only distance vector is shared.
 Routers always trust routing information received from neighbor routers. This is
also known as routing on rumors.
Disadvantages –

 As the routing information is exchanged periodically, unnecessary traffic is


generated which consumes available bandwidth.
 As full routing tables are exchanged, therefore it has security issues. If an un-
authorized person enters the network, then the whole topology will be very easy to
understand.
 Also, the broadcasting of the network periodically creates unnecessary traffic.
3. Link State Routing Protocol:
These protocols know more about Internetwork than any other distance vector routing
protocol. These are also known as SPF (Shortest Path First) protocol. OSPF is an
example of link-state routing protocol.
Features –
 Hello, messages, also known as keep-alive messages are used for neighbor
discovery and recovery.
 Concept of triggered updates is used i.e updates are triggered only when there is a
topology change.
 Only that many updates are exchanged which is requested by the neighbor router.

Link state routing protocol maintains three tables namely:


1. Neighbor table- the table which contains information about the neighbors of the
router only, i.e, to which adjacency has been formed.
2. Topology table- This table contains information about the whole topology i.e
contains both best and backup routes to a particular advertised networks.
3. Routing table- This table contains all the best routes to the advertised network.

Advantages –
 As it maintains separate tables for both the best route and the backup routes ( whole
topology) therefore it has more knowledge of the internetwork than any other
distance vector routing protocol.
 Concept of triggered updates is used therefore no more unnecessary bandwidth
consumption is seen like in distance vector routing protocol.
 Partial updates are triggered when there is a topology change, not a full update like
distance vector routing protocol where the whole routing table is exchanged.

1. Border Gateway Protocol (BGP)


BGP is an alternative exterior gateway protocol that was created to replace EGP. BGP employs
the optimal path selection technique for data package transfers, making it a distance vector
protocol. To automatically find the optimal route, BGP refers to the following variables:

 Adjacent IP addresses
 Router designation
 Path distance
 Origin type

The BGP Best Path Selection Algorithm is utilized to determine the optimal paths for data packet
transfers. If no special parameters have been configured, BGP will select routes with the shortest
path to the destination.
BGP enables administrators to modify transfer routes based on their requirements and provides
extensive security measures to ensure that only authorized routers can exchange data and
information. The algorithm for selecting the optimal route path can be modified by modifying
the BGP cost community attribute. BGP is able to make routing decisions based on factors
including weight, local preference, locally generated, AS Path length, origin type, multi-exit
discriminator, eBGP over iBGP, IGP metric, router ID, cluster list, and neighbor IP address.

BGP only transmits updated routing table data when a change occurs. Therefore, there is no
auto-discovery of topology changes, and the user must manually set up BGP. Regarding security,
the BGP protocol can be verified so that only authorized routers can exchange data.

BGP was chosen over OSPF because BGP allows device designers and owners greater flexibility
and control than OSPF. BGP processes include options for which routes should be broadcast and
which alerts the device will accept. It provides extra options for route choosing. This allows us
greater flexibility to avoid overloading specific lines that OSPF would automatically presume to
be the fastest path.

2. Routing Information Protocol (RIP)


The Routing Information System (RIP) was first defined in RFC 1058 as a first-generation
routing protocol for IPv4. RIP is a distance-vector routing protocol that uses the metric hop
count. RIP is straightforward to configure, making it an excellent option for small networks.

RIPv1 possesses the following qualities:

 The number of hops is utilized as the path selection metric.


 Every 30 seconds, routing updates are transmitted (255.255.255.255).
 Greater than 15 hops is considered infinite (too far). This 15th hop router would not
transmit the routing update to the following router.

In 1993, RIPv1 evolved into RIP version 2, a classless routing protocol (RIPv2). RIPv2
brought the subsequent enhancements:

 Security: It includes an authentication mechanism for securing routing table update


communications between neighbors.
 Classless routing protocol support: It supports VLSM and CIDR because routing
updates include the subnet mask.
 Improved efficiency: It forwards updates to the multicast address 224.0.0.9 rather than
the broadcast address 255.255.255.255.
 Reduced routing entries: Manual route summarization on any interface is supported.

3. Open Shortest Path First (OSPF)


Open Shortest Path First (OSPF) is the most prevalent link-state routing protocol. The OSPF
Working Group of the Internet Engineering Task Force (IETF) designed it. OSPF development
began in 1987, and there are currently two active versions:
 OSPFv2: OSPF for IPv4 networks (RFC 1247 and RFC 2328)
 OSPFv3: OSPFv3 is the IPv6 version of OSPF (RFC 2740)

OSPFv3 now supports both IPv4 and IPv6 thanks to the Address Families functionality.

OSPF implements the link state routing algorithm and is utilized in medium- to large-sized
networks. OSPF is an intradomain routing protocol that only operates within a specific routing
domain. OSPF is also a hierarchical routing protocol that may be used in a single autonomous
system. OSPF emerged from the intermediate-system-to-system (IS-IS) routing protocol of the
Open Systems Interconnection (OSI) reference model. OSPF enables multipath routing and
uses one or more routing metrics, including dependability, bandwidth, latency, load, and
maximum transmission unit (MTU). If OSPF utilizes many metrics, it also allows type-of-
service (TOS) requests for traffic differentiation.

OSPF, is a link-state, interior gateway, and classless protocol that uses the shortest path first
(SPF) algorithm to ensure efficient data transmission. Internally, this type maintains numerous
databases containing topology tables and network-wide information. Typically, the data is
derived from link state advertising transmitted by individual routers. The advertising, which
resembles reports, provides thorough details of the path's length and the resources that may be
necessary.

OSPF utilizes the Dijkstra algorithm to recalculate paths when topology changes occur. It also
employs authentication procedures to maintain the security of its data throughout network
modifications and intrusions. Due to its scalability, OSPF may be advantageous for both small
and large network enterprises.
Classifications of Transport Layer Protocols

You might also like