A model of a cell of a communication network, divided into zones, with the dependence of the users' service time on the zone, in which they are located, is considered. The arrival flow of users is defined by a marked Markovian process. The number of users that can receive service in a cell simultaneously is finite. If the number of users reached the limit, then new users are lost, except the users that come to the cell already during the service (handover users). For the short-term storage of such users, there is a buffer of a finite capacity. Cell operation is modeled by a multi-server queueing system. The behavior of this system is described by a multi-dimensional Markov chain. The algorithms for calculating the stationary distribution of this chain and the main characteristics of the quality of service have been developed. © 2013 IEEE.