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

TCP-Vegas

TCP Vegas senses the congestion in the network before any packet loss occurs, and instantly it decreases the window size. So, TCP Vegas handles the congestion without any packet loss occurring.

  • Uses diff = expected rate - actual rate to regulate the sending rate.

  • Expected rate = window size divided by baseRTT.

  • Actual rate = window size divided by currentRTT.

  • baseRTT = It is the minimum RTT measured so far.

  • The expected rate is always larger than the Actual rate.

Rate-based congestion control.

  • diff = expected rate – actual rate.

  • If diff < a, Vegas increases cwnd linearly.

  • If diff > b, Vegas decreases cwnd linearly.

  • If a< diff < b, Vegas keeps cwnd unchanged.

Modified slow-start.

  • Allows cwnd to grow exponentially only in every other RTT.

  • If diff > c, Vegas switches from slow-start to congestion avoidance.

New retransmission.

  • Reads and records transmission time.

  • When DUPACK arrives, check if it is expired.

  • Retransmits without waiting for a third DUPACK.

PreviousQUICNextClassification of Transport protocols

Last updated 1 year ago