Paper Info
Title
Performance-based routing
Abstract
In many-server systems with heterogeneous servers, the Fastest-Server-First (FSF) policy is known for its excellent performance. However, when service rates are unknown and/or time-varying, implementing FSF routing is not straightforward. We analyze an algorithm that approximates FSF routing: servers are ranked in a dynamic list, where the shorter the actual service times that a server exhibits-the closer the server is to the head of the list; a customer is then routed to the lowest-index (highest-in-the-list) idle server.
Year
DOI
Venue
2014
10.1016/j.orl.2014.07.003
Operations Research Letters
Keywords
Field
DocType
multi-server queue,routing,transposition rule
Server farm,Dynamic Source Routing,Ranking,Idle,Computer science,Policy-based routing,Static routing,Server,Computer network,Distributed computing
Journal
Volume
Issue
Citations 
42
6
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Avishai Mandelbaum1106185.79
Petar Momcilovic29312.28