Allocation of interdependent resources for maximal throughput

DOI10.1080/15326340008807575zbMath0978.90014OpenAlexW2059174652WikidataQ126241337 ScholiaQ126241337MaRDI QIDQ4951465

Leandros Tassiulas, Partha Pratim Bhattacharya

Publication date: 12 February 2002

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326340008807575

zbMATH Keywords

communication systemsscheduling policyqueueing network model

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (11)

A push-pull network with infinite supply of work ⋮ Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ Maximizing throughput in queueing networks with limited flexibility ⋮ Randomized scheduling algorithm for queueing networks ⋮ Dynamic server allocation for unstable queueing networks with flexible servers ⋮ MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic ⋮ Profit maximization in flexible serial queueing networks ⋮ Robustness of efficient server assignment policies to service time distributions in finite-buffered lines ⋮ DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Maximizing queueing network utility subject to stability: greedy primal-dual algorithm

This page was built for publication: Allocation of interdependent resources for maximal throughput