Notes - MIECT
Redes E Sistemas Autónomos
Notes - MIECT
Redes E Sistemas Autónomos
  • Redes e Sistemas Autónomos
  • Peer-to-Peer Systems and Networks
    • Content Distribution Networks
    • Peer-to-peer networks
      • Types
    • Structured vs Unstructured
    • Fully Decentralized Information System
    • FastTrack/KaZaA
    • OpenNAP/Napster
    • BitTorrent
  • InterPlanetary File System (IPFS)
    • IPFS
      • Bitswap
    • Connecting an IPFS node to the P2P network
    • Searching in DHTs (Structured)
    • File Search
    • Security
  • Ad-Hoc Networks
    • Mobile Ad-hoc networks
    • Application Scenarios
    • Routing
      • AODV - Ad Hoc On-Demand Distance Vector Routing
      • OLSR - Optimized Link State Routing Protocol
      • LAR – Location Aided Routing
      • Batman
    • IP Address Assignment
  • Self-organized systems: Data, learning and decisions
    • Use Cases and Data
    • Machine Learning
      • Supervised Learning
      • Neural Networks
      • Reinforcement Learning
      • Unsupervised Learning: K-means
    • Learning
  • Vehicular Networks
    • Vehicular Ad Hoc Networks
    • How do they work?
    • SPAT: Signal Phase And Timing
    • MAP: MAP
    • Manoeuvre Coordination Message (MCM)
    • Communication Technologies
  • QoS and Security
    • TCP- and UDP-based applications
      • TCP-Cubic
    • QUIC
    • TCP-Vegas
    • Classification of Transport protocols
    • Exploiting Buffering Capabilities
    • QoS in UDP: trade-offs
    • Transmission Quality (Batman v.3)
    • QoS-OLSR
    • Security
      • Key Management
      • RSA (Rivest-Shamir-Adleman) Key
      • Key Management in ad-hoc networks
      • Self-organized public key management (SOPKM)
      • Self-securing ad-hoc wireless networks (SSAWN)
Powered by GitBook
On this page
  1. QoS and Security
  2. TCP- and UDP-based applications

TCP-Cubic

PreviousTCP- and UDP-based applicationsNextQUIC

Last updated 1 year ago

CUBIC is RTT-independent.

The window size is a cubic function of the time t, which is passed time since the last congestion occurrence.

  • W_CUBIC: cwnd size for cubic congestion control mechanism.

  • W_max: cwnd size just before the last window reduction.

  • C: predefined constant (scaling factor).

  • β: cwnd size decrease factor. Window size reduction at the time of loss event is:

  • W(t*): cwnd size at the time t* of packet loss, that is, Wmax.

When a packet loss is detected, W(t) is reduced as per the previous equation.

Whenever a packet-dropping event occurs, the cwnd is reduced by a factor β, otherwise increased by the α for a successful ACK. For TCP with CUBIC, β=0.3, whereas for QUIC with CUBIC, β=0.3/2=0.15.