A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, 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 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.
Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.

"About this title" may belong to another edition of this title.

Store Description

We have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!

Visit Seller's Storefront

Seller's business information

Miramar International Services LLC

Sale & Shipping Terms

Terms of Sale

www.californiabooks.com

Shipping Terms

www.californiabooks.com

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	3 to 7 business days	2 to 5 business days
First item	US$ 0.00	US$ 12.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.