Abstract
We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its computational complexity is prohibitively high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near-optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.
Similar content being viewed by others
Notes
While the one-hop interference model is indeed a mathematical simplification of wireless interference in reality, it has been used as a reasonable approximation to Bluetooth or FH-CDMA networks [11]. It may also be used to model half-duplex communication.
We remark that while a properly chosen Lyapunov function would suffice to show stability, finding such a function may be difficult.
References
Birand, B., Chudnovsky, M., Ries, B., Seymour, P., Zussman, G., Zwols, Y.: Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. IEEE/ACM Trans. Netw. 20(1), 163–176 (2012)
Brzezinski, A., Zussman, G., Modiano, E.: Local pooling conditions for joint routing and scheduling. In: Proceedings of Information Theory and Applications Workshop (ITA), pp. 499–506, San Diego (2008)
Bui, L.X., Srikant, R., Stolyar, A.: A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm. IEEE/ACM Trans. Netw. 19(6), 1597–1609 (2011)
Chen, H., Yao, D.D.: Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization, Stochastic Modelling and Applied Probability, vol. 46. Springer, New York (2001)
Chung, K.L.: A Course in Probability Theory, 3rd edn. Academic Press, San Diego (2001)
Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5(1), 49–77 (1995)
Dai, J.G., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proceedings of IEEE International Conference on Computer and Communication (INFOCOM), 2: 556–564, Tel Aviv, Israel (2000)
Dimakis, A., Walrand, J.: Sufficient conditions for stability of longest queue first scheduling: second-order properties using fluid limits. Adv. Appl. Probab. 38(2), 505–521 (2006)
Hellings, T., Borst, S.C., van Leeuwaarden, J.S.: Tandem queueing networks with neighbor blocking and back-offs. Queueing Syst. 68(3–4), 321–331 (2011)
Joo, C., Lin, X., Shroff, N.B.: Greedy maximal matching: performance limits for arbitrary network graphs under the node-exclusive interference model. IEEE Trans. Autom. Control 54(12), 2734–2744 (2009)
Joo, C., Lin, X., Shroff, N.B.: Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks. IEEE/ACM Trans. Netw. 17(4), 1132–1145 (2009)
Kang, X., Jaramillo, J.J., Ying, L.: Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference. In: Proceedings of IEEE Conference on Decision and Control (CDC), pp. 3312–3317, Florence, Italy (2013)
Leconte, M., Ni, J., Srikant, R.: Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks. IEEE/ACM Trans. Netw. 19(3), 709–720 (2011)
Maguluri, S., Hajek, B., Srikant, R.: The stability of longest-queue-first scheduling with variable packet sizes. IEEE Trans. Autom. Control 59(8), 2295–2300 (2014)
Ni, J., Tan, B., Srikant, R.: Q-CSMA: queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. IEEE/ACM Trans. Netw. 20(3), 825–836 (2012)
Royden, H.L., Fitzpatrick, P.M.: Real Analysis, 4th edn. Prentice Hall, New Jersey (2010)
Shah, D., Wischik, D.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. 22(1), 70–127 (2012)
Stolyar, A.L.: Large number of queues in tandem: scaling properties under back-pressure algorithm. Queueing Syst. 67(2), 111–126 (2011)
Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37(12), 1936–1948 (1992)
Tassiulas, L., Ephremides, A.: Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models. Ann. Oper. Res. 48(4), 333–355 (1994)
Acknowledgments
We thank Sanjay Shakkottai, R. Srikant, and Alexander L. Stolyar for many useful comments. This work was supported in part by the National Science Foundation (NSF) under Grants CNS-1264012 and CNS-1262329, and in part by the Defense Threat Reduction Agency (DTRA) under Grant HDTRA1-13-1-0030
Author information
Authors and Affiliations
Corresponding author
Additional information
An earlier version of the paper appeared in IEEE CDC 2013 [12].
Appendix
Appendix
1.1 Proof of Lemma 1
We first notice that if \(\bar{Z}\in B\), then there are no adjacent dominating nodes; i.e., if \(\bar{Z}\in B_i\) for some \(i\in \{1, 2, \dots , N\}\), then \(\bar{Z}\notin B_{i-1}\) and \(\bar{Z}\notin B_{i+1}\). Let the dominating set at time \(t\) be
Then we can easily check that \(I_{\text {dom}}(t)\subseteq \bigcap \text {LQF}(\bar{Z}(t))\); i.e., all dominating links must be scheduled by LQF at time \(t\). Due to the one-hop interference, there is no internal arrival to a scheduled link. Then for regular time \(t\) and any \(i\in I_{\text {dom}}(t)\),
and
while
Thus,
and
Let \(\bar{Z}_{\max } = \max _j\bar{Z}_j(0)\). We now present two propositions to complete the proof of Lemma 1.
Proposition 4
There exists \(t_1\in (t_0, t_0+\bar{Z}_{\max }/(1-\alpha _i)]\) such that \(\bar{Z}(t_1)\notin B_i\); i.e., link \(l_i\) is not dominating any more at some time before \(t_0+\bar{Z}_{\max }/(1-\alpha _i)\).
Proof
Indeed, if link \(l_i\) remains dominating up to (and including) time \(t_0+\bar{Z}_{\max }/(1-\alpha _i)\), then by (17), (18) and the absolute continuity of the fluids, we would have for any adjacent link \(l_j\) of \(l_i\),
Hence
Then by continuity, there is some \(t_1\in (t_0, t_0+\bar{Z}_{\max }/(1-\alpha _i)]\) such that \(\bar{Z}_i(t_1)-\bar{Z}_j(t_1) = 0\), which contradicts our assumption that link \(l_i\) remains dominating up to \(t_0+\bar{Z}_{\max }/(1-\alpha _i)\). This completes the proof of the proposition. \(\square \)
Therefore, for any \(i\in I_{\text {dom}}(t_0)\), there exists \(t_1\in (t_0, t_0+\bar{Z}_{\max }/(1-\max _j\alpha _j)]\) such that \(\bar{Z}(t_1)\notin B_i\).
Proposition 5
If \(\bar{Z}(t_1)\notin B_i\), then \(\bar{Z}(t)\notin B_i\) for any \(t \ge t_1\).
Proof
Indeed, if \(\bar{Z}(t_2)\in B_i\) for some \(t_2 > t_1\), let \(t_3 = \sup \{t < t_2\mid \bar{Z}(t)\notin B_i\}\). Then by Lipschitz continuity \(\bar{Z}_i(t_3) = \bar{Z}_j(t_3)\) for some neighbor \(l_j\) of link \(l_i\) and \(t_3 < t_2\). Since \(\frac{\mathrm d}{\mathrm dt}(\bar{Z}_i(t)-\bar{Z}_j(t)) \le \max _k\alpha _k-1\) for almost all \(t\in [t_3, t_2]\), we have
which contradicts the assumption that \(\bar{Z}(t_2)\in B_i\). Hence, \(\bar{Z}(t)\notin B_i\) for any \(t\ge t_1\). \(\square \)
Considering all \(i\), we have \(\bar{Z}(t)\notin B\) for any \(t\ge t_0+\bar{Z}_{\max }/(1-\max _j\alpha _j)\).
1.2 Proof of Proposition 2
To show this proposition by contradiction, we suppose \(J(t) = \emptyset \).
We first notice that for \(j_1 = \min \{j\mid j\in J_0(t)\}\) we must have \(\frac{\mathrm d}{\mathrm dt}\bar{W}_{j_1}(t) > 0\). If this is not the case, we would have \(\frac{\mathrm d}{\mathrm dt}\bar{W}_{j_1}(t) < 0\) and \(j_1 \ge 2\). Then it would follow that there exists some \(\delta > 0\) such that for any \(s\in (t, t+\delta )\) we have \(\bar{Z}_1(s) > \bar{Z}_2(s)\) if \(j_1 = 2\), and \(\bar{Z}_{j_1-1}(s) > \max \{\bar{Z}_{j_1-2}(s), \bar{Z}_{j_1}(s)\}\) if \(j_1 > 2\), which implies \(\bar{Z}(s) \in B\), a contradiction.
We then conclude that if all \(j\in \{1, 2, \dots , k\}\cap J_0(t)\) satisfy
then either \(k+1\notin J_0(t)\) or
If this is not the case, there would exist \(\delta > 0\) such that for any \(s\in (t, t+\delta )\), we have \(\bar{Z}_k(s) > \max \{\bar{Z}_{k-1}(s), \bar{Z}_{k+1}(s)\}\) if \(\bar{W}_k(t) \ge 0\), or \(\bar{Z}_j(s) > \max \{\bar{Z}_{j-1}(s), \bar{Z}_{j+1}(s)\}\) for some \(j < k\) otherwise, either of which leads to a contradiction.
By induction we have \(\frac{\mathrm d}{\mathrm dt}\bar{W}_j(t) > 0\) for all \(j\in J_0(t)\), which also leads to contradiction since by letting \(j_2 = \max \{j\mid j\in J_0(t)\}\) there exists \(\delta > 0\) such that for any \(s\in (t, t+\delta )\) we have \(\bar{Z}_N(s) > \bar{Z}_{N-1}(s)\) if \(j_2 = N\), and \(\bar{Z}_{j_2}(s) > \max \{\bar{Z}_{j_2-1}(s), \bar{Z}_{j_2+1}(s)\}\) if \(j_2 \ne N\). Then \(\bar{Z}(s)\in B\), which is a contradiction. This completes the proof of Proposition 2.
1.3 Proof of Proposition 3
Note that \(u \ge 2\). By the definition of \(u, \bar{W}_u(t_1) = \frac{\mathrm d}{\mathrm dt}\bar{W}_u(t_1) = 0\), i.e., \(\bar{Z}_u(t_1) = \bar{Z}_{u-1}(t_1)\) and \(\frac{\mathrm d}{\mathrm dt}\bar{Z}_u(t_1) = \frac{\mathrm d}{\mathrm dt}\bar{Z}_{u-1}(t_1)\).
We first claim that there exists \(\delta > 0\) such that for any \(t\in (t_1, t_1+\delta )\),
Indeed, if \(J_0(t_1)\cap \{1, 2, \dots , u-1\} = \emptyset \), then \(\bar{W}_i(t_1)\ne 0\) for \(i = 1, 2, \dots , u-1\). Otherwise for any \(j\in J_0(t_1)\cap \{1, 2, \dots , u-1\}\), by the definitions of \(u\) and \(J_0(\cdot )\), we have \(\bar{W}_j(t_1) = 0\) and \(\frac{\mathrm d}{\mathrm dt}\bar{W}_j(t_1) \ne 0\), so there exists \(\delta _j > 0\) such that \(\bar{W}_j(t) \ne 0\) for any \(t\in (t_1, t_1+\delta _j)\). In either case, there exists \(\delta > 0\) such that \(\bar{W}_i(t)\ne 0\) for any \(t\in (t_1, t_1+\delta )\) and any \(i\in \{1, 2, \dots , u-1\}\). If \(\bar{W}_i(t) < 0\) for some \(i\in \{1, 2, \dots , u-1\}\) and some \(t\in (t_1, t_1+\delta )\), then \(\bar{Z}_j(t) > \max \{\bar{Z}_{j-1}(t), \bar{Z}_{j+1}(t)\}\) for some \(j\le i\), which contradicts Lemma 1. Hence \(\bar{W}_i(t) > 0\) for \(i = 1, 2, \dots , u-1\); i.e., \(0 < \bar{Z}_1(t) < \bar{Z}_2(t) < \dots < \bar{Z}_{u-1}(t)\). The claim then follows.
In the actual system with this strict order of queues, either all odd links up to \(l_u\) get scheduled at a time slot, or all even links up to \(l_u\) get scheduled. Then in our fluid limits we would have
for any regular time \(t\in (t_1, t_1+\delta )\). Then by the absolute continuity,
By the definition of derivatives, we have
So \(\mu _1(t_1) = \mu _3(t_1)\). Similarly, we have \(\mu _i(t_1) = \mu _{i+2}(t_1)\) for \(i = 1, 2, \dots , u-2\).
Rights and permissions
About this article
Cite this article
Kang, X., Jaramillo, J.J. & Ying, L. Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference. Queueing Syst 80, 273–291 (2015). https://doi.org/10.1007/s11134-015-9441-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-015-9441-2
Keywords
- Queueing networks
- Stability
- Longest-queue-first scheduling
- Linear networks
- Fluid limit
- Throughput optimality
- Multihop traffic