A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a r...

Full description

Bibliographic Details

Format:	Book
Language:	English
Published:	Dordrecht [u.a.] Kluwer 1996
Series:	Applied optimization 1
Subjects:	Analyse combinatoire Analyse de réseau (planification) Combinatieleer Graphes, Théorie des Netwerkanalyse Réseaux (mathématiques) Network analysis (Planning) Combinatorial analysis Netzwerkanalyse Kombinatorische Analysis
Summary:	A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses de Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem All the chapters emphasize the combinatorial aspects of network theory
Physical Description:	VII, 212 S. graph. Darst.
ISBN:	0792337778