Symmetric Nash equilibrium arrivals to queuing system

We consider a game-theoretic setting for the queuing system models where input process of arrivals is strategic. This paper generalizes a methodology for the symmetric Nash equilibrium exploring in queuing system with loss. We assume that the system admits customer requests at the time interval $[0,T]$. Each of customers chooses the moment to send his request into the system maximizing his payoff. Several models of certain systems are presented as examples demonstrating a result of the methodology application.