On deflection worm routing on meshes

In this paper, we consider the deflection worm routing problem on two dimensional n/spl times/n meshes. Our results include: (i) an off-line algorithm for routing permutations in O(kn) steps, and (ii) a general method to obtain deflection worm routing algorithms from packet routing algorithms.< &...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE First ICA³PP, IEEE First International Conference on Algorithms and Architectures for Parallel Processing, Brisbane, Australia, 19-21 April, 1995 Jg. 1; S. 375 - 378 vol.1
Hauptverfasser: Roberts, A., Symvonis, A.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1995
Schlagworte:
Computer science
Computer worms
Routing
Sorting
Tree graphs
Upper bound
ISBN:9780780320185, 0780320182
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider the deflection worm routing problem on two dimensional n/spl times/n meshes. Our results include: (i) an off-line algorithm for routing permutations in O(kn) steps, and (ii) a general method to obtain deflection worm routing algorithms from packet routing algorithms.< >
ISBN:9780780320185
0780320182
DOI:10.1109/ICAPP.1995.472207