Traffic Management for the Available Bit Rate (ABR) Service in ...
Traffic Management for the Available Bit Rate (ABR) Service in ... Traffic Management for the Available Bit Rate (ABR) Service in ...
eld in the RM-cells (in the forward and/or backward directions). This dissertation deals mainly with explicit rate feedback from switches. VS/VD Control: In this mode, the switch may segment the ABR control loop by appearing as a \virtual source" to one side of the loop and as a \virtual destination" to the other side. We study the implications of this mechanism on the ABR service later in this dissertation. Switch Rule 2: This rule speci es how a switch may generate an RM cell in case it is heavily congested and doesn't see RM cells from the source. Basically, the rule allows such RM cells to only decrease the source rate, and these RM cells are sent out-of-rate. This rule contains aspects of the Backward Explicit Congestion Noti cation proposal [69] and the OSU scheme proposal described later in this dissertation. Switch Rule 3: This rule says that the RM cells may be transmitted out-of- sequence, but the sequence integrity must be maintained. This rule allows the switch the exibility to put the RM cells on a priority queue for faster feedback to sources when congested. However, by queuing RM cells separately from the data stream, the correlation between the quantities declared RM cells and the actual values in the data stream may be lost. Switch Rule 4 and 5: Rule 4 speci es alignment with ITU-T's I.371 draft, and ensures the integrity of the MCR eld in the RM cell. Rule 5 allows the optional implementation of a use-it-or-lose-it policy at the switch. We treat the use-it-or-lose-it issue in greater detail later in this dissertation. 35
Observe that the ABR tra c management framework only speci es that the switch should implement a feedback marking mechanism and gives exibility onhow to handle RM cells. However, the speci c schemes to calculate feedback are not stan- dardized. Several other aspects (such as VS/VD, use-it-or-lose-it implementation, switch queuing and bu ering architectures, and parameter selection) are implemen- tation speci c, and are an area for vendor di erentiation. In this dissertation, we address issues in several of these non-standard areas. Towards this direction, the next chapter describes the design goals of switch algorithms. 2.8 Summary We have presented the source, destination, switch rules, and parameters of the ABR tra c management model. Like any other standard, these rules re ect a com- promise between several di ering views. As observed, a key component in the tra c management speci cation is the switch scheme which calculates the feedback to be given to the sources. The work presented in this dissertation helped develop the source, switch and destination rules of the ATM Forum Tra c Management standard. Speci cally, we study and propose designs for switch rate feedback calculation, source rule design (especially SES Rules 3, 5, 9, 11, and 13), and address application performance and switch scheme implementation tradeo s. 36
- Page 11 and 12: 2.7 Switch Behavior . . . . . . . .
- Page 13 and 14: 5.8 Proof: Fairness Algorithm Impro
- Page 15 and 16: 8.15 Factors A ecting Bu ering Requ
- Page 17 and 18: Bibliography . . . . . . . . . . .
- Page 19 and 20: 8.12 Maximum Queues for Satellite N
- Page 21 and 22: 5.1 Transmitted cell rate (instanta
- Page 23 and 24: 6.13 Results foratwo sources con gu
- Page 25 and 26: 7.11 E ect of UILI on Medium Bursts
- Page 27 and 28: C.3 Flow Chart of Bi-Directional Co
- Page 29 and 30: header information which limits the
- Page 31 and 32: switches since a standard does not
- Page 33 and 34: congestion control deals with the c
- Page 35 and 36: hand side of the equation is the su
- Page 37 and 38: analyses which are used to validate
- Page 39 and 40: CHAPTER 2 THE ABR TRAFFIC MANAGEMEN
- Page 41 and 42: time (RTT). As we explain later, AB
- Page 43 and 44: feedback from nearby switches to re
- Page 45 and 46: Note that in-rate and out-of-rate d
- Page 47 and 48: Data cells also have an Explicit Fo
- Page 49 and 50: opportunity the source may nd that
- Page 51 and 52: Figure 2.7: Scheduling of forward R
- Page 53 and 54: as the timeout value) which reduces
- Page 55 and 56: It has been incorrectly believed th
- Page 57 and 58: NI CI Action 0 0 ACR Min(ER, ACR +
- Page 59 and 60: Source Rule 13: Sources can optiona
- Page 61: Switch Rule 1: This rule speci es t
- Page 65 and 66: complex method like per-VC queuing
- Page 67 and 68: graphs have a steady state with con
- Page 69 and 70: Figure 3.2: Operating point between
- Page 71 and 72: The following example illustrates t
- Page 73 and 74: mention this concept of fairness fo
- Page 75 and 76: control problem was also simpler. S
- Page 77 and 78: of such an occurrence is expected t
- Page 79 and 80: y giving only one feedback per meas
- Page 81 and 82: CHAPTER 4 SURVEY OF ATM SWITCH CONG
- Page 83 and 84: The adaptive FCVC algorithm [63] co
- Page 85 and 86: np. Thus, long path VCs have fewer
- Page 87 and 88: networks like ATM can have complete
- Page 89 and 90: scheme followed by a discussion of
- Page 91 and 92: exibility of decoupling the enforce
- Page 93 and 94: 4.6.1 Key Techniques In EPRCA, the
- Page 95 and 96: If the mean ACR is not a good estim
- Page 97 and 98: is the ratio of the input rate to t
- Page 99 and 100: which shares the link equally as al
- Page 101 and 102: proportional to the the unused ABR
- Page 103 and 104: The key technique in the scheme is
- Page 105 and 106: the bandwidth allocations to satis
- Page 107 and 108: 4.10 DMRCA scheme The Dynamic Max R
- Page 109 and 110: on its CCR. Further MAX times out i
- Page 111 and 112: other words, a di erent set of para
eld <strong>in</strong> <strong>the</strong> RM-cells (<strong>in</strong> <strong>the</strong> <strong>for</strong>ward and/or backward directions). This<br />
dissertation deals ma<strong>in</strong>ly with explicit rate feedback from switches.<br />
VS/VD Control: In this mode, <strong>the</strong> switch may segment <strong>the</strong> <strong>ABR</strong> control<br />
loop by appear<strong>in</strong>g as a \virtual source" to one side of <strong>the</strong> loop and as a<br />
\virtual dest<strong>in</strong>ation" to <strong>the</strong> o<strong>the</strong>r side. We study <strong>the</strong> implications of this<br />
mechanism on <strong>the</strong> <strong>ABR</strong> service later <strong>in</strong> this dissertation.<br />
Switch Rule 2: This rule speci es how a switch may generate an RM cell <strong>in</strong><br />
case it is heavily congested and doesn't see RM cells from <strong>the</strong> source. Basically,<br />
<strong>the</strong> rule allows such RM cells to only decrease <strong>the</strong> source rate, and <strong>the</strong>se RM<br />
cells are sent out-of-rate. This rule conta<strong>in</strong>s aspects of <strong>the</strong> Backward Explicit<br />
Congestion Noti cation proposal [69] and <strong>the</strong> OSU scheme proposal described<br />
later <strong>in</strong> this dissertation.<br />
Switch Rule 3: This rule says that <strong>the</strong> RM cells may be transmitted out-of-<br />
sequence, but <strong>the</strong> sequence <strong>in</strong>tegrity must be ma<strong>in</strong>ta<strong>in</strong>ed. This rule allows <strong>the</strong><br />
switch <strong>the</strong> exibility to put <strong>the</strong> RM cells on a priority queue <strong>for</strong> faster feedback<br />
to sources when congested. However, by queu<strong>in</strong>g RM cells separately from <strong>the</strong><br />
data stream, <strong>the</strong> correlation between <strong>the</strong> quantities declared RM cells and <strong>the</strong><br />
actual values <strong>in</strong> <strong>the</strong> data stream may be lost.<br />
Switch Rule 4 and 5: Rule 4 speci es alignment with ITU-T's I.371 draft,<br />
and ensures <strong>the</strong> <strong>in</strong>tegrity of <strong>the</strong> MCR eld <strong>in</strong> <strong>the</strong> RM cell. Rule 5 allows <strong>the</strong><br />
optional implementation of a use-it-or-lose-it policy at <strong>the</strong> switch. We treat <strong>the</strong><br />
use-it-or-lose-it issue <strong>in</strong> greater detail later <strong>in</strong> this dissertation.<br />
35