Premium
Routing bandwidth guaranteed paths for traffic engineering in WiMAX mesh networks
Author(s) -
Misra Sudip,
Ghosh Tushar I.,
Obaidat Mohammad S.
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2518
Subject(s) - computer science , computer network , wimax , key (lock) , distributed computing , mesh networking , routing (electronic design automation) , heuristic , bandwidth (computing) , telecommunications , wireless , computer security , artificial intelligence
SUMMARY In this paper, the authors present a novel algorithm for computing bandwidth guaranteed paths for traffic engineering in WiMAX IEEE 802.16 standard based networks using the mesh topology. The underlying algorithm fulfills routing requests ‘on the fly’ without a priori knowledge of future requests. This problem is motivated by the need for efficient handling of traffic and network resource utilization. The key idea behind the solution is the use of heuristic methods to defer routing through certain nodes, which have a higher chance of getting selected because of hop constraints, so that they can be prevented from congestion. Simulation‐based performance evaluation shows that the proposed algorithm performs well in comparison with the selected benchmarks on metrics such as the number of rejected requests and the active links present in the network. Copyright © 2013 John Wiley & Sons, Ltd.