Team : rap
Section: New Results
The analysis of a transient multi-class queue has been achieved. Customers enter the queue in the FIFO order and achieve J feed-backs before leaving definitely the queue. The distribution of the service received at the j th feedback depends on j . When the load is greater than one, limit results have been proved for the total number of customers in each class. The techniques involve the use of branching processes. A study of the service in random order discipline has been also done in the same context.