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 ...
2.5 Source End System Rules TM4.0 speci es 13 rules that the sources have to follow. This section discusses each rule and traces the development and implications of certain important rules. In some cases the precise statement of the rule is important. Hence, the source and destination rules are quoted from the TM speci cation [32] in appendix A. Source Rule 1: Sources should always transmit at a rate equal to or below their computed ACR. The ACR cannot exceed PCR and need not go below MCR. Mathematically, MCR ACR PCR Source Rate ACR Source Rule 2: At the beginning of a connection, sources start at ICR. The rst cell is always an in-rate forward RM cell. This ensures that the network feedback will be received as soon as possible. Source Rule 3: At any instant, sources have three kinds of cells to send: data cells, forward RM cells, and backward RM cells (corresponding to the reverse ow). The relative priority of these three kinds of cells is di erent at di erent transmission opportunities. First, the sources are required to send an FRM after every 31 cells. However, if the source rate is low, the time between RM cells will be large and network feedback will be delayed. Toovercome this problem, a source is supposed to send an FRM cell if more than 100 ms has elapsed since the last FRM. This introduces another problem for low rate sources. In some cases, at every transmission 21
opportunity the source may nd that it has exceeded 100 ms and needs to send an FRM cell. In this case, no data cells will be transmitted. To overcome this problem, an additional condition was added that there must be at least two other cells between FRMs. An example of the operation of the above condition is shown in the gure 2.6. The gure assumes a unidirectional VC (i.e., there are no BRMs to be turned around). The gure has three parts. The rst part of the gure shows that, when the source rate is 500 cells/s, every 32nd cell is an FRM cell. The time to send 32 cells is always smaller than 100 ms. In the second part of the gure, the source rate is 50 cells/s. Hence 32 cells takes 640 ms to be transmitted. There- fore, after 100 ms, an FRM is scheduled in the next transmission opportunity (or slot). The third part of the gure shows the scenario when the source rate is 5 cells/s. The inter-cell time itself is 200 ms. In this case, an FRM is scheduled every three slots, i.e., the inter-FRM time is 600 ms. Since Mrm is 2, two slots between FRMs are used for data or BRM cells. Second, awaiting BRM has priority over waiting data, given that no BRM has been sent since the last FRM. Of course, if there are no data cells to send, waiting BRMs may be sent. Third, data cells have priority intheremaining slots. The second and third part of the this rule ensure that BRMs are not unnec- essarily delayed and that all available bandwidth is not used up by the RM cells. 22
- Page 1 and 2: Tra c Management for the Available
- Page 3 and 4: ABSTRACT With the merger of telecom
- Page 5 and 6: Tra c Management for the Available
- Page 7 and 8: To my family iv
- Page 9 and 10: VITA April 30, 1971 :::::::::::::::
- 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: Data cells also have an Explicit Fo
- 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 and 62: Switch Rule 1: This rule speci es t
- Page 63 and 64: Observe that the ABR tra c manageme
- 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
2.5 Source End System Rules<br />
TM4.0 speci es 13 rules that <strong>the</strong> sources have to follow. This section discusses<br />
each rule and traces <strong>the</strong> development and implications of certa<strong>in</strong> important rules. In<br />
some cases <strong>the</strong> precise statement of <strong>the</strong> rule is important. Hence, <strong>the</strong> source and<br />
dest<strong>in</strong>ation rules are quoted from <strong>the</strong> TM speci cation [32] <strong>in</strong> appendix A.<br />
Source Rule 1: Sources should always transmit at a rate equal to or below<br />
<strong>the</strong>ir computed ACR. The ACR cannot exceed PCR and need not go below<br />
MCR. Ma<strong>the</strong>matically,<br />
MCR ACR PCR<br />
Source <strong>Rate</strong> ACR<br />
Source Rule 2: At <strong>the</strong> beg<strong>in</strong>n<strong>in</strong>g of a connection, sources start at ICR. The<br />
rst cell is always an <strong>in</strong>-rate <strong>for</strong>ward RM cell. This ensures that <strong>the</strong> network<br />
feedback will be received as soon as possible.<br />
Source Rule 3: At any <strong>in</strong>stant, sources have three k<strong>in</strong>ds of cells to send: data<br />
cells, <strong>for</strong>ward RM cells, and backward RM cells (correspond<strong>in</strong>g to <strong>the</strong> reverse<br />
ow). The relative priority of <strong>the</strong>se three k<strong>in</strong>ds of cells is di erent at di erent<br />
transmission opportunities.<br />
First, <strong>the</strong> sources are required to send an FRM after every 31 cells. However,<br />
if <strong>the</strong> source rate is low, <strong>the</strong> time between RM cells will be large and network<br />
feedback will be delayed. Toovercome this problem, a source is supposed to send<br />
an FRM cell if more than 100 ms has elapsed s<strong>in</strong>ce <strong>the</strong> last FRM. This <strong>in</strong>troduces<br />
ano<strong>the</strong>r problem <strong>for</strong> low rate sources. In some cases, at every transmission<br />
21