Node-Based Service-Balanced Scheduling for Provably Guaranteed Throughput and Evacuation Time Performance

This paper focuses on the design of <italic>provably efficient online</italic> link scheduling algorithms for multi-hop wireless networks. We consider single-hop traffic and the one-hop interference model. The objective is twofold: 1) <italic>maximizing the throughput</italic> when the flow sources continuously inject packets into the network, and 2) <italic>minimizing the evacuation time</italic> when there are no future packet arrivals. The prior work mostly employs the link-based approach, which leads to throughput-efficient algorithms but often does not guarantee satisfactory evacuation time performance. In this paper, we propose a novel Node-based Service-Balanced (NSB) online scheduling algorithm. NSB aims to give scheduling opportunities to heavily congested nodes in a balanced manner, by maximizing the total weight of the scheduled nodes in each scheduling cycle, where the weight of a node is determined by its workload and whether the node was scheduled in the previous scheduling cycle(s). We rigorously prove that NSB guarantees to achieve an efficiency ratio no worse (or no smaller) than <inline-formula> <tex-math notation="LaTeX">$2/3$</tex-math><alternatives><inline-graphic xlink:href="ji-ieq1-2777828.gif"/> </alternatives></inline-formula> for the throughput and an approximation ratio no worse (or no greater) than <inline-formula><tex-math notation="LaTeX">$3/2$</tex-math><alternatives> <inline-graphic xlink:href="ji-ieq2-2777828.gif"/></alternatives></inline-formula> for the evacuation time. It is remarkable that NSB is both throughput-optimal and evacuation-time-optimal if the underlying network graph is bipartite. Further, we develop a lower-complexity NSB algorithm, called LC-NSB, which provides the same performance guarantees as NSB. Finally, we conduct numerical experiments to elucidate our theoretical results.

[1]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[2]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Ernst W. Mayr,et al.  Node Weighted Matching , 1984, ICALP.

[4]  Ness B. Shroff,et al.  Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model , 2009, IEEE Transactions on Automatic Control.

[5]  Leandros Tassiulas,et al.  MNCM: A Critical Node Matching Approach to Scheduling for Input Buffered Switches With No Speedup , 2009, IEEE/ACM Transactions on Networking.

[6]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[7]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Bo Ji,et al.  Node-based service-balanced scheduling for provably guaranteed throughput and evacuation time performance , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[9]  Richard P. Anstee.  Simplified existence theorems for (g, f)-factors , 1990, Discret. Appl. Math..

[10]  Jeff Kahn,et al.  Asymptotics of the Chromatic Index for Multigraphs , 1996, J. Comb. Theory, Ser. B.

[11]  Michael Stiebitz,et al.  Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture , 2012 .

[12]  Rahul Singh,et al.  Throughput Optimal Decentralized Scheduling of Multihop Networks With End-to-End Deadline Constraints: Unreliable Links , 2016, IEEE Transactions on Automatic Control.

[13]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[14]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[15]  Seth Pettie,et al.  A simple reduction from maximum weight matching to maximum cardinality matching , 2012, Inf. Process. Lett..

[16]  Jie Wu,et al.  Node-based scheduling with provable evacuation time , 2015, 2015 49th Annual Conference on Information Sciences and Systems (CISS).

[17]  Murray Hill,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004 .

[18]  Leandros Tassiulas,et al.  Minimal Evacuation Times and Stability , 2015, IEEE/ACM Transactions on Networking.

[19]  Leandros Tassiulas,et al.  Cut-through switching, pipelining, and scheduling for network evacuation , 1999, TNET.

[20]  Leandros Tassiulas,et al.  Performance measures and scheduling policies in ring networks , 1995, TNET.

[21]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[22]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.

[23]  Telikepalli Kavitha,et al.  Efficient algorithms for maximum weight matchings in general graphs with small edge weights , 2012, SODA.

[24]  Haibo Zhang,et al.  Deadline-constrained transmission scheduling and data evacuation in WirelessHART networks , 2009, 2009 European Control Conference (ECC).

[25]  Lui Sha,et al.  Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound , 2012, Real-Time Systems.

[26]  Richard P. Anstee,et al.  An application of matching theory of edge-colourings , 1996, Discret. Math..

[27]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[28]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[29]  Gagan Gupta.  Delay efficient control policies for wireless networks , 2009 .

[30]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[31]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[32]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[33]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[34]  R. Srikant,et al.  Emulating Round-Robin in Wireless Networks , 2017, MobiHoc.

[35]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[36]  Anja Feldmann,et al.  A methodology for estimating interdomain web traffic demand , 2004, IMC '04.