Article

Free access

Bubbles: adaptive routing scheme for high-speed dynamic networks

Authors:

Shlomi Dolev,

Evangelos Kranakis,

Danny Krizanc,

David PelegAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 528 - 537

https://doi.org/10.1145/225058.225270

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

Y. Afek, E. Gafni, and M. Ricklin. "Upper and lower bounds for routing schemes in dynamic networks,') Proc. 30th Symp. on Foundations of Computer Sczence, pp. 370-375, 1989.

Google Scholar

[2]

B. Awerbuch. "Complexity of network synchro-nization," JACM, 32(4):804-823, 1985.

Digital Library

Google Scholar

[3]

B. Awerbuch, A. Bar-Noy, N. Linial, and D. Pe-leg. "Compact Distributed Data Structure for Adaptive Routing," Proc. .21 th Symp. on The-ory o~ Computing, pp. 479-489, 1989.

Digital Library

Google Scholar

[4]

B. Awerbuch, A. Bar-Noy, N. Linial, and D. Pe-leg. "Improved routing strategies with succinct tables," J. of Algorithms, II :307-341, 1990.

Digital Library

Google Scholar

[5]

B. Awerbuch and D. Peleg. "Routing with poly-nomial communication-space tradeoff," S.L4M J. on Discrete Mathj 5(2) pp. 151-162, 1992.

Digital Library

Google Scholar

[6]

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Saks. "Adapting to asynchronous dynamic net-works, " Proc.,!A/th Symp. on Theory of Com-puttng, pp. 557-570, 1992.

Digital Library

Google Scholar

[7]

I. Cidon and I. Gopal. "PARIS: An approach to private integrated networks," Journal of Ana-log and Digital Cabled Systems 1(2), pp. 77-86, 1988.

Crossref

Google Scholar

[8]

I. Cidon, O. Gerstel and S. Zaks. "A Scalable Approach to Routing in ATM Networks," P~oc, 8th Int. Workshop on Dzstnbuted A!goTithms, 1994.

Digital Library

Google Scholar

[9]

S. Dolev and T. Herman, "SuperStabilizing Protocols for Dynamic Distributed Systems" University of Iowa, Department of Computer Science Technical Report 95-02, 1995.

Google Scholar

[10]

0. Gerstel and S. Zaks. "The Virtual Path Layout Problem in Fast Networks," Proc. 13th ACM Symp. on Principles of Distributed Com-puting, 1994.

Digital Library

Google Scholar

[11]

L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks, " ComputeT Net-WOTkS1, (1977), 155-174.

Google Scholar

[12]

L. Kleinrock and F. Kamoun, "Optimal clus-tering structures for hierarchical topological de-sign of large computer networks, " Netwo?%s10, (1980), 221-248.

Google Scholar

[13]

D. Peleg and E. Upfal. "A tradeoff between size and efficiency for routing tables, " JA GM, 36:510-530, 1989.

Digital Library

Google Scholar

[14]

M. Santoro and R. Khatib. "Labeling and implicit routing in networks," The Computer Journal, 28:5-8, 1985.

Crossref

Google Scholar

[15]

L. G. Valiant. "Universality consideration in VLSI circuits," IEEE Transactions on Comput-eTs, 30, 135-140, 1981.

Digital Library

Google Scholar

[16]

J. van Leeuwen, and R.B. Tan. "Interval Rout-ing," The ComputeT J., 30 (1987), 298-307.

Digital Library

Google Scholar

Cited By

View all

Beauquier JDelaët SDolev STixeuil S(2007)Transient fault detectorsDistributed Computing10.1007/s00446-007-0029-x20:1(39-51)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1007/s00446-007-0029-x
Beauquier JDelaËt SDolev STixeuil S(2006)Transient fault detectorsDistributed Computing10.1007/BFb0056474(62-74)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056474
Gavoille C(2001)Routing in distributed networksACM SIGACT News10.1145/568438.56845132:1(36-52)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1145/568438.568451
Show More Cited By

Index Terms

Bubbles: adaptive routing scheme for high-speed dynamic networks

Recommendations

Bubbles and Information: An Experiment

A symmetric distribution of information, although omnipresent in real markets, is rarely considered in experimental economics. We study whether information about imminent future dividends can abate bubbles in experimental asset markets. We find that ...
Fundamental bubbles in equity markets
Abstract
Using an affine model to compute the price of equities based on a dataset of macroeconomic factors, we propose a measure of equity bubbles. We use a dynamic affine term structure framework to price equity and bonds jointly, and investigate how ...
International comparison of bubbles and bubble indicators

The purpose of this paper is to analyze the financial turmoil of the US subprime loan crisis of mid-Noughties and to compare it with the Japanese asset bubble of late 1980s. While examining the two crises, it compares the monetary policies of both ...

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

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: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
410
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)23

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beauquier JDelaët SDolev STixeuil S(2007)Transient fault detectorsDistributed Computing10.1007/s00446-007-0029-x20:1(39-51)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1007/s00446-007-0029-x
Beauquier JDelaËt SDolev STixeuil S(2006)Transient fault detectorsDistributed Computing10.1007/BFb0056474(62-74)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056474
Gavoille C(2001)Routing in distributed networksACM SIGACT News10.1145/568438.56845132:1(36-52)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1145/568438.568451
Dolev SFitingof BMelkman ATubman O(2001)Smooth and adaptive forward erasure correctingComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/S1389-1286(01)00168-236:2-3(343-355)Online publication date: 1-Jul-2001
https://dl.acm.org/doi/10.1016/S1389-1286%2801%2900168-2
Dolev SKranakis EKrizanc D(1999)Baked-Potato RoutingJournal of Algorithms10.1006/jagm.1998.098130:2(379-399)Online publication date: 1-Feb-1999
https://dl.acm.org/doi/10.1006/jagm.1998.0981
Adler MScheideler CMiller GGibbons P(1998)Efficient communication strategies for ad-hoc wireless networks (extended abstract)Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277692(259-268)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277651.277692
Plaxton CRajaraman RRicha ALeiserson CCuller D(1997)Accessing nearby copies of replicated objects in a distributed environmentProceedings of the ninth annual ACM symposium on Parallel algorithms and architectures10.1145/258492.258523(311-320)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/258492.258523

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

Bubbles and Information: An Experiment

Fundamental bubbles in equity markets

International comparison of bubbles and bubble indicators

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Bubbles and Information: An Experiment

Fundamental bubbles in equity markets

International comparison of bubbles and bubble indicators

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

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