Distributed Queuing in Dynamic Networks

@article{Sharma2013DistributedQI,
  title={Distributed Queuing in Dynamic Networks},
  author={Gokarna Sharma and Costas Busch},
  journal={Parallel Process. Lett.},
  year={2013},
  volume={25},
  pages={1550005:1-1550005:17}
}
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… 
View PDF on arXiv
3 Citations
Methods Citations
1

3 Citations

Skueue: A Scalable and Sequentially Consistent Distributed Queue

SKUEUE satisfies sequential consistency in the asynchronous message passing model, and Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.

A Distributed Transactional Memory Protocol for Dynamic Networks

A novel distributed transactional memory protocol called TRAIL using gossip based approach for dynamic networks, which supports safety, fairness and liveness properties on execution of the algorithms.

Time to Change: On Distributed Computing in Dynamic Networks (Keynote)

Questions are asked that might bring author and readers to start to clarify some important research aspects and put some order in a sometimes confusing field, specifically on distributed computing's deterministic aspects.

27 References

Distributed computation in dynamic networks

A worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current round are before they broadcast their messages is considered.

Coordinated consensus in dynamic networks

It is shown that in the absence of a good initial upper bound on the size of the network, eventual consensus is as hard as computing deterministic functions of the input, e.g., the minimum or maximum of inputs to the nodes.

Dynamic Analysis of the Arrow Distributed Protocol

A novel and comprehensive competitive analysis of the arrow protocol is presented, proving that for every spanning tree chosen for execution, the arrow Protocol is-competitive to the optimal queuing protocol.

Self-stabilizing distributed queuing

This paper presents a new self-stabilizing distributed queuing protocol, a simple path-reversal protocol that runs on a spanning tree of the network, and presents a proof that the protocol stabilizes to a stable state irrespective of the (perhaps faulty) initial state, and an analysis of the time until convergence.

On the Complexity of Information Spreading in Dynamic Networks

It is proved that starting from any well-mixed distribution of tokens where each node has each token independently with a constant probability, this algorithm solves the k-gossip problem in O((n + k) log n log k) rounds with high probability over the initial token distribution and the randomness of the protocol.

Lower Bounds on Information Dissemination in Dynamic Networks

It is shown that even if each node only needs to obtain a δ-fraction of all the tokens for some δ∈[0,1], Ω(nkδ3/logn) are still required, and if the network is T-interval connected, it is proved that Ω (n+nk/(T2logn)) rounds are needed.

Concurrent counting is harder than queuing

    C. BuschS. Tirthapura
    Mathematics, Computer Science
    Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006

Dynamic networks: models and algorithms

This column surveys some recent work on dynamic network algorithms, focusing on the effect that model parameters such as the type of adversary, the network diameter, and the graph expansion can have on the performance of algorithms.

Competitive concurrent distributed queuing

This paper gives a novel competitive analysis of the Arrow distributed queuing protocol under concurrent access, employing a novel greedy characterization of the way the Arrow protocol orders concurrent requests, and yields a new lower bound on the quality of the nearest-neighbor heuristic for the Traveling Salesperson Problem.

An Analysis Framework for Distributed Hierarchical Directories

The analysis framework captures both the time and the distance restrictions in ordering dynamic requests through a notion of time windows, which may be of independent interest, and is the first competitive dynamic analysis for distributed hierarchical directories.