Traffic classification and service in wavelength routed all-optical networks
Wavelength routed all-optical networks require that continuous wavelengths be established from source to destination nodes if no wavelength converters exist in the network. The requests to establish these lightpaths can be blocked, depending on the availability of the wavelengths. It has been discovered that lightpaths of longer length suffer higher blocking probability than those of shorter lightpaths, which is known as the Fairness Problem. The Traffic Classification and Service (ClaServ) Method is introduced to optimize the Fairness Problem as well as reduce the traffic blocking probability. Simulation results for a 4×4 Mesh-Torus network and a NSFNET topology show that the ClaServ method can greatly reduce the blocking probability for average network traffic requests.
|Keywords||All optical network, Blocking probability, ClaServ, DWDM, Fairness, Hierarchy, Waveband|
|Conference||2003 International Conference on Communications (ICC 2003)|
Li, Y. (Yunhao), Francisco, M.J. (Mark Joseph), Lambadaris, I, & Huang, C. (2003). Traffic classification and service in wavelength routed all-optical networks. Presented at the 2003 International Conference on Communications (ICC 2003).