Article

Free access

Universal continuous routing strategies

Authors:

Christian Scheideler,

Berthold VöckingAuthors Info & Claims

SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures

Pages 142 - 151

https://doi.org/10.1145/237502.237519

Published: 24 June 1996 Publication History

PDF eReader

References

[1]

D AIdous. Ultimate Instability of Exponential Back-Off Protocol for Acknowledgement Based Transformation Control of Random Access Communication Channels. IEEE Transaction on Information Theory 33, pp. 219-223, 1987.

Digital Library

Google Scholar

[2]

R.Y. Awdeh, H.T. Mouftah. Survey of ATM Switch Architectures. in Computer Networks and ISDN Systems, 27, pp 1567-1613, 1995.

Digital Library

Google Scholar

[3]

A. Broder, E. Upfal. Dynamic Deflection Routing Arrays. To appear in Proc. of the 28th A CM Symp. on Theory of Computing, 1996.

Digital Library

Google Scholar

[4]

R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. VScking. Universal Algorithms for Store-and-Forward and Wormhole Routing. To appear in Proc. of the 28th A CM Symp. on Theory of Computing, 1996.

Digital Library

Google Scholar

[5]

W. Dally. Virtual-Channel Flow Control. In Proc. of the 17th Intl. Syrup. on Computer Archztecture, pp. 60-68, 1990.

Digital Library

Google Scholar

[6]

W. Dally, C. Se#tz. Deadlock-Free Message Routing in Multicomputer Networks Using Virtual Channels. IEEE Trans. on Computers 36, pp. 547-553, 1987.

Digital Library

Google Scholar

[7]

R. Greenberg, H.C. Oh. Universal Wormhole Routing. Technical Report, Umversity of Maryland, 1993.

Digital Library

Google Scholar

[8]

J. H~stad, T. Leighton, B. Rogoff. Analysis of Backoff Protocols for Multiple Access Channels. In Proc. of the 19th A CM Syrup. on Theory of Computing, pp. 241-253, 1987.

Digital Library

Google Scholar

[9]

F.P. Kelly. Stochastic Models of Computer Communication Systems. J. Royal Statistic Soc. 47, pp. 379-395, 1985.

Google Scholar

[10]

R. Koch. Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Then a Constant Factor. in Proc. of the 27th Symp. on Foundations of Computer Science, pp. 221-230, 1988.

Digital Library

Google Scholar

[11]

F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.

Digital Library

Google Scholar

[12]

T. Leighton, B. Maggs, A. Ranade, S. l#ao. Randomized Routing and Sorting on Fixed- Connection Networks Journal of Algorithms 17, pp. 157-205, 1994.

Digital Library

Google Scholar

[13]

F. Meyer auf der Heide, B. V5cking. A Packet Routing Protocol for Arbitrary Networks. In Proc. of the 12th Symp. on Theoretical Aspects of Computer Science, pp. 291-302, 1995.

Google Scholar

[14]

J.H. Patel. Performance of Processor-Memory Interconnections for Multlprocessors. In IEEE Trans. Computers, vol. C-30, no. 10, pp. 771- 780, 1981.

Google Scholar

[15]

R. Rehrmann, B. Monien, R. Liiling, R. Diekmann. To appear in 8th Annual A CM Symposzum on Parallel Algorithms and Archzteetures, 1996.

Digital Library

Google Scholar

[16]

P. Raghavan, E. Upfal. Stochastic Contention Resolution With Short Delays. In Proc. of the 27th Symp. on Theory of Computing, 1995.

Digital Library

Google Scholar

[17]

M. Settembre, F. Matera. All Optical Implementations of High Capacity TDMA Networks Fiber and integrated Optics 12, pp 173-186, 1993

Google Scholar

[18]

G.D. Stamoulis, J.N. Tsitsiklis. The Efficiency of Greedy Routing in Hypercubes and Butterflies. In 3rd Annual A CM Symposium on Parallel Algorithms and Architectures, pp. 248-259, 1991.

Digital Library

Google Scholar

[19]

H.H. Theimer, E.P. Rathgeb, M.N. Huber, Performance Analysis of Buffered Banyan Networks. In IEEE Trans. Commumcatwns, vol. 39, no. 2, pp. 269- 277, 1991.

Crossref

Google Scholar

[20]

H. Yoon, K. Lee, M. T. Liu. Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems. In IEEE Trans. Computers, vol. 39, no. 3, pp. 319-327, 1990.

Digital Library

Google Scholar

Cited By

View all

Maggs B(2006)A Survey of Congestion+Dilation Results for Packet Scheduling2006 40th Annual Conference on Information Sciences and Systems10.1109/CISS.2006.286378(1505-1510)Online publication date: Mar-2006
https://doi.org/10.1109/CISS.2006.286378
Upfal E(2005)Stochastic analysis of dynamic processesFundamentals of Computation Theory10.1007/BFb0036173(85-92)Online publication date: 21-Jun-2005
https://doi.org/10.1007/BFb0036173
Sampels M(2005)Large networks with small diameterGraph-Theoretic Concepts in Computer Science10.1007/BFb0024505(288-302)Online publication date: 17-Jun-2005
https://doi.org/10.1007/BFb0024505
Show More Cited By

Index Terms

Universal continuous routing strategies
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
  2. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Universal Routing in Distributed Networks
ICPADS '05: Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02

We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that from a routing perspective the fat-stack is efficient and is suitable for use ...
Universal Design: Lessons for Wearable Computing

The concept of universal design attempts to create products that are as usable as possible by as many people as possible, regardless of age, ability, or situation. These designs more accessible to people with disabilities and more usable and functional ...
Performance comparison of different multicast routing strategies in disruption tolerant networks

Disruption Tolerant Networks (DTNs) technologies are emerging solutions to networks that experience frequent partitions. As a result, multicast design in DTNs is a considerably more difficult problem compared to that in Internet and mobile ad hoc ...

Comments

Information & Contributors

Information

Published In

SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures

June 1996

337 pages

ISBN:0897918096

DOI:10.1145/237502

Chairman:
Guy E. Blelloch
CMU

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: 24 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

8SPAA96

Sponsor:

8SPAA96: 8th Annual ACM Symposium on Parallel

June 24 - 26, 1996

Padua, Italy

Acceptance Rates

SPAA '96 Paper Acceptance Rate 39 of 106 submissions, 37%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
269
Total Downloads

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

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maggs B(2006)A Survey of Congestion+Dilation Results for Packet Scheduling2006 40th Annual Conference on Information Sciences and Systems10.1109/CISS.2006.286378(1505-1510)Online publication date: Mar-2006
https://doi.org/10.1109/CISS.2006.286378
Upfal E(2005)Stochastic analysis of dynamic processesFundamentals of Computation Theory10.1007/BFb0036173(85-92)Online publication date: 21-Jun-2005
https://doi.org/10.1007/BFb0036173
Sampels M(2005)Large networks with small diameterGraph-Theoretic Concepts in Computer Science10.1007/BFb0024505(288-302)Online publication date: 17-Jun-2005
https://doi.org/10.1007/BFb0024505
Döring AObelöer WLustig GMaehle E(2005)A flexible approach for a fault-tolerant routerParallel and Distributed Processing10.1007/3-540-64359-1_736(693-713)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-64359-1_736
Angelov SKhanna SKunal K(2005)The network as a storage deviceProceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques10.1007/11538462_1(1-13)Online publication date: 22-Aug-2005
https://dl.acm.org/doi/10.1007/11538462_1
Grossman J(2004)Analytically Modeling a Fault-Tolerant Messaging ProtocolIEEE Transactions on Computers10.1109/TC.2004.1953:7(870-878)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1109/TC.2004.19
Aiello WOstrovsky RKushilevitz ERosén A(2003)Dynamic routing on networks with fixed-size buffersProceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/644108.644236(771-780)Online publication date: 12-Jan-2003
https://dl.acm.org/doi/10.5555/644108.644236
Westermann MRosenberg AMaggs B(2002)Distributed caching independent of the network sizeProceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures10.1145/564870.564876(31-40)Online publication date: 10-Aug-2002
https://dl.acm.org/doi/10.1145/564870.564876
Adler MBerenbrink PSchröder K(2002)Analyzing an Infinite Parallel Job Allocation ProcessAlgorithms — ESA’ 9810.1007/3-540-68530-8_35(417-428)Online publication date: 15-Mar-2002
https://doi.org/10.1007/3-540-68530-8_35
Upfal E(2002)Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper)Algorithms — ESA’ 9810.1007/3-540-68530-8_2(26-34)Online publication date: 15-Mar-2002
https://doi.org/10.1007/3-540-68530-8_2
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Universal Routing in Distributed Networks

Universal Design: Lessons for Wearable Computing

Performance comparison of different multicast routing strategies in disruption tolerant networks