TY - JOUR
T1 - QoS-aware ant-based route, wavelength and timeslot assignment algorithm for optical burst switched networks
AU - Coulibaly, Yahaya
AU - Rouskas, George
AU - Abd Latiff, Muhammad Shafie
AU - Razzaque, M. A.
AU - Mandala, Satria
PY - 2015/11/1
Y1 - 2015/11/1
N2 - All-optical networks are the aspiration of bandwidth-greedy applications providers and users such as telecom operators and scientific research centres. Because of the limitations of current network infrastructures, some optical switching paradigms have been proposed. Among these paradigms, optical burst switching (OBS) is seen as the most appropriate solution. However, OBS suffers from high burst loss ratio as a result of contention at the buffer-less core node. According to current optical technology reviews, cost effective optical memories are yet to be cost effective. In this paper, an ant-based route, wavelength and timeslot allocation algorithm is proposed to address high burst loss in OBS and improve the overall network performance. The solution was implemented in hierarchical time-sliced OBS and was evaluated through computer simulation where it was compared with shortest path (SP) algorithm. Simulation results show that the proposed algorithm outperforms SP in terms of burst loss ratio and delay.
AB - All-optical networks are the aspiration of bandwidth-greedy applications providers and users such as telecom operators and scientific research centres. Because of the limitations of current network infrastructures, some optical switching paradigms have been proposed. Among these paradigms, optical burst switching (OBS) is seen as the most appropriate solution. However, OBS suffers from high burst loss ratio as a result of contention at the buffer-less core node. According to current optical technology reviews, cost effective optical memories are yet to be cost effective. In this paper, an ant-based route, wavelength and timeslot allocation algorithm is proposed to address high burst loss in OBS and improve the overall network performance. The solution was implemented in hierarchical time-sliced OBS and was evaluated through computer simulation where it was compared with shortest path (SP) algorithm. Simulation results show that the proposed algorithm outperforms SP in terms of burst loss ratio and delay.
UR - http://www.scopus.com/inward/record.url?scp=84944687529&partnerID=8YFLogxK
U2 - 10.1002/ett.2919
DO - 10.1002/ett.2919
M3 - Article
AN - SCOPUS:84944687529
SN - 2161-5748
VL - 26
SP - 1265
EP - 1277
JO - Transactions on Emerging Telecommunications Technologies
JF - Transactions on Emerging Telecommunications Technologies
IS - 11
ER -