BGP - Link State (BGP-LS) Advertisement of IGP Traffic Engineering Performance Metric Extensions

2019 ◽  
Author(s):  
S. Previdi ◽  
Q. Wu ◽  
J. Tantsura ◽  
C. Filsfils
Keyword(s):  
Traffic Engineering ◽  
Link State ◽  
Performance Metric

An Efficient K-Shortest Paths Based Routing Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li
Keyword(s):  
Computer Networks ◽  
Shortest Path ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Link State

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.

scholarly journals Analisis Routing Protocol Is-Is Dengan MPLS Traffic Engineering Menggunakan GNS3

2021 ◽  
Vol 13 (1) ◽  
pp. 32
Author(s):  
Hendra Bayu Susueno ◽  
Imam Tri Wibowo ◽  
Siti Ummi Masruroh ◽  
Dewi Khairani ◽  
I’im Umamil Khoiri
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Traffic Engineering ◽  
Link State ◽  
Digital Era ◽  
The Status ◽  
The Many ◽  
And Control ◽  
Label Switched Path

In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.

scholarly journals An Enhanced MPR-Based Solution for Flooding of Broadcast Messages in OLSR Wireless ad hoc Networks

2010 ◽  
Vol 6 (3) ◽  
pp. 249-257 ◽  
Author(s):  
Tzu-Hua Lin ◽  
Han-Chieh Chao ◽  
Isaac Woungang
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Packet Loss ◽  
Ad Hoc ◽  
Promising Technique ◽  
Simulation Experiments ◽  
Mobile Wireless ◽  
Link State ◽  
Performance Metric ◽  
Hoc Networks ◽  
Optimized Link State Routing

In an Optimized Link State Routing (OLSR)-based mobile wireless network, optimizing the flooding of broadcast messages is a challenging task due to node's mobility and bandwidth resource consumption. To complement existing solutions to this problem, the Multi-Point Relays (MPR) selection has recently been advocated as a promising technique that has an additional feature of reducing the number of redundant re-transmission occurring in the network. This paper continuous on the investigation of an existing MPR-based solution, arguing that by considering a cost factor as an additional decision parameter in selecting the MPR nodes, the enhanced MPR selection algorithm leads to less packet loss in the network. Simulation experiments are presented to validate the stated goal, using the average packet loss ratio as the performance metric.

scholarly journals Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering

2011 ◽  
Vol 19 (6) ◽  
pp. 1717-1730 ◽  
Author(s):  
Dahai Xu ◽  
Mung Chiang ◽  
J. Rexford
Keyword(s):  
Traffic Engineering ◽  
Link State
Sign in / Sign up

Export Citation Format

Share Document