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

Heydarian, Mohsen

doi:10.1007/s11227-011-0723-0

Cited by 7 publications

(6 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two well-known network topologies including MIRA and ANSNET are used to compare different routing algorithms. The MIRA topology has been used in numerous studies such as [ 13 , 31 ] and the ANSNET topology has been accepted by studies such as [ 13 , 15 ]. MIRA topology consists of 15 nodes and 28 links, as shown in Fig.…”

Section: Resultsmentioning

confidence: 99%

“…The pairs of ingress - egress routers for the request of establishing an LSP are randomly selected. Furthermore, let all routed paths not be broken until the end of the simulation, so all LSPs are long-lived [ 13 ].…”

Section: Resultsmentioning

confidence: 99%

“…Let P be the number of ingress - egress pairs, N the number of nodes, and L be the number of network links. Accordingly, the time complexity of the proposed routing algorithm is as follows: The time complexity of the fuzzy system in FDBGR is O (| M | × | K | 2 ) according to [ 13 ], in which M is the number of rules and K is the number of fuzzy samples. Since the number of rules is limited, the complexity of the fuzzy system can be considered as O (| K | 2 ).…”

Section: Resultsmentioning

confidence: 99%

“…So far, various QoS-based routing algorithms have been proposed, regardless of their context and technology [ 14 , 22 , 27 , 33 ]. A high performance optimal dynamic routing algorithm with QoS guarantee has been developed in [ 13 ] for communication networks. They developed an Optimal Dynamic Unicast Multichannel QoS Routing algorithm (ODUMR) based on Constrained Based Routing (CBR) and label switching technology.…”

Section: Literature Reviewmentioning

confidence: 99%

See 3 more Smart Citations

A fuzzy delay-bandwidth guaranteed routing algorithm for video conferencing services over SDN networks

Gong

Rezaeipanah²

2023

Multimed Tools Appl

View full text Add to dashboard Cite

Video conferencing is one of the advanced technologies for users that allows online communication despite long distances. High quality communication and ongoing support for the principles of video conferencing service that can be achieved through Software-Defined Networking (SDN). SDN is a new architecture for computer networks that separates the control plane from the data plane to improve network resources and reduce operating costs. All routing decisions and control mechanisms are made by a device called a controller. Traffic engineering can be well implemented in SDN because the entire network topology is known to the controller. Considering SDN features, user requests can be dynamically routed according to current network status and Quality of Service (QoS) requirements. In general, the purpose of SDN routing algorithms is to maximize the acceptance rate of user requests by considering QoS requirements. In this literature, most routing studies to provide satisfactory video conferencing services have focused solely on bandwidth. Nevertheless, some studies have considered both delay and bandwidth constraints. In this paper, a Fuzzy Delay-Bandwidth Guaranteed Routing (FDBGR) algorithm is proposed that considers both delay and bandwidth constraints in routing. The proposed fuzzy system is based on rules that can postpone requests with high resource demands. Also, the purpose of the FDBGR is to distribute the network workload evenly for all requests, where this is done by maintaining the capacity to accept future requests. The combination of conventional routing algorithms and SDN provides remarkable improvements in mobility, scalability and the overall performance of the networks. Simulations are performed on different scenarios to evaluate the performance of the FDBGR compared to state-of-the-art methods. Besides, FDBGR has been compared with a number of most related previous works such as H-MCOP, MH-MCOP, QoMRA, QROUTE and REDO based on criteria such as number of accepted requests, average path length, energy consumption, load balancing, and average delay. The simulation results clearly prove the superiority of the proposed algorithm with an average delay of 48 ms in different topologies for video conferencing applications.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

A fuzzy delay-bandwidth guaranteed routing algorithm for video conferencing services over SDN networks

Gong

Rezaeipanah²

2023

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…The main purpose of using OSPF protocol is done where this protocol divide the domain of the network into two levels of areas where the root presents a level which is connected with the rest areas in the second level (El-Sayed et al, 2006). OSPF protocol is a dynamic protocol that gives the network more stability and compatibility (Heydarian, 2012).…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of EIGRP via OSPF Based on OPNET and GNS3

Al-Hadidi¹,

Al-Gawagzeh²,

Al-Zubi³

et al. 2014

RJASET

View full text Add to dashboard Cite

In this study we present a simulation based comparative performance analysis between OSPF and EIGRP for real time applications by using Optimized Network Engineering Tools (OPNET) and Graphical Network Simulator (GNS3). In order to evaluate OSPF and EIGRP's performance, we have designed three network models where the first, second and third Network model are configured, respectively with OSPF, EIGRP and combination of EIGRP and OSPF. This study shows the estimation of proposed routing protocols based on the quantitative metrics such as Convergence Time, Throughput, End to End delay, Jitter and Packet Loss through the simulated network models. The evaluation results show that EIGRP routing protocol provides a better performance than OSPF routing protocol for real time applications.

show abstract

Dynamic distributed unicast routing: optimal incremental paths

Heydarian

2013

J Supercomput

View full text Add to dashboard Cite

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

Cited by 7 publications

References 36 publications

A fuzzy delay-bandwidth guaranteed routing algorithm for video conferencing services over SDN networks

A fuzzy delay-bandwidth guaranteed routing algorithm for video conferencing services over SDN networks

Performance Analysis of EIGRP via OSPF Based on OPNET and GNS3

Dynamic distributed unicast routing: optimal incremental paths

Contact Info

Product

Resources

About