BBN Notes for Lecture 22 (4/23/97)
next previous contents

Incorporating PCR into the Floating Algorithm

Note that the Floating Algorithm discussed last time, ignores the PCR value on each VCC.
In order to incorporate the PCR value for each VCC, add one imaginary link for each VCC to its source (or destination) with link capacity, C = PCRVCC .
Apply the algorithm to the extended network.

Example:

Results from last time (with no PCR)
VCC ACR with no PCR
VCC1 A -> D 0.5
VCC2 A -> B 1.5
VCC3 B -> C 0.5
VCC4 C -> D 0.5


Now incorporate PCRVCC1 = 0.2, PCRVCC2 = 1.5, PCRVCC3 = 2.0, PCRVCC3 = 0.4

Apply Floating Algorithm
Raise all VCC's to 0.2 VCC1 stops
Raise VCC2, VCC3, and VCC4 to 0.4 VCC4 stops
Raise VCC2 and VCC3 to 0.8 VCC3 stops
Raise VCC2 to 1.5 VCC2 stops

New Results
VCC ACR with no PCR ACR with PCR
VCC1 A -> D 0.5 0.2
VCC2 A -> B 1.5 1.5
VCC3 B -> C 0.5 0.8
VCC4 C -> D 0.5 0.4

Note that F < C, for the links A -> B and C -> D.


Homework Assignment

Apply floating algorithm with

Solution


Concern: Floating Algorithm is inherently centralized.
Solution: A. Charny's Distributed Max-Min Fair Rate Computation Algorithm.


Charny proved that this converges to a Max-Min Fair allocation.


A Simpler Algorithm for computing FSR

The standards folks thought Charny's Algorithm with computationally too intensive, so they implemented this simper one (which is not known to converge to anything in particular). As the old joke goes: We may be lost, but we're making very good time!

In steady state the FSR should converge to the average of all the ACR's on the link. If a higher rate is desired, it may eventually creep up to that higher rate.
    Set FSR = SW_DPF x MACR
SW_DPF stands for Switch Down Pressure Factor .
This value is typically 7/8 since,
based on typical queueing theory results,
a much lower delay (or backlog) can be achieved
slightly below capacity:

Switches also set CI = 1 in RM cells of VCC with MACR < ER

Sources do the following:


BBN Notes for Lecture 22 (4/23/97)
next previous contents
Notes taken by Stephen Young from a lecture by Prof. K.S. Vastola on April 23, 1997.