Cited by 92Network Traffic and Congestion ControlAdvanced Optical Network TechnologiesWireless Networks and Protocols

TCP implementations and false time out detection in OBS networks

Xians Yu, Chunming Qiao, Yona Liu·2005·IEEE INFOCOM 2004

Abstract

This paper compares Reno, new-Reno and selective acknowledgements (SACK), the three most common TCP implementations today in (future) optical burst switched (OBS) networks. In general, SACK, which considers multiple triple duplicated ACKed (TD) losses in one round, is found to perform best in OBS networks, while new-Reno, which improves Reno in packet switched networks by fast retransmission in responding to partial ACKs, may however perform worse than Reno. All three TCP implementations react to a time out (TO) loss in the same way (i.e., using slow start). In OBS networks, where a burst may contain all packets from one round, and a burst loss occurs mainly due to contention instead of buffer overflow, such a TO event may no longer imply heavy congestion, or in other words, it may he a false TO or FTO. Such FTOs, which may he common in OBS networks especially for fast TCP flows, can significantly degrade the performance of all existing TCP implementations. Accordingly, we also propose a new TCP implementation called burst TCP (BTCP) which can detect FTOs and react properly, and as a result, improve over the existing TCP implementations significantly.

Integrity signals

Registry

Crossref · 10.1109/infcom.2004.1356966

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • TCP throughput for wireless networks can be improved by accurately identifying the cause of packet loss and reducing the TCP transmission rate only when congestion is detected.

    “Therefore, the TCP throughput for wireless networks can be improved by accurately identifying the cause of packet loss [34,62,490] and reducing the TCP transmission rate only when congestion is detected.”
  • Their classifiers integrate two TCP variants that keep low control overhead for better performance over standard TCP-NewReno and TCP-SACK, and Burst-TCP for OBS networks.

    “These classifiers integrate two TCP variants that keep a low control overhead for providing better performance (e.g. higher throughput and fewer timeouts) over the standard TCP-NewReno [185] and TCP-SACK [299], and Burst-TCP [490] for OBS networks.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yu, X., Qiao, C., & Liu, Y.
Affiliations
  • University at Buffalo, State University of New York (US)
  • University of Massachusetts Amherst (US)
Venue
IEEE INFOCOM 2004
Publisher
IEEE
Published
2005-02-22
Volume
2
Pages
774-784
OpenAlex
W2160104418
Cited by
92
References
14
Citations by year
2022: 1 · 2020: 1 · 2019: 1 · 2018: 2 · 2017: 3 · 2015: 2 · 2014: 4 · 2013: 1 · 2012: 8
FWCI
8.46
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Computer Communications (INFOCOM) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Optical Network Technologies
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
Keywords
TCP, optical burst switching, Reno, NewReno, SACK, TCP congestion control, burst loss, contention, fast retransmission, slow start

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review