Telecommunications Network Design Algorithms

by Aaron Kershenbaum

This book is one of the few devoted entirely to the design of telecommunications networks and the first to deal with the topic in sufficient depth to allow the reader to actually solve network design problems on a realistic scale. It begins by introducing the reader to the representation of networks as graphs and to the fundamentals of the analysis of performance in networks. It then presents the basic data structures and graph algorithms which form the foundation of more complex network design procedures. Next, it discusses the design of centralized networks, introducing actual network design problems in a relatively simple context. Finally, it treats problems in mesh network design, where routing, capacity assignment, and topological optimization interact with one another to create the most challenging problems. Actual design algorithms are included in the text, and a companion diskette includes an implementation of these algorithms in a tutorial shell which allows the reader to use and compare the algorithms.

368 pages, Hardcover

First published January 1, 1993

Reviews

[Smita]

Its a very nice book for network design algorithms.

[Madhavi Indalkar]

good

[Trupti]

Whats this when ever I click on want to read or read option no single page is opened. Directly feedback form is opened... Whats this???

[Anuj Sabale]

dfgdfgasdf

[Datta]

sfaFAFAFGAFASFAFASDV ZXxzCV sDFG GADG DAZGFFGBDADAGBDA

[Quang]

very well

[Snehal]

network algortihms