• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.279-289
• /
• 2009

As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. In this article, we suggest the newly improved algorithm using two parameters, the local retransmission time value and the local retransmission critical value to the BS based on the Snoop. This technique adjusts the base stations local retransmission timer effectively according to the wireless link status to recover the wireless packet loss rapidly. We checked that as a result of the suggested algorithm through various simulations, A-Snoop protocol improve more the wireless TCP transmission rate by recovering the packet loss effectively in the wireless link that the continuous packet loss occur than the Snoop protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.98-106
• /
• 2005

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.635-640
• /
• 2006

The Snoop in the BS (Base Station) performs a local retransmission over wired-wireless networks to recover packet loss quickly. However, when the MH (Mobile Host) leaves the reception range of the signal, the local retransmission causes performance to degrade. In this paper, we minimize the packet loss and local retransmission caused by the unreachability from BS to MH to improve network performance. To do this, we suggest to add RSS(Received Signal Strengths) flag bit in ACK packet of MH. By using this flag bit, the BS decides whether it retransmits or not to minimize packet loss. The result of the simulation by ns-2 shows a big improvement of performance in the networks.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.687-698
• /
• 1997

In this paper, a Variation of Blast with Go-Back-N(V-BGBN) protocol is proposed, which differs from Blast with Go-Back-N(BGBN) and Blast with Full Retransmission on Error(BFRE) protocols in the retransmission strategy of packets. Performances of these three protocols under correlated packet errors are analyzed. Throughput efficiency of an arbitrary packet is obtained under the assumption that the round trip delay and the packet length are respectively constant. Recursive formula and difference equations are used as analytical tools. Correlation of packet errors is modelled by a two state Markov chain. The throughput efficiencies under these protocols are compared. V-BGBN protocol is shown to be superior to other two protocols in high speed network.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.530-541
• /
• 2011

In this paper, we propose an effective network-adaptive ARQ based error control scheme to provide video streaming services through IP networks where packet error usually occurs. If time delay and feedback channel are allowed, client can request server to retransmit lost packets through IP networks. However, if retransmission is unconditionally requested without considering network condition and number of simultaneous feedback messages, retransmitted packets may not arrive in a timely manner so that decoding may not occur. In the proposed ARQ, a client conditionally requests retransmission based on assumed network condition, and it further determines valid retransmission time so that effective ARQ can be applied. In order to verify the performance of the proposed adaptive ARQ based error control, NIST-Net is used to emulate packet-loss network environment. It is shown by simulations that the proposed scheme provides noticeable error resilience with significantly reduced traffics required for ARQ.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.385-393
• /
• 2005

In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.15-19
• /
• 2000

This paper is about MPEG-4 error resilience tools of video streaming on packet service(ex, Internet). It is need to packetization for MPEG-4 video transport by packet unit on MPEG-4 system, this paper suggest packetization method of minimizing packet error on packet service[1]. FEC(Forward Error Correction) and retransmission is usually used for recovery of packet loss, and this paper suggest applying these method to DMIF(Delivery Multimedia Integration Framework) for minimizing packet loss[2].

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.97-104
• /
• 2001

In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

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

Stream Control Transmission Protocol(SCTP) is a new connection-oriented, reliable delivery transport protocol operating on top of an unreliable connectionless packet service such as IP. It inherits many of the functions developed for TCP, including flow control and packet loss recovery functions. In addition, it also supports transport layer multihoming and multistreaming In this paper, we study the impact of multi-homing on the performance of SCTP. We first compare performance of single-homed SCTP. multi-homed SCTP, TCP Reno and TCP SACK. We, then describe potential flaw in the current SCTP retransmission policy, when SCTP host is multihomed. Our Results show that SCTP performs better than TCP Reno and TCP SACK due to several changes from TCP in its congestion control mechanism. In particular. multi-homed SCTP shows the best result among the compared schemes. Through experimentation for multi-homed SCTP, we found that the current SCTP retransmission policy nay deteriorate the perfomance when the retransmission path it worse than the original path. Therefore, the condition of retransmission path is a very important factor In SCTP performance and a proper mechanism would be required to measure the condition of the retransmission path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.350-359
• /
• 2014

With the rapid growth of Internet, the importance of application traffic analysis is increasing for efficient network management. The statistical information in traffic flows can be efficiently utilized for application traffic identification. However, the packet out-of-order and retransmission occurred at the traffic collection point reduces the performance of the statistics-based traffic analysis. In this paper, we propose a novel method to detect and resolve the packet out-of-order and retransmission problem in order to improve completeness and accuracy of the traffic identification. To prove the feasibility of the proposed method, we applied our method to a real traffic analysis system using statistical flow information, and compared the performance of the system with the selected 9 popular applications. The experiment showed maximum 4% of completeness growth in traffic bytes, which shows that the proposed method contributes to the analysis of heavy flow.