Queueing networks of random link topology: stationary dynamics of maximal throughput schedules

DOI10.1007/s11134-005-0858-xzbMath1080.90025OpenAlexW2018075485MaRDI QIDQ2572903

Nicholas Bambos, George Michailidis

Publication date: 7 November 2005

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/47640

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (6)

Queueing System MAP/M/ ∞ with n Types of Customers ⋮ Control of multi-node mobile communications networks with time-varying channels via stability methods ⋮ An Analysis Method of Queueing Networks with a Degradable Structure and Non-zero Repair Times of Systems ⋮ Dynamic scheduling for switched processing systems with substantial service-mode switching times ⋮ Stability of spatial queueing systems ⋮ Queueing and scheduling in random environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point processes and queues. Martingale dynamics
• ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES
• On Flows in Stochastic Marked Graphs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• On stability of state-dependent queues and acyclic queueing networks
• Minimum weight paths in time-dependent networks
• Dynamic server allocation to parallel queues with randomly varying connectivity
• ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
• Scheduling and stability aspects of a general class of parallel processing systems

This page was built for publication: Queueing networks of random link topology: stationary dynamics of maximal throughput schedules