Transmission Control Protocol Performance Comparison Using Piggyback Scheme In WLANS

The main problem at wireless networks is the overhead at MAC layer; when the data physical rate is increasing it causes increasing the overhead and decreasing at the MAC efficiency. In this study we study the performance comparison of TCP protocol in WLANs with and without using piggyback. The study of results concerning of implemented both mechanisms in NS2 simulator and find out the good performance from this comparison. Based on the results from our experiments show that the Piggyback scheme is one of the efficient ways to reduce the overhead at MAC wireless networks

Throughput analysis of TCP congestion control algorithms in a cloud based collaborative virtual environment

Collaborative Virtual Environment (CVE) has become popular in the last few years, this is because CVE is designed to allow geographically distributed users to work together over the network. In CVE the state of the virtual objects is witnessing unprecedentant change. When a user performs an action in CVE, the information of the action needs to be transmitted to other users to maintain consistency in the cooperative work. TCP is the most widely used protocol in the design of CVE, and its throughput deteriorates in the network with large delay. Gital et al, 2014 proposes a cloud based architectural model for improving scalability and consistency in CVE. Therefore, this paper aim at evaluating and comparing the performance of different TCP variant (Tahoe, Reno, New Reno, Vegas, SACK, Fack and Linux) with the cloud based CVE architecture to determine the suitability of each TCP variant for CVE. A comparative analysis between the different TCP variants is presented in terms of throughput verses elapse time, with increasing number of users in the system. TCP with the cloud based model was found to be effective, promising and robust for achieving consistency requirement in CVE system

Providing Fairness Between TCP NewReno and TCP Vegas with RD Network Services

Abstract — While Transmission Control Protocol (TCP) variants with delay-based congestion control (e.g., TCP Vegas) provide low queueing delay and low packet loss, the key problem with their deployment on the Internet is their relative performance when competing with traditional TCP variants with lossbased congestion control (e.g., TCP NewReno). In particular, the more aggressive loss-based flows tend to dominate link buffer usage and degrade the throughput of delay-based flows. In this paper, we study a novel approach for achieving fair sharing of the network resources among TCP variants, using Rate-Delay (RD) Network Services. In particular, loss-based and delay-based flows are isolated from each other and served via different queues. Using extensive ns-2 network simulation experiments, we show that our approach is effective in providing fairness between lossbased NewReno and delay-based Vegas flows. I