• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.1-4
• /
• 2015

This paper aims to present the mathematical model to find the mean web object transfer latency in the slow-start phase of TCP congestion control mechanism, which is one of the main control techniques of Internet. Mean latency is an important service quality measure of end-user in the network. The application area of the proposed latency model is the narrowband environment including multi-hop wireless network and Internet of Things(IoT), where packet loss occurs in the slow-start phase only due to small window. The model finds the latency considering initial window size and the packet loss rate. Our model shows that for a given packet loss rate, round trip time and initial window size mainly affect the mean web object transfer latency. The proposed model can be applied to estimate the mean response time that end user requires in the IoT service applications.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.281-288
• /
• 2008

Recently, the advance of multimedia hardware has fostered the development of wireless multimedia sensor network which is able to ubiquitously obtain multimedia content such as image or audio from the environment. The multimedia data which has several characteristics such as large size and correlation between the data requires reliability in transmission. However, the existing solution which take the focus on the efficiency of network mainly, is not appropriate to transmit the multimedia data. In the paper, we proposes a reliable asynchronous image transfer protocol, RAIT. RAIT applies double sliding window method in node-to-node image tansfer to prevent the packet loss caused by network congestion. The double sliding window consists of one sliding window for the receiving queue, which is used for prevention of packet loss caused by communication failure between nodes and the other sliding window for the sending queue which prevents the packet loss caused by network congestion. the routing node prevents the packet loss and guarantees the fairness between the nodes by scheduling the packets based on the image non-preemptively. The RAIT implements the double sliding window method by cross layer design between RAIT layer, routing layer, and queue layer. The experiment shows that RAIT guarantees the reliability of image transmission compared with the existing protocol.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.24-30
• /
• 2006

With the original Transmission Control Protocol(TCP) design, which is particularly targeted at the wired networks, a packet loss is assumed to be caused by the network congestion. In the wireless environment where the chances to lose packets due to transmission bit errors are not negligible, though, this assumption may result in unnecessary TCP performance degradation. In these days, many papers describe about wireless-TCP which has suggested how to avoid congestion control when packet loss over the wireless network. In this paper, an enhancement scheme is proposed by modifying SNOOP scheme. To enhance the original SNOOP scheme, CPC(Consecutive Packet Control) and ZWSC(Zero Window Size Control) are added. The invocation of congestion control mechanism is now minimized by knowing the cause of packet loss. We use simulation to compare the overhead and the performance of the proposed schemes, and to show that the proposed schemes improve the TCP performance compares to SNOOP by knowing the cause of packet loss at the base station.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1406-1424
• /
• 2017

Recent advancements in network infrastructures provide increased opportunities to support data delivery over multiple paths. Compared with multi-homing scenario, overlay network is regarded as an effective way to construct multiple paths between end devices without any change on the underlying network. Exploiting multipath characteristics has been explored for TCP with multi-homing device, but the corresponding exploration with overlay network has not been studied in detail yet. Motivated by improving quality of experience (QoE) for reliable data delivery, we propose a multipath message transport protocol based on application level relay (MPMTP-AR). MPMTP-AR proposes mechanisms and algorithms to support basic operations of multipath transmission. Dynamic feedback provides a foundation to distribute reasonable load to each path. Common source decrease (CSD) takes the load weight of the path with congestion into consideration to adjust congestion window. MPMTP-AR uses two-level sending buffer to ensure independence between paths and utilizes two-level receiving buffer to improve queuing performance. Finally, the MPMTP-AR is implemented on the Linux platform and evaluated by comprehensive experiments.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.331-339
• /
• 2007

The problem of architecting a reliable transport system across an overlay network using split TCP connections as the transport primitive is mainly considered. The considered overlay network uses the application-level switch in each intermediate host. We first argue that natural designs based on store-and-forward principles that are maintained by split TCP connections of hop-by-hop approaches. These approaches in overlay networks do not concern end-to-end TCP semantics. Then, a new transport protocol-Overlay Transport Protocol (OTP)-that manages the end-to-end connection and is responsible for the congestion/flow control between source host and destination host is proposed. The proposed network model for the congestion and flow control mechanisms uses a new window size-Ownd-and a new timer in the source host and destination host. We validate our analytical findings and evaluate the performance of our OTP using a prototype implementation via simulation.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.264-270
• /
• 2006

In this paper we verified that the window based TCP performance of throughput can be improved by the traffic connection efficiency. and have studied the performance of traffic congestion control that is controlling transmission rate. In wireless network, the bidirectional node is run by estimating the usage rate of link of error control idle and the throughput is shown by transmitting segments. The throughput rate shows almost no delay due to the bidirectional traffic connection efficiency up to the allowable point as increasing the transport rate by the critical value, depending on the size of end-to-end node queue of the increase of transport rate. This paper reports the performance improvement as the number of feedback connection traffic congestion control increases because of the increase of the number of asynchronous transport TCP connections.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.9-12
• /
• 2000

In this paper, we carry out a performance study related to the Advanced Peer-to-Peer Network(APPN). For this particular network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a Perform ance model in order to study the Interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.474-476
• /
• 1998

전송 프로토콜은 응용 프로그램과 네트워크의 인터페이스로서, 응용 프로그램에서 요구한 QoS(Quality of Service)를 제공하는 역할을 한다. 이 중 TCP는 인터넷의 전송 흐름 제어를 위해서 사용되는 프로토콜이다. TCP의 흐름 제어를 위해서 수신된 데이터의 ACK(acknowledgement)에 따라 허가된 윈도크기만큼의 데이터를 보내는 크레디트 할당 밀집 윈도(congestion window)를 사용한 slow-start 알고리즘을 사용하며, 손실된 데이터를 재전송하기 위한 방법으로 빠른 재전송 및 회복 알고리즘을 사용한다. 본 논문에서는 빠른 재전송 알고리즘에서 나타나는 문제점을 알아보고, 이 알고리즘이 빠른 시간에 데이터 손실을 회복하고 데이터를 보낼 수 있도록 수정한 알고리즘을 소개한다. 또한 수정된 알고리즘을 확장하여 네트워크의 상태에 따라 더 많은 데이터를 보낼 수 있도록 개선한 알고리즘을 제안한다.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.40-50
• /
• 2000

We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.