Deterministic Dominating Set Construction in Networks with Bounded Degree

Friedman, Roy; Kogan, Alex

doi:10.1007/978-3-642-17679-1_6

Cited by 4 publications

(3 citation statements)

References 34 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another example of the supported models is related to the classical dominating set problem. The dominating set algorithm by Friedman and Kogan [5] consists of two phases: symmetry breaking (distance-2 coloring) and optimization (greedy). In the supported model we can solve both phases with a local algorithm-in essence, we can pre-compute a distance-2 coloring of the underlying network G, which provides an appropriate coloring of the subgraph H as well.…”

Section: Symmetry Breakingmentioning

confidence: 99%

Exploiting locality in distributed SDN control

Schmid

Suomela

2013

Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking

171

131

View full text Add to dashboard Cite

Large SDN networks will be partitioned in multiple controller domains; each controller is responsible for one domain, and the controllers of adjacent domains may need to communicate to enforce global policies. This paper studies the implications of the local network view of the controllers. In particular, we establish a connection to the field of local algorithms and distributed computing, and discuss lessons for the design of a distributed control plane. We show that existing local algorithms can be used to develop efficient coordination protocols in which each controller only needs to respond to events that take place in its local neighborhood. However, while existing algorithms can be used, SDN networks also suggest a new approach to the study of locality in distributed computing. We introduce the so-called supported locality model of distributed computing. The new model is more expressive than the classical models that are commonly used in the design and analysis of distributed algorithms, and it is a better match with the features of SDN networks.

show abstract

Section: Symmetry Breakingmentioning

confidence: 99%

Exploiting locality in distributed SDN control

Schmid

Suomela

2013

Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking

171

131

View full text Add to dashboard Cite

show abstract

“…Clustering has been widely studied and adopted in ad hoc networks to reduce communication cost and improve scalability in various networking and application problems. [16][17][18][19] However, making use of cluster hierarchy in dynamic networks is a challenging task. First, hierarchy makes the network architecture more complex, and it will change with the network topology changes.…”

Section: Introductionmentioning

confidence: 99%

“…Clustering has been widely studied and adopted in ad hoc networks to reduce communication cost and improve scalability in various networking and application problems. 16–19…”

Section: Introductionmentioning

confidence: 99%

Cluster-based efficient information dissemination in dynamic networks

Yang

Yong

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Dynamic network is an abstraction of networks with frequent topology changes arising from node mobility or other reasons. In this article, we first propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network models with clusters. (T, L)-HiNet includes several properties defining the stability of cluster hierarchy in a dynamic network, including cluster head set, cluster member set and the connections among them. Based on (T, L)-HiNet, we design several hierarchical information dissemination algorithms for different scenarios of dynamics. Furthermore, we extend the (T, L)-HiNet model and corresponding algorithms in two directions, that is, stability of cluster head set and cluster size. The correctness of our algorithms is proved rigorously, and their performance is evaluated via both numerical analysis and simulations. The results show that compared with the algorithm recently proposed by Kuhn et al., our design can significantly reduce communication cost and also time cost.

show abstract

Efficient Information Dissemination in Dynamic Networks

Yang

Chen

et al. 2013

2013 42nd International Conference on Parallel Processing

View full text Add to dashboard Cite

Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, distributed computation problems can be formally studied with rigorous correctness. Information dissemination is one of such problems and it has received much attention recently. However, existing works focus on the time cost of dissemination, i.e. how fast the information can be disseminated to all nodes, and communication cost has been largely ignored. Our work focuses on high communication efficiency in information dissemination with correctness property guaranteed. We achieve this by making use of cluster-based hierarchy. Clustering has been widely studied and used in wireless networks to reduce communication cost. However, to the best of our knowledge, it has never been considered in the study of dynamic networks. In this paper, we firstly propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network model with clusters. (T, L)-HiNet includes several properties defining the dynamics of cluster hierarchy in a dynamic network. Base on (T, L)-HiNet, we design hierarchical information dissemination algorithms for different scenarios of dynamics. The correctness of our algorithms is proved and the performance is analyzed. Compared with the algorithm recently proposed by Kuhn, Lynch and Oshman [7], our design can significantly reduce communication and our objective is fully achieved.

show abstract

Deterministic Dominating Set Construction in Networks with Bounded Degree

Cited by 4 publications

References 34 publications

Exploiting locality in distributed SDN control

Exploiting locality in distributed SDN control

Cluster-based efficient information dissemination in dynamic networks

Efficient Information Dissemination in Dynamic Networks

Contact Info

Product

Resources

About