This report analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to understand how the packet level link e ciency is dependent on the rates of individual virtual circuits and the degree of the imposed overload. In addition, we study early packet discard and show that the queue capacity needed to achieve high e ciency under worst-case conditions grows with the number of virtual circuits and we determine the e ciency obtainable with more limited queue capacities. Using the insights from these analyses, extensions to early packet discard are proposed which achieve high e ciency with dramatically smaller queue capacities (independent of the number of virtual circuits). 0 This work was supported by the ARPA Computing Systems Technology O ce, Ascom Timeplex, Bay Networks, Bell Northern Research, NEC, NTT, Southwestern Bell and Tektronix.
Jonathan S. Turner