• Title/Summary/Keyword: packet loss

Search Result 975, Processing Time 0.023 seconds

TCP NJ+: Packet Loss Differentiated Transmission Mechanism Robust to High BER Environments (TCP NJ+ : 높은 BER에 강인한 패킷 손실 원인별 처리기반 전송방식)

  • Kim, Jung-Rae;Lee, You-Ho;Choo, Hyun-Seung
    • 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.

  • PDF

Architecture and Performance Analysis of the Cellular Ethernet System with a Dual Link for efficient Micro Mobility (효율적인 미시적 핸드오버를 지원하는 이중 링크 기반의 셀룰러 이더넷 시스템의 구조 및 성능 분석)

  • Jung, Han-Gyun;Yoon, Chong-Ho;Park, Pu-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.54-62
    • /
    • 2007
  • Mobile IPv6 is the representative standard protocol proposed to offer mobility of mobile hosts, but it has drawbacks such as high handover latency and packet loss during handover. To complement these drawbacks, several protocols have been proposed and they can support faster handover than the Mobile IPv6, but there still exists inevitable packet loss during handover in those protocols. In this paper, we propose a new handover procedure of mobile host who has a dual link for minimizing packet loss rate during micro handover to improve mobility capability of Cellular Ethernet system that supports mobility at layer 2. And we derive the superiority of proposed scheme by comparing in terms of packet loss rate, handover latency and throughput of proposed scheme with those of Hierarchical Mobile IPv6 which is the representative IP-layer micro mobility protocol by simulation.

Analytical model for mean web object transfer latency estimation in the narrowband IoT environment (협대역 사물 인터넷 환경에서 웹 객체의 평균 전송시간을 추정하기 위한 해석적 모델)

  • Lee, Yong-Jin
    • 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.

(A Packet Loss Recovery Algorithm for Tree-based Mobile Multicast) (트리기반 이동 멀티캐스트를 위한 패킷손실회복 알고리즘)

  • 김기영;김선호;신용태
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.343-354
    • /
    • 2003
  • This paper describes algorithm that minimizes recovery time of packet loss resulting from handoff in multicast environments and guarantees reliability through interaction of FN(Foreign Network) with PMTP(Predictable Multicast Tree Protocol). To solve the problems that inefficient routing and handoff delay taking plate when using hi-directional tunneling and remote subscription independently in multicast environments, proposed algorithm uses tunneling and rejoining multicast group according to the status of an arriving FA in a foreign network. Furthermore, proposed algorithm sends packet loss information and register message to previous FA or current FA at the same time. so, MH is able to recovery packet loss in handoff delay as soon as possible. As a result of performance analysis, proposed algorithm is more efficient than previous researches and is applicable to existing handoff method without requiring additional procedures.

Performance Improvement of Wireless Uplink Channels Using Packet Diversity (패킷 다이버시티를 이용한 무선 상향 링크의 성능 개선)

  • Lee, Goo-Yeon;Kim, Hwa-Jong;Jeong, Choong-Kyo;Lee, Yong
    • Journal of Industrial Technology
    • /
    • v.24 no.B
    • /
    • pp.187-192
    • /
    • 2004
  • In this paper, we introduce a packet diversity scheme to increase uplink channel utilization in a wireless network where forward error correction is used. The packet diversity allows neighbor base stations to receive uplink packets from a mobile terminal in order to increase the utilization of the uplink channel. By allowing multiple base stations to receive the same packets, we can improve the error correction capability in an uplink channel. By incorporating the packet diversity we can reduce the parity overhead of each packet for a given tolerable loss probability, which improves the link efficiency.

  • PDF

Buffer Management Algorithms in Unbounded Buffers

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.721-724
    • /
    • 2010
  • In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

A Packet Scheduling Algorithm for High-speed Portable Internet System (휴대 인터넷 시스템에서의 패킷 스케줄링 알고리즘 연구)

  • Choi, Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.59-65
    • /
    • 2007
  • HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

Performance Analysis of LAN Interworking Unit for Capacity Dimensioning of Internet Access Links

  • Park, Chul-geun;Han, Dong-hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.692-699
    • /
    • 2000
  • We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

  • PDF

Packet Delay and Loss Analysis of Real-time Traffic in a DBA Scheme of an EPON (EPON의 DBA 방안에서 실시간 트래픽의 패킷 손실률과 지연 성능 분석)

  • Shim, Se-Yong;Park, Chul-Geun
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.86-88
    • /
    • 2004
  • As the rapid incensement of the number of internet users has occurred recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as VoIP(Voice over Internet Protocol), and nonreal-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analyzed with simulation.

  • PDF

A Light-weight and Dynamically Reconfigurable RMON Agent System

  • Lee, Jun-Hyung;Park, Zin-Won;Kim, Myung-Kyun
    • Journal of Information Processing Systems
    • /
    • v.2 no.3 s.4
    • /
    • pp.183-188
    • /
    • 2006
  • A RMON agent system, which locates on a subnet, collects the network traffic information for management by retrieving and analyzing all of the packets on the subnet. The RMON agent system can miss some packets due to the high packet analyzing overhead when the number of packets on the subnet is huge. In this paper, we have developed a light-weight RMON agent system that can handle a large amount of packets without packet loss. Our RMON agent system has also been designed such that its functionality can be added dynamically when needed. To demonstrate the dynamic reconfiguration capability of our RMON agent system, a simple port scanning attack detection module is added to the RMON agent system. We have also evaluated the performance of our RMON agent system on a large network that has a huge traffic. The test result has shown our RMON agent system can analyze the network packets without packet loss.