Skip to main content

Data Link Layer


Data link Layer(Layer 2): It makes the raw transmission facility, reliable and error-free to the upper layer. It is responsible for moving the frames from one hop to the next, reliable transmission of data frames between two nodes connected by a physical layer.


Functions include:




  • Framing: This layer divides the stream of bits from the network layer and organizes into manageable data units called frames.
  • Physical Addressing: The data link layer adds a header to the frame in order to define physical address of the sender or receiver of the frame, if the frames are to be distributed to the different systems on the network.
  • Flow Control: If the data rate, at which the data is transmitted by the sender is greater than the rate at which data is received by the receiver, this layer imposes a flow control mechanism to prevent overwhelming the receiver. This prevents traffic jam at the receiver side.
  • Error Control: This layer adds reliability to the physical layer by adding mechanisms to detect and retransmit damaged or lost frames and to prevent duplication of frames.
  • Access Control: When two or more devices are connected to the same link, data link layers are necessary to determine which layer has control over the link at a given time.

Comments

Popular posts from this blog

Configuring 2 backend servers and a load balancer with HAProxy

A load balancer is a device that distributes the traffic across a cluster of servers. In computing, load balancing improves the distribution of workloads across multiple computing resources, such as computers, a computer cluster, network links, central processing units, or disk drives.As a result, it improves responsiveness and increases the availability of applications.  For load balancing, we need to install LAMP server on backend servers and HAProxy on the load balancer. HAProxy is a free, open source software that provides a high availability load balancer and proxy server for TCP and HTTP based applications that spread requests across multiple servers. Here we will make two backend servers and one load balancer. At two backend servers enter the following commands— $sudo apt-get install apache2 $sudo apt-get install mysql-server $sudo apt-get install php libapache2-mod-php php-mysql $sudo gedit /var/www/html/index.html (Mak...

Network Connection verification and Troubleshooting commands in Windows

To ensure the proper network connection in the system, we do the following three types of checking: ---   Check the NIC card --- Check whether we have an IP or not or our gateway is active or not by a ping test -----  Check if the port no or the service is active or not To check the connection go to command prompt and enter the commands >ping localhost  then NIC  working. >ping 172.29.0.1 then gateway working >ipconfig In computing, ipconfig (internet protocol configuration) is a console application (command line tool) in Microsoft Windows used to control the network connections on windows.It displays all current TCP/IP network configuration values and can modify DHCP and DNS settings. Usually, ipconfig command is used with the command-line switch  /all. > ipconfig /all This command shows the various network configurations, MAC address, default gateway and IP addresses of different servers on the ne...

Fundamental Concepts of Arrays

  An   array   is a collection of elements of the same data type stored in   contiguous memory cells . It has a   fixed size   and is by default   passed by reference   to a function.  Eg. int arr[6] = {4, -3, 8, 5, -1, 6}; It initializes an integer array 'arr' storing 6 elements.  Assuming the size of an integer to be 4 bytes and base cell address to be 2000. It can be represented as -  A  dynamic array  is similar to a static array but it has the ability to  automatically resize  itself when an element is inserted or deleted.  They are available as  vectors in C++  and likewise l ists in Java .  Eg. list<int> l;      vector<int> v; Vectors are slightly less efficient than static arrays due to the occasional resizing and copying of elements.   The amortized time complexity of insertion in a dynamic array is O(1).  [Amortized Time complexity ...