• Title/Summary/Keyword: 혼잡제어

Search Result 526, Processing Time 0.025 seconds

A Representative-based Multicast Congestion Control (대표자 계층 구조를 이용한 멀티캐스트 혼잡 제어)

  • 송명준;차호정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.565-567
    • /
    • 1998
  • 본 논문은 멀티미디어 멀티캐스트 혼잡 제어에서 발생하는 피드백 폭주 문제를 해결하기 위해 대표자 계층구조를 이용한 피드백 수렴 방법과 이에 따른 전송률 조정 방법을 제안하고 시뮬레이션을 통해서 이를 검증한다. 시뮬레이션 결과 적절한 파라미터의 설정하에 피드백 폭주 문제를 해경하고 혼잡하고 대처하여 전송률을 조정할 수 있음을 볼 수 있었다.

  • PDF

Traffic Congestion Control Using PQS in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크에서 PQS를 이용한 트래픽 혼잡제어)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.2
    • /
    • pp.218-224
    • /
    • 2013
  • Uplink overflow in WMSN (Wireless Multimedia Sensor Networks) aggravates the resource consumption, delay, and traffic congestion. This paper proposes a new traffic congestion control mechanism using popularity. The proposed mechanism controls congestions by dispersing the media traffic, and it control fairly packets according to priority. This paper proposes PQS (Packet Queue Scheduler) to control fairly packets, and the proposed mechanism provides a fair opportunity to all sensor nodes without a specific location. The simulation results show that the proposed mechanism achieves improved performance in throughput, delay ratio, link quality, and buffer queue control ratio compared with those of other existing methods.

Congestion Control Mechanism for Efficient Network Environment in WMSN (무선 멀티미디어 센서 네트워크에서 효율적인 네트워크 환경을 위한 혼잡 제어 메커니즘)

  • Park, Jeong-Hyeon;Lee, Sung-Keun;Oh, Won-Geun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.289-296
    • /
    • 2015
  • Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.

Deep Reinforcement Learning-Based C-V2X Distributed Congestion Control for Real-Time Vehicle Density Response (실시간 차량 밀도에 대응하는 심층강화학습 기반 C-V2X 분산혼잡제어)

  • Byeong Cheol Jeon;Woo Yoel Yang;Han-Shin Jo
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.379-385
    • /
    • 2023
  • Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

Performance of TCP without congestion control (혼잡제어를 하지 않는 TCP의 성능)

  • Oh, Hong-Kyun;Kim, Eun-Gi
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.229-234
    • /
    • 2004
  • In this study, the performance is compared between RFC compatible normal TCP and several speed constraints Ignored TCP. To do these, the main algorithms that constraints the transmit rate of TCP are modified. We have modified TCP protocol stack in a Linux kernel to compare the speeds between the standard TCP and our modified TCP. We find that if the destination is short distance away from the source and packet error is scarce then the speed differences between normal and modified TCP nay be negligible. However, if the destination is far away from the source and slow start algorithm is not adopted then the transfer time for small file is different greatly In addition, if packet error occurred frequently, our modified TCP is faster than the standard TCP regardless of distance.

A Novel Rate Control for Improving the QoE of Multimedia Streaming Service in the Internet Congestion (인터넷 혼잡상황에서 멀티미디어 스트리밍 서비스의 QoE 향상을 위한 전송률 제어기법)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.492-504
    • /
    • 2009
  • The delivery of multimedia that efficiently adapts its bit-rate to changing network characteristics and conditions is one of the important challenging tasks in the design of today's real-time multimedia streaming systems such as IPTV, Mobile IPTV and so on. In these work, the primary focus is on network congestion, to improve network stability and inter-protocol fairness. However, these existing works have problems which do not support QoE (Quality of Experience), because they did not consider essential characteristics of contents playback such as the media continuity. In this paper, we propose a novel rate control scheme for improving the QoE of multimedia streaming service in the Internet congestion, called NCAR (Network and Client-Aware Rate control), which is based on network-aware congestion control and client-aware flow control scheme. Network-aware congestion control of the NCAR offers an improving reliability and fairness of multimedia streaming, and reduces the rate oscillation as well as keeping high link utilization. Client-aware flow control of NCAR offers a removing the media discontinuity and a suitable receiver buffer allocation, and provides a good combination of low playback delay. Simulation results demonstrate the effectiveness of our proposed schemes.

TCP AD-Vegas algorithm for Improving Efficiency of Transmission in TCP (TCP 전송 효율 개선을 위한 TCP AD-Vegas 알고리즘)

  • Park, Chang-Yong;Hwang, Su-Jin;Park, Min-Woo;Lee, Jun-Ho;Chung, Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.992-995
    • /
    • 2010
  • 본 논문에서는 TCP Vegas의 혼잡 제어 알고리즘을 개선하여 전송 효율을 높이는 TCP AD-Vegas를 제안한다. 현재 널리 사용되는 Reno 방식은 Additive Increase Multiplicative Decrease(AIMD) 기반의 혼잡제어 방식으로 혼잡이 생길 경우 세션의 전송 크게 줄이는 기법이다. 최근 네트워크 인프라 증가로 큰 대역폭을 사용할 수 있게 되었으나, TCP Reno의 소극적인 혼잡 윈도우 조절로 충분한 전송 효율을 얻지 못하고 있다. 본 논문에서는 RTT를 이용하여 혼잡 정도를 판단하고 혼잡 윈도우를 조절하는 TCP Vegas를 개선하여 TCP의 전송 효율을 높일 수 있는 새로운 알고리즘을 제안한다.

A Study on the Performance Improvements of Congestion Control of Multiple Time Scale Under in TCP-MT network (TCP-MT네트워크에서 다중 시간 간격을 이용한 혼잡제어 성능 개선에 관한 연구)

  • Cho, Hyun-Seob;Oh, Myoung-Kwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.1
    • /
    • pp.75-80
    • /
    • 2008
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

Improvement of TFMCC for Streaming Service (스트리밍 미디어 서비스를 위한 TFMCC 알고리즘의 개선 방안)

  • 김주영;정영준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.625-627
    • /
    • 2004
  • 인터넷에서 멀티캐스트에 대한 요구가 증가되고 있다. 그러나 UDP 기반의 멀티캐스트는 TCP 트래픽에 영향을 주기 때문에 혼잡제어가 요구된다. 이를 위해 여러 가지 혼잡제어 기법이 연구되었는데, 이중에서 본 논문에서는 스트리밍 미디어 응용에 적합한 TFMCC 기법에 대해서 소개하였다. 그리고 TFMCC의 CLR에 의한 전송률 조정은 멀티캐스트 세션 전체의 성능을 현저히 떨어뜨릴 수 있기 때문에 이를 해결하기 위한 방안을 제시하였다.

  • PDF

A New Queue Management Algorithm for Congestion Control in Internet Routers (인터넷 라우터의 혼잡제어를 위한 새로운 큐 관리 알고리즘)

  • 구자헌;송병훈;정광수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.490-492
    • /
    • 2000
  • 기존의 인터넷 라우터는 Drop tail 방식으로 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인한 혼잡 상황으로 발생하는 패킷 손실을 해결할 수 없다. 이 문제를 해결하기 위해 IETF(Internet Engineering Task Force)에서는 RED(Random Early Detection)와 같은 능동적인 큐 관리 알고리즘을 제시하였다. 하지만 RED는 동적으로 변화하는 인터넷 트래픽에 대하여 단지 큐 크기의 변화 정보를 얻어 혼잡 상황을 제어하기 때문에 성능에 있어는 매우 비효율적이다. 본 논문에서는 기존의 RED를 개선한 MRED를 제안했다. MRED는 RED에 비하여 휴리스틱한 방법을 이용하여 폐기 확률 값을 계산하고, 이를 실험을 통하여 MRED의 성능을 검증하였다.

  • PDF