Sequencing two Servers On a Sphere

We analyze a service system in which two servers move independently on the surface of the n-dimensional sphere. Requests for service arrive independently and uniformly over the surface. the ith request is to be served completely before service of the (i+l)st request begins. in an earlier paper the authors showed that the nearer server (NS) policy is optimal among all server selection policies in the sense that it minimizes the equilibrium expected angular distance E(D) which a server moves to process z request. in the present paper we obtain for all n the integral equation satisfied by the equilibrium measure for the angular distance @ between servers under the NS policy. the equation is solved numerically. We also show that E (D)+E (a) = n, and use this to compute E (D). © 1985, Taylor & Francis Group, LLC. All rights reserved.

Duke Scholars

Author Robert Calderbank Computer Science