Abstract
We study a new dynamic of generalized networks (G-networks) of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: first-in-first-out (FIFO), last-in-first-out with pre-emptive resume priority (LIFO/PR) and processor sharing (PS). Moreover, we consider a probabilistic deleting mechanism based on iterated deletions of customers according to an arbitrary list of service stations. We prove that these networks have a steady-state product-form solution and we investigate the existence of a solution to the traffic equation of such networks.
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.
