• Title/Summary/Keyword: packet recovery

Search Result 151, Processing Time 0.021 seconds

A Study on Reliable Multicast Transmission using Recovery Cluster (복구 클러스터를 이용한 신뢰성 있는 멀티캐스트 전송에 관한 연구)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.11
    • /
    • pp.1-6
    • /
    • 2019
  • Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

Lane Adaptive Recovery for Multiple Lane Faults in Optical Ethernet Link

  • Han, Kyeong-Eun;Kim, Sun-Me;Lee, Jonghyun
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.1066-1069
    • /
    • 2014
  • We propose a lane adaptive recovery scheme for multiple lane faults in a multi-lane-based Ethernet link. In our scheme, when lane faults occur in a link, they are processed not as full link faults but as partial link faults. Our scheme provides a higher link utilization and lower packet loss rate by reusing the available lanes of the link and providing a low recovery time of under a microsecond.

Packet Scheduling Scheme and Receiver-Based Recovery Scheme for MPTCP in Heterogeneous Networks (이종망에서 MPTCP를 위한 패킷 스케줄링 방법과 수신단 기반의 손실 복구 방법)

  • Oh, Bong-Hwan;Kim, Hanah;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.11
    • /
    • pp.975-983
    • /
    • 2012
  • Multi network interface has become common phenomenon for mobile devices such as smart phone which has 3G, LTE-advanced, WiFi. Consequently, there are researches for a transmission strategies using multiple paths below on end-to-end connection. MPTCP which is proposed and being standardized by the IETF as a new transport protocol can perform concurrent multipath transfer using multiple network interfaces. However, current MPTCP has performance degradation when it use heterogeneous networks which have quite different network characteristics. Therefore, this paper proposes the packet scheduling scheme and receiver-based recovery scheme to reduce the performance degradation due to reordering problem. Also, simulation results show that the proposed scheme can improve throughput and retransmission performance.

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

Analysis of Bursty Packet Loss Characteristic According to Transmission Rate for Wi-Fi Broadcast (Wi-Fi 방송 서비스를 위한 방송 패킷 전송률에 따른 버스트 손실 특성 분석)

  • Kim, Se-Mi;Kim, Dong-Hyun;Kim, Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.7
    • /
    • pp.553-563
    • /
    • 2013
  • When the IEEE 802.11 wireless LAN-based broadcasting services, we use broadcast packets to broadcast multimedia contents to a large number of users using limited wireless resources. However, broadcast transmission is difficult to recover the loss packets compared with unicast transmission. Therefore, analysis of packet loss characteristics is required to perform efficient packet recovery. The packet loss in wireless transmissions is often bursty with high loss data rate. Even if loss patterns have the same average packet loss, they are different in the recovery rate of random loss and burst loss depending on the nature. Therefore, the analysis and research of the nature of the loss are needed to recover loss packets considering bursty characteristics. In this paper, we experimented Wi-Fi broadcast transmission according to transmission rate and analyzed bursty characteristics of loss patterns using 4-state markov model.

Lower Bound of Partial Packet Recovery (패킷부분재전송기법의 수율 최저 한계)

  • Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.28 no.A
    • /
    • pp.113-117
    • /
    • 2008
  • Wireless carrier sense multiple access (CSMA) systems are widely used but show extremely different transmission efficiency according to the operation environment. Simulation or prototype deployment is needed to see the transmission efficiency of a wireless CSMA system with the partial packet retransmission scheme. The lower bound for the transmission efficiency of such a system is found mathematically in this work. This shows how much the partial packet retransmission scheme improves the transmission efficiency quantitatively. It also shows that the maximum throughput is obtained at higher offered load compared to the conventional CSMA system without the partial packet transmission. The result of this work can be applied to IEEE 802.11 networks or wireless mesh networks.

  • PDF

Utilizing Multicasts Routers for Reliability in On-Line Games (온라인 게임에서 신뢰성 확보를 위한 멀티캐스트 라우터의 활용)

  • Doo, Gil-Soo;Lee, Kwang-Jae;Seol, Nam-O
    • Journal of Korea Game Society
    • /
    • v.2 no.1
    • /
    • pp.23-29
    • /
    • 2002
  • Multicast protocols are efficient methods of group communication such as video conference, Internet broadcasting and On-Line Game, but they do not support the various transmission protocol services like a reliability guarantee, FTP, or Telnet that TCPs do. The Purpose or this Paper is to find a method to utilize multicast routers can simultaneously transport multicast packets and TCP packets. For multicast network scalability and error recovery the existing SRM(Scalable Reliable Multicast)method has been used. Three packets per TCP transmission control window site are used for transport and an ACK is used for flow control. A CBR(Constant Bit Rate) and a SRM is used for UDP traffic control. Divided on whether a UDP multicast packet and TCP unicast packet is used simultaneously or only a UDP multicast packet transport is used, the multicast receiver with the longest delay is measured on the number of packets and its data receiving rate. It can be seen that the UDP packet and the TCP's IP packet can be simultaneously used in a server router.

  • PDF

Modeling TCP Loss Recovery Latency for the Number of Retransmissions (재전송 개수를 고려한 TCP 손실 복구 과정의 지연 모델링 및 분석)

  • 김동민;김범준;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12B
    • /
    • pp.1106-1114
    • /
    • 2003
  • Several analytic models describe transmission control protocol (TCP) performance such as steady-state throughput as an averaged ratio of number of transmissions to latency. For more detailed analysis of TCP latency, the latency during packet losses are recovered should be considered. In this paper, we derive the expected duration of loss recovery latency considering the number of packet losses recovered by retransmissions. Based on the numerical results verified by simulations, TCP using selective acknowledgement (SACK) option is more effective than TCP NewReno from the aspect of loss recovery latency.

Improving Loss Recovery Performance of TCP SACK by Retransmission Loss Recovery (재전송 손실 복구를 통한 TCP SACK의 성능 향상 모델링 및 분석)

  • 김범준;김동민;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.667-674
    • /
    • 2004
  • The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. Although TCP SACK can recover multiple packet losses in a window, it cannot avoid RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose a simple change to TCP SACK, which is called TCP SACK+ in simple. We use a stochastic model to evaluate the performance of TCP SACK+, and compare it with TCP SACK. Numerical results evaluated by simulations show that SACK+ can improve the loss recovery of TCP SACK significantly in presence of random losses.

A Routing Protocol with Fast-Recovery of Failures Using Backup Paths on MANETs (MANET에서 백업경로를 이용한 빠른 경로복구 능력을 가진 라우팅 프로토콜)

  • Thai, Ahn Tran;Kim, Myung-Kyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1541-1548
    • /
    • 2012
  • This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.