Near-complete decomposability of queueing networks with clusters of strongly interacting servers.
Hendrik VantilborghRichard L. GarnerEdward D. LazowskaPublished in: Performance (1980)
Keyphrases
- queueing networks
- arrival rate
- product form
- service times
- steady state
- heavy traffic
- queueing network model
- scheduling policies
- queueing systems
- state dependent
- queue length
- buffer allocation
- service rates
- stationary distribution
- multiclass queueing networks
- queueing theory
- long run
- clustering algorithm
- data center
- data points
- cluster analysis
- fluid model
- customer classes
- hierarchical clustering
- random walk
- sufficient conditions
- decision making
- neural network