Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
