Investigation of Queueing Systems with a Polya Arrival Process

The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.