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 ...
4.14 Summary of Switch Congestion Control Schemes We have observed in our preceding survey that di erent schemes have addressed di erent subsets of switch scheme goals listed in chapter 3. In this section, we summa- rize these goals and approaches and identify areas not addressed by these proposals. If we sort the schemes by time, we nd that early schemes addressed the basic problem of achieving max-min fairness with minimal complexity. We can see a tran- sition from using purely bit-based ideas for ER-feedback to using purely ER-based ideas for the same purpose. Early schemes used a number of concepts which have been based on the legacy of bit-based feedback design, which may not be best when explicit-rate feedback capabilityisavailable. For example, control of queuing delayisdonetypically through an threshold-based or hysteresis-based approach which is a legacy from bit-based feedback design. This approach does not work when there is high variance in queue uctuations due to tra c variation. As discussed in a later chapter, using queue thresholds alone to detect congestion is a awed technique especially when rate-based control is used. Later schemes addressed the speed of convergence and the implementation com- plexityofthescheme, and faced a tradeo between the two. The issue of measurement raised in this dissertation has been recognized in several contemporary schemes. Some of the schemes described in this section have been developed at the same time, or after the development of the OSU, ERICA and ERICA+ schemes. As a result, they share several features with the schemes we have described in this dissertation. 91
4.14.1 Common Drawbacks Though the evolution of switch schemes has yielded increasingly e cient and fair algorithms, with reduction in implementation complexity, and a broader scope, many of these proposals su er from a common set of drawbacks as listed in this section. In general schemes, with a few notable exceptions, have not been comprehen- sive in design, i.e., they either do not address all the goals of a switchscheme and/or make too many assumptions about measurement related aspects of the scheme. For example, many schemes do not address the issue of how to measure the ABR demand. The lack of information about the demand may lead to under- allocation of rates. Several schemes (like those which use the concept of Mean ACR (MACR)) approximate the average demand per connection. However, if the total demand (aggregate input rate) is not measured, the scheme could be consistently making estimation errors. Other schemes do not monitor the activity of sources, and may overlook a source becoming temporarily idle. If the idle source is considered while determining allocations for all other sources, the allocations for the other sources may be reduced. In brief, measurement is necessary to track the current network state used by the scheme. Ideally, a scheme should measure every component of the network state it uses for its calculations. Another issue is how to measure the scheme metrics when there is high variation in the tra c demand and available capacity. Several metrics need to be observed over intervals of time and averaged over manysuchintervals to smooth out the e ects of such variation. The length of the interval is a key factor in a tradeo between quick response and accurate response. Implementation issues include 92
- 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
- Page 113 and 114: A combination of several ideas in a
- Page 115 and 116: 4.13 SP-EPRCA scheme The SP-EPRCA s
- Page 117: RTD and shuts o the source (for sta
- Page 121 and 122: The ATM Tra c Management standard a
- Page 123 and 124: 5.1.1 Control-Cell Format The contr
- Page 125 and 126: The last two elds are used in the b
- Page 127 and 128: Figure 5.3: Flow chart for updating
- Page 129 and 130: LAF in cell Max(LAF in cell, z) The
- Page 131 and 132: the time of departure (instant mark
- Page 133 and 134: the steady state. The system operat
- Page 135 and 136: 5.2.3 Use Measured Rather Than Decl
- Page 137 and 138: said about the maximum queue length
- Page 139 and 140: The key problem with some unipolar
- Page 141 and 142: Figure 5.6: Space time diagram show
- Page 143 and 144: As noted, these heuristics do not g
- Page 145 and 146: Transmitted Cell Rate ABR Queue Len
- Page 147 and 148: 4. The RM cell contains a timestamp
- Page 149 and 150: 1. The source o ered average cell r
- Page 151 and 152: Transmitted Cell Rate Link Utilizat
- Page 153 and 154: Transmitted Cell Rate Link Utilizat
- Page 155 and 156: Transmitted Cell Rate Link Utilizat
- Page 157 and 158: Figure 5.17: The parking lot fairne
- Page 159 and 160: Figure 5.19: Network con guration w
- Page 161 and 162: Transmitted Cell Rate Link Utilizat
- Page 163 and 164: Transmitted Cell Rate Link Utilizat
- Page 165 and 166: 5.8 Proof: Fairness Algorithm Impro
- Page 167 and 168: Region 2: y s and x s and U(1 + ) x
4.14.1 Common Drawbacks<br />
Though <strong>the</strong> evolution of switch schemes has yielded <strong>in</strong>creas<strong>in</strong>gly e cient and fair<br />
algorithms, with reduction <strong>in</strong> implementation complexity, and a broader scope, many<br />
of <strong>the</strong>se proposals su er from a common set of drawbacks as listed <strong>in</strong> this section.<br />
In general schemes, with a few notable exceptions, have not been comprehen-<br />
sive <strong>in</strong> design, i.e., <strong>the</strong>y ei<strong>the</strong>r do not address all <strong>the</strong> goals of a switchscheme and/or<br />
make too many assumptions about measurement related aspects of <strong>the</strong> scheme.<br />
For example, many schemes do not address <strong>the</strong> issue of how to measure<br />
<strong>the</strong> <strong>ABR</strong> demand. The lack of <strong>in</strong><strong>for</strong>mation about <strong>the</strong> demand may lead to under-<br />
allocation of rates. Several schemes (like those which use <strong>the</strong> concept of Mean ACR<br />
(MACR)) approximate <strong>the</strong> average demand per connection. However, if <strong>the</strong> total<br />
demand (aggregate <strong>in</strong>put rate) is not measured, <strong>the</strong> scheme could be consistently<br />
mak<strong>in</strong>g estimation errors.<br />
O<strong>the</strong>r schemes do not monitor <strong>the</strong> activity of sources, and may overlook a<br />
source becom<strong>in</strong>g temporarily idle. If <strong>the</strong> idle source is considered while determ<strong>in</strong><strong>in</strong>g<br />
allocations <strong>for</strong> all o<strong>the</strong>r sources, <strong>the</strong> allocations <strong>for</strong> <strong>the</strong> o<strong>the</strong>r sources may be reduced.<br />
In brief, measurement is necessary to track <strong>the</strong> current network state used by <strong>the</strong><br />
scheme. Ideally, a scheme should measure every component of <strong>the</strong> network state it<br />
uses <strong>for</strong> its calculations.<br />
Ano<strong>the</strong>r issue is how to measure <strong>the</strong> scheme metrics when <strong>the</strong>re is high<br />
variation <strong>in</strong> <strong>the</strong> tra c demand and available capacity. Several metrics need<br />
to be observed over <strong>in</strong>tervals of time and averaged over manysuch<strong>in</strong>tervals to smooth<br />
out <strong>the</strong> e ects of such variation. The length of <strong>the</strong> <strong>in</strong>terval is a key factor <strong>in</strong> a<br />
tradeo between quick response and accurate response. Implementation issues <strong>in</strong>clude<br />
92