TCP Vegas Revisited. Hengartner, U., Bolliger, J., & Gross, T. In , Tel Aviv, Israel, March, 2000. Paper bibtex @inproceedings{ Hengartner00,
author = {Hengartner, Urs and Bolliger, Juerg and Gross, Thomas},
title = {{TCP} Vegas Revisited},
booktitle = {},
year = {2000},
address = {Tel Aviv, Israel},
month = {March},
annote = {The innovative techniques of TCP Vegas have been the subject of much debate in recent years. Several studies have reported that TCP Vegas provides better performance than TCP Reno. However, the question which of the new techniques are responsible for the impressive performance gains remains unanswered so far. This paper presents a detailed performance evaluation of TCP Vegas. By decomposing TCP Vegas into the various novel mechanisms proposed and assessing the effect of each of these mechanisms on performance, we show that the reported performance gains are achieved primarily by TCP Vegas's new techniques for slow-start and congestion recovery. TCP Vegas's innovative congestion avoidance mechanism is shown to have only a minor influence on throughput. Furthermore, we find that the congestion avoidance mechanism exhibits fairness problems even if all competing connections operate with the same round trip time.},
url = {papers/hengartner00_TCP_Vegas_Revisited.ps.gz},
keywords = {Communication protocols implementation and software; Protocol design, analysis and performance; Congestion, admission and flow control},
days = {28--30},
submitter = {Anna Brunstr̈{o}m},
bibdate = {Sun Oct 21 16:27:50 CEST 2001}
}
Downloads: 0
{"_id":"GQe7n6a7T7RMEsoih","bibbaseid":"hengartner-bolliger-gross-tcpvegasrevisited-2000","downloads":0,"creationDate":"2015-12-04T23:32:57.051Z","title":"TCP Vegas Revisited","author_short":["Hengartner, U.","Bolliger, J.","Gross, T."],"year":2000,"bibtype":"inproceedings","biburl":"http://www.cs.kau.se/cs/prtp/prtp.bib","bibdata":{"address":"Tel Aviv, Israel","annote":"The innovative techniques of TCP Vegas have been the subject of much debate in recent years. Several studies have reported that TCP Vegas provides better performance than TCP Reno. However, the question which of the new techniques are responsible for the impressive performance gains remains unanswered so far. This paper presents a detailed performance evaluation of TCP Vegas. By decomposing TCP Vegas into the various novel mechanisms proposed and assessing the effect of each of these mechanisms on performance, we show that the reported performance gains are achieved primarily by TCP Vegas's new techniques for slow-start and congestion recovery. TCP Vegas's innovative congestion avoidance mechanism is shown to have only a minor influence on throughput. Furthermore, we find that the congestion avoidance mechanism exhibits fairness problems even if all competing connections operate with the same round trip time.","author":["Hengartner, Urs","Bolliger, Juerg","Gross, Thomas"],"author_short":["Hengartner, U.","Bolliger, J.","Gross, T."],"bibdate":"Sun Oct 21 16:27:50 CEST 2001","bibtex":"@inproceedings{ Hengartner00,\n author = {Hengartner, Urs and Bolliger, Juerg and Gross, Thomas},\n title = {{TCP} Vegas Revisited},\n booktitle = {},\n year = {2000},\n address = {Tel Aviv, Israel},\n month = {March},\n annote = {The innovative techniques of TCP Vegas have been the subject of much debate in recent years. Several studies have reported that TCP Vegas provides better performance than TCP Reno. However, the question which of the new techniques are responsible for the impressive performance gains remains unanswered so far. This paper presents a detailed performance evaluation of TCP Vegas. By decomposing TCP Vegas into the various novel mechanisms proposed and assessing the effect of each of these mechanisms on performance, we show that the reported performance gains are achieved primarily by TCP Vegas's new techniques for slow-start and congestion recovery. TCP Vegas's innovative congestion avoidance mechanism is shown to have only a minor influence on throughput. Furthermore, we find that the congestion avoidance mechanism exhibits fairness problems even if all competing connections operate with the same round trip time.},\n url = {papers/hengartner00_TCP_Vegas_Revisited.ps.gz},\n keywords = {Communication protocols implementation and software; Protocol design, analysis and performance; Congestion, admission and flow control},\n days = {28--30},\n submitter = {Anna Brunstr̈{o}m},\n bibdate = {Sun Oct 21 16:27:50 CEST 2001}\n}","bibtype":"inproceedings","booktitle":"","days":"28--30","id":"Hengartner00","key":"Hengartner00","keywords":"Communication protocols implementation and software; Protocol design, analysis and performance; Congestion, admission and flow control","month":"March","submitter":"Anna Brunstr̈om","title":"TCP Vegas Revisited","type":"inproceedings","url":"papers/hengartner00_TCP_Vegas_Revisited.ps.gz","year":"2000","bibbaseid":"hengartner-bolliger-gross-tcpvegasrevisited-2000","role":"author","urls":{"Paper":"http://www.cs.kau.se/cs/prtp/papers/hengartner00_TCP_Vegas_Revisited.ps.gz"},"keyword":["Communication protocols implementation and software; Protocol design","analysis and performance; Congestion","admission and flow control"],"downloads":0},"search_terms":["tcp","vegas","revisited","hengartner","bolliger","gross"],"keywords":["communication protocols implementation and software; protocol design","analysis and performance; congestion","admission and flow control"],"authorIDs":[],"dataSources":["6WGcSu2Ku7pZzqCcg"]}