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 ...
THEN BEGIN Increment Num VC Underloading � Sum OCR Underloading Sum OCR Underloading + OCR Of VC END (* IF *) Fair Share Rate (Target Cell Rate - SUM OCR Underloading) /maxf1, (Num VC Active - Num VC Underloading )g UNTIL Fair Share Rate does not change (* Maximum of 2 iterations *)� Load Adjustment Decision OCR In Cell/Fair Share Rate� END� (* Precise Fairness Computation Option *) IF (Load Adjustment Decision > Load Adjustment Factor In Cell) THEN BEGIN Load Adjustment Factor In Cell Load Adjustment Decision� IF BECN Option and Load Adjustment Decision > 1 THEN SEND A COPY OF CONTROL CELL BACK TO SOURCE � END (* IF *) 395
APPENDIX C ERICA SWITCH ALGORITHM: DETAILED DESCRIPTION C.1 Variables and Flow charts Notes: All rates areintheunits of cells/s The following pseudo-code assumes a simple xed-time averaging interval. Ex- tension to a cells and time averaging interval is trivial. We use a combination of owcharts and pseudo-code to describe the ERICA al- gorithm. The following names are used to identify the ow charts: Flow Chart 1: Flow Chart of the Basic ERICA Algorithm. Figure C.1. Flow Chart 2: Flow Chart for Achieving Max-Min Fairness. Figure C.2. Flow Chart 3: Flow Chart for Bi-Directional Counting. Figure C.3. Flow Chart 4: Flow Chart of averaging number of active sources (part 1 of 2). Figure C.4. 396
- Page 371 and 372: 9.2 The ERICA Switch Scheme: Renota
- Page 373 and 374: The unknowns in the above equations
- Page 375 and 376: Figure 9.9: Two methods to measure
- Page 377 and 378: 9.4 VS/VD Switch Design Options 9.4
- Page 379 and 380: # VC Rate VC Input Rate Input Rate
- Page 381 and 382: 8 uses source rate measurement, we
- Page 383 and 384: The allocated rate update and the e
- Page 385 and 386: sources in chapter 6. We expect the
- Page 387 and 388: con guration mentioned in the table
- Page 389 and 390: can be very di erent for di erent V
- Page 391 and 392: CHAPTER 10 IMPLEMENTATION ISSUES At
- Page 393 and 394: With an enhanced UBR service, appli
- Page 395 and 396: 2. Some switch schemes have a proce
- Page 397 and 398: 4. Large legacy switches have a pro
- Page 399 and 400: section 9. Further, WAN switches wo
- Page 401 and 402: CHAPTER 11 SUMMARY AND FUTURE WORK
- Page 403 and 404: good transient performance. Since r
- Page 405 and 406: variant background tra c conditions
- Page 407 and 408: APPENDIX A SOURCE, DESTINATION AND
- Page 409 and 410: 7. After following behaviors #5 and
- Page 411 and 412: set the QL and SN elds to zero, pre
- Page 413 and 414: d) VS/VD Control: The switch may se
- Page 415 and 416: 5. Setting of other parameters at V
- Page 417 and 418: 4. The averaging interval timer exp
- Page 419 and 420: 1. Initialization: Target Cell Rate
- Page 421: THEN IF (OCR In Cell Fair Share Rat
- Page 425 and 426: Number Active VCs In Last Interval
- Page 427 and 428: IF (NOT(Averaging VCs Option)) THEN
- Page 429 and 430: IF (Load Factor = In nity) THEN Loa
- Page 431 and 432: ; (Contribution[VC] = Decay Factor)
- Page 433 and 434: Name Explanation Flow Chart (FC) or
- Page 435 and 436: Figure C.2: Flow Chart for Achievin
- Page 437 and 438: Figure C.4: Flow Chart of averaging
- Page 439 and 440: Figure C.6: Flow chart of averaging
- Page 441 and 442: C.3 Pseudocode for VS/VD Design Opt
- Page 443 and 444: (* | Bottleneck rate of next loop |
- Page 445 and 446: Follow SESRules 1-4 (see appendix A
- Page 447 and 448: CRM - Missing RM-cell Count DIR bit
- Page 449 and 450: TUB -Target Utilization Band Trm -
- Page 451 and 452: [12] J. Bennett and G. Tom Des Jard
- Page 453 and 454: [38] M. Grossglauser, S.Keshav, and
- Page 455 and 456: [64] H. T. Kung. Flow Controlled Vi
APPENDIX C<br />
ERICA SWITCH ALGORITHM: DETAILED<br />
DESCRIPTION<br />
C.1 Variables and Flow charts<br />
Notes:<br />
All rates are<strong>in</strong><strong>the</strong>units of cells/s<br />
The follow<strong>in</strong>g pseudo-code assumes a simple xed-time averag<strong>in</strong>g <strong>in</strong>terval. Ex-<br />
tension to a cells and time averag<strong>in</strong>g <strong>in</strong>terval is trivial.<br />
We use a comb<strong>in</strong>ation of owcharts and pseudo-code to describe <strong>the</strong> ERICA al-<br />
gorithm. The follow<strong>in</strong>g names are used to identify <strong>the</strong> ow charts:<br />
Flow Chart 1: Flow Chart of <strong>the</strong> Basic ERICA Algorithm. Figure C.1.<br />
Flow Chart 2: Flow Chart <strong>for</strong> Achiev<strong>in</strong>g Max-M<strong>in</strong> Fairness. Figure C.2.<br />
Flow Chart 3: Flow Chart <strong>for</strong> Bi-Directional Count<strong>in</strong>g. Figure C.3.<br />
Flow Chart 4: Flow Chart of averag<strong>in</strong>g number of active sources (part 1 of 2).<br />
Figure C.4.<br />
396
Change language