Distributed Queuing in Dynamic Networks

We consider the problem of forming a distributed queue in the synchronous dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected. Queue requests may arrive over rounds at network nodes and the goal is to eventually enqueue them in a distributed queue. We show that in 1-interval connected graphs, where the communication links change arbitrarily between every round, it is possible to solve the distributed queueing problem in O(nk) rounds using O (logn) size messages, where n is the number of nodes in the network and k≤n is the number of queue requests. Further, we show that for more stable graphs, e.g. T-interval connected graphs where the communication links change in every T≥2 rounds, the distributed queuing problem can be solved in O(n+nkmin{α,T}) rounds using the same O (logn) size messages, where α>0 is the concurrency level parameter that captures the minimum number of active queue requests in the system at any round. These results hold in any arbitrary arrival of queue requests and ensure correctness of the queue formed. To our best knowledge, these are the first solutions to the distributed queuing problem in highly dynamic networks.

[1]  Maurice Herlihy,et al.  Self-stabilizing distributed queuing , 2006 .

[2]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[3]  Gokarna Sharma,et al.  An Analysis Framework for Distributed Hierarchical Directories , 2013, ICDCN.

[4]  Gokarna Sharma,et al.  Towards Load Balanced Distributed Transactional Memory , 2012, Euro-Par.

[5]  Roger Wattenhofer,et al.  An Inherent Bottleneck in Distributed Counting , 1998, J. Parallel Distributed Comput..

[6]  Maurice Herlihy,et al.  Dynamic Analysis of the Arrow Distributed Protocol , 2006, Theory of Computing Systems.

[7]  Srikanta Tirthapura,et al.  Concurrent counting is harder than queuing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[8]  David R. Karger,et al.  Faster information dissemination in dynamic networks via network coding , 2011, PODC '11.

[9]  Maurice Herlihy,et al.  Competitive concurrent distributed queuing , 2001, PODC '01.

[10]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[11]  Gokarna Sharma,et al.  Distributed Transactional Memory for General Networks , 2012, IPDPS.

[12]  Maurice Herlihy,et al.  The Arrow Distributed Directory Protocol , 1998, DISC.

[13]  Mohamed Naimi,et al.  A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal , 1996, J. Parallel Distributed Comput..

[14]  Fabian Kuhn,et al.  Lower Bounds on Information Dissemination in Dynamic Networks , 2012, DISC.

[15]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[16]  Yoram Moses,et al.  Coordinated consensus in dynamic networks , 2011, PODC '11.

[17]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[19]  Binoy Ravindran,et al.  Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory , 2009, OPODIS.

[20]  Hagit Attiya,et al.  A Provably Starvation-Free Distributed Directory Protocol , 2010, SSS.

[21]  Ye Sun,et al.  Distributed transactional memory for metric-space networks , 2005, Distributed Computing.

[22]  Roger Wattenhofer,et al.  Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.

[23]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[24]  Gokarna Sharma,et al.  Distributed Queuing in Dynamic Networks , 2013, FOMC.

[25]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[26]  Emanuele Viola,et al.  On the Complexity of Information Spreading in Dynamic Networks , 2013, SODA.