In this paper, graph- theoretic models are described that are of use in stu
dies of designs for ATM networks and for optical networks. Although these m
odels share a basic framework, the problems studied, and the parameters und
er concern, are not identical. The differences stem from the constraints im
posed by the two different technologies, and their perspective applications
.
For ATM networks, a short summary of the virtual path layout problem is giv
en, and some results are discussed. A detailed description is given for the
use of duality and high dimensional geometry in deriving and analyzing opt
imal designs for chain and ring networks. Regarding optical networks the wa
velength assignment problem and the ring partition problem are described, t
ogether with few recent results.