Network layer Routing Algorithms:

-

Routing algorithms are crucial for determining the best path for data packets to travel across a network. They can be broadly classified into two main categories: Adaptive (Dynamic) Algorithms and Non-Adaptive (Static) Algorithms.

Adaptive (Dynamic) Algorithms

These algorithms adjust their routing decisions based on changes in the network topology or traffic load. They use real-time data to optimize routing paths. Some common types include:

  1. Isolated Algorithms: Each node makes routing decisions independently using local information. Examples include Hot Potato Routing and Backward Learning.
  2. Centralized Algorithms: A central node has complete information about the network and makes all routing decisions. The Link State Algorithm is an example.
  3. Distributed Algorithms: Nodes share information with their neighbors and make routing decisions collaboratively. The Distance Vector Algorithm is an example.

Non-Adaptive (Static) Algorithms

These algorithms do not change their routing decisions once they are set. Routes are pre-determined and do not adapt to changes in the network. Some common types include:

  1. Flooding: Every incoming packet is sent out on every outgoing line except the one it arrived on. This can lead to duplicate packets and potential network congestion.
  2. Shortest Path Routing: Routes are determined based on the shortest path from source to destination, often using algorithms like Dijkstra’s.

Hybrid Algorithms

These combine elements of both adaptive and non-adaptive algorithms to balance efficiency and stability.

Comments

Post a Comment

Popular posts from this blog

Error Detection in Data Link Layer

-
Image
 Sure! Error control in the data link layer ensures that data is transmitted accurately over a network. It involves both error detection and error correction techniques. Here’s a detailed explanation with examples: Error Detection Error detection involves identifying errors in the transmitted data. Common techniques include: Sure! Let’s dive into the different error detection methods used in the data link layer: VRC, LRC, CRC, and Checksum. 1. Vertical Redundancy Check (VRC) VRC , also known as Parity Check , involves adding a parity bit to each data unit (byte). This parity bit ensures that the total number of 1s in the byte (including the parity bit) is even (even parity) or odd (odd parity). Example: Data to be sent: 1010001 Even parity: Add a parity bit 1 to make the total number of 1s even: 10100011 Odd parity: Add a parity bit 0 to keep the total number of 1s odd: 10100010 At the receiver’s end, the parity of the received data is checked. If it doesn’t match the expected pa...
Read more

Transmission impairments – Attenuation, Distortion, Noise. Multiplexing – Frequency division, Time division, Wavelength division

-
 Sure, let’s break down these concepts in an easy-to-understand way for your paper. Transmission Impairments Attenuation : Definition : Attenuation refers to the loss of signal strength as it travels through a medium. Cause : This happens due to the resistance of the medium, which absorbs some of the signal’s energy. Example : Imagine shouting across a large field. Your voice gets weaker the further it travels. Solution : Amplifiers are used to boost the signal strength at intervals to counteract attenuation. Distortion : Definition : Distortion occurs when the shape or form of the signal changes. Cause : Different frequency components of a signal travel at different speeds, causing them to arrive at different times. Example : Think of a band playing music. If the instruments are not synchronized, the music sounds distorted. Solution : Equalizers can be used to correct the timing differences between frequency components. Noise : Definition : Noise is any unwanted signal that interf...
Read more

DSA LAB 1 Program

-
 Program for using Dynamic Function (malloc(), calloc(), realloc(), free(0) function   // malloc() & free() function # include < stdio.h > # include < stdlib.h > int main () {     int n , i , * ptr , sum = 0 ;     printf ( " Enter number of elements: " ) ;     scanf ( " %d " , & n ) ;     ptr = ( int * ) malloc ( n * sizeof ( int )) ;     // if memory cannot be allocated     if ( ptr == NULL )     {         printf ( " Error! memory not allocated. " ) ;         exit ( 0 ) ;     }     for ( i = 0 ; i < n ; ++ i )     {         printf ( " Enter %d elements : " , i + 1 ) ;         scanf ( " %d " , ptr + i ) ;         sum += * ( ptr + i );     }     printf ( " Sum = %d " , sum ) ;     // deallocating the m...
Read more