• Title/Summary/Keyword: 패킷손실

Search Result 1,108, Processing Time 0.023 seconds

Selection of Scalable Video Coding Layer Considering the Required Peak Signal to Noise Ratio and Amount of Received Video Data in Wireless Networks (무선 네트워크에서 요구되는 평균 최대 신호 대 잡음비와 수신 비디오 데이터양을 고려하는 스케일러블 비디오 코딩 계층 선택)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.17 no.2
    • /
    • pp.89-96
    • /
    • 2016
  • SVC(Scalable Video Coding), which is one form among video encoding technologies, makes video streaming with the various frame rate, resolution, and video quality by combining three different scalability dimensions: temporal, spatial, and video quality scalability. As the above SVC-encoded video streaming consists of one base layer and several enhancement layers, and a wireless AP(Access Point) chooses and sends a suitable layer according to the received power from the receiving terminals in the changeable wireless network environment, the receiving terminals supporting SVC are able to receive video streaming with the appropriate resolution and quality according to their received powers. In this paper, after the performance analysis for the received power, packet loss rate, PSNR(Required Peak Signal to Noise Ratio), video quality level and amount of received video data based on the number of SVC layers was performed, an efficient method for selecting the number of SVC layer satisfying the RSNR and minimizing the amount of received video data is proposed.

Internet Based Tele-operation of the Autonomous Mobile Robot (인터넷을 통한 자율이동로봇 원격 제어)

  • Sim, Kwee-Bo;Byun, Kwang-Sub
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.692-697
    • /
    • 2003
  • The researches on the Internet based tole-operation have received increased attention for the past few years. In this paper, we implement the Internet based tele-operating system. In order to transmit robustly the surroundings and control information of the robot, we make a data as a packet type. Also in order to transmit a very large image data, we use PEG compressive algorithm. The central problem in the Internet based tele-operation is the data transmission latency or data-loss. For this specific problem, we introduce an autonomous mobile robot with a 2-layer fuzzy controller. Also, we implement the color detection system and the robot can perceive the object. We verify the efficacy of the 2-layer fuzzy controller by applying it to a robot that is equipped with various input sensors. Because the 2-layer fuzzy controller can control robustly the robot with various inputs and outputs and the cost of control is low, we hope it will be applied to various sectors.

Simulation Analysis of User Grouping Algorithms for Massive Smart TV Services (시뮬레이션을 이용한 대규모 스마트 TV 서비스 제공을 위한 사용자 그룹핑 알고리즘 성능 분석)

  • Jeon, Cheol;Lee, Kwan-Seob;Jou, Wou-Seok;Jeong, Tai-Kyeong Ted.;Han, Seung-Chul
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.1
    • /
    • pp.61-67
    • /
    • 2011
  • Smart TV System will lead to drastic change of communication and media industries as one of the emerging next generation network services. However, when the number of concurrent users increases rapidly, the issue of service quality degradation occurs because providing services to many users simultaneously stresses both the server and the network. The server limitation can be circumvented by deploying server clusters. but the network limitation is far less easy to cope with, due to the difficulty in determining the cause and location of congestion and in provisioning extra resources. In order to alleviate these problems, a number of schemes have been developed. Prior works mostly focus on reducing user-centric performance metrics of individual connection, such as the round-trip time(RTT), downloading time or packet loss rate, but tend to ignore the network loads caused by the concurrent connections or global network load balance. In this work, we make an in-depth investigation on the issue of user grouping for massive Smart TV services through simulations on actual Internet test-bed, PlanetLab.

Low-Latency Beacon Scheduling Algorithms for Vehicular Safety Communications (차량간 안전 통신에서 짧은 지연시간을 보장하는 비콘 스케줄링 알고리즘)

  • Baek, Song-Nam;Jung, Jae-Il;Oh, Hyun-Seo;Lee, Joo-Yong
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.1
    • /
    • pp.19-28
    • /
    • 2011
  • The safety applications based on the IEEE 802.11p, periodically transmit the safety-related information to all surrounding vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic network topology and limited network resource, the fixed beacon scheduling scheme excess delay and packet loss due to the channel contention and network congestion. With this motivation, we propose a novel beacon scheduling algorithm referred to as spatial-aware(SA) beacon scheduling based on the spatial context information, dynamically rescheduling the beaconing rate like a TDMA channel access scheme. The proposed SA beacon scheduling algorithm was evaluated using different highway traffic scenarios with both a realistic channel model and 802.11p model in our simulation. The simulation results showed that the performance of our proposed algorithm was better than the fixed scheduling in terms of throughput, channel access delay, and channel load. Also, our proposed algorithm is satisfy the requirements of vehicular safety application.

Conversational Quality Measurement System for Mobile VoIP Speech Communication (모바일 VoIP 음성통신을 위한 대화음질 측정 시스템)

  • Cho, Jae-Man;Kim, Hyoung-Gook
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.4
    • /
    • pp.71-77
    • /
    • 2011
  • In this paper, we propose a conversational quality measurement (CQM) system for providing the objective QoS of high quality mobile VoIP voice telecommunication. For measuring the conversational quality, the VoIP telecommunication system is implemented in two smart phones connected with VoIP. The VoIP telecommunication system consists of echo cancellation, noise reduction, speech encoding/decoding, packet generation with RTP (Real-Time Protocol), jitter buffer control and POS (Play-out Schedule) with LC (loss Concealment). The CQM system is connected to a microphone and a speaker of each smart phone. The voice signal of each speaker is recorded and used to measure CE (Conversational Efficiency), CS (Conversational Symmetry), PESQ (Perceptual Evaluation of Speech Quality) and CE-CS-PESQ correlation. We prove the CQM system by measuring CE, CS and PESQ under various SNR, delay and loss due to IP network environment.

Error Concealment Method Based on POCS for Multi-layered Video Coding (다계층 비디오 코딩에 적용 가능한 POCS 기반 에러 은닉 기법)

  • Yun, Byoung-Ju
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.67-75
    • /
    • 2009
  • Multi-layered video coding that provides scalability across the visual content has emerged for easily adaptive service over current heterogeneous network. However, the network is still error prone environment so that video service may suffer packet loss or erroneous decoding of the video. Especially distortion caused by the burst error may propagate to several pictures until intra refreshing, which will raise a terrific degradation of picture quality. To overcome the problem at terminal independently, we propose a new error concealment algorithm for the multi-layered video coding. The proposed method uses the similarity of between layers in the multi-layered video coding and POCS (Projections Onto Convex Sets) which is a powerful error concealment tool, but heavily dependent on initial values. To find adequate initial value which can reduce iteration times as well as achieve high performance, we took consideration into both features of layered approach coding and the correlation in neighbor blocks. The simulation results show that the proposed concealment method works well.

Fast Handoff Technique using Improved Cashing Agent and CoA Pool in Mobile IP (모바일 아이피에서 개선된 캐싱 에이전트와 CoA 풀을 사용한 빠른 핸드오프 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

Delayed-constrained scheduling for a game server virtual machine (게임서버 가상머신을 위한 지연 제약 스케줄링)

  • kang, Kiwook;Ko, Cherl-hong;Hong, Jiman;Paik, Doowon
    • Journal of Korea Game Society
    • /
    • v.16 no.4
    • /
    • pp.57-68
    • /
    • 2016
  • As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

An Efficient Data Authentication Scheme for Content Centric Networking (컨텐츠 중심 네트워크에서 해시 체인 기반의 효율적인 데이터 인증 기법)

  • Seo, Seog Chung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.6
    • /
    • pp.1375-1386
    • /
    • 2016
  • This paper presents an efficient hash chain-based data authentication mechanism which can considerably reduce the overhead of processing and transmission for authenticating segments in CCN. The proposed method makes use of hash chain and MHT(Merkle Hash Tree). At first, it applies hash chain methods for data segments and encodes them to Data part. Then, it constitutes Meta part with the hash values generated at the previous step and properly applies both hash chain method and MHT-based signing for not only achieving efficiency, but also mitigating the drawback(data-loss, out-of-order transmission) of hash chain method. We have implemented our method in the CCNx library and measured the performance. When transmitting 100Mbyte of content, the proposed method generates only 2.596% of processing overhead and 1.803% of transmission overhead.

Performance Analysis of Virtual Conference System in the IPv6 Multicast Network (IPv6 멀티캐스트 네트워크에서 가상 학술회의 시스템의 성능 분석)

  • Eom, Tai-Rang;Do, Jin-Sook;Lee, Kyung-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.45-54
    • /
    • 2003
  • In the Protocol-Independent Multicast Sparse Mode(PIM-SM), we need a careful selection scheme for the Rendezvous Point(RP) which influences much on the QoS due to the delay among multicast group members and packet loss The QoS based RP selection schemes choose RPs which satisfy the restriction conditions such as bandwidth, delay, and other QoS parameters In this paper, we propose a new RP selection scheme which is a variation of the group-based RP selection scheme The new algorithm, MCT(Maximum Cross Tree), is implemented by taking advantages of the topology-based selection scheme and the group-based selection scheme as well In order to verify the proposed algorithm, we first measure the multicast traffic data of the Virtual Conference System implemented on the IPv6 network via KOREN, then expand the results to two types of network models and analyze the performance by computer simulation.