Article

Free access

Many-to-one packet routing on grids

Authors:

Yishay Mansour,

Boaz Patt-ShamirAuthors Info & Claims

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

Pages 258 - 267

https://doi.org/10.1145/225058.225136

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice-Hall, Engelwood Cliffs, New Jersey, 1993.

Google Scholar

[2]

F. M. auf der Heide, B. Oesterdiekhoff, and R. Wanka. Strongly adaptive token distribution. In Proceedings of the 20th ICALP, 1993.

Digital Library

Google Scholar

[3]

G. Bilardi and F. Prepaprata. Horizons of par-allel computation. Research Report CS-93-20, Department of Computer Science, Brown Uni-versity, May 1993.

Digital Library

Google Scholar

[4]

Y. Feldman and E. Shapiro. Spatial machines: A more realistic approach to parallel computation. Comm. ACM, 35(10):61-73, 1992.

Digital Library

Google Scholar

[5]

L. R. Ford, Jr. and D. R. Fulkerson. Flows m Networks. Princeton U. Press, 1962.

Google Scholar

[6]

A. V. Goldberg and R. E. Tarjan. A new ap-proach to the maximum flow problem. J. ACM, 35(4):921-940, Oct. 1988.

Digital Library

Google Scholar

[7]

B. Hoppe and E. Tardos. The quickest transship-ment problem. In Proc, of the 6th arm. ACM-SIAM Symposium on Discrete Algorithms, Jan. 1995. To appear.

Digital Library

Google Scholar

[8]

M. Kunde. Concentrated regular data streams on grids: sorting and routing near to the bi-section bound. In 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pages 141-150, Oct. 1991.

Digital Library

Google Scholar

[9]

T. Leighton. Introduction to Parallel Algorithms and Architectures: Morgan-Kaufman, Arrays . Trees Hypercubes. 1991.

Digital Library

Google Scholar

[10]

T. Leighton, B. Maggs, and S. Rae. Univer-sal packet routing algorithms. In 29th Annua~ Sympostum on Foundations of Computer Sci-ence, pages 256-269, White Plains, NY, October 1988.

Google Scholar

[11]

T. Leighton, B. Maggs, and S. Rae. Fast algo-rithms for finding O(congestion+dilation) packet routing schedules. In Proc. 28th Hawaii Interna-tional Conference on System Sciences, Januray 1995. To appear.

Digital Library

Google Scholar

[12]

D. Peleg and E. Upfal. The token distribution problem. SIAM J. Comput., 18, 1!389.

Digital Library

Google Scholar

[13]

S. Rajasekaran and T. Tsantilas. Optimal rout-ing algorithms for mesh-connected processor ar-rays. Algorithmic, 1992(8):21-38, 1992.

Digital Library

Google Scholar

[14]

J. Sibyen. Algorithms for routing on meshes. PhD thesis, Department of Computer Science, Utrecht University, 1992.

Google Scholar

[15]

P. M. Vitanyi. Nonsequential computations and the laws of nature. In Aegian Workshop on Com-puting, pages 108-120, Berlin, 1986. Springer-Verlag (LNCS 227).

Digital Library

Google Scholar

Cited By

View all

Biondi NPernici FBruni MMugnai DBimbo A(2023)CL2R: Compatible Lifelong Learning RepresentationsACM Transactions on Multimedia Computing, Communications, and Applications10.1145/356478618:2s(1-22)Online publication date: 6-Jan-2023
https://dl.acm.org/doi/10.1145/3564786
Erata FYildiz EGoknil AYildirim KSzefer JPiskac RSezgin G(2023)ETAP: Energy-aware Timing Analysis of Intermittent ProgramsACM Transactions on Embedded Computing Systems10.1145/356321622:2(1-31)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1145/3563216
North KZampieri MShardlow M(2023)Lexical Complexity Prediction: An OverviewACM Computing Surveys10.1145/355788555:9(1-42)Online publication date: 31-Jan-2023
https://dl.acm.org/doi/10.1145/3557885
Show More Cited By

Index Terms

Many-to-one packet routing on grids

Recommendations

Better Deterministic Online Packet Routing on Grids
SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures

We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The ...
Adaptive packet routing in a hypercube
C³P: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1

All commercial hypercubes use fixed-path routing for packet switching. However, it has long been known that adaptive routing reduces packet delay by sending packets via less congested areas. Moreover, the hypercube topology contains many alternative, ...
Online packet-routing in grids with bounded buffers
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

We present the first online algorithm with a polylogarithmic competitive ratio for the problem of online routing of packets in unidirectional grids. The goal is to maximize the throughput, i.e., the number of delivered packets. Our online algorithm is ...

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%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
346
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)9

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Biondi NPernici FBruni MMugnai DBimbo A(2023)CL2R: Compatible Lifelong Learning RepresentationsACM Transactions on Multimedia Computing, Communications, and Applications10.1145/356478618:2s(1-22)Online publication date: 6-Jan-2023
https://dl.acm.org/doi/10.1145/3564786
Erata FYildiz EGoknil AYildirim KSzefer JPiskac RSezgin G(2023)ETAP: Energy-aware Timing Analysis of Intermittent ProgramsACM Transactions on Embedded Computing Systems10.1145/356321622:2(1-31)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1145/3563216
North KZampieri MShardlow M(2023)Lexical Complexity Prediction: An OverviewACM Computing Surveys10.1145/355788555:9(1-42)Online publication date: 31-Jan-2023
https://dl.acm.org/doi/10.1145/3557885
Calamai MCrescenzi PMarino A(2022)On Computing the Diameter of (Weighted) Link StreamsACM Journal of Experimental Algorithmics10.1145/356916827(1-28)Online publication date: 13-Dec-2022
https://dl.acm.org/doi/10.1145/3569168
Peis BWiese A(2011)Universal packet routing with arbitrary bandwidths and transit timesProceedings of the 15th international conference on Integer programming and combinatoral optimization10.5555/2018158.2018187(362-375)Online publication date: 15-Jun-2011
https://dl.acm.org/doi/10.5555/2018158.2018187
Peis BWiese A(2011)Universal Packet Routing with Arbitrary Bandwidths and Transit TimesInteger Programming and Combinatoral Optimization10.1007/978-3-642-20807-2_29(362-375)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20807-2_29
Peis BSkutella MWiese A(2010)Packet routing on the gridProceedings of the 9th Latin American conference on Theoretical Informatics10.1007/978-3-642-12200-2_12(120-130)Online publication date: 19-Apr-2010
https://dl.acm.org/doi/10.1007/978-3-642-12200-2_12
Bermond JNisse NReyes PRivano H(2009)Minimum Delay Data Gathering in Radio NetworksProceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks10.1007/978-3-642-04383-3_6(69-82)Online publication date: 29-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-04383-3_6
Revah YSegal M(2008)Improved bounds for data-gathering time in sensor networksComputer Communications10.1016/j.comcom.2008.08.00631:17(4026-4034)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.comcom.2008.08.006
Revah YSegal M(2007)Improved Lower Bounds for Data-Gathering Time in Sensor NetworksProceedings of the Third International Conference on Networking and Services10.1109/ICNS.2007.71Online publication date: 19-Jun-2007
https://dl.acm.org/doi/10.1109/ICNS.2007.71
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

Better Deterministic Online Packet Routing on Grids

Adaptive packet routing in a hypercube

Online packet-routing in grids with bounded buffers

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

Better Deterministic Online Packet Routing on Grids

Adaptive packet routing in a hypercube

Online packet-routing in grids with bounded buffers

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations