Distributed Online and Stochastic Queuing on a Multiple Access Channel
We consider the problems of online and stochastic packet queuing in a distributed system of n nodes with queues, where the communication between the nodes is done via a multiple access channel. In each round, an arbitrary number of packets can be injected into the system, each to an arbitrary node’s queue. Two measures of performance are considered: the total number of packets in the system, called the total load, and the maximum queue size, called the maximum load. In the online setting, we develop a deterministic algorithm that is asymptotically optimal with respect to both complexity measures, in a competitive way. More precisely, the total load of our algorithm is bigger then the total load of any other algorithm, including centralized offline solutions, by only O(n 2), while the maximum queue size of our algorithm is at most n times bigger than the maximum queue size of any other algorithm, with an extra additive O(n). The optimality for both measures is justified by proving the corresponding lower bounds. Next, we show that our algorithm is stochastically optimal for any expected injection rate smaller or equal to 1. To the best of our knowledge, this is the first solution to the stochastic queuing problem on a multiple access channel that achieves such optimality for the (highest possible) rate equal to 1.
KeywordsCompetitive Ratio Total Load Online Algorithm Queue Size Multiple Access Channel
Unable to display preview. Download preview PDF.
- 1.Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Deterministic broadcast on multiple access channels. In: INFOCOM, pp. 146–150. IEEE (2010)Google Scholar
- 3.Bar-Noy, A., Freund, A., Landa, S., Naor, J.S.: Competitive on-line switching policies. In: ACM-SIAM SODA, pp. 525–534 (2002)Google Scholar
- 5.Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)Google Scholar
- 7.Chlebus, B.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J.H., Rolim, J.D.P. (eds.) Handbook on Randomized Computing, vol. I, pp. 401–456. Kluwer Academic (2001)Google Scholar
- 9.Chung, K.L., Fuchs, W.: On the distribution of values of sums of random variables. Memoirs of the AMS 6, 1–12 (1951)Google Scholar
- 14.Richa, A.W., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair medium access despite reactive jamming. In: ICDCS, pp. 507–516 (2011)Google Scholar