scholarly journals Optimal Traffic Engineering in Link State Routing Protocols

2013 ◽  
Vol 68 (18) ◽  
pp. 35-37
Author(s):  
R. S.Dayama ◽  
S. P. Pingat
Author(s):  
Unung Verawardina

In a dynamic routing setting a routing protocol is required to perform the settings to find the shortest and best path. Routing protocols are of two types: vector distance and link state. Use of EIGRP routing that includes long-range vectors and link state OSPF Link link state coverage, peg well to be implemented in complex network because it can adapt well. In this research is the method used for routing and speed of time available EIGRP routing and OSPF routing through simulator GNS3 and wireshark application, then analyze the difference of peformance with speed of routing table and speed of time. While for Quality of Service (QoS) compare network service quality from EIGRP and OSPF routing which include delay, packet loss, and throughput. Based on the results of the research shows the EIGRP routing table is better in the selection path, EIGRP smaller time tansfer data then its data transfer faster than the OSPF. Overall Quality Of Service (Qos) delay, packetloss and throughput on EIGRP and OSPF are well balanced and good.


Author(s):  
Raad Alturki ◽  
Rashid Mehmood

The HCPR scheme is implemented as an extension to the OPNET simulation software and is analysed in detail for its QoS performance to deliver multimedia applications over ad hoc networks. It is compared with three well-known and widely used routing protocols: Ad Hoc On Demand Distance Vector (AODV), Optimised Link State Routing (OLSR), and Geographic Routing Protocol (GRP). Several networking scenarios have been carefully configured with variations in networks sizes, applications, codecs, and routing protocols to extensively analyse the proposed scheme. The HCPR enabled ad hoc network outperforms the well-known routing schemes, in particular for relatively large networks and high QoS network loads. These results are promising because many QoS schemes do work for small networks and low network loads but are unable to sustain performance for large networks and high QoS loads. Several directions to extend this research for future work are given.


2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li

We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.


Author(s):  
Gimer Cervera ◽  
Michel Barbeau ◽  
Joaquin Garcia-Alfaro ◽  
Evangelos Kranakis
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document