2010/02/23 by A. Ganesh, Ganesh, A., S. Lilienthal +10
Business, Management and Accounting · Computer Science · Engineering · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Wireless Communication Networks Research #cs.NI
paper · pdf · doi:10.48550/arxiv.1002.4314
Accepted to Sigmetrics 2010
openalex publication_date 2010/02/23 · arxiv created 2010/04/09 · arxiv updated 2010/04/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly relevant in scenarios where clients cannot predict the load of a server before being actually attached to it. An important example is in wireless spectrum sharing where clients try to share a set of frequency bands in a distributed manner.