• 제목/요약/키워드: packet loss

검색결과 975건 처리시간 0.033초

우선순위 제어기법을 기반으로 한 재순환 Shuffle-Exchage 상호연결 ATM 스위치 (Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm)

  • 박병수
    • 한국정보처리학회논문지
    • /
    • 제7권6호
    • /
    • pp.1949-1955
    • /
    • 2000
  • This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

  • PDF

Dynamic Load-Balancing Algorithm Incorporating Flow Distributions and Service Levels for an AOPS Node

  • Zhang, Fuding;Zhou, Xu;Sun, Xiaohan
    • Journal of the Optical Society of Korea
    • /
    • 제18권5호
    • /
    • pp.466-471
    • /
    • 2014
  • An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.

Context-ID detection method for Robust Header Compression in wireless packet communication

  • Lee, Chul-Soo;Park, Hae-Wook
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1602-1605
    • /
    • 2002
  • Communication schemes are currently changing from circuit switched towards packet switched. These changes enable access to Internet and multimedia services in wireless network. Provision of real-time IP services in air interface introduces relatively large overhead in RTP/UDP/IP headers. To reduce the overhead, the header compression schemes are required. There exist two header compression schemes (CRTP, ROHC) which are IETF standards. We propose Context-ID detection method which reduces more efficiently the packet loss rate than two existing schemes. Its performance in WCDMA system environment is evaluated for CRTP and ROHC schemes.

  • PDF

웨이블릿 패킷을 적용한 의료영상의 워터마킹에 관한 연구 (A Study on Medical Image Watermarking with Wavelet Packet)

  • 이승용;김윤호;류광렬
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2002년도 추계종합학술대회
    • /
    • pp.222-225
    • /
    • 2002
  • 본 논문은 의료영상 워터마킹에 웨이블릿 패킷을 적용한 연구이다. 웨이블릿 패킷기법을 적용하여 저주파 대역에서 고주파 대역까지 손실을 최소화하므로 의료영상의 분해능을 향상시킨다. 비교분석 실험결과 PSNR은 0.1dB 이상 향상되었고 내구성 평가에서 압축률 60%에서 PSNR이 28dB 이상 얻었다. 결과적으로 의료영상의 화질이 향상되었으며 고의적인 영상왜곡 및 변형 등의 외부 공격에 대해 내구성을 유지하는 결과를 얻었다.

  • PDF

A study on Advanced Load-Balanced Ad hoc Routing Protocol

  • Lee, Joo-Yeon;Lee, Cheong-Jae;Kim, Yong-Woo;Song, Joo-Seok
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2004년도 춘계학술발표대회
    • /
    • pp.1433-1436
    • /
    • 2004
  • The ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure of centralized administration. Load-Balanced Ad hoc Routing(LBAR) protocol is an on-demand routing protocol intended for delay-sensitive applications where users are most concern with packet transmission delay. Although LBAR mechanism is a novel load balancing routing protocol for ad hoc network, it has own limitation in route path maintenance phase. Therefore, in this paper, we propose Advanced Load-Balanced Ad hoc Routing(A-LBAR) that is delay-sensitive and has an efficient path maintenance scheme. The robust path maintenance scheme is maintained by considering about nodal loads all over network and misbehavior of overloaded or selfish nodes. The proposed scheme provides good performance over DSR and AODV in terms of packet delay and packet loss rate when some misbehaving nodes exist in the network.

  • PDF

PMIPv6 빠른 핸드오버에서의 Out-of-Order 패킷 분석 (Out-of-Order Packet Analysis in Fast Handover for Proxy Mobile IPv6)

  • ;손민한;추현승
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2013년도 추계학술발표대회
    • /
    • pp.287-289
    • /
    • 2013
  • Fast Handover for Proxy Mobile IPv6 (FPMIPv6), a protocol described in RFC 5949, is used to reduce handover latency and minimize packet loss problem occuring in the Proxy Mobile IPv6 (PMIPv6) protocol. However, during the study of implementing FPMIPv6, we found the Out-of-Order Packet (OoOP) problem that occurs in the experiment of FPMIPv6. Since the OoOP is an issue that affects significantly to QoS of the network, in this paper, we analyze the OoOP problem by using network model. The analysis conducts the cause of occurring OoOP problem due to there exist two paths for data transmitted from Correspondent Node (CN) to MN in FPMIPv6.

IDS의 성능 향상을 위한 패킷 폐기 방안 (Policy of packet dropping for enhancing IDS performance)

  • 문종욱;김종수;정기현;임강빈;주민규;최경희
    • 정보처리학회논문지C
    • /
    • 제9C권4호
    • /
    • pp.473-480
    • /
    • 2002
  • 침입탐지시스템에 대해 많은 연구가 이루어지고 있지만 이들 연구는 침입탐지시스템내의 탐지 소프트웨어의 알고리즘에만 국한되어 있다. 하지만, 침입탐지시스템의 탐지 알고리즘이 우수하더라도 침입에 해당하는 단서인 패킷을 손실하게 되면 해당 침입을 탐지해내지 못하게 된다. 본 논문에서는 침입 탐지 시스템의 하드웨어적인 한계와 탐지 소프트웨어의 거대화에 따른 시스템 부하로 인해서 자연히 발생하게 되는 패킷 손실을 줄이기 위해서 탐지 시스템에 불필요한 패킷으로 분류될 수 있는 패킷을 미리 폐기함으로써 얻을 수 있는 탐지 시스템의 성능 향상을 다룬다. 실험 결과에 따르면 제안한 방법에 의해서 패킷 손실인 줄어들어 실제 공격에 대한 탐지율이 개선되었다.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권9호
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

Multicore Flow Processor with Wire-Speed Flow Admission Control

  • Doo, Kyeong-Hwan;Yoon, Bin-Yeong;Lee, Bhum-Cheol;Lee, Soon-Seok;Han, Man Soo;Kim, Whan-Woo
    • ETRI Journal
    • /
    • 제34권6호
    • /
    • pp.827-837
    • /
    • 2012
  • We propose a flow admission control (FAC) for setting up a wire-speed connection for new flows based on their negotiated bandwidth. It also terminates a flow that does not have a packet transmitted within a certain period determined by the users. The FAC can be used to provide a reliable transmission of user datagram and transmission control protocol applications. If the period of flows can be set to a short time period, we can monitor active flows that carry a packet over networks during the flow period. Such powerful flow management can also be applied to security systems to detect a denial-of-service attack. We implement a network processor called a flow management network processor (FMNP), which is the second generation of the device that supports FAC. It has forty reduced instruction set computer core processors optimized for packet processing. It is fabricated in 65-nm CMOS technology and has a 40-Gbps process performance. We prove that a flow router equipped with an FMNP is better than legacy systems in terms of throughput and packet loss.

소방로봇 원격제어를 위한 무선패킷 디지털 데이터통신 및 아날로그 영상통신 기법 (Wireless Digital Packet Communication and Analog Image Communication Systems for Fire Fighting Robot)

  • 정직한;김병욱;박상욱;박동조;박정현
    • 제어로봇시스템학회논문지
    • /
    • 제13권2호
    • /
    • pp.121-127
    • /
    • 2007
  • Frequent occurrences of a fire cause tremendous loss of human lives and their property. Recently, in order to cope with such catastrophic accidents, researches on fire-fighting robots are carried out in developed countries. Under the dangerous situations, it is sometimes impossible for fire-fighting men to access the firing place because of explosive materials, smoke, high temperature and so on. In such an environment, fire-fighting robots can be useful to extinguish the fire. It is usually very dangerous place where fire-fighting robots operate. Hence, these robots should be controlled by remote users who are for away from the firing place exploiting remote communication systems. This paper considers the communication systems between fire-fighting robots and remote users. The communication systems consist of two parts; digital packet communication systems and analog image communication systems. Digital packet communication systems transfer data packets in order to control fire-fighting robots and to check the state of the fire-fighting robots. Remote users watch the video around the fire-fighting robots by exploiting the analog image communication systems. In the future, the more prosperous the commercial communication network systems will be, the more evolved the communication systems for fire-fighting robots are.