Rearrangeability conditions for multirate Benes networks

Author

Favalli, Lorenzo

Author_Institution

Dipartimento di Elettronica, Pavia Univ., Italy

fYear

1993

fDate

29 Nov-2 Dec 1993

Firstpage

734

Abstract

New results are provided for the rearrangeability conditions of Benes networks when connections with different bandwidth requirements share the same input link. In the path of a work by R. Melen and J.S. Turner [1989], a coloring algorithm for the connection graph that exploits the topological properties of the Benes network is described and a formal proof of its behaviour is given. The algorithm has been tested with simulations and results from these are used to discuss some limitations intrinsic to the approximations necessarily made in the analytical approach

Keywords

asynchronous transfer mode; graph colouring; network topology; telecommunication network routing; telecommunication traffic; bandwidth requirements; coloring algorithm; connection graph; input link; limitations; multirate Benes networks; rearrangeability conditions; topological properties; Algorithm design and analysis; Analytical models; Bandwidth; Multiprocessor interconnection networks; Packet switching; Switches; Switching circuits; Telecommunication traffic; Testing; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE

Conference_Location

Houston, TX

Print_ISBN

0-7803-0917-0

Type

conf

DOI

10.1109/GLOCOM.1993.318168

Filename

318168