Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/215399.215433acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article
Free access

Space-efficient routing in vertex-symmetric networks (extended abstract)

Published: 20 July 1995 Publication History
First page of PDF

References

[1]
B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Improved Routing Strategies with Succinct Tables. Journal of Algorithms 11, pp. 307-341, 1990.
[2]
V. Braune. Theoret#sche und ezperimentelle Analyse yon Intervall-Routing-Algorithmen. Muster Thesis, Department of Mathematics and Computer Science, University of Paderborn, 1993.
[3]
M. Flammini, G. Gambosi, S. Salomone. Boolean Routing. In Proc. 7th Int. Workshop on Dzstmbuted Algomthms (WDAG 93), LNCS 725, Springer Verlag, pp. 219-233, 1993.
[4]
G.N. Frederickson and R. Janardan. Designing Networks with Compact Routing Tables. Algorithmzca 3, pp. 171-190, 1988.
[5]
G.N. Frederickson and R. Janardan. Space- Efficient Message Routing in c-Decomposable Networks. SIAM Journal of Computin9 19/1, pp. 164-181, 1990
[6]
F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays. Trees Hypercubes. Morgan Kaufmann Publishers (San Mateo, CA, 1992)
[7]
A. Lubotzky, R. Phillips, R. Sarnak. Ramanujan Graphs. Comb#natorica 8/3, pp. 261-277, 1988.
[8]
F.T. Leighton, B.M. Maggs, A.G. Ranade, S.B. Rao. Randomized routing and sorting on fixed-connection networks. Journal of Algo. rithms 17, pp. 157-205, 1994.
[9]
G.A. Margulis. Explicit Group Theoretical Constructions of Combinatorial Schemes and their Application to the Design of Expanders and Superconcentrators. Problems Inform. Transmission 11, pp. 39-46, 1988.
[10]
M. Morgenstern. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. Journal of Comb. Theory, Series B 62, pp. 44-62, 1994.
[11]
F. Meyer auf der Heide and B. V5cking. A Packet Routing Protocol for Arbitrary Networks. In 12th Syrup. on Theoretzcal Aspects of Computer Science (STACS 95), pp. 291-302, 1995.
[12]
D. Peleg and E. Upfal. A Tradeoff between Size amd Efficiency for Routing Tables. Journal of the A CM 36, pp.510-530, 1989.
[13]
A.G. Ranade. How to Emulate Shared Memory. Journal of Computer and System Sciences 42, pp. 307-326, 1991.
[14]
J.P. Schmidt, A. Siegel. The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM Journal of Computing 19/5, pp. 775- 786, 1990.
[15]
J.P. Schmidt, A. Siegel, A. Srinivasan. Chernoff-Hoeffding Bounds for Applications with Limited Independence. In Proc. 4th Syrup. on Discrete Algorithms (SODA 93), pp. 331-340, 1993.
[16]
L.G. Valiant. A Scheme for Fast Parallel Communication. SIAM Journal of Computing 11/2, pp. 350-361, 1982.

Cited By

View all
  • (1998)Packet Routing in Fixed-Connection NetworksJournal of Parallel and Distributed Computing10.1006/jpdc.1998.148354:2(77-132)Online publication date: 1-Nov-1998
  • (1996)Deterministic routing with bounded buffers: turning offline into online protocolsProceedings of 37th Conference on Foundations of Computer Science10.1109/SFCS.1996.548496(370-379)Online publication date: 1996

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SPAA '95: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
July 1995
320 pages
ISBN:0897917170
DOI:10.1145/215399
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 1995

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

7SPAA95
Sponsor:

Acceptance Rates

SPAA '95 Paper Acceptance Rate 31 of 101 submissions, 31%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)24
  • Downloads (Last 6 weeks)3
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (1998)Packet Routing in Fixed-Connection NetworksJournal of Parallel and Distributed Computing10.1006/jpdc.1998.148354:2(77-132)Online publication date: 1-Nov-1998
  • (1996)Deterministic routing with bounded buffers: turning offline into online protocolsProceedings of 37th Conference on Foundations of Computer Science10.1109/SFCS.1996.548496(370-379)Online publication date: 1996

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media