全光网中基于跳数的波长分配算法

在有波长连续性限制的情况下,减少波长预留冲突需要在波长预留时尽量使用不同的波长,这使全网的空闲波长数减少,容易导致大跳数光路的连接请求失败。解决波长预留冲突问题的大多数算法都把解决问题的目标设为降低网络阻塞率,无法兼顾网络中大跳数光路的情况。本文提出了用于全光网中基于跳数的波长分配算法,该算法通过建立跳数与波长之间的相互对应关系,对未来可能发生预留冲突的光路及其要预留的波长进行预测,根据预测尽量使用相同波长,增加全网的空闲波长数。在解决波长预留冲突问题的同时,实现支持大跳数光路连接请求的目标。

A hop-count-based wavelength assignment algorithm for all-optical networks

Reducing wavelength reservation confliction requires more using the different wavelengths when wavelengths are reserved under the limit of wavelength continuity. This makes the free wavelengths of whole network decrease and easily causes the connection - request blocking of the big - hop - count light path. More algorithms of resolving the problem of wavelength reservation confliction are mainly for the sake of decreasing blocking rate and neglect the situation of the big- hop - count light path. This paper presents a hop - count - based wavelength assignment （HWA） algorithm for all - optical networks. It predicts if the light path has the possibility of reservation confliction and which wavelength will be reserved by establishing the corresponding relation between the hop count and the wavelengths, more using the same wavelengths according to the prediction so that the flee wavelengths of whole network increase. It not only resolves the problem of wavelength reservation confliction, but also supports the connection request of big - hop - count light path.