Optimal dynamic scheduling in Jackson networks

DOI10.1109/9.8648MaRDI QIDQ3829323zbMATH OpenOpenAlexFDO

Authors Keith W. Ross, David D. Yao

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.8648

zbMATH Keywords

polymatroidConservation lawsinteractive trafficinternal routingJackson-like networkpacket-switched data networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 5665896
• Dynamic Scheduling for a Flexible Processing Network
• A Cross-Layer View of Optimal Scheduling
• Optimal control of service rates and arrivals in Jackson networks
• Dynamic problems of optimal distribution of several kinds of resources on network schedules
• Dynamic Scheduling of a Multiclass Fluid Network
• Fast Jackson networks with dynamic routing
• Dynamic Distributed Scheduling in Random Access Networks

Cited in

(11)

• Dynamic scheduling in manufacturing systems using Brownian approximations
• scientific article; zbMATH DE number 2086195 (Why is no real title available?)
• Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy
• Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
• Optimal control of service rates and arrivals in Jackson networks
• Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
• Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
• Dynamic scheduling with reconfiguration delays
• Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
• Optimal intensity control of a multi-class queue

This page was built for publication: Optimal dynamic scheduling in Jackson networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829323)