Network Design: Algorithms and Examples

Abstract

This article addresses the issues in data network design. We discuss graph models for network, issues in topology design and optimization, link and node capacity assignment, path search algorithms, and network flow assignments. The network can support point‐to‐point packet‐switched or connection‐oriented circuit‐switched or virtual circuit‐switched connections. We also address performance issues such as blocking probability, throughput, and delay and how to account for them in the design of a network. The issue of fault tolerance in network design is also examined. The design is explained using a context of wavelength division multiplexed (WDM) fiber‐optic network.