Data networks (2nd ed.)
Data and computer communications (5th ed.)
Data and computer communications (5th ed.)
Data Networks, Routing, Security, and Performance Optimization
Data Networks, Routing, Security, and Performance Optimization
Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
Dynamic Routing in Telecommunications Networks
Dynamic Routing in Telecommunications Networks
Mpls and Label Switching Networks
Mpls and Label Switching Networks
Internet resiliency to attacks and failures under BGP policy routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-constraint QoS routing using a new single mixed metrics
Journal of Network and Computer Applications
Dynamic appointment of ABR for the OSPF routing protocol
Computer Communications
MPLS over ATM and IP over ATM methods for multimedia applications
Computer Standards & Interfaces
Optimal multicast multichannel routing in computer networks
Computer Communications
IP Routing table compaction and sampling schemes to enhance TCAM cache performance
Journal of Systems Architecture: the EUROMICRO Journal
Network fault detection with Wiener filter-based agent
Journal of Network and Computer Applications
A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
Advances in Engineering Software
Implementing and analyzing in Maude the Enhanced Interior Gateway Routing Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Routing Protocols and Concepts, CCNA Exploration Labs and Study Guide
Routing Protocols and Concepts, CCNA Exploration Labs and Study Guide
Research challenges in QoS routing
Computer Communications
Link-state routing without broadcast storming for multichannel mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic distribution for end-to-end QoS routing with multicast multichannel services
The Journal of Supercomputing
Expert Systems with Applications: An International Journal
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
Identifying BGP routing table transfers
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extending next generation network (NGN) architecture for connection-oriented transport
Computer Communications
Cross-layer failure restoration of IP multicast with applications to IPTV
Computer Networks: The International Journal of Computer and Telecommunications Networking
Toward a practical approach for BGP stability with root cause check
Journal of Parallel and Distributed Computing
Future Generation Computer Systems
Intra-domain IP traceback using OSPF
Computer Communications
Dynamic routing at different layers in IP-over-WDM networks - Maximizing energy savings
Optical Switching and Networking
Optimal multichannel data transmission in computer networks
Computer Communications
Computer Communications
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.