Cited by 16Network Traffic and Congestion ControlWireless Networks and ProtocolsAdvanced Wireless Network Optimization

Learning-TCP: A Novel Learning Automata Based Congestion Window Updating Mechanism for Ad hoc Wireless Networks

Ramana, B. Venkata, Murthy, C. Siva Ram·2005·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/11602569_47

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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?

  • Some RL-based approaches for updating CWND are designed for resource-constrained networks including WANETs and IoT, while others address wider network architectures such as satellite, cellular, and data center networks.

    “Some of these approaches are particularly designed for resourceconstrained networks, including WANETs [29,219,379,380] and IoT [271], while others address a wider range of network architectures [30,122,477], such as satellite, cellular, and data center networks.”
  • The deterministic nature of TCP is more prone to cause higher contention losses and CWND synchronization problems in WANET, due to node mobility that continuously modifies the wireless multi-hop paths.

    “the deterministic nature of TCP is more prone to cause higher contention losses and CWND synchronization problems in WANET, due to node mobility that continuously modifies the wireless multi-hop paths [29,379].”
  • Several simulations in ns-2 and GloMoSim show that both Learning-TCP and TCP-FALA outperform standard TCP-NewReno in terms of packet loss, goodput, and fairness.

    “Several simulations in ns-2 and GloMoSim show that both Learning-TCP and TCP-FALA outperform standard TCP-NewReno in terms of packet loss, goodput, and fairness.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ramana, B. V., & Murthy, C. S. R.
Affiliations
Indian Institute of Technology Madras (IN)
Venue
Lecture Notes in Computer Science
Published
2005
Pages
454-464
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1567891849
Cited by
16
References
10
Citations by year
2022: 1 · 2021: 1 · 2020: 1 · 2019: 1 · 2018: 1 · 2015: 1 · 2014: 1 · 2012: 2
FWCI
0.00
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
Keywords
learning automata, congestion window, congestion control, ad hoc networks, reliable transport, packet loss reduction, throughput, TCP adaptation

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