A Robust Heuristic for Minimizing Cell Loss in ATM Networks
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
| Hi-index | 0.00 |
This paper addresses the following questions related to buffer management schemes for high speed integrated services networks: ($i$) given the pattern of cell arrivals from different classes of traffic, can buffer control significantly influence the effect of cell loss, and ($ii$) what are the ``best'''' policies for selecting cells for transmission from buffers in the network nodes as well as for rejecting cells when the buffers are full. The basic approach to answering these questions is to impute a cost of losing cells which may vary between classes of applications and to minimize this cost over the finite or infinite time horizons. The policies we derive are best in the sense that they minimize the cost function at each (deterministic) instant of time during the system''s operation (pathwise optimum). We then illustrate via simulations how these optimal rules would perform in realistic conditions in a sequence of cascaded buffers. The simulations are conducted using a CM-5 MIMD parallel computer so as to obtain rapid results.