Skip to main content

Data Link Protocol

The data link protocols operate in the data link layer of the Open System Interconnections (OSI) model, just above the physical layer.
The services provided by the data link protocols may be any of the following −
  • Framing − The stream of bits from the physical layer are divided into data frames whose size ranges from a few hundred to a few thousand bytes. These frames are distributed to different systems, by adding a header to the frame containing the address of the sender and the receiver.
  • Flow Control − Through flow control techniques, data is transmitted in such a way so that a fast sender does not drown a slow receiver.
  • Error Detection and/or Correction − These are techniques of detecting and correcting data frames that have been corrupted or lost during transmission.
  • Multipoint transmission − Access to shared channels and multiple points are regulated in case of broadcasting and LANs.

Common Data Link Protocols


  • Synchronous Data Link Protocol (SDLC) − SDLC was developed by IBM in the 1970s as part of Systems Network Architecture. It was used to connect remote devices to mainframe computers. It ascertained that data units arrive correctly and with right flow from one network point to the next.
  • High Level Data Link Protocol (HDLC) − HDLC is based upon SDLC and provides both unreliable service and reliable service. It is a bit – oriented protocol that is applicable for both point – to – point and multipoint communications.
  • Serial Line Interface Protocol (SLIP) − This is a simple protocol for transmitting data units between an Internet service provider (ISP) and home user over a dial-up link. It does not provide error detection / correction facilities.
  • Point - to - Point Protocol (PPP) − This is used to transmit multiprotocol data between two directly connected (point-to-point) computers. It is a byte – oriented protocol that is widely used in broadband communications having heavy loads and high speeds.
  • Link Control Protocol (LCP) − It one of PPP protocols that is responsible for establishing, configuring, testing, maintaining and terminating links for transmission. It also imparts negotiation for set up of options and use of features by the two endpoints of the links.
  • Network Control Protocol (NCP) − These protocols are used for negotiating the parameters and facilities for the network layer. For every higher-layer protocol supported by PPP, one NCP is there.

Comments

Post a Comment

Popular posts from this blog

Types of MAC

Post a Comment
Read more

Bridge,Router and Gateways

Bridge – A bridge operates at data link layer. A bridge is a repeater, with add on the functionality of filtering content by reading the MAC addresses of source and destination. It is also used for interconnecting two LANs working on the same protocol. It has a single input and single output port, thus making it a 2 port device. Types of Bridges Transparent Bridges:- These are the bridge in which the stations are completely unaware of the bridge’s existence i.e. whether or not a bridge is added or deleted from the network, reconfiguration of the stations is unnecessary. These bridges make use of two processes i.e. bridge forwarding and bridge learning. Source Routing Bridges:- In these bridges, routing operation is performed by source station and the frame specifies which route to follow. The hot can discover frame by sending a special frame called discovery frame, which spreads through the entire network using all possible paths to destination.   Routers – A...
Post a Comment
Read more

BellmanAlgorithm

How Bellman Ford's algorithm works Bellman Ford algorithm works by overestimating the length of the path from the starting vertex to all other vertices. Then it iteratively relaxes those estimates by finding new paths that are shorter than the previously overestimated paths Steps 1) This step initializes distances from source to all vertices as infinite and distance to source itself as 0. Create an array dist[] of size |V| with all values as infinite except dist[src] where src is source vertex. 2) This step calculates shortest distances. Do following |V|-1 times where |V| is the number of vertices in given graph. ….. a) Do following for each edge u-v ………………If dist[v] > dist[u] + weight of edge uv, then update dist[v] ………………….dist[v] = dist[u] + weight of edge uv 3) This step reports if there is a negative weight cycle in graph. Do following for each edge u-v ……If dist[v] > dist[u] + weight of edge uv, then “Graph contains negative weight cyc...
Post a Comment
Read more