Access traffic control implementations for frame relay

Various aspects of the implementation of access traffic control mechanisms for frame relay networks are considered. Emphasis is placed on the distinction between two related rate control mechanisms, i.e., access policing by the network and traffic shaping by the user. Frame discarding performance (policer strictness) is compared for two alternative policing techniques, i.e., leaky bucket and quantized moving window. Hardware and software implementations are compared for these two policers. It is estimated that between 15 and 150 policers could be implemented on a single 10 mm by 10 mm chip with frame throughputs per policer of a few million frames per second. Processor sharing would be possible for large-scale systems, with correspondingly lower frame throughputs. Design requirements of a leaky bucket shaper that will achieve zero policing loss and minimum delay when operating in conjunction with a leaky bucket policer are discussed. The loss/delay tradeoff for the shaping function is quantified