column

Dynamic networks: models and algorithms

Authors:

Fabian Kuhn,

Rotem OshmanAuthors Info & Claims

ACM SIGACT News, Volume 42, Issue 1

Pages 82 - 96

https://doi.org/10.1145/1959045.1959064

Published: 21 March 2011 Publication History

Get Access

References

[1]

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. In Proc. of 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 290--299, 2004.

Digital Library

Google Scholar

[2]

J. Aspnes and E. Ruppert. An introduction to population protocols. In B. Garbinato, H. Miranda, and L. Rodrigues, editors, Middleware for Network Eccentric and Mobile Applications, pages 97--120. Springer-Verlag, 2009.

Crossref

Google Scholar

[3]

C. Avin, M. Koucký, and Z. Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Proc. of 35th Coll. on Automata, Languages and Programming (ICALP), pages 121--132, 2008.

Digital Library

Google Scholar

[4]

R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Computer and System Sciences, 45(1):104--126, 1992.

Digital Library

Google Scholar

[5]

H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), pages 260--269, 2009.

Digital Library

Google Scholar

[6]

C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2:257--269, 2003.

Digital Library

Google Scholar

[7]

B. Bollobás. The diameter of random graphs. Trans. of the American Mathematical Society, 267(1):41--52, 1981.

Crossref

Google Scholar

[8]

E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine resilient random membership sampling. Computer Networks, 53(13):2340--2359, 2009.

Digital Library

Google Scholar

[9]

C. Busch and S. Tirthapura. Analysis of link reversal routing algorithms. SIAM J. on Computing, 35:305--326, 2005.

Digital Library

Google Scholar

[10]

T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing, 2(5):483--502, 2002.

Crossref

Google Scholar

[11]

A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-Markovian dynamic graphs. In Proc. of 27th ACM Symp. on Principles of Distributed Computing (PODC), pages 213--222, 2008.

Digital Library

Google Scholar

[12]

A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. Journal of Computer and System Sciences, 75(4):213--230, 2009.

Digital Library

Google Scholar

[13]

A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. of Parallel and Distribited Computing, 64(1):89--96, 2004.

Digital Library

Google Scholar

[14]

A. Clementi, A. Monti, and R. Silvestri. Fast flooding over Manhattan. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 375--383, 2010.

Digital Library

Google Scholar

[15]

A. Clementi, F. Pasquale, A. Monti, and R. Silvestri. Information spreading in stationary Markovian evolving graphs. In Proc. of IEEE Symp. on Parallel & Distributed Processing (IPDPS), 2009.

Digital Library

Google Scholar

[16]

S. Dolev. Self-stabilization. MIT Press, Cambridge, MA, USA, 2000.

Digital Library

Google Scholar

[17]

A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network Magazine, 18(5):24--29, 2004.

Digital Library

Google Scholar

[18]

A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627--640, 2009.

Digital Library

Google Scholar

[19]

E. M. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 29:11--18, 1981.

Crossref

Google Scholar

[20]

A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. SCAMP: Peer-to-peer lightweight membership service for large-scale group communication. Networked Group Communication, pages 44--55, 2001.

Digital Library

Google Scholar

[21]

P. Grindrod and D. J. Higham. Evolving graphs: dynamical models, inverse problems and propagation. Proc. of the Royal Society A: Mathematical, Physical and Engineering Sciences, 466(2115):753--770, 2009.

Google Scholar

[22]

M. Gurevich and I. Keidar. Correctness of gossip-based membership under message loss. SIAM J. of Computing, 39(8):3830--3859, 2010.

Digital Library

Google Scholar

[23]

S. Janson, T. ?uczak, and A. Rucinski. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.

Crossref

Google Scholar

[24]

D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, chapter 5, pages 153--181. Kluwer Academic, 1996.

Crossref

Google Scholar

[25]

R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. Proc. of 41st Symp. on Foundations of Computer Science (FOCS), pages 565--574, 2000.

Digital Library

Google Scholar

[26]

F. Kuhn, C. Lenzen, T. Locher, and R. Oshman. Optimal gradient clock synchronization in dynamic networks. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 430--439, 2010.

Digital Library

Google Scholar

[27]

F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa. Broadcasting in unreliable radio networks. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 336--345, 2010.

Digital Library

Google Scholar

[28]

F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. of 42nd Symp. on Theory of Computing (STOC), pages 513--522, 2010.

Digital Library

Google Scholar

[29]

F. Kuhn, S. Schmid, and R. Wattenhofer. A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In Proc. of 4th Int. Workshop on Peer-To-Peer Systems (IPTPS), 2005.

Digital Library

Google Scholar

[30]

J.-Y. Le Boudec and M. Vojnovic. The random trip model: Stability, stationarity regime, and perfect simulation. IEEE/ACM Transactions on Networking, 16(6):1153--1166, 2006.

Digital Library

Google Scholar

[31]

C. Lenzen, T. Locher, and R. Wattenhofer. Tight bounds for clock synchronization. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), pages 46--55, 2009.

Digital Library

Google Scholar

[32]

X. Li, J. Misra, and C. G. Plaxton. Maintaining the ranch topology. J. of Parallel and Distributed Computing, 70(11):1142--1158, 2010.

Digital Library

Google Scholar

[33]

P. Mahlmann and C. Schindelhauer. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proc. of 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 155--164, 2005.

Digital Library

Google Scholar

[34]

R. O'Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. of Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104--110, 2005.

Digital Library

Google Scholar

[35]

C. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. of 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 311--320, 1997.

Digital Library

Google Scholar

[36]

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001.

Digital Library

Google Scholar

[37]

J. E.Walter, J. L.Welch, and N. H. Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 7:585--600, 2001.

Digital Library

Google Scholar

Cited By

View all

Oh SRandall DRicha A(2025)Adaptive collective responses to local stimuli in anonymous dynamic networksTheoretical Computer Science10.1016/j.tcs.2024.1149041024(114904)Online publication date: Jan-2025
https://doi.org/10.1016/j.tcs.2024.114904
Jain ASahni S(2024)Polynomial Time Algorithm for Shortest Paths in Interval Temporal GraphsAlgorithms10.3390/a1710046817:10(468)Online publication date: 21-Oct-2024
https://doi.org/10.3390/a17100468
Nowak TSchmid UWinkler K(2024)Topological Characterization of Consensus in Distributed SystemsJournal of the ACM10.1145/368730271:6(1-48)Online publication date: 22-Aug-2024
https://dl.acm.org/doi/10.1145/3687302
Show More Cited By

Index Terms

Dynamic networks: models and algorithms

Recommendations

Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks
Abstract
In this paper, we propose a scheme that dynamically adjusts the slow start threshold (ssthresh) of TCP. The ssthresh estimation is used to set an appropriate ssthresh. A good ssthresh would improve the transmission performance of TCP. For the ...
Dynamic Multicast Routing for Mobile Networks
ICCNMC '03: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing

Multicast is a mechanism widely used in the Internet to disseminate information. Multicast delivery paths may need to be frequently restructured along with host migrations. But all existing multicast routing proposals implicitly assume static hosts when ...
Dynamic autoconfiguration in 4G networks: problem statement and preliminary solution
DIN '05: Proceedings of the 1st ACM workshop on Dynamic interconnection of networks

The Internet is characterized by the coexistence of two Internet Protocol (IP) versions and multiple autoconfiguration mechanisms which are deployed targeting specific communication scenarios. This heterogeneity requires user pre-configurations, namely ...

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 42, Issue 1

March 2011

123 pages

ISSN:0163-5700

DOI:10.1145/1959045

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Published in SIGACT Volume 42, Issue 1

Check for updates

Qualifiers

Column

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

171
Total Citations
View Citations
3,020
Total Downloads

Downloads (Last 12 months)156
Downloads (Last 6 weeks)20

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Oh SRandall DRicha A(2025)Adaptive collective responses to local stimuli in anonymous dynamic networksTheoretical Computer Science10.1016/j.tcs.2024.1149041024(114904)Online publication date: Jan-2025
https://doi.org/10.1016/j.tcs.2024.114904
Jain ASahni S(2024)Polynomial Time Algorithm for Shortest Paths in Interval Temporal GraphsAlgorithms10.3390/a1710046817:10(468)Online publication date: 21-Oct-2024
https://doi.org/10.3390/a17100468
Nowak TSchmid UWinkler K(2024)Topological Characterization of Consensus in Distributed SystemsJournal of the ACM10.1145/368730271:6(1-48)Online publication date: 22-Aug-2024
https://dl.acm.org/doi/10.1145/3687302
Jain ASahni S(2024)Shortest Paths In Interval Temporal GraphsProceedings of the 2024 Sixteenth International Conference on Contemporary Computing10.1145/3675888.3678103(282-288)Online publication date: 8-Aug-2024
https://dl.acm.org/doi/10.1145/3675888.3678103
Dinitz MFineman JGilbert SNewport C(2024)Smoothed Analysis of Information Spreading in Dynamic NetworksJournal of the ACM10.1145/366183171:3(1-24)Online publication date: 11-Jun-2024
https://dl.acm.org/doi/10.1145/3661831
Zhang QTseng L(2024)Fault-tolerant Consensus in Anonymous Dynamic Network2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00021(128-138)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00021
Castañeda Avan Ditmarsch HRosenblueth DVelázquez D(2024)Pattern Models: A Dynamic Epistemic Logic For Distributed SystemsThe Computer Journal10.1093/comjnl/bxae01667:7(2421-2440)Online publication date: 17-Feb-2024
https://doi.org/10.1093/comjnl/bxae016
Goubault ÉKniazev RLedent JRajsbaum S(2024)Simplicial models for the epistemic logic of faulty agentsBoletín de la Sociedad Matemática Mexicana10.1007/s40590-024-00656-x30:3Online publication date: 9-Sep-2024
https://doi.org/10.1007/s40590-024-00656-x
Jahja IYu H(2024)Sublinear Algorithms in T-Interval Dynamic NetworksAlgorithmica10.1007/s00453-024-01250-386:9(2959-2996)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s00453-024-01250-3
Winkler KPaz AGaleana HSchmid SSchmid U(2024)The Time Complexity of Consensus Under Oblivious Message AdversariesAlgorithmica10.1007/s00453-024-01209-486:6(1830-1861)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1007/s00453-024-01209-4
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks

Dynamic Multicast Routing for Mobile Networks

Dynamic autoconfiguration in 4G networks: problem statement and preliminary solution

Comments

Published In

Publisher

Publication History

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

References

Cited By

Index Terms

Recommendations

Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks

Dynamic Multicast Routing for Mobile Networks

Dynamic autoconfiguration in 4G networks: problem statement and preliminary solution

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations