2 papers
math.OC2006
On Decentralized Policies for the Stochastic k-Server Problem
Randy Cogill, Sanjay Lall
In this paper we study a dynamic resource allocation problem which we call the stochastic k-server problem. In this problem, requests for some service to be performed appear at var…
cs.NI2006
A Delay Analysis of Maximal Matching Switching with Speedup
Randy Cogill, Sanjay Lall
In this paper we analyze the average queue backlog in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare this average backlog to t…