Ordering policy based routing and bandwidth assignment algorithms in optical networks

Today, the Internet traffic is crowded by emerging bandwidth hungry multimedia services. These services required dynamic bandwidth which may be high, low or moderate. For establishing such a connection demand, we propose a novel routing and bandwidth assignment (RBA) algorithm. In order to efficiently utilize the network resources and to reduce the connection blocking probability, we propose various ordering policies based RBA algorithms. For RBA, two constraints, the wavelength continuity and wavelength contiguity constraint must be satisfied, which is different and complex with the traditional routing and wavelength assignment (RWA) technique. In ordering policies based RBA algorithms, the entire set of traffic demands are arranged either by their route length, or bandwidth requirement, or considering both. We performed the extensive simulation experiments in MATLAB environment and compared the proposed policies with the simple RBA algorithm. It is observed from the result that some of the proposed ordering policies outperform the RBA, on the metric of blocking probability, and resource utilization ratio.