• Title/Summary/Keyword: Congestion Control Mechanism

Search Result 178, Processing Time 0.023 seconds

A ENA algorithm for Performance Enhancement of Satellite Link using TCP (TCP를 사용하는 위성링크에서의 성능 향상을 위한 ENA 알고리즘)

  • 이정규;김상희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1177-1185
    • /
    • 2000
  • In this paper, We report on the performance issues faced by TCP based applications on satellite link having long propagation delay and high probability of bit erros and propose ENA(Error Notification Ack) algorithm for TCP Performance Enhancement. TCP Protocol cannot distinguish errored segments(in noisy medium) from losses of genuine network congestion and react as if there is network congestion. Therefore, Slow Start and Congestion avoidance mechanism are initiated. It happen this case in satellite link. Therefore it reduce the transmission rate and drop the performance. So, in this paper We propose ENA algorithm which is distinguished errored segments from losses of network congestion. And We propose the method of algorithm's implementation. And We evaluate the Performance of Tahoe, Reno, Sack TCP with ENA. As results, TCP Performance is better.

  • PDF

A Near Saturation Routing Algorithm for Non-hieratical Networks (비계층적 통신망에서의 근사 포화형 경로설정 알고리즘)

  • 길계태;은종관;박영철;이상철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1037-1053
    • /
    • 1991
  • Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

  • PDF

Performance Analysis of Error and Congestion Control Algorithm in Transport Layer Mobility Support Approach (트랜스포트 계층 이동성 지원 방안에서의 오류 및 혼잡제어 알고리즘 성능분석)

  • Jang, Moon-Jeong;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.733-740
    • /
    • 2005
  • In this paper, we propose an approach to transport layer mobility support leveraging the SCTP extension dubbed dynamic address reconfiguration in IPv6 networks. Timing issues related to the end-to-end address management, and a novel error recovery mechanism associated with a handover are discussed. The proposed error recovery mechanism is analyzed and compared to that of the plain SCTP to show that it reduces the handover latency and error recovery time.

Gallop-Vegas: An Enhanced Slow-Start Mechanism for TCP Vegas

  • Ho Cheng-Yuan;Chan Yi-Cheng;Chen Yaw-Chung
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.351-359
    • /
    • 2006
  • In this article, we present a new slow-start variant, which improves the throughput of transmission control protocol (TCP) Vegas. We call this new mechanism Gallop-Vegas because it quickly ramps up to the available bandwidth and reduces the burstiness during the slow-start phase. TCP is known to send bursts of packets during its slow-start phase due to the fast window increase and the ACK-clock based transmission. This phenomenon causes TCP Vegas to change from slow-start phase to congestion-avoidance phase too early in the large bandwidth-delay product (BDP) links. Therefore, in Gallop-Vegas, we increase the congestion window size with a rate between exponential growth and linear growth during slow-start phase. Our analysis, simulation results, and measurements on the Internet show that Gallop-Vegas significantly improves the performance of a connection, especially during the slow-start phase. Furthermore, it is implementation feasible because only sending part needs to be modified.

A simulation study on TCP performance for constrained IoT networks

  • Chansook, Lim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.1-7
    • /
    • 2023
  • TCP is considered a major candidate transport protocol even for constrained IoT networks due to its ability to integrate into the existing network infrastructures. Since TCP implementations such as uIP TCP often allow only a single TCP segment per connection to be unacknowledged at any given time due to resource constraints, the congestion control relies only on RTO management. In our previous work, to address the problem that uIP TCP performs poorly particularly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe, we proposed a RTO scheme for uIP TCP and validated the performance through Cooja simulation. In this study, we investigate the effect of other factors that were not considered in our previous work. More specifically, the effect of traffic intensity, the degree of the hidden terminal problem, and RDC is investigated by varying the offered load and the transmission range, and the RDC channel check rate. Simulation results imply that we need to further investigate how to improve TCP performance when the radio duty cycling mechanism is used.

An Adaptive Online Pricing Mechanism for Congestion Control in QoS sensitive Multimedia Networks (멀티미디어 네트워크의 트래픽 혼잡 제어를 위한 적응적 온라인 가격결정기법에 대한 연구)

  • Kim Sung-Wook;Kim Sung-Chun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.764-768
    • /
    • 2006
  • Over the years, the widespread proliferation of multimedia services has necessitated the development for an efficient network management. In this paper, we investigate the role of adaptive online pricing mechanism in order to manage effectively the network congestion problem. Our on-line approach is dynamic and flexible that responds to current network conditions. With a simulation study, we demonstrate that our proposed scheme enhances network performance and system efficiency simultaneously under widely diverse traffic load intensities.

Improving TCP Performance through Pre-detection of Route Failure in Mobile Ad Hoc Networks (Ad Hoc 망에서 경로단절 사전감지를 통한 TCP 성능향상)

  • Lee Byoung-Yeul;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.900-910
    • /
    • 2004
  • Route failure is mainly caused by mobility of mobile host in ad hoc networks. Route failure, which may lead to sudden packet losses and delays, is losing the route from source to destination. In this situation, TCP assumes that congestion has occurred within the network and also initiates the congestion control procedures. Congestion control algorithm provides the means for the source to deal with lost packets. TCP performance in ad hoc environments will be degraded as TCP source cannot distinguish congestion from route failure. In this paper, we propose TCP-P as pre-detection approach to deal with route failure. TCP-P freezes TCP through pre-detection of route failure. Route failure information of the proposed mechanism is obtained not by routing protocol but by MAC protocol. The intermediated node, obtaining route failure information by its MAC layer, relays the information to TCP source and lets TCP source stop the congestion control algorithm. Results reveal that TCP-P responding with proactive manner outperforms other approaches in terms of communication throughput under the presence of node mobility.

An Error Recovery Mechanism for Communications with Reliability and Transport Control for Media Access in Sensor Network (센서 네트워크에서의 매체제어를 위한 전송제어 및 신뢰성 있는 통신을 위한 에러 복구 기법)

  • Min, Byung-Ung;Kim, Dong-Il;Choi, Sam-Gil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1190-1194
    • /
    • 2007
  • In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval herby-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports franc congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

An Adaptive Feedback Rate Control Algorithm for Unicast Video Transmission

  • Ru, Zhou;Jang, Kyung-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.966-969
    • /
    • 2007
  • In this paper, we propose a novel probing mechanism for adaptive transmission of video data based on congestion control and client state. The proposed mechanism is friendly to the network dominant transport protocols (TCP) and can reduce fluctuations compared to the previous works.

Usage parameter control mechanism using a virtual buffer for ATM networks (ATM 망에서 가상 버퍼를 이용한 사용자 파라메타 제어 메카니즘)

  • 박창욱;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.23-31
    • /
    • 1996
  • This paper proposes a new UPC(usage parameter control) mechanism that varies the token generation rate of leaky bucket by observing virtual buffer, thus achieving an improvement of performance. An acceptance of a call in B-ISDN is determined by call admission control. A UPC that polices the agreed traffic parameters of a call and takes appropriate actions to prevent congestion in networks. The cell loss probability of conventional UPC is far from that of ideal UPC. The proposed mechanism has a better policing ability and response time for nonconforming call. The proposed mechanism uses ON-OFF model as input traffic. The results of simulation show the efficiency of the proposed mechanism.

  • PDF