• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2014

There have been company researches for TCP-Westwood algorithms in wireless TCP environment with high packet loss rate. Because the TCP-Westwood algorithm adjusts the congestion window according to the ABE(Available Bandwidth Estimation), the algorithm has a problem which the accuracy of ABE decreases as the error rate increases. To solve such a problem, the proposed scheme in this paper adopts the existing packet pattern based algorithm that the ABE is ignored when the arriving interval time of ACK is longer than a given interval time and uses new algorithm that the ABE is reallocated to a given allowable ABE when the ABE is over the allowable range. The proposed scheme shows the simulation result that the ABE is closest to the setting bandwidth for simulation compared to the existing algorithms.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.45-50
• /
• 2008

Many applications of sensor network require connection to the Internet. The transmission protocol of traditional sensor network was designed within the sensor network itself. However, based on 6LoWPAN which can be accessed using IPv6, direct connection is possible between the sensor network and the TCP/IP network outside. Transmission of data in applications of sensor network falls into two main categories. One is a small packet that is periodically produced such as packet related to temperature and humidity. The other is a relatively large packet that brings about network overheads such as images. We investigated the conformance test and pros and cons of application data over the transmission protocol of Zigbee and 6LoWPAN. As a result, both Zigbee and 6LoWPAN have shown low rate of loss for periodic data and have in creased reliability of data transfer. When transmitting streaming image data, both ACK, non ACK mode of Zigbee and UDP of 6LoWPAN minimized transmission time but suffered the consequences of high packet loss. Even though TCP of 6LoWPAN required a long transmission time, we were able to confirm that no loss has occurred.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.435-445
• /
• 2007

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem: it cannot perform local retransmission efficiently under the bursty-error prone wireless link. To solve this problem, SACK-Aware-Snoop and SNACK mechanism have been proposed. These approaches improve the performance by using SACK option field between base station and mobile host. However in the wireless channel with high packet loss rate, SACK-Aware-Snoop and SNACK mechanism do not work well because of two reason: (a) end-to-end performance is degraded because duplicate ACKs themself can be lost in the presence of bursty error, (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily because of SACK option field in the wireless link. In this paper, we propose a new local retransmission scheme based on Cross-layer approach, called Cross-layer Snoop(C-Snoop) protocol, to solve the limitation of previous localized link layer schemes. C-Snoop protocol includes caching lost TCP data and performing local retransmission based on a few policies dealing with MAC-layer's timeout and local retransmission timeout. From the simulation result, we could see more improved TCP throughput and energy efficiency than previous mechanisms.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.73-82
• /
• 2016

In cognitive radio networks (CRNs), the performance of the transmission control protocol (TCP) at the secondary user (SU) severely drops due to the mistrigger of congestion control. A long disruption is caused by the transmission of primary user, leading to the mistrigger. In this paper, we propose a cross-layer approach, called a CR-aware scheme that enhances TCP performance at the SU. The scheme is a sender side addition to the standard TCP (i.e., TCP-NewReno), and utilizes an explicit cross-layer signal delivered from a physical (or link) layer and the signal gives an indication of detecting the primary transmission (i.e., transmission of the primary user). We evaluated our scheme by implementing it onto a software radio platform, the Universal Software Radio Peripheral (USRP), where many parts of lower layer operations (i.e., operations in a link or physical layer) run as user processes. In our implementation, we ran our CR-aware scheme over IEEE 802.15.4. Furthermore, for the purpose of comparison, we implemented a selective ACK-based local recovery scheme that helps TCP isolate congestive loss from a random loss in a wireless section.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.275-284
• /
• 2010

The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.923-930
• /
• 2001

In this paper, in order to improve the performance of TCP short traffic services in wireless Internet environments, the Split-ACKs(SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless links results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end performance degradation of TCP. In this paper, to alleviate the TCP performance, the SPACK method, split acknowledgement packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analyzed and shows better performance than traditional TCP protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.813-822
• /
• 2003

Conventional TCPs are designed to work efficiently on wired network where any transmission errors rarely take place. However, the probability of transmission error in a wireless network is much higher than in a wired network, due to pass loss, multipath fading, and many kinds of interference. There were many researches on preventing the degradation of TCP performance in these wireless networks with bad channel condition. One of these researches is the SNOOP protocol which is link-layer solution for achieving high throughput of TCP. However, this SNOOP protocol is apt to retransmit some TCP segments unnecessarily, which could cause some increased traffic loads in a wireless network. In this paper, we propose a new algorithm to prevent the unnecessary retransmission of TCP segments and to achieve increased performance of TCP.

• 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.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1521-1529
• /
• 2009

There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.