A hill-climbing approach to the queue depth assignment problem to ensure customer QoS subscriptions.
Marc A. DonisLundy LewisUtpal DattaPublished in: ISCC (1998)
Keyphrases
- hill climbing
- simulated annealing
- quality of service
- service times
- search space
- search algorithm
- direct search
- arrival process
- search strategy
- steady state
- genetic algorithm ga
- queue length
- max min
- beam search
- systematic search
- service requirements
- hill climbing algorithm
- call center
- steepest ascent
- np hard
- search procedure
- tabu search
- arrival rate
- greedy search
- web services
- markov chain
- real time
- path finding
- holding cost
- ad hoc networks
- lower bound
- arrival processes
- state dependent
- queueing model
- heuristic function
- fluid model
- exhaustive search
- hybrid algorithms
- service rates
- queue size
- decision trees