Synchronous and Asynchronous Transmission

-

 Synchronous and Asynchronous Transmission


Synchronous - In Synchronous Transmission, data is sent in the form of blocks or frames. This transmission is the full-duplex type. Between sender and receiver, synchronization is compulsory. In Synchronous transmission, There is no time gap present between data. It is more efficient and more reliable than asynchronous transmission to transfer a large amount of data. 

Both the sender and receiver are synchronized with a common clock signal. This means they operate at the same speed and know exactly when to send and receive data. Data is sent in a continuous stream, with each byte or chunk of data following the previous one without any gaps. It’s efficient for sending large amounts of data quickly because there’s less overhead (extra bits) needed to start and stop the transmission.






Asynchronous - In Asynchronous Transmission, data is sent in form of byte or character. This transmission is the half-duplex type transmission. In this transmission start bits and stop bits are added with data. It does not require synchronization. Asynchronous transmission is like sending individual text messages without knowing exactly when the other person will read them. 

The sender and receiver do not share a common clock signal. Instead, data is sent one byte or character at a time, with start and stop bits indicating the beginning and end of each byte. Each piece of data is sent independently, with gaps in between, allowing the receiver to process each byte as it arrives. It’s flexible and simpler to implement, especially useful for communications where data is sent intermittently.








Comments

Post a Comment

Popular posts from this blog

DSA Lab 8 program

-
 Program for implementing multiple stack. # include < stdio.h > # include < stdlib.h > struct stack {     int maxstack;     int * stack;     int top; }; int isEmpty ( struct stack * ptr ) {     if ( ptr -> top == - 1 ) {         return 1 ;     } else {         return 0 ;     } } int isFull ( struct stack * ptr ) {     if ( ptr -> top == ptr -> maxstack - 1 ) {         return 1 ;     } else {         return 0 ;     } } int peek ( struct stack * ptr ) {     return ptr -> stack [ ptr -> top ]; } int pop ( struct stack * ptr ) {     if ( isEmpty (ptr) ) {         printf ( " Stack Underflow! Cannot pop from the stack \n " ) ;         return - 1 ;     } else {         in...
Read more

DSA Lab 7 Program

-
 Program for implementing Stack using array # include < stdio.h > int maxstack = 10 ; int stack [ 10 ]; int top = - 1 ; int empty (){     if (top == - 1 ){         return 1 ;     }     else {         return 0 ;     } } int full (){     if (top == maxstack){         return 1 ;     }     else {         return 0 ;     } } int peek (){     return stack [top]; } int pop (){     int data;     if ( ! empty () ){         data = stack [top];         top -= 1 ;         printf ( " The data has been Deleted. Your data is %d \n " , data) ;         return data;     }     else {         printf ( " The data Can't be Deleted. Becouse stack is empty \n " ) ;   ...
Read more

Network Layer: Design Issues and Key Concepts

-
Image
 ### Network Layer: Design Issues and Key Concepts **Network Layer** is responsible for data transfer between devices on different networks. It determines how data is routed from the source to the destination, ensuring it follows the best path. ### 1. **Design Issues in the Network Layer:**    - **Routing**: Deciding the best path for data to travel across the network.    - **Congestion Control**: Preventing network overload, ensuring smooth data flow.    - **Packet Forwarding**: Moving data packets from one network to another.    - **Error Handling**: Detecting and correcting errors that occur during data transmission. ### 2. **Routing Algorithms**: A Detailed Explanation Routing algorithms are methods used by network devices (like routers) to determine the best path for data to travel from its source to its destination. The goal of these algorithms is to ensure that data packets reach their destination efficiently, quickly, and with minimal...
Read more