The computers and computer networks have become a great part of our lives, so transmitting the data is a major task. The initial Internet protocols have become outdated, several new algorithms have been developed, but still failed to create an universally well-functioning version. Due to the diversity of Internet and existing protocols to have a fair congestion control and have the best utilization of the capacities are significant challenges to the developers. According to a new idea, it can be a possible solution if we do not use any congestion control and send data at a maximal rate. Thus the available capacity of the network devices will be fully utilized, and fair schedulers in the network nodes can provide fairness among competing flows. Against the occurring packet loss the protocol uses erasure coding, so resending packets is not needed, the protocol can recover from bursty packet losses. This idea is implemented in DFCP (Digital Fountain based Communication Protocol), which performance is examined in my thesis. The tests were performed in NS2 (Network Simulator 2), which is a network simulation environment for testing, where I have compared DFCP to the most common TCP versions, TCP Reno and Cubic TCP. During my experimentation on various topologies, I changed the buffer size and delay of links and set the timings of the data flows to create the appropriate test conditions. The results are encouraging, DFCP can be a possible fair solution in today’s wireless world.