Skip to main content

Traffic Management for High-Speed Networks (1997) / Chapter Skim
Currently Skimming:

Rate-based Flow Control
Pages 14-15

The Chapter Skim interface presents what we've algorithmically identified as the most significant single chunk of text within every page in the chapter.
Select key terms on the right to highlight them within pages of the chapter.


From page 14...
... Per-VC Queueing to Achieve a High Degree of Fairness To achieve fairness between bursty VCs sharing the same output, it is necessary to have separate queueing for individual VCs. With a fair round-robin scheduling policy among these queues, cells from different VCs will be sent out in a fair manner.
Read the entire page →
From page 15...
... Assume that the two VCs share the same switch output link TABLE 1 Expected Rates for VC Groups in Generic Fairness Configuration (GFC) of Figure 12 Group Bandwidth Bottleneck Link A 1/27= 0.037 S1-S2 B 2/27= 0.074 S4-S5 C 2/9= 0.222 S3-S4 D 1/27= 0.037 S1-S2 E 2/27= 0.074 S4-S5 F 1/3= 0.333 S2-S3 15
Read the entire page →

Key Terms

  • loop delay
  • control loop
  • link rate
  • parking lot
  • rate control

  • fairness configuration
  • generic fairness
  • peak link
  • total assigned
  • sorting arriving

  • unfair advantage
  • bandwidth equally
  • vcs sharing
  • highly bursty
  • fairness objective

  • bursty traffic
  • sources according
  • rate setting
  • share fairly
  • expected rates

  • control time
  • bursty abr
  • performance criterion
  • position closer
  • abr traffic

  • phases correspond
  • virtual circuits
  • link speed
  • approach described
  • simple scenario


    • This material may be derived from roughly machine-read images, and so is provided only to facilitate research.
    More information on Chapter Skim is available.