The stream control transmission protocol (SCTP) will play an important role in the next generation of the Internet. Up to now, there are no literatures about differentiated services for SCTP associations. Regarding the throughput as SCTP criteria to support differentiated services, the differentiated services between SCTP associations can be obtained by introducing the weighted factor to a or b for AIMD(a,b)-based SCTP congestion control. Theoretic analysis and simulation results show that the proposed scheme can achieve well proportional differentiated services for SCTP associations with few additional overheads, and it is easy to regulate the fluctuation of data sending rate or SCTP response to networks.
To mitigate TCP global synchronization and improve network throughput, an improved TCP congestion control mechanism is proposed, namely P-TCP, which adopts the probability-based way to adjust congestion window independently when the network occurs congestion. Therefore, some P-TCP connections may decrease the congestion window greatly while other P-TCP connections may decrease the congestion window lightly. Simulation results show that TCP global synchronization can be effectively mitigated, which leads to efficient utilization of network resources as well as the effective mitigation for network congestion. Simulation results also give some valuable references for determining the related parameters in P-TCP.
TCP congestion control mechanism, being based on the presupposition that network congestion is the only reason for data loss, is suitable for wired environments rather than for wireless environments with characteristics of higher bit error rate, lower bandwidth, longer delay, frequent mobility and so on, where link corruption can also cause data loss. To avoid unnecessary decrease of packet sending rate resulting in lower throughput and longer delay, some improved TCP congestion mechanisms have been presented. However, one of the disadvantages of these mechanisms is that a great deal of unnecessary packets lost by corruption can be caused while heavy data loss rate by corruption lasts short time. As well known, energy consumption of mobile hosts is one of the most important factors for wireless communication. How to save energy of mobile host has become an important task for wireless communication. One of the methods is to improve reliability to decrease overheads resulting from re-transmitting lost data. Obviously, it is necessary to decrease data sending rate, but how does it do? This paper answers the question, and then presents an improved TCP congestion control mechanism, namely TCP_IR (TCP for Improving Reliability) whose implementations are based on two algorithms. Algorithm I-based TCP_IR is driven by data sending periodic, while algorithm II-based TCP_IR is driven by the event of data lost by corruption. They can be very easily implemented with fewer overheads and can effectively improve TCP reliability with light influence to throughput and delay. The paper’s contribution is to give valuable references to further study TCP in wireless networks.
Recently, there is an increasing interests in providing differentiated services in Internet. However, research efforts have almost exclusively focused on routers by improving their policies of packet scheduling and queue management. There has been much less work on transport level approaches to support differentiated services. The mechanism presented by Chang-Biao Xu, DSAS-TCP and MulTCP are the only pieces of the works in this direction known to the authors. Up to now, there is no paper to discuss the interrelation between these mechanisms. Regarding throughput as TCP criteria to support proportional-differentiated-services (PDS), this paper deeply explores the variants of AIMD(a,b)-based TCP congestion control and their effect on differentiated services, and presents a transport level approach for TCP to support PDS, namely PDS_TCP which can be obtained by introducing weighted factor to a or b of AIMD(a,b)-based TCP congestion control. PDS_TCP also takes into account the influence of slow start for timeout. From the analysis, this paper draws the conclusion that the existing mechanisms are only variants of PDS_TCP. For the example of PDS_TCP, the principles, implementation and simulation results of PDS_a_TCP are discussed in detail. The theory analysis and simulation results show that the proposed mechanism PDS_TCP can be implemented with lower additional overheads and support controlled PDS very well without the loss of flexibility.