Discrete-time queuing models arise naturally in the study of slotted systems such as asynchronous transfer mode (ATM) networks. As traditional analytical approaches based on the solution of a state probability matrix are restricted to Markovian models, in resent years algorithmic solutions have become an extremely attractive option for solving non-Markovian models. This paper reports work on the performance analysis of a discrete-time GI/GI/I-L queuing system applied to the usage parameter control (UPC) or “policing” problem in ATM networks.