Article

Free access

A quantitative approach to dynamic networks

Authors:

Baruch Awerbuch,

Oded Godlreich,

Amir HerzbergAuthors Info & Claims

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

Pages 189 - 203

https://doi.org/10.1145/93385.93419

Published: 01 August 1990 Publication History

PDF eReader

References

[1]

Yehuda Afek, Baruch Awerbuch, and Eli Gafili. Applying static network protocols to dynamic networks, in 28th Annual Symposium on Foundations of Computer Science, IEEE, October 1987.

Digital Library

Google Scholar

[2]

Yehuda Afek and Eli Gafni. Bootstrap network resynchronization: an efficient technique for end-to-end communication. October 1989. Manuscript.

Google Scholar

[3]

Yehuda Afek and Eli Gafni. End-to-end communication in unreliable networks. In Proceedings of lhe 7th Annual A CM Symposium on Principles of Distribuled Computing, Toronto, Ontario, Canada, pages 131-148, ACM SIGACT and SIGOPS, ACM, 1988.

Digital Library

Google Scholar

[4]

Yehuda Afek, Eli Gafni, and Adi Rosen. Slide - a technique for communication in unreliable networks. January 1990. Extended Abstract.

Google Scholar

[5]

IIagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on the time to reach agreement in the presence of tinting uncertainty. 1990. In preparation.

Google Scholar

[6]

IIagit Attiya and Nancy Lynch. Time bounds for real-time process control in the presence of tinting uncertainty. In Procecdings of the l Oth IEEE Real-Time Systems Symposium, pages 268-284, December 1989. Expanded version in MIT/LCS/TM-403.

Google Scholar

[7]

Barueh Awerbueh, Israel Cidon, and Shay Kutten. Communication-optimal maintenance of dynamic trees. January 1990. Manuscript.

Google Scholar

[8]

Baruch Awerbuch and Shimon Even. Reliable broadcast protocols in unreliable networks. Networks, 16(4):381-396, Winter 1986.

Crossref

Google Scholar

[9]

Baruch Awerbuch, Oded Goldreich, and Amir tlerzberg. A Quantitative Approach to Dynamic Networks (version without global time). Technical Report 624, Computer Science Dept., Technion, May 1989.

Google Scholar

[10]

Baruch Awerbuch and Yishay Mansour. Efficient topology update algorithms. 1988. Manuscript.

Google Scholar

[11]

Baruch Awerbuch, Yishay Mansour, and Nir Shavit. Polynomial end-to-end communication. In Proc. of the 30th IEEE Symp. on Foundations of Computer Science, pages 358-363, October 1989.

Digital Library

Google Scholar

[12]

Baruch Awerbuch and Adrian Segall. A reliable broadcast protocol. 1EEE Trans. Comm., COM-31:896-901, July 1983.

Google Scholar

[13]

A. E. Baratz, d. P. Gray, P. E. Green :It., J. M. Jaffe, and D. P. Pozefsky. SNA networks of small systems. IEEE Trans. on Selected Areas iu Comm., SAC-3(3):416-426, May 1985.

Google Scholar

[14]

Alan E. Baratz, Inder Gopal, and Adrian Sega|l. Fau}t tolerant queries in computer networks. In J. van Leeuwen, editor, Distributed Algorithms: Second International Workshop, Springer-Verlag, 1988. Lecure notes in computer science number 312.

Digital Library

Google Scholar

[15]

Alan E. Baratz and Adrian Segall. Reliable link initialization procedures. IEEE Trans. on Communication, COM-36:144-152, February 1988.

Crossref

Google Scholar

[16]

K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on full duplex transmission over half duplex links. Comm. of A CM, 12(5):260, May 1969.

Digital Library

Google Scholar

[17]

S. G. Finn. Resynch procedures and a failsafe network protocol. IEEE Tran. Comm., COM- 27(6):840-846, June 1979.

Google Scholar

[18]

Robert G. Gallager. A shortest path routing algorithm with automatic resynch. March 1976. Manuscript.

Google Scholar

[19]

Oded Goldreich, Amir Herzberg, and Yishay Mansour. Source to destination communication in the presence of faults. In Proceedings of the Eighlh Annual A CM Symposium on Principles of Distributed Computing (PODC), pages 85- 102, August 1989.

Digital Library

Google Scholar

[20]

Amir Iterzberg. Network management in the presence of faults, in Ninth International Conference on Computers and Communication (ICCC), October 1988.

Google Scholar

[21]

Amir Herzberg and Shay Kutten. Efficient detection of message forwarding faults, ill Proceedings of the Eighth Annual A GM Symposium on Principles of Distributed Computing (PODC), pages 339-353, August 1989.

Digital Library

Google Scholar

[22]

Pierre A. tlumblet and Stuart R. Soloway. Topology broadcast algorithms. Computer Networks and ISDN Systems, 179-186, 1989.

Digital Library

Google Scholar

[23]

Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Comm. A CM, 21(7):558-565, July 1978.

Digital Library

Google Scholar

[24]

John M. McQuillan, Ira Richer, and Eric C. Rosen. The new routing algorithm for the ARPANET. IEEE Trans. Comm., 28(5):711- 719, hlay 1980.

Crossref

Google Scholar

[25]

Mike Merritt, F. Modugno, and Mark Tutlle. Time constrained automata. November 1988. Manuscript.

Google Scholar

[26]

Radia Pcrlman. Fault tolerant broadcast of routing information. Computer Networks, December 1983.

Google Scholar

[27]

Eric C. Rosen. Vulnerabilities of network control protocols: an example. Computer Communications Review, July 1981.

Digital Library

Google Scholar

[28]

Adrian Segall. Distributed network protocols. 1EEE Trans, Iufo. Theory, IT-29(I):23-35, January 1983.

Google Scholar

[29]

John M. Spinelli and Robert G. Gallager. Broadcasting topology information in computer networks. IEEE Trans. Comm., COM- 37(5):468-474, May 1989.

Crossref

Google Scholar

[30]

A. Tannenbaum. Computer Networks. Prentice Hall, 1981.

Digital Library

Google Scholar

[31]

H. Zimmerman. OSI reference model- the ISO model of architecture for open systems interconnection. IEEE Trans. Comm., 28:425-432, 1980.

Crossref

Google Scholar

Cited By

View all

Cheng ZLi ZSun BZhang SShao Y(2020)Reputation-based Q-Routing for Robust Inter-committee Routing in the Sharding-based Blockchain2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049(230-236)Online publication date: Aug-2020
https://doi.org/10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049
Goenka SDuan SZhang H(2018)A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)10.1109/NCA.2018.8548163(1-10)Online publication date: Nov-2018
https://doi.org/10.1109/NCA.2018.8548163
Awerbuch BCidon IKutten S(2008)Optimal maintenance of a spanning treeJournal of the ACM10.1145/1391289.139129255:4(1-45)Online publication date: 18-Sep-2008
https://dl.acm.org/doi/10.1145/1391289.1391292
Show More Cited By

Index Terms

A quantitative approach to dynamic networks

Recommendations

A hybrid approach for quantitative assessment of construction projects risks: The case study of poor quality concrete
Highlights
- A new fuzzy-based approach is presented for quantitative assessment of project risks.
Abstract
This research presents a new fuzzy-based approach for quantitative assessment of construction projects risks. Using the proposed approach, the risk is decomposed into internal and external root causes prompting it and the probability ...
Centrality metric for dynamic networks
MLG '10: Proceedings of the Eighth Workshop on Mining and Learning with Graphs

Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many different centrality measures exist, most of them apply to static ...
Dynamic networks are as fast as static networks
SFCS '88: Proceedings of the 29th Annual Symposium on Foundations of Computer Science

An efficient simulation is given to show that dynamic networks are as fast as static ones up to a constant multiplicative factor. That is, any task can be performed in a dynamic asynchronous network essentially as fast as in a static synchronous ...

Comments

Information & Contributors

Information

Published In

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

August 1990

411 pages

ISBN:089791404X

DOI:10.1145/93385

Chairman:
Cynthia Dwork
Univ. of Montreal, Quebec, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC90

Sponsor:

PODC90: 9th Annual ACM Symposium in Principles of Distibuted Computing

August 22 - 24, 1990

Quebec, Quebec City, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
424
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)12

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheng ZLi ZSun BZhang SShao Y(2020)Reputation-based Q-Routing for Robust Inter-committee Routing in the Sharding-based Blockchain2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049(230-236)Online publication date: Aug-2020
https://doi.org/10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049
Goenka SDuan SZhang H(2018)A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)10.1109/NCA.2018.8548163(1-10)Online publication date: Nov-2018
https://doi.org/10.1109/NCA.2018.8548163
Awerbuch BCidon IKutten S(2008)Optimal maintenance of a spanning treeJournal of the ACM10.1145/1391289.139129255:4(1-45)Online publication date: 18-Sep-2008
https://dl.acm.org/doi/10.1145/1391289.1391292
Elkin MGupta IWattenhofer R(2007)A near-optimal distributed fully dynamic algorithm for maintaining sparse spannersProceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing10.1145/1281100.1281128(185-194)Online publication date: 12-Aug-2007
https://dl.acm.org/doi/10.1145/1281100.1281128
Fraigniaud PGavoille C(2006)Header-size lower bounds for end-to-end communication in memoryless networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2005.09.02550:10(1630-1638)Online publication date: 14-Jul-2006
https://dl.acm.org/doi/10.1016/j.comnet.2005.09.025
Basu ACharron-Bost BToueg S(2005)Simulating reliable links with unreliable links in the presence of process crashesDistributed Algorithms10.1007/3-540-61769-8_8(105-122)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61769-8_8
Dolev SWelch J(2005)Crash resilient communication in dynamic networksDistributed Algorithms10.1007/3-540-57271-6_32(129-144)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_32
Fraigniaud PGavoille C(2003)Lower Bounds for Oblivious Single-Packet End-to-End CommunicationDistributed Computing10.1007/978-3-540-39989-6_15(211-223)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39989-6_15
Sterbenz JKrishnan RHain RJackson ALevin DRamanathan RZao JMaughan DVaidya N(2002)Survivable mobile wireless networksProceedings of the 1st ACM workshop on Wireless security10.1145/570681.570685(31-40)Online publication date: 28-Sep-2002
https://dl.acm.org/doi/10.1145/570681.570685
Adler MFich FCoan BWelch J(1999)The complexity of end-to-end communication in memoryless networksProceedings of the eighteenth annual ACM symposium on Principles of distributed computing10.1145/301308.301364(239-248)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301308.301364
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A hybrid approach for quantitative assessment of construction projects risks: The case study of poor quality concrete

Centrality metric for dynamic networks

Dynamic networks are as fast as static networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A hybrid approach for quantitative assessment of construction projects risks: The case study of poor quality concrete

Centrality metric for dynamic networks

Dynamic networks are as fast as static networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations