• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.699-706
• /
• 2008

This paper compares throughput performance of TCP and SCTP in a variety of network environments. For experiments, we construct a Linux-based testbed and consider a set of performance metrics such as MSS(Maximum Segment Size), transmission delay, and packet loss rate. In addition, we analyze the effect of SCTP multi-streaming on throughput. From the experimental results, we can see that SCTP provides throughput gain of approximately $20%{\sim}50%$ over TCP. This performance gain comes from the distinctive features of SCTP such as chunk bundling, initial congestion window of 2 MTU and SACK(Selective ACK) based error control. In the lossy networks, we can see that SCTP multi-streaming transmissions can effectively overcome the so-called HoLB(Head-of-Line Blocking) phenomenon of TCP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.7-13
• /
• 2011

While the TCP throughput degradation problem in coded wireless mesh networks is well-known, few effective solutions have been proposed. Most schemes proposed attempts to mask packet reordering by ordering packets at a lower layer or to adjust a packet transmission rate to solve the scarcity problem of coding opportunities. Through the throughput comparison of traditional standard TCP variants, we show that losses and duplication of TCP acknowledgements in coded wireless mesh networks can impact throughput. In addition, we show that a TCP variant that does not rely on duplicate acknowledgements is more suitable for coded wireless mesh networks.

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.176-184
• /
• 1997

The Asynchronous Transfer Mode(ATM) networks are being adopted as backbones over various parts of Internet. Also, TCP is one of the most widespread transport protocols, nowdays. It can be used with ATM. But, TCP shows poor end-to-end performance on ATM networks. Effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as congested link transmits cells from corrupted packets. This paper examines the behavior of TCP over ATM with limited bandwidth in a broadband environment. As multiple VBR sources occupies most of the available bandwidth, there has been a starvation effect, so TCP sources couldn't get the chance of transmitting data. Also, throughput is proportional to the amount of buffer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.107-109
• /
• 2016

In this paper, we address the TCP-over-WLAN performance problem that occurs during periodic active background scanning with which mobile devices discover available APs in the vicinity. We measure the impact of the scanning period on the TCP throughput and observe a significant performance degradation when the scan operation period is shortened. Our experimental analysis has identified the main cause of the problem, that is, the associated AP continues to send packets to the mobile device even when the device is not able to receive due to the scanning operation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.303-308
• /
• 2016

Recently, as the rapid development of network technology and the increase of services required high bandwidth such as multimedia service, the network traffic dramatically increases. This massive increase of network traffic causes some problems such as the degradation of QoS and the lack of network resources and, to solve these problems, various research to guarantee QoS have been performing. Currently, The most representative method to guarantee the QoS is the DiffServ(: Differentiated Service). The DiffServ defines the AF(: Assured Forwarding) PHB(: Per Hop Behavior) and statistically ensures the throughput over the certain level of data rate. However, the TCP congestion control method that make up the majority of the Internet traffic is not fundamentally suitable to the DiffServ that guarantees the throughput without managing the individual flow. Therefore, in this paper, we present this mismatch through the simulation as an example and propose the solution by controlling the TCP of the terminal in the network. The proposed scheme utilizes the information of the reception window size included in the ACK frame and does not require any modification of the TCP algorithms currently in use.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.81-86
• /
• 2011

In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.73-83
• /
• 2009

TCP(Transmission Control Protocol) is currently used connection-oriented protocol as a typical transport layer protocol in the Internet. However, it has deficiency not be able to communicate with other TCP entities when any link included in the path is down because of single-homing on single path. SCTP(Stream Control Transmission Protocol) suggested as the new transport layer protocol supports multi-homing feature, which provides several paths between source and destination. It can communicate with other SCTP entities using alternate path even when any link on the primary path is down. This paper aims to measure and analyze the multi-homing effect of SCTP over TCP in case of link-down using NS-2 simulator. We classify SCTP into $SCTP_{single-homing}$ and $SCTP_{multi-homing}$ because SCTP with single-homing can also be used like TCP. We measured throughput and bandwidth utilization varying link-down duration, bandwidth, and RTT(round trip time), Simulation results show that throughput of $SCTP_{multi-homing}$ is more than that of TCP by 18 % on average. It is also shown that $SCTP_{multi-homing}$ on varying RTT and bandwidth increases the throughput of TCP by 'l7% and 9% on average, respectively in the link-down environment. In above cases, more or less difference between $SCTP_{single-homing}$ and TCP on throughput and bandwidth utilization was found To summarize, multi-homing effect of SCTP over TCP on throughput is about 18 % on average in the link-down environment This experimental result can be used as the benchmark in order to estimate the multi-homing effect of SCTP over TCP when the link-down happens in the real Internet.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.667-669
• /
• 2005

TCP Vegas나 FAST TCP는 RTT(Round Trip Time) 동안 실제 처리량(actual throughput)이 기대 처리량 (expected throughput)보다 특정 임계값보다 더 작으면 혼잡 상황으로 판단하고 송신측에서 내보내는 데이터 양을 감소시킴으로써 혼잡을 제어한다. 그러나 RTT 기반의 처리량(Throughput) 측정은 송수신 경로가 다를 경우 양방향 경로의 혼잡 상황을 구분하지 않는 문제점을 가지고 있다. 따라서 본 논문에서는 TCP Timestamp를 이용하여 양방향 혼잡 상황을 구분하여 혼잡을 제어하는 메커니즘을 제안한다. 그리고 제안한 방식에 대한 성능 분석을 위해 NS-2의 TCP Vegas를 수정하여 시뮬레이션한 결과를 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.427-434
• /
• 2003

This paper suggests an improved TCP congestion algorithm, which is more robust to lossy wireless environment than other algorithms such as TCP-Reno. The suggested algorithm decides on the size of a congestion window depending on both PER (Packet Error Rate) and its state, which is one of fast recovery state and slow start state. Some simulations are given to validate the suggested algorithm and the algorithm is compared with other TCP congestion algorithm from the point of view of performance measures such as a congestion window and throughput. The suggested algorithm has better throughput than other algorithm over wireless links with high PER and similar throughput to others over wireless links with low BER.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10B
• /
• pp.638-643
• /
• 2007

Interconnecting wireless local area networks (WLANs) with third generation (3G) cellular networks has become an issue of great interest. However, a Vertical Handover (VHO) causes an abrupt change in link bandwidth. Due to such a change, TCP triggers unnecessary fast retransmission during a Downward VHO (DVHO) from a cellular network to a WLAN, causing throughput degradation. Thus, we propose a new reordering mechanism for DVHO that suppresses unnecessary retransmission due to the spurious duplicate acknowledgments. We analytically investigate the throughput of TCP in the literature and our proposed scheme. Through the numerical and simulation results, it is shown that our proposed TCP achieves better performance in terms of throughput, compared with Nodupack with SACK.