A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

Abstract

Dynamic routing protocols play an important role in today's networks. In communication networks, in a current data transmission session, failing nodes and links is a destructor event which loses packets immediately and it can also waste network resources and services seriously. Sometimes failing nodes can disconnect data transmission and, therefore, lost packets must be retransmitted by new session. In this situation, the routing algorithm must discard failed nodes and must repair paths of session by rerouting them. In this case, static routing algorithms and some existing dynamic routing algorithms cannot manage faulty paths fairly and network efficiency is seriously declined. The capability to compensate for topology changes is the most important advantage dynamic routing offers over static routing. An efficient dynamic routing algorithm tries to reroute and change faulty paths without disconnecting sessions and keeps packet transmission in a desirable rate. It is important to tell that a dynamic routing algorithm should provide multi essential parameters, such as acceptable delay, jitter, bandwidth, multichannel paths, virtual channel connections, label switching technology, optimal resource allocation, optimal efficiency in the case of multimedia, and real time applications. This paper proposes a new dynamic framework which transforms static routing algorithms to dynamic routing algorithms. Using the new dynamic framework, this paper constructs an Optimal Dynamic Unicast Multichannel QoS Routing (ODUMR) algorithm based on the Constrained Based Routing (CBR) and Label Switching Technology which is called as ODUMR Algorithm. The performance of ODUMR is analyzed by network simulator tools such as OpNet, MATLAB, and WinQSB. ODUMR produces results better than the existing static and dynamic routing algorithms in terms of necessary parameters.