• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.29-35
• /
• 2024

TCP is considered as one of the major candidate transport protocols even for constrained IoT networks..In our previous work, we investigated the congestion control mechanism of the uIP TCP. Since the uIP TCP sets the window size to one segment by default, managing the retransmission timer is the primary approach to congestion control. However, the original uIP TCP sets the retransmission timer based on the fixed RTO, it performs poorly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe. In our previous work, we proposed a TCP retransmission timer adjustment scheme for uIP TCP which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Although our previous work showed that the proposed retransmission timer adjustment scheme can improve performance, we observe that the scheme often causes a node to set the retransmission timer for an excessively too long time period. In this work, we show that slightly modifying the dithering mechanism of the previous scheme is effective for improving TCP fairness.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1039-1046
• /
• 2005

TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.931-936
• /
• 2004

We need to have an adaptive TCP protocol that can be tolerable on wireless network environement. TCP Westwood for use in the environe-ment that have a very high loss rate like a sattelite was proposed by modifying the existing bulk retransmission protocol. Bulk retransmission mechanism shows a highly enhanced performance on networks that have a very high loss rate but are prone to bursty loss networks. Also, it can exprience less performance on low late transmission environement. This paper proposes Adaptive Bulk Retransmission Mechanism that adjusts the number of bulk retransmitted packets based on the network conditions. The proposed mechanism was evaluated by using NS-2.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.53-56
• /
• 2015

In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1610-1618
• /
• 1998

In this paper, we present the FB(Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved with the FB mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare through simulation the performance of the existing drop-tail, EB(Equal Buffering) and the proposed FB buffer management schemes, with and without RR(Roung-Robin) scheduling, and demonstrate that the proposed FB mechanism is most effective when used in conjunction with the RR scheduling scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.1
• /
• pp.49-57
• /
• 2005

ATM Form has defined the guaranteed frame rate (GFR) service to provide minimum cell rate (MCR) guarantees for TCP traffic in ATM networks and allow it to fairly share residual bandwidth. GFR switch implementation consists of the frame-based generic cell rate algorithm (F-GCRA) and a frame forwarding mechanism. The F-GCRA identifies frames that are eligible for an MCR guarantee. The frame forwarding mechanism buffers cells at a frame unit according to information provided by the F-GCRA and forwards the buffered cells to an output port according to its scheduling discipline. A simple GFR mechanism with shared buffer with a global threshold is a feasible implementation mechanism, but has been known that it is insufficient to guarantee the MCR. This paper has estimated performance of GFR service for TCP traffic over ATM switches with the simple FIFO-based mechanism

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.21-24
• /
• 2000

End-to-end congestion control mechanism have been critical to the robustness and stability of the Internet. Most of today's Internet traffic is TCP, and we expect this to remain so in the future. TCP/IP is the intermediate transport layer candidate for today's applications. TCP uses an adaptive window-based flow control. The congestion avoidance and control algorithms deployed by TCP aims at using the available network bandwidth. This paper compares different congestion control policies, and proposes the new design mechanism for future public networks

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.108-117
• /
• 2002

TCP, which was developed on the basis of wired links, supposes that packet losses are caused by network congestion. In a wireless network, however, packet losses due to data corruption occur frequently. Since TCP does not distinguish loss types, it applies its congestion control mechanism to non-congestion losses as well as congestion losses. As a result, the throughput of TCP is degraded. To solve this problem of TCP over wireless links, previous researches, such as split-connection and end-to-end schemes, tried to distinguish the loss types and applied the congestion control to only congestion losses; yet they do nothing for non-congestion losses. We propose a novel transport protocol for wireless networks. The protocol called VS-TCP (Variable Segment size Transmission Control Protocol) has a reaction mechanism for a non-congestion loss. VS-TCP varies a segment size according to a non-congestion loss rate, and therefore enhances the performance. If packet losses due to data corruption occur frequently, VS-TCP decreases a segment size in order to reduce both the retransmission overhead and packet corruption probability. If packets are rarely lost, it increases the size so as to lower the header overhead. Via simulations, we compared VS-TCP and other schemes. Our results show that the segment-size variation mechanism of VS-TCP achieves a substantial performance enhancement.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2004

Differentiated services network (DiffServ) aims to provide the same service to a group of connections that have similar Quality of Service requirements. One of the essential function to realize DiffServ is the traffic conditioning mechanism. The paper proposes the enhanced traffic conditioning mechanism which can assure the reserved rates of TCP and UDP flows and support fair distribution of excess bandwidth. The simulation results show that the new mechanism is rather insensitive of the effect of UDP against TCP throughput, and performs better both in terms of throughput assurance and fair distribution of excess bandwidth in case of well-provisioned and over-provisioned network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.471-489
• /
• 2013

Data compression at the transport layer could both reduce transmitted bytes over network links and increase the transmitted application data (TCP PDU) in one RTT at the same network conditions. Therefore, it is able to improve transmission efficiency on Internet, especially on the networks with limited bandwidth or long delay links. In this paper, we propose an on-the-fly TCP data compression scheme, i.e., the TCPComp, to enhance TCP performance. This scheme is primarily composed of the compression decision mechanism and the compression ratio estimation algorithm. When the application data arrives at the transport layer, the compression decision mechanism is applied to determine which data block could be compressed. The compression ratio estimation algorithm is employed to predict compression ratios of upcoming application data for determining the proper size of the next data block so as to maximize compression efficiency. Furthermore, the assessment criteria for TCP data compression scheme are systematically developed. Experimental results show that the scheme can effectively reduce transmitted TCP segments and bytes, leading to greater transmission efficiency compared with the standard TCP and other TCP compression schemes.