Cluster-Based Back-Pressure Routing Algorithm

The back-pressure algorithm introduced in 1992 by Tassiulas and Ephremides is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue-length information of neighboring nodes to make routing decisions. Packets are adaptively routed in the network according to congestion information, which makes the algorithm resilient to traffic and topology changes. However, the back-pressure algorithm requires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back-pressure routing algorithm that retains the adaptability of back-pressure routing while significantly reducing the number of queues that have to be maintained at each node.

[1]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[2]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[3]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[4]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[5]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[6]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[8]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[9]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[10]  R. Srikant,et al.  Joint congestion control, routing, and MAC for stability and fairness in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[11]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[12]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[13]  Donald F. Towsley,et al.  Optimal routing with multiple traffic matrices tradeoff between average and worst case performance , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[14]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  L. Tassiulas,et al.  Throughput properties of a queueing network with distributed dynamic routing and flow control , 1996, Advances in Applied Probability.

[17]  Ness B. Shroff,et al.  On the stability region of congestion control , 2004 .

[18]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[19]  Yung Yi,et al.  Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

[20]  Srikanth Kandula,et al.  Dynamic load balancing without packet reordering , 2007, CCRV.

[21]  R. Srikant,et al.  Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.

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

[23]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[24]  Nick Feamster,et al.  Guidelines for interdomain traffic engineering , 2003, CCRV.

[25]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[26]  Eytan Modiano,et al.  Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[27]  E. Yeh,et al.  Throughput Optimal Distributed Control of Stochastic Wireless Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[28]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[29]  R. Srikant,et al.  Overlay TCP for MultiPath Routing and Congestion Control ∗ , 2004 .