• Title/Summary/Keyword: congestion loss rate

Search Result 119, Processing Time 0.024 seconds

Comparison about TCP and Snoop protocol on wired and wireless integrated network (유무선 혼합망에서 TCP와 Snoop 프로토콜 비교에 관한 연구)

  • Kim, Chang Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.141-156
    • /
    • 2009
  • As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. The Snoop Protocol was designed for the wired network by putting the Snoop agent module on the BS(Base Station) that connect the wire network to the wireless network to complement the TCP problem. The Snoop agent cash the packets being transferred to the wireless terminal and recover the loss by resending locally for the error occurred in the wireless link. The Snoop agent blocks the unnecessary congestion control by preventing the dupack (duplicate acknowledgement)for the retransmitted packet from sending to the sender and hiding the loss in the wireless link from the sender. We evaluated the performance in the wired/wireless network and in various TCP versions using the TCP designed for the wired network and the Snoop designed for the wireless network and evaluated the performance of the wired/wireless hybrid network in the wireless link environment that the continuous packet loss occur.

A Network Coding Mechanism Minimizing Congestion of Lossy Wireless Links (손실이 있는 무선 링크에서 혼잡을 최소화하는 네트워크 코딩 기법)

  • Oh, Hayoung;Lim, Sangsoon
    • Journal of KIISE:Information Networking
    • /
    • v.41 no.4
    • /
    • pp.186-191
    • /
    • 2014
  • Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

Implementation of Internet Video Phone Supporting Adaptive QoS (적응적 QoS를 지원하는 인터넷 화상전화의 구현)

  • Choi, Tae-Uk;Kim, Young-Ju;Chung, Ki-Dong
    • The KIPS Transactions:PartC
    • /
    • v.10C no.4
    • /
    • pp.479-484
    • /
    • 2003
  • In the current Internet, it is difficult for an Internet Phone to guarantee the QoS due to variable network conditions such as packet loss rate, delay and bandwidth. In addition, the QoS of an Internet Video Phone is more hard to guarantee because of video data. In this paper, we investigate application-level QoS control schemes that can adapt to variable network conditions, and describe an error control scheme and a congestion control scheme. Based on these QoS control schemes, we have designed and implemented an Internet Video Phone System that supports adaptive audio and video delivery. Through experiments, we found that the Internet Video Phone can reduce the packet loss rate considerably as well as adjust the transmission rate considering other TCP flows.

A TCP-Friendly Control Method using Neural Network Prediction Algorithm (신경회로망 예측 알고리즘을 적용한 TCP-Friednly 제어 방법)

  • Yoo, Sung-Goo;Chong, Kil-To
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.105-107
    • /
    • 2006
  • As internet streaming data increase, transport protocol such as TCP, TGP-Friendly is important to study control transmission rate and share of Internet bandwidth. In this paper, we propose a TCP-Friendly protocol using Neural Network for media delivery over wired Internet which has various traffic size(PTFRC). PTFRC can effectively send streaming data when occur congestion and predict one-step ahead round trip time and packet loss rate. A multi-layer perceptron structure is used as the prediction model, and the Levenberg-Marquardt algorithm is used as a traning algorithm. The performance of the PTFRC was evaluated by the share of Bandwidth and packet loss rate with various protocols.

  • PDF

The Classification of Congestion and Wireless Losses for TCP Segments Using ROTT (상대전송지연시간을 이용한 TCP 세그먼트의 혼잡 손실과 무선 손실 구분 알고리즘)

  • Shin, Kwang-Sik;Lee, Bo-Ram;Kim, Ki-Won;Jang, Mun-Suck;Yoon, Wan-Oh;Choi, Sang-Bang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.858-870
    • /
    • 2007
  • TCP is popular protocol for reliable data delivery in the Internet. In recent years, wireless environments with transmission errors are becoming more common. Therefore, there is significant interest in using TCP over wireless links. Previous works have shown that, unless the protocol is modified, TCP may perform poorly on paths that include a wireless link subject to transmission errors. The reason for this is the implicit assumption in TCP that all packet losses are due to congestion which causes unnecessary reduction of transmission rate when the cause of packet losses are wireless transmission errors. In this paper, we propose a new LDA that monitors the network congestion level using ROTT. And we evaluate the performance of our scheme and compare with TCP Veno, Spike scheme with NS2(Network Simulator 2). In the result of our experiment, our scheme reduces the packet loss misclassification to maximum 55% of other schemes. And the results of another simulation show that our scheme raise its transmission rate with the fairness preserved.

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.618-636
    • /
    • 1997
  • DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

  • PDF

IMPLEMENTATION EXPERIMENT OF VTP BASED ADAPTIVE VIDEO BIT-RATE CONTROL OVER WIRELESS AD-HOC NETWORK

  • Ujikawa, Hirotaka;Katto, Jiro
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.668-672
    • /
    • 2009
  • In wireless ad-hoc network, knowing the available bandwidth of the time varying channel is imperative for live video streaming applications. This is because the available bandwidth is varying all the time and strictly limited against the large data size of video streaming. Additionally, adapting the encoding rate to the suitable bit-rate for the network, where an overlarge encoding rate induces congestion loss and playback delay, decreases the loss and delay. While some effective rate controlling methods have been proposed and simulated well like VTP (Video Transport Protocol) [1], implementing to cooperate with the encoder and tuning the parameters are still challenging works. In this paper, we show our result of the implementation experiment of VTP based encoding rate controlling method and then introduce some techniques of our parameter tuning for a video streaming application over wireless environment.

  • PDF

An Enhanced Transmission Mechanism for Supporting Quality of Service in Wireless Multimedia Sensor Networks

  • Cho, DongOk;Koh, JinGwang;Lee, SungKeun
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.65-73
    • /
    • 2017
  • Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

Performance Improvement of TCP over Wired-Wireless Networks by Predicting Packet Loss of Mobile Host (유. 무선 혼합망에서 이동 호스트의 패킷 손실 예측을 통한 TCP 성능 향상)

  • Kwon, Kyung-Hee;Kim, Jin-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.131-138
    • /
    • 2007
  • In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

Queue Management using Optimal Margin method to Improve Bottleneck Link Performance

  • Radwa, Amr
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.12
    • /
    • pp.1475-1482
    • /
    • 2015
  • In network routers, buffers are used to resolve congestion and reduce packet loss rate whenever congestion occurs at bottleneck link. Most of the existing methods to manage such buffers focus only on queue-length-based control as one loop which have some issues of low link utilization and system stability. In this paper, we propose a novel framework which exploits two-loop control method, e.g. queue-length and congestion window size, combined with optimal margin method to facilitate parameter choices. Simulation results in ns-2 demonstrate that bottleneck link performance can be improved with higher link utilization (85%) and shorter queue length (22%) than the current deployed scheme in commercial routers (RED and DropTail).