Skip to main content

Reliable User Datagram Protocol

RUDP provides a solution where UDP is too primitive because guaranteed-order packet delivery is desirable, but TCP adds too much overhead. 
In order for RUDP to gain higher Quality of Service, RUDP implements features that are similar to TCP with less overhead.

Implementations:

In order to ensure quality, it extends UDP by means of adding the following features:
  1. Acknowledgment of received packets
  2. Flow control
  3. Re-transmission of lost packets
  4. Over buffering (Faster than real-time streaming)
RUDP is not currently a formal standard, however it was described in an n 1999. It has not been proposed for standardization.

 Working Example:
  1. One way to think about how RUDP types of transport work is to use a basic model where all the data is sent in UDP format, and each missing packet is indexed. 
  2. Once the main body of the transfer is done, the recipient sends the sender the index list and the sender re-transmits only those packets on the list. 
  3. As you can see, because it avoids the re-transmission of any windows of data that have already been sent that immediately follow a missed packet, this simple model is much more efficient. 
  4. However, it couldn't work for live data, and even for archives a protocol must be agreed upon for sending the index. 

Probably because of the "task-specific" nature of RUDP implementations, though, RUDP hasn't become a formal standard.

Labels:

Comments

  1. Sharda Borse4 October 2016 at 11:09

    so for missed packets it will follow sr or gbn protocol and only difference is in main packet size?

    ReplyDelete
  2. amitkumarx864 October 2016 at 11:12

    for missed packets it will not follow any of it...it will store the information that which packets got missed.
    And then when whole msg got received it will send the list of missing packets to sender.

    So need of SR or GBN in this scenario.

    ReplyDelete

Post a Comment

Popular posts from this blog

Red Black Tree Deletion in Java

Red Black tree deletion involves following cases: If node to delete is a RED leaf node then just delete it. If node to delete is a BLACK node and has one red child then, just replace it with child and retain color of node to be deleted. If node is having more than two children then just replace the node with in-order predecessor and call the delete routine at in-order predecessor recursively. But the problem arises when node to delete is a BLACK node and it has only one BLACK child or node to be deleted is a BLACK leaf node. Then DOUBLE BLACK problem arises. Note: Points form 1 to 3 are easy to implement and can be understood using the code given below. To resolve DOUBLE BLACK problem we have following four cases: Why double black problem: Suppose we have deleted a BLACK node and the number of nodes in the path going through it is reduced by 1. So the BLACK replacement will carry one extra BLACK color to retain property 5 of RB Tree that in any path from root to leaf...
Post a Comment
Read more

Red Black Tree Insertion in Java

Red Black Tree is a binary search tree. With extra property with each node having color either RED or BLACK. It has following properties: Every node is either RED or BLACK Root element will have BLACK color. Every RED node has BLACK children. Every path from root to leaf will have same number of BLACK nodes. We have few theorems over RB tree: Note: Height of RB tree is θ(logn). Insertion: Insertion in RB tree is little tricky as compared to BST, we have following cases to insert a node in RB tree: When tree is null just insert the node and it will be root, color will be BLACK. To insert an element first find its position: if key <= node.key then move to left else move to right Once we find the correct place to insert, we insert the node with color RED. But if the parent of the node just inserted has color RED then it will violate 3 property. So we have to fix this issue. We call it double RED problem, we resolve it using following few cases. DOUBLE R...
Post a Comment
Read more