• Title, Summary, Keyword: TCP Vegas

Search Result 34, Processing Time 0.041 seconds

Global Finite-Time Convergence of TCP Vegas without Feedback Information Delay

  • Choi, Joon-Young;Koo Kyung-Mo;Lee, Jin S.;Low Steven H.
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.1
    • /
    • pp.70-78
    • /
    • 2007
  • We prove that TCP Vegas globally converges to its equilibrium point in finite time assuming no feedback information delay. We analyze a continuous-time TCP Vegas model with discontinuity and high nonlinearity. Using the upper right-hand derivative and applying the comparison lemma, we cope with the discontinuous signum function in the TCP Vegas model; using a change of state variables, we deal with the high nonlinearity. Although we ignore feedback information delay in analyzing the model of TCP Vegas, the simulation results illustrate that TCP Vegas in the presence of feedback information delay shows very similar dynamic trends to TCP Vegas without feedback information delay. Consequently, dynamic properties of TCP Vegas without feedback information delay can be used to estimate those of TCP Vegas in the presence of feedback information delay.

A New Congestion Control Algorithm for Improving Fairness in TCP Vegas (TCP Vegas에서 공정성 향상을 위한 혼잡제어 알고리즘)

  • Lee, Sun-Hun;Song, Byung-Hoon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.583-592
    • /
    • 2005
  • An important factor influencing the robustness of the Internet is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes the network congestion worse. Brakmo and Peterson proposed a congestion control algorithm, TCP Vegas, by modifying the congestion avoidance scheme of TCP Reno. Many studies indicate that Vegas is able to achieve better throughput and higher stability than Reno. But there are three unfairness problems in Vegas. These problems hinder the spread of Vegas in the current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP NewVegas. The proposed NewVegas is able to solve these unfairness problems effectively by using the variation of the number of queued packets in a bottleneck router. To evaluate the proposed approach, we compare the performance among NewVegas, Reno and Vegas. Through the simulation, NewVegas is shown to be able to achieve throughput and better fairness than Vegas.

A Congestion Control Algorithm for the fairness Improvement of TCP Vegas (TCP Vegas의 공정성 향상을 위한 혼잡 제어 알고리즘)

  • 오민철;송병훈;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • The most important factor influencing the robustness of the Internet Is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes worse the network congestion. Recently, Brakmo and Peterson have proposed a new version of TCP, which is named TCP Vegas, with a fundamentally different congestion control scheme from that of the Reno. Many studies indicate that the Vegas is able to achieve better throughput and higher stability than the Reno. But there are two unfairness problems in Vegas. These problems hinder the spread of the Vegas in current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP PowerVegas. The existing Vegas depends mainly only on the rtt(round trip time), but the proposed PowerVegas use the new congestion control scheme combined the Information on the rtt with the information on the packet loss. Therefore the PowerVegas performs the congestion control more competitively than the Vegas. Thus, the PowerVegas is able to solve effectively these unfairness problems which the Vegas has experienced. To evaluate the proposed approach, we compare the performance among PowerVegas, Reno and Vegas under same network environment. Using simulation, the PowerVegas is able to achieve better throughput and higher stability than the Reno and is shown to achieve much better fairness than the existing Vegas.

Improving TCP-Vegas Performance over Mobile Ad-hoc Networks (이동 애드혹 네트워크에서의 TCP-Vegas 성능향상 기법)

  • Bae Han-Seok;Song Jeom-Ki;Kim Dong-Kyun;Park Jung-Soo;Kim Hyoung-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.221-231
    • /
    • 2006
  • TCP is needed as a transport protocol to provide reliable end-to-end message delivery for MANETs in order to achieve a smooth integration with the fixed Internet. Particularly, TCP has its variants, namely TCP-Reno and TCP-Vegas. However, there has been no research work on extensive performance comparison of TCP-Reno and TCP-Vegas over AODV and OLSR. This paper is the first trial to perform the research by using ns-2 simulator. Through the extensive simulations, we found that which to select among routing protocols is more important than which to select among TCP variants, because the performance difference between TCP-Reno and TCP-Vegas over uy selected routing protocol is not so much outstanding. Particularly, TCP-Vegas relies on an accurate BaseRTT estimation in order to decide the sending rate of a TCP Sender. However, it cannot be directly applied to MANET because a route change makes the Base an used over a Previous Path obsolete. Therefore, we propose a technique for improving the performance of TCP-Vegas by considering the route change, and show the performance improvement through simulation study.

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.

TCP Congestion and Flow Control Algorithm using a Network Model (네트워크 모델을 이용한 전송제어 프로토콜(TCP))

  • 유영일;이채우
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.4
    • /
    • pp.35-44
    • /
    • 2004
  • Recently announced TCP Vegas predicts the degree of congestion in the network and then control the congestion window size. Thus it shows better performance than TCP Reno. however, TCP vegas does not assume any network model, its congestion window control is very limited. Because or this limitation, TCP vegas still can not adapt to fast changing available bandwidth. In this paper, we introduce a new TCP algorithm which adapts to fast changing available bandwidth well. To devise such a TCP, we model the end to end network of TCP connection as a queueing system and finds congestion window size which can utilize the available bandwidth sufficiently but not make the network congested. The simulation results show that our algorithm adapts to the avaliable bandwidth faster than TCP vegas and as a results, when the available bandwidth is changing rapidly, our algorithm not only operates more stably than TCP Vegas, but also it shows higher thruput than TCP Vegas.

Performance Improvement of TCP Vegas Using Estimation of End-to-End Forward/Backward Delay Variation (종단간 순방향/역방향 전송지연 측정을 이용한 TCP Vegas의 성능 향상)

  • Shin Young-Suk;Kim Eun-Gi
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3
    • /
    • pp.353-358
    • /
    • 2006
  • Unlike TCP Reno, TCP Vegas recognizes network congestion through the measuring of RTT (Round Trip Time) and decides the main congestion control parameters, such as Windows size. But, congestion avoidance scheme of Vegas poorly reflects asymmetric characteristics of packet path because TCP Vegas uses the measuring of RTT that reflects forward/backward packet transmission delay as a forward delay. The RTT can't infer the forward/backward transmission delay variation because it only measures the packet's turn around time. In this paper, We have designed and implemented a new Vegas congestion control algorithm that can distinguish forward/backward network congestion. We have modified the source codes of TCP Vegas in Linux 2.6 kernel and verified their performance.

TCP Vegas RTT Ambiguity Problem and Its Solutions (TCP Vegas RTT Ambiguity 문제와 그 해결)

  • 김종덕;김종권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7B
    • /
    • pp.1260-1269
    • /
    • 2000
  • TCP 구현의 하나인 Vegas는 RTT 측정값을 바탕으로 혼잡을 인지하며 윈도우 크기 등 혼잡제어를 위한 주요 인자를 결정한다. 이러한 Vegas가 기존 TCP 구현에 비해 우수한 성능과 높은 공평성을 가짐은 여러 논문을 통해 보고되었다. 그런데 우리는 Vegas의 혼잡회피 방안이 TCP 데이터 흐름의 비대칭적 특성을 제대로 반영하지 못하며, 이것이 양쪽 방향 상태를 반영하는 RTT 측정값을 순방향 링크의 상태 해석에 이용하기 때문임을 발견하였다. 우리는 이를 Vegas RTT Ambiguity 문제라 하고, 네트워크 내의 패킷 스케쥴링 방법인 Small Get Priority Queue, TCP Timestamp Options을 이용한 수정 Vegas 구현 등 두 가지 해결 방안을 제시하였다. 우리는 시뮬레이션을 통해 Vegas RTT Ambiguity 문제와 제시한 해결 방안들을 검증하였다.

  • PDF

New Stability Analysis of a Single Link TCP Vegas Model

  • Park, Poo-Gyeon;Choi, Doo-Jin;Choi, Yoon-Jong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.2430-2434
    • /
    • 2003
  • This paper provides a new approach to analyze the stability of TCP Vegas, which is a kind of feedback-based congestion control algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium points, this approach uses the exactly characterized dynamic model to get a new stability criterion via a piecewise and delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs). Using the new criterion, this paper shows that the current TCP Vegas algorithm is stable in the sufficiently wide region of network delay and link capacity.

  • PDF

Stability Analysis of a Multi-Link TCP Vegas Model

  • Park, Poo-Gyeon;Choi, Doo-Jin;Choi, Yoon-Jong;Ko, Jeong-Wan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.1072-1077
    • /
    • 2004
  • This paper provides a new approach to analyze the stability of a general multi-link TCP Vegas, which is a kind of feedback-based congestion algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium pints, this approach models a multi-link TCP Vegas network in the form of a piecewise linear multiple time-delay system. And then, based on the exactly characterized dynamic model, this paper presents a new stability criterion via a piecewise and multiple delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs).

  • PDF