• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.465-475
• /
• 2004

Transport Control Protocol (TCP) has been implemented in software running on CPU in end systems, and the protocol processing has appeared as a new bottleneck due to advanced link technology. TCP processing is a critical issue in Storage Area Network (SAN) such as iSCSL, and the overall performance of the Storage Area Network heavily depends on speed of TCP processing. TCP Engine implemented in hardware reduces the load of CPU in end systems as well as accelerates the protocol processing, and hence high speed data processing is achieved. In this paper, we have proposed a hardware engine for TCP processing. TCP engine consists of three major block, TCP Connection block Rx TCP block and Tx TCP block TCP Connection block is responsible for managing TCP connection states. Rx TCP block is responsible for receive flow which receives packets from network and sends to CPU. Rx TCP performs header and data processing and sends header information to TCP connection block and Tx TCP block It also assembles out-of-ordered data to in-ordered before it transfers data to CPU. Tx TCP block is responsible for transmit flow which transfers data from CPU to network. Tx TCP performs retransmission for reliable data transfer and management of transmit window and sequence number. Various test-cases are used to verify the TCP functions. The TCP Engine is synthesized using 0.18 micron technology and results in 51K gates not including buffers for temporal data storage.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.234-236
• /
• 2004

Transmission control protocol(TCP) is protocol used in internet. TCP is seldom transmission error and is protocol based on wire environment. TCP uses 3 way handshake ways, data transmission control through windows size, data transmission control through reception confirmation, sliding window for packet delivery. In this study, designed TCP packet ion module for analyze the TCP segments & correct information about TCP. TCP capture in internet using designed TCP module and analysed TCP segments composition. Through this, could analyze the correct information of protocol in network.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1052-1062
• /
• 2004

Recent studies have pointed out that existing high-speed TCP protocols have a severe unfairness and TCP friendliness problem. As the congestion window achieved by a high-speed TCP connection can be quite large, there is a strong possibility that the sender will transmit a large burst of packets. As such, the current congestion control mechanisms of high-speed TCP can lead to bursty traffic flows in hi인 speed networks, with a negative impact on both TCP friendliness and RTT unfairness. The proposed solution to these problems is to evenly space the data sent into the network over an entire round-trip time. Accordingly, the current paper evaluates this approach with a high bandwidth-delay product network and shows that pacing offers better TCP friendliness and fairness without degrading the bandwidth scalability.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.235-244
• /
• 2004

TCP Vegas version provides better performance and more stable services than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, in the situation where TCP Vegas and Reno share the bottleneck link, the performance of TCP Vegas is much smaller than that of TCP Reno. This unfairness is due to the difference of congestion control mechanisms of each TCP use. Several studies have been executed in order to solve this unfairness problem. In this paper, we analyze the minimum window size to maintain the maximum TCP performance of link bandwidth. In addition, we propose an algorithm which maintains the TCP performance and improves fairness by selective packet drops in order to allocate proper window size of each TCP connections. To evaluate the performance of the proposed algorithm, we have measured the number of data bytes transmitted between end-to-end systems by each TCP connections. The simulation results show that the proposed algorithm maintains the maximum TCP performance and improves the fairness.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.125-132
• /
• 2007

Transmission mechanisms that include an available bandwidth estimation algorithm and a packet loss differentiation scheme, in general, exhibit higher TCP performance in wireless networks. TCP New Jersey, known as the best existing scheme in terms of goodput, improves wireless TCP performance using the available bandwidth estimation at the sender and the congestion warning at intermediate routers. Although TCP New Jersey achieves 17% and 85% improvements in goodput over TCP Westwood and TCP Reno, respectively, we further improve TCP New Jersey by exploring improved available bandwidth estimation, retransmission timeout, and recovery mechanisms. Hence, we propose TCP New Jersey PLUS (shortly TCP NJ+), showing that under 1% packet loss rate, it outperforms 3% by TCP New Jersey and 5% by TCP Wes1wood. In 5% packet loss rate, a characteristic of high bit-error-rate wireless network, it outperforms other TCP variants by 19% to 104% in terms of goodput even when the network is in bi-directional congestion.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.355-368
• /
• 2006

This paper introduces a new split-TCP approach for improving TCP performance over IEEE 802.11-based wireless LANs. TCP over wireless LANs differently from wired networks is not aggressive, which is a fundamental reason for poor performance. Therefore, we propose TAS (TCP-Aware Sub-layer) to migigate this problem. Our scheme extends the split-connection approach that divides a connection into two different connections at a split point such as an access point (AP). Using TAS, a wireless node emulates TCP ACK packets using MAC ACK frames, instead of receiving real TCP ACK packets. We compared TAS with both normal TCP and I-TCP (Indirect TCP) by NS2 simulation. Results show that TAS achieves higher throughput, more fair resource allocation and, in power-saving mode, shorter delays.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.221-231
• /
• 2006

TCP is needed as a transport protocol to provide reliable end-to-end message delivery for MANETs in order to achieve a smooth integration with the fixed Internet. Particularly, TCP has its variants, namely TCP-Reno and TCP-Vegas. However, there has been no research work on extensive performance comparison of TCP-Reno and TCP-Vegas over AODV and OLSR. This paper is the first trial to perform the research by using ns-2 simulator. Through the extensive simulations, we found that which to select among routing protocols is more important than which to select among TCP variants, because the performance difference between TCP-Reno and TCP-Vegas over uy selected routing protocol is not so much outstanding. Particularly, TCP-Vegas relies on an accurate BaseRTT estimation in order to decide the sending rate of a TCP Sender. However, it cannot be directly applied to MANET because a route change makes the Base an used over a Previous Path obsolete. Therefore, we propose a technique for improving the performance of TCP-Vegas by considering the route change, and show the performance improvement through simulation study.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.865-874
• /
• 2002

HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1600-1610
• /
• 2015

While today's networks have been shown to exhibit HBDP (High Bandwidth Delay Product) characteristics, the legacy TCP increases the size of the congestion window slowly and decreases the size of the congestion window drastically such that it is not suitable for HBDP Networks. In order to solve this problem with the legacy TCP, many congestion control TCP mechanisms have been proposed. C-TCP (Compound-TCP) is a hybrid TCP which is a synergy of delay-based and loss-based approaches. C-TCP adapts the decreasing rate of the delay window without considering the congestion level, leading to degradation of performance. In this paper, we propose a new scheme to improve the performance of C-TCP. By controlling the increasing and decreasing rates according to the congestion level of the network, our proposed scheme can improve the bandwidth occupancy and fairness of C-TCP. Through performance evaluation, we show that our proposed scheme offers better performance in HBDP networks as compared to the legacy C-TCP.