Encapsulating networks and routing

Author

Zerrouk, B. ; Blin, J.M. ; Greiner, A.

Author_Institution

Inst. Blaise Pascal, Univ. Pierre et Marie Curie, Paris, France

fYear

1994

fDate

26-29 Apr 1994

Firstpage

546

Lastpage

553

Abstract

Presents a new view of routing messages in interconnection networks based on the known compact interval labeling. The authors propose simple algorithms, encapsulating networks and routing, suitable for a large class of topologies. They define a floating rule that unifies the notions of virtual channels and multiple intervals labeling. The introduced approach is applied to some usual structures

Keywords

data structures; database management systems; multiprocessor interconnection networks; network routing; network topology; compact interval labeling; distributed data structure; finite connected graph; interconnection networks; networks; routing; routing messages; routing scheme; virtual channels; Concurrent computing; Data structures; Distributed computing; Labeling; Network topology; Routing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Conference_Location

Cancun

Print_ISBN

0-8186-5602-6

Type

conf

DOI

10.1109/IPPS.1994.288250

Filename

288250

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1831463