Geometric Capacity Provisioning for Wavelength-Switched WDM Networks

Abstract

In this chapter, we use an asymptotic analysis similar to the spherepacking argument in the proof of Shannon’s channel capacity theorem to derive optimal provisioning requirements for networks with both static and dynamic provisioning. We consider an N-user shared-link model whereWs wavelengths are statically assigned to each user, and a common pool ofWd wavelengths are available to all users.We derive the minimumvalues ofWs andWd required to achieve asymptotically non-blocking performance as the number of users N becomes large. We also show that it is always optimal to statically provision at least enough wavelengths to support the mean of the traffic.