Energy-Efficient Traffic Scheduling in IP over WDM Networks

In this paper, we investigate the energy efficiency that can be achieved by using traffic scheduling in IP over WDM networks. A mixed integer linear programming model is developed to optimize routing and scheduling in dynamically arriving demands, where part of the demands can be allocated within a sliding window. The results show that scheduling improves the energy efficiency of non-bypass IP/WDM networks, with traffic grooming by up to 25% and blocking is reduced by 30%

Wavelength and time division multiplexing with lightpath trespassing for all-optical star local area networks

Many medium access control protocols have been proposed for optical wavelength division multiplexing local area networks with a star topology. These protocols range from those based on the concept of fixed-assignment of communication subchannels, such as TDMA (Time Division Multiple Access); reservation of communication subchannels, such as DAS (Dynamic Allocation Scheme); or random-access to communication subchannels, such as DT-WDMA (Dynamic Time-Wavelength Division Multiple Access). In addition various hybrid protocols have been considered, for example, protocols incorporating both fixed-assignment and reservation rules, such as HTDM (Hybrid TDM). This thesis is on a novel hybrid protocol of fixed-assignment and random-access called "WTDMA with lightpath trespassing". This protocol combines the most desirable aspects of fixed-assignment and random-access protocols, while limiting their drawbacks. The performance of different versions of the protocol are analysed both mathematically and by stochastic simulation. The obtained results justify the introduction of the WTDMA with trespassing protocol, and indicate the situations where its use is advantageous

Resource allocation and scalability in dynamic wavelength-routed optical networks.

This thesis investigates the potential benefits of dynamic operation of wavelength-routed optical networks (WRONs) compared to the static approach. It is widely believed that dynamic operation of WRONs would overcome the inefficiencies of the static allocation in improving resource use. By rapidly allocating resources only when and where required, dynamic networks could potentially provide the same service that static networks but at decreased cost, very attractive to network operators. This hypothesis, however, has not been verified. It is therefore the focus of this thesis to investigate whether dynamic operation of WRONs can save significant number of wavelengths compared to the static approach whilst maintaining acceptable levels of delay and scalability. Firstly, the wavelength-routed optical-burst-switching (WR-OBS) network architecture is selected as the dynamic architecture to be studied, due to its feasibility of implementation and its improved network performance. Then, the wavelength requirements of dynamic WR-OBS are evaluated by means of novel analysis and simulation and compared to that of static networks for uniform and non-uniform traffic demand. It is shown that dynamic WR-OBS saves wavelengths with respect to the static approach only at low loads and especially for sparsely connected networks and that wavelength conversion is a key capability to significantly increase the benefits of dynamic operation. The mean delay introduced by dynamic operation of WR-OBS is then assessed. The results show that the extra delay is not significant as to violate end-to-end limits of time-sensitive applications. Finally, the limiting scalability of WR-OBS as a function of the lightpath allocation algorithm computational complexity is studied. The trade-off between the request processing time and blocking probability is investigated and a new low-blocking and scalable lightpath allocation algorithm which improves the mentioned trade-off is proposed. The presented algorithms and results can be used in the analysis and design of dynamic WRONs