• 제목/요약/키워드: Congestion Information

검색결과 1,185건 처리시간 0.031초

Dynamic Contention Window based Congestion Control and Fair Event Detection in Wireless Sensor Network

  • Mamun-Or-Rashid, Md.;Hong, Choong-Seon
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2007년도 춘계학술발표대회
    • /
    • pp.1288-1290
    • /
    • 2007
  • Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

  • PDF

Buffer and Rate Control Based Congestion Avoidance in Wireless Sensor Networks

  • Alam, Muhammad Mahbub;Hong, Choong-Seon
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2007년도 춘계학술발표대회
    • /
    • pp.1291-1293
    • /
    • 2007
  • Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

  • PDF

TCP 혼잡제어를 위한 RTT(Round trip time) 측정 (Measurement of RTT for TCP Congestion Control)

  • 김은기
    • 한국정보처리학회논문지
    • /
    • 제7권5호
    • /
    • pp.1520-1524
    • /
    • 2000
  • TCP 프로토콜의 혼잡 제어 알고리즘은 인터넷 망 내로 들어오는 트래픽 량을 조정하여 망이 혼잡 상태에 빠지는 것을 방지하는 기능을 수행한다. 따라서, 망에서는 어떤 TCP에서 발생하는 트래픽이 표준 TCP 흐름 제어 알고리즘을 따르고 있는지 감시할 필요가 있다. 이러한 기능르 수행할 수 있는지 감시할 필요가 있다. 이러한 기능을 수행할 수 있는 몇 가지 방안들이 제안되었으니 이들은 TCP 플로우(flow)의 RTT(round trip time)를 얻지 못하여 실제로 사용될 수 없는 문제를 갖고 있다. 본 연구에서는 인터넷 망 내 라우터에서 각 TCP 플로우의 RTT 값을 측정할 수있는 알고리즘을 제안하고, 시뮬레이션을 통하여 알고리즘의 올바른 동작을 확인하였다.

  • PDF

A MULTIPATH CONGESTION CONTROL SCHEME FOR HIGH-QUALITY MULTIMEDIA STREAMING

  • Lee, Sunghee;Chung, Kwangsue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.414-435
    • /
    • 2017
  • As network adaptive streaming technology becomes increasingly common, transport protocol also becomes important in guaranteeing the quality of multimedia streaming. At the same time, because of the appearance of high-quality video such as Ultra High Definition (UHD), preventing buffering as well as preserving high quality while deploying a streaming service becomes important. The Internet Engineering Task Force recently published Multipath TCP (MPTCP). MPTCP improves the maximum transmission rate by simultaneously transmitting data over different paths with multiple TCP subflows. However, MPTCP cannot preserve high quality, because the MPTCP subflows slowly increase the transmission rate, and upon detecting a packet loss, drastically halve the transmission rate. In this paper, we propose a new multipath congestion control scheme for high-quality multimedia streaming. The proposed scheme preserves high quality of video by adaptively adjusting the increasing parameter of subflows according to the network status. The proposed scheme also increases network efficiency by providing load balancing and stability, and by supporting fairness with single-flow congestion control schemes.

차등서비스를 위한 혼잡요금부과의 타당성 검토와 로지스틱 회귀모형을 이용한 인터넷 접속 확률 예측 (An Idea, Strategy of Congestion Pricing for Differentiated Services and Forecasting Probability of Access using Logistic Regression Model)

  • 지선수
    • 한국산업정보학회논문지
    • /
    • 제10권1호
    • /
    • pp.9-15
    • /
    • 2005
  • 관련 기업 및 ISP 업체에게는 투자의 매력을 부여하며 인터넷의 사용시간대 및 사용량에 따라 빈약한 사용자, 건강한 사용자, 과다한 사용자 등으로 구분하여 차등요금을 부여하는 합리적인 전략이 필요하다. 이 논문에서 차등요금부과의 타당성을 검토한다. 그리고 로지스틱 회귀모형을 이용하여 혼잡에 따른 차등요금, 지연시간, 접속만족도 등에 따라 실제적으로 인터넷 사용자들이 인터넷 접속을 얼마나 유지하는 지를 측정할 수 있는 관련 예측모델을 제시한다. 이러한 예측모델을 이용하여 인터넷 접속 또는 비접속 확률을 예측하는 분석률은 $69.5\%$이었음을 확인하였다.

  • PDF

요금부과를 기반으로 구별되는 서비스와 혼잡관리 (Congestion Control and Differentiated Services based Pricing)

  • 지선수
    • 한국산업정보학회논문지
    • /
    • 제8권4호
    • /
    • pp.17-25
    • /
    • 2003
  • 현재의 대역폭 매카니즘에서 서비스 공급자는 그들 도메인 안에서 보장된 대역폭을 공급하고 있다. 네트워크에서 가능한 대역폭을 개선할지라도 대역폭 요구가 더 빨리 증가하기 때문에 인터넷에서의 혼잡관리는 매우 중요하며 미래의 네트워크 안정성에 커다란 영향을 줄 것이다. 인터넷 사용자의 사용시간을 조절할 전략이 필요하다. 혼잡이 발생할 경우 경매 제도를 기반으로 한 차등요금제를 적용함으로 차별적인 서비스가 일어나는 인터넷 시장개념은 차세대 혼잡을 해결할 수 있는 유일한 대안 중의 하나가 될 것이다. 이 논문에서 통계적으로 보장된 QoS를 위해 구별되는 서비스와 요금계획을 제안한다.

  • PDF

A Fair and Efficient Congestion Avoidance Scheme Based on the Minority Game

  • Kutsuna, Hiroshi;Fujita, Satoshi
    • Journal of Information Processing Systems
    • /
    • 제7권3호
    • /
    • pp.531-542
    • /
    • 2011
  • In this paper, we propose a new congestion control scheme for high-speed networks. The basic idea of our proposed scheme is to adopt a game theory called, "Minority Game" (MG), to realize a selective reduction of the transmission speed of senders. More concretely, upon detecting any congestion, the scheme starts a game among all senders who are participating in the communication. The losers of the game reduce the transmission speed by a multiplicative factor. MG is a game that has recently attracted considerable attention, and it is known to have a remarkable property so that the number of winners converges to a half the number of players in spite of the selfish behavior of the players to increase its own profit. By using this property of MG, we can realize a fair reduction of the transmission speed, which is more efficient than the previous schemes in which all senders uniformly reduce their transmission speed. The effect of the proposed scheme is evaluated by simulation. The result of simulations indicates that the proposed scheme certainly realizes a selective reduction of the transmission speed. It is sufficiently fair compared to other simple randomized schemes and is sufficiently efficient compared to other conventional schemes.

Improving Performance of Remote TCP in Cognitive Radio Networks

  • Yang, Hyun;Cho, Sungrae;Park, Chang Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2323-2340
    • /
    • 2012
  • Recent advances in cognitive radio technology have drawn immense attention to higher layer protocols above medium access control, such as transmission control protocol (TCP). Most proposals to improve the TCP performance in cognitive radio (CR) networks have assumed that either all nodes are in CR networks or the TCP sender side is in CR links. In those proposals, lower layer information such as the CR link status could be easily exploited to adjust the congestion window and improve throughput. In this paper, we consider a TCP network in which the TCP sender is located remotely over the Internet while the TCP receiver is connected by a CR link. This topology is more realistic than the earlier proposals, but the lower layer information cannot be exploited. Under this assumption, we propose an enhanced TCP protocol for CR networks called TCP for cognitive radio (TCP-CR) to improve the existing TCP by (1) detection of primary user (PU) interference by a remote sender without support from lower layers, (2) delayed congestion control (DCC) based on PU detection when the retransmission timeout (RTO) expires, and (3) exploitation of two separate scales of the congestion window adapted for PU activity. Performance evaluation demonstrated that the proposed TCP-CR achieves up to 255% improvement of the end-to-end throughput. Furthermore, we verified that the proposed TCP does not deteriorate the fairness of existing TCP flows and does not cause congestions.

BTDF를 이용한 직거래 전력시장에서의 혼잡처리에 관한 연구 (A study of congestion management in bilateral electricity market using BTDF)

  • 이승진;이기송;박종배;신중린;이명환
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 A
    • /
    • pp.609-611
    • /
    • 2003
  • This paper presents a method for a congestion management in the competitive market which is modeled as the multiple bilateral transaction. Traditionary, the congestion management for the multiple bilateral transaction is accomplished through the process of adjustment bids. It is necessary in for the market entity to submit their price information when the congestion is occured. Finally, the ISOs can be blown about the approximated contract price of participants from the price of adjustment bids. However, the entities can submit only the amount of their contract to ISOs and ISOs are required the method to manage the congestion only by the contracted quantity. Therefore, this paper presents a method for congestion management by curtailing the only contracted quantity of market entities. To evaluated the above problem, we suggest Bilateral Transaction Distribution Factors(BTDFs), which is the sensitivity of line flow with curtailment of transactions. Using this factor, we studied about congestion management when the objective function is to minimize total curtailment of transaction.

  • PDF

라스트 홉 무선 네트워크에서 TFRC의 성능향상을 위한 손실 구별 기법 (Loss Discrimination Mechanism for Improving the Performance of TFRC in Last-hop Wireless Networks)

  • 정규민;구자헌;정광수
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제16권2호
    • /
    • pp.227-231
    • /
    • 2010
  • TFRC(TCP Friendly Rate Control)는 비디오 스트리밍 응용의 요구 조건을 만족시키는 혼잡제어 기법으로써, 손실 사건률과 왕복 지연 시간 등의 정보를 이용하여 전송률을 조절한다. 그런데 TFRC는 무선 네트워크에서 발생하는 손실을 모두 혼잡 손실로 판단하고 혼잡제어를 수행하기 때문에 성능이 저하되는 문제가 있다. 본 논문에서는 이를 해결하기 위해 ECN(Explicit Congestion Notification) 정보를 이용하는 새로운 손실 구별 기법을 제안하였다. 실험을 통해 제안한 기법이 무선 네트워크에서 TFRC의 성능을 향상시킴을 확인하였다.