Uncongested and Congested Network

Abstract-We presume a perfect fountain-based protocol (FBP) with zero decoding inefficiency will be realised in the near future. The FBP node encodes a message of k symbols into infinite number of codewords and the receiver may decode any combination of k codewords to the original message without error. Therefore, the FBP node may transmit data at maximum speed even if the network is congested. We model the throughput of TCP and FBP nodes with point process and further study the performance through simulation in both uncongested and congested network. The results suggest that both FBP and TCP nodes have a similar performance in the uncongested network. However, FBP nodes dominate all the bandwidth if the network congested. I. INTRODUCTION Undoubtedly, part of the success of the Internet is credited to its doctrine of resource sharing and measures in overcom­ing the network congestion issues. The network congestion issue first appeared in the early development of ARPANET (former project of Internet). It was caused by the improper retransmission of lost packets that flooded the network with excessive packets and subsequently congested the network