TY  - JOUR
AU  - Deepalakshmi, R. 
AU  - Rajaram, S. 
PY  - 2014
TI  - EFFECTIVE HEURISTIC ALGORITHM FOR DYNAMIC ROUTING AND BANDWIDTH MANAGEMENT UNDER QUALITY OF SERVICE CONSTRAINTS IN MULTISTAGE INTERCONNECTION NETWORKS
JF  - American Journal of Applied Sciences
VL  - 11
IS  - 3
DO  - 10.3844/ajassp.2014.414.424
UR  - https://thescipub.com/abstract/ajassp.2014.414.424
AB  - Today, Internet of Things (IoT) has introduced abundant bandwidth consumption and necessities in multimedia communications from online games to video-conferencing applications with the constraint of QoS requirements from time to time. The expected rapid proliferation of services would require performance unprecedented in the currently available best-effort routing algorithms. In, particular, the present routing mechanisms are based on the best-effort paradigm are unlikely to provide satisfactory end-to-end performance for services required in the real time applications. Thus, there is a definite need for architectures and algorithms that provide bandwidth guaranteed and QoS guarantees beyond those of the currently available ones. The proposed routing algorithm addressed the problem by computing low cost trees with delay bounded within the model wherein the bandwidth can be reserved and guaranteed once reserved on various links of the network there by providing QoS guarantees. This novel tree-pruning algorithm aids the bandwidth measurement tools by applying heuristic approach and the effectiveness of the algorithm is determined by two factors (i) the end-to-end delay (ii) the cost of routing. The new data structure significantly improves the running time complexity by O (log k) for routing procedures under a variety of QoS constraints and checking tree routing runs in O(m+n2).