Oblivious Routing Algorithm under Hose Model for WDM Mesh Network

Author

Zhang, Xiaoning ; Li, Lemin ; Wang, Sheng

Author_Institution

Key Lab. of Broadband Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu

Volume

3

fYear

2006

fDate

25-28 June 2006

Firstpage

1908

Lastpage

1912

Abstract

In this paper, we introduce a novel oblivious routing scheme based on valiant load-balancing for the model of polyhedral uncertainty (i.e., hose model), and the scheme is implemented with traffic-grooming approach in WDM mesh networks. Considering that a high-speed connection request in optical networks is difficult to be divided into low-speed connections, we propose the method of hose-model separation to support the multi-granularity connections for valiant load-balanced oblivious routing in WDM mesh networks. Our Objective is to minimize total network cost. Two fast heuristic algorithms-MPCF and MRUF are proposed. Simulation results show MRUF performs better than MPCF

Keywords

optical fibre networks; resource allocation; telecommunication network routing; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; MPCF; MRUF; WDM mesh network; heuristic algorithm; hose-model; maximizing resource utilization first; minimizing path cost first; oblivious routing scheme; optical network; traffic-grooming approach; valiant load-balancing; wavelength division multiplexing; Hoses; Load modeling; Mesh networks; Optical fiber networks; Routing; Telecommunication traffic; Traffic control; Uncertainty; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems Proceedings, 2006 International Conference on

Conference_Location

Guilin

Print_ISBN

0-7803-9584-0

Electronic_ISBN

0-7803-9585-9

Type

conf

DOI

10.1109/ICCCAS.2006.285046

Filename

4064272