• Title/Summary/Keyword: 패킷 예측

Search Result 234, Processing Time 0.027 seconds

A Frequency Offset Estimation Algorithm using Frequency Offsets Estimated from Previous Packets in OFDM System (OFDM 시스템에서의 패킷들의 상관관계를 이용한 주파수 오프셋 예측 알고리즘)

  • Kim, Sang-Sik;Kwak, Jae-Min;Park, Jong-Su;Choi, Jong-Chan;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7A
    • /
    • pp.702-709
    • /
    • 2008
  • This paper presents a frequency offset estimation scheme which can be used for packet based OFDM communication systems. The proposed scheme detects the failure of performing coarse frequency offset estimation and compensates the error of estimated coarse frequency offset. The preamble structure considered in this paper is based on the preamble specified in IEEE802.11a and IEEE802.11p standards. We performed simulation to compare the performance according to the different number of reference packets used to detect the failure of performing coarse frequency offset estimation. The simulation results show that the proposed scheme has better performance than the conventional scheme in the low SNR(below 2dB) environment.

Packet Scheduling Mechanism to Improve TCP Throughput Using Link State Information in Wireless Networks (무선 네트워크에서 링크 상태 정보를 이용하는 TCP 효율 향상을 위한 패킷 스케줄링 매커니즘)

  • Kim Seong-Cheol;Lee Jin-Young
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1443-1451
    • /
    • 2004
  • In this paper we propose a new packet scheduling mechanism to improve TCP throughput and fairness with estimated link state information in wireless networks, in which mobile hosts are receivers. Since a priori estimated link state information is used in this proposed mechanism, the entire packet transmission time can be reduced. In other words, packets scheduling procedure is performed before packets are transmitted using estimated link state. The proposed mechanism also has an temporary FIFO queue to store packets which are on the head of queue and can not be transmitted due to bad link state. Using this temporary FIFO queue, HOL(Head of Line) problem of FIFO queue can be resolved.

  • PDF

Channel Quality Based Wireless TCP Mechanism Considering Link Loss Prediction Error (링크 손실 예측 오류를 고려한 채널 상태 기반 무선 TCP 매커니즘)

  • 김성철;정주연;이진영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.469-471
    • /
    • 2003
  • TCP는 패킷손실이 발생할 경우에 이를 혼잡에 의한 것이라고 판단하여 혼잡제어를 수행하는 프로토콜이다. 그러나 무선망은 그 특성상 에러가 많기 때문에 기존의 TCP프로토콜을 그대로 적용할 경우 불필요한 혼잡제어를 수행하게 되어 결국 전체 망의 성능을 떨어뜨리게 된다. 본 논문에서는 링크상태에 따라 송신률을 조절하는 TCP-ELSA 메커니즘 이용하여 링크상태 예측 방법을 개선하였다. TCP-ELSA는 무선링크의 링크상태를 예측하여 송신률을 조절하여 대역폭의 효율을 증가시키고 링크의 공평성을 보장하는 메커니즘이다. 본 논문에서 제안하는 개선된 TCP-ELSA는 링크상태 예측방법에 있어서 오류가 발생할 수 있는 경우를 고려함으로써 공평성을 유지하면서도 좀더 정확한 링크상태의 예측이 가능하도록 한다. 그리고 실시간 패킷을 비실시간 패킷과 구분하여 전송하도록 하여 Qos를 제공하였다.

  • PDF

Performance Improvement of Packet Loss Concealment Algorithm in G.711 Using Adaptive Signal Scale Estimation (적응적 신호 크기 예측을 이용한 G.711 패킷 손실 은닉 알고리즘의 성능향상)

  • Kim, Tae-Ha;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.34 no.5
    • /
    • pp.403-409
    • /
    • 2015
  • In this paper, we propose Packet Loss Concealment (PLC) method using adaptive signal scale estimation for performance improvement of G.711 PLC. The conventional method controls a gain using 20 % attenuation factor when continuous loss occurs. However, this method lead to deterioration because that don't consider the change of signal. So, we propose gain control by adaptive signal scale estimation through before and after frame information using Least Mean Square (LMS) predictor. Performance evaluation of proposed algorithm is presented through Perceptual Evaluation of Speech Quality (PESQ) evaulation.

No-Reference Video-Quality Assessment of Packet Loss Effect over Packet Video Network (패킷비디오 네트워크에서의 패킷손실을 고려한 무기준 화질열화 예측기법)

  • Han, Jung-Hyun;Kim, Yo-Han;Kim, Hyun-Tai;Shin, Ji-Tae
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.11a
    • /
    • pp.183-186
    • /
    • 2009
  • 인터넷의 발전과 비디오 압축 코덱의 발전으로 인해 실시간 영상 스트리밍 (Streaming) 서비스가 가능해졌다. 하지만, 패킷 손실로 인한 비디오 화질 열화는 여전히 문제가 되고 있다. 이 때문에 부호화기 에서는 에러에 강한 내성을 가지는 부호화방법으로 압축하며, 복호화기 에서는 에러 은닉기법을 통하여 패킷 손실에 의한 화질열화를 최소화한다. 이런 기법들을 활용하기 위해서는 패킷손실을 보정한 정확한 화질 열화를 측정 할 수 있는 방법이 필요하다. 영상의 화질을 평가하는 방법은 어떤 정보를 기준으로 평가하느냐에 따라서 전체 기준법 (Full Reference), 부분기준법 (Reduced Reference) 그리고 무기준법 (No Reference)으로 나눌 수 있다. 이중에서 무기준법은 수신 영상만을 가지고 측정하기 때문에, 다른 방법보다 활용범위가 넓다. 본 논문에서는 패킷 비디오 네트워크 환경에서의 발생할 수 있는 다양한 패턴의 패킷 손실에 따른 비디오의 화질 열화를 무기준법에 의해 측정하는 방법을 제안한다. 제안한 방법은 수신된 영상의 움직임 정보를 이용하여 패킷 손실에 따른 각 프레임당 초기 에러 값을 예측 한다. 실험 결과를 통하여 제안한 방법이 상당히 높은 피어슨 상관도 (Pearson Correlation)를 보여준다.

  • PDF

Simulation of Packet Transmission Efficiency for Routing Algorithm on Torus-Networks (토러스 망에서 라우팅 알고리즘에 대한 패킷 전송 효율의 시뮬레이션)

  • 김현기;송호정;박준선;하기종;이천희
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1996.05a
    • /
    • pp.10-14
    • /
    • 1996
  • 본 논문은 토러스 망의 패킷 전송 효율을 평가하기 위해 각 노드가 에지당 2개의 입·출력 큐를 가지는 라우팅 알고리즘을 제시하고 시뮬레이션을 수행하여 그 결과를 분석하였다. 제시된 4가지 오름순차를 가지는 라우팅 알고리즘에 대해 시뮬레이션을 하기 위해 도착분포와 서비스분포는 지수분포를 갖도록하여 교착상태가 없는 패킷 전송 효율을 비교 평가하였다. 실험 결과로부터 무교착 상태로 패킷을 전달하기 위한 노드 큐의 크기를 알 수 있었고, 또한 입력 패킷 메시지의 분포에 따라 패킷의 전송 효율을 높이기 위한 버퍼의 크기를 예측할 수 있었다.

  • PDF

Adaptive and Strict Packet Dropping Mechanism for the Congestion Control of AF Packets in Differentiated Service (차별화 서비스에서 AF 패킷의 혼잡제어를 위한 적응적 엄격 패킷 폐기 메커니즘)

  • Kim, Su-Yeon;Kahng, Hyun-Kook
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.11
    • /
    • pp.1-8
    • /
    • 2001
  • Adaptive and Strict Packet Dropping mechanism we proposed in this paper drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes the wastes of the bandwidth being capable of predicting in Dynamic and Strict Packet Dropping (DSPD) mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic and compared RIO and the DSPD. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class than RIO and the DSPD mechanism.

  • PDF

Cycling Packet Dropping Mechanism for Assured Forwarding Packets in Internet (인터넷에서 Assured Forwarding 패킷을 위한 사이클링 패킷 폐기 메커니즘)

  • Kim, Su-Yeon;Gang, Hyeon-Guk
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.221-226
    • /
    • 2002
  • Cycling Packet Dropping mechanism we proposed in this paper adaptively drops packets, as predicting traffic pattern between each cycle. Therfore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes errors being capable of predicting in Dynamic and Strict Packet Dropping mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class.

The Congestion Estimation based TCP Congestion Control Scheme using the Weighted Average Value of the RTT (RTT의 가중평균값을 이용한 혼잡 예측 기반 TCP 혼잡 제어 기법)

  • Lim, Min-Ki;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.16 no.3
    • /
    • pp.381-388
    • /
    • 2015
  • TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

Adaptive Packet Transmission Interval for Massively Multiplayer Online First-Person Shooter Games

  • Seungmuk, Oh;Yoonsik, Shim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.39-46
    • /
    • 2023
  • We present an efficient packet transmission strategy for massively multiplayer online first-person shooter (MMOFPS) games using movement-adaptive packet transmission interval. The player motion in FPS games shows a wide spectrum of movement variability both in speed and orientation, where there is room for reducing the number of packets to be transmitted to the server depending on the predictability of the character's movement. In this work, the degree of variability (nonlinearity) of the player movements is measured at every packet transmission to calculate the next transmission time, which implements the adaptive transmission frequency according to the amount of movement change. Server-side prediction with a few auxiliary heuristics is performed in concert with the incoming packets to ensure reliability for synchronizing the connected clients. The comparison of our method with the previous fixed-interval transmission scheme is presented by demonstrating them using a test game environment.