Bounds on mean cycle time in acyclic fork-join queueing networks
Nikolai K. KrivulinPublished in: CoRR (2012)
Keyphrases
- queueing networks
- product form
- steady state
- heavy traffic
- state dependent
- queueing systems
- np hard
- upper bound
- long run
- arrival rate
- buffer allocation
- stationary distribution
- multiclass queueing networks
- fluid model
- join algorithms
- single server
- lower bound
- np complete
- queueing theory
- query optimization
- join operations
- database schemes
- state space search
- queue length
- genetic algorithm
- markov chain
- asymptotically optimal
- worst case
- lower and upper bounds
- service times
- random walk
- supply chain
- dynamic programming
- query processing
- computational complexity