A colored Gauss-Seidel approach for the distributed network flow problem

A distributed solution for the minimum cost network flow problem is here proposed. The method uses a block version of the Gauss-Seidel algorithm in order to iteratively solve the dual problem whose structure is such that the Hessian matrix coincides with the Laplacian matrix of the corresponding graph. Thus, the updating rule turns out to be fully distributed. In order to increase the parallelism degree, a graph coloring scheme allows the clustering of nodes that reduces the sequentiality of the Gauss-Seidel technique. Numerical experiments show the effectiveness of the approach compared with methods recently presented in the literature.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[3]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  J. Ortega,et al.  Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  Jizhong Zhu,et al.  Optimization of Power System Operation , 2009 .

[8]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Convex Optimization Over Random Networks , 2011, IEEE Transactions on Automatic Control.

[9]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[10]  Kivanc Dincer,et al.  A Comparison of Parallel Graph Coloring Algorithms , 1995 .

[11]  Guy E. Blelloch,et al.  GraphChi: Large-Scale Graph Computation on Just a PC , 2012, OSDI.

[12]  Charles E. Leiserson,et al.  Ordering heuristics for parallel graph coloring , 2014, SPAA.

[13]  Alejandro Ribeiro,et al.  Accelerated dual descent for constrained convex network flow optimization , 2013, 52nd IEEE Conference on Decision and Control.

[14]  P. Beraldi,et al.  Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem , 2001, Comput. Optim. Appl..

[15]  David G. Green,et al.  Ordered asynchronous processes in multi-agent systems , 2005 .

[16]  Alejandro Ribeiro,et al.  Robust Routing in Wireless Multi-Hop Networks , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[17]  James B. Orlin,et al.  Minimum Convex Cost Dynamic Network Flows , 1984, Math. Oper. Res..

[18]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[19]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[20]  Michael Zarghamy,et al.  Accelerated dual descent for constrained convex network flow optimization , 2013, CDC 2013.

[21]  Geoffrey C. Fox,et al.  A parallel Gauss-Seidel algorithm for sparse power system matrices , 1994, Proceedings of Supercomputing '94.

[22]  Muriel Medard,et al.  A Network Flow Approach in Cloud Computing , 2013, 2013 47th Annual Conference on Information Sciences and Systems (CISS).

[23]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[24]  Alejandro Ribeiro,et al.  Accelerated Dual Descent for Network Flow Optimization , 2014, IEEE Transactions on Automatic Control.

[25]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[26]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.