Optimal many-to-one routing on the mesh with constant queues
In: Information processing letters, Jg. 96 (2005), Heft 1, S. 24-29
academicJournal
- print, 5 ref
Zugriff:
We present randomized and deterministic algorithms for many-to-one packet routing on an n-node two-dimensional mesh under the store-and-forward model. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of l (resp., k) packets, for arbitrary values of l and k. All our algorithms run in optimal O(√lkn) time and use queues of only constant size at each node to store packets in transit. The randomized algorithms, however, are simpler to implement. Our result closes a gap in the literature, where time-optimal algorithms using constant-size queues were known only for the special cases l = 1 and k=l = k.
Titel: |
Optimal many-to-one routing on the mesh with constant queues
|
---|---|
Autor/in / Beteiligte Person: | PIETRACAPRINA, Andrea ; PUCCI, Geppino |
Link: | |
Zeitschrift: | Information processing letters, Jg. 96 (2005), Heft 1, S. 24-29 |
Veröffentlichung: | Amsterdam: Elsevier Science, 2005 |
Medientyp: | academicJournal |
Umfang: | print, 5 ref |
ISSN: | 0020-0190 (print) |
Schlagwort: |
|
Sonstiges: |
|