Abstract
A slotted ring that allows simultaneous transmissions of messages by different users is considered. Such a ring network is commonly called ring withspatial reuse. It can achieve significantly higher throughput than standard token rings but it also raises the issue of fairness since some nodes may be prevented from accessing the ring for long time intervals. Policies that operate in cycles and guarantee that a certain number (quota) of packets will be transmitted by every node in every cycle have been considered before to deal with the fairness issue. In this paper we address the problem of designing a policy that results in a stable system whenever the end-to-end arrival rates are within the stability region of the ring with spatial reuse (the stability region of the ring is defined as the set of end-to-end arrival rates for which there is a policy that makes the ring stable). We provide such a policy, which does not require knowledge of end-to-end arrival rates. The policy is an adaptive version of the quota policies and can be implemented with the same distributed mechanism. We use the Lyapunov test function technique together with methods from the theory of regenerative processes to derive our main results.
Similar content being viewed by others
References
S. Asmussen,Applied Probability and Queues (Wiley, New York, 1987).
N. Bambos and A. Nguyen, Optimal message flow on ring network with spatial reuse,Proc. 31st Conf. on Decision and Control, Tucson, AZ, 1992, pp. 2360–2363.
Y.S. Chow and H. Teicher,Probability Theory: Independence, Interchangeability, Martingales (Springer, New York, 1988).
I. Cidon and Y. Ofek, MetaRing — a full-duplex ring with fairness and spatial reuse, IEEE Trans. Commun. 41 (1993) 110–120.
E.G. Coffman Jr., E.N. Gilbert, A.G. Greenberg, F.T. Leighton, P. Robert and A.L. Stolyar, Queues served by a rotating ring, preprint.
R.L. Cruz, A calculus for network delay part II: Network analysis, IEEE Trans. Inf. Theory 37 (1991) 132–141.
R.M. Falconer and J.L. Adams, Orwell: A protocol for an integrated service local network, Br. Telecom Tech. J. 3(4) (1985) 21–35.
L. Georgiadis, R. Guerin and I. Cidon, Throughput properties of fair policies in ring networks, IEEE/ACM Trans. Networking 1 (1993) 718–728.
L. Georgiadis, W. Szpankowski and L. Tassiulas, Stability Analysis of scheduling policies in ring networks with spatial reuse,Proc. 31st Annual Allerton Conf. on Communication, Control and Computing, Urbana Illinois, 1993, pp. 1109–1119.
S.P. Meyn and R.L. Tweedie,Markov Chains and Stochastic Stability (Springer, London, 1993).
L. Tassiulas and L. Georgiadis, Any work-conserving policy stabilizes the ring with spatial reuse, IEEE/ACM Trans. Networking (1995), to appear.
O. Yaron and M. Sidi, Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. Networking 1 (1993) 372–385.
Author information
Authors and Affiliations
Additional information
This research was primarily done while the author was visiting INRIA in Rocquencourt, France. The author wishes to thank INRIA (projects ALGO, MEVAL and REFLECS) for a generous support. Additional support was provided by NSF Grants NCR-9206315 and CCR-9201078 and INT-8912631, and by Grant AFOSR-90-0107, and in part by NATO Grant 0057/89.
The research of this author was supported in part by NSF under Grants NCR-9211417 and NCR-9406415, and by the New York State Center for Advanced Technology in Telecommunications, Polytechnic University.
Rights and permissions
About this article
Cite this article
Georgiadis, L., Szpankowski, W. & Tassiulas, L. A scheduling policy with maximal stability region for ring networks with spatial reuse. Queueing Syst 19, 131–148 (1995). https://doi.org/10.1007/BF01148943
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01148943