The document discusses different routing protocols used in computer networks. It begins with an introduction to routing protocols and their purpose of communicating between source and destination networks by updating routing tables. It then categorizes routing protocols as static or dynamic and discusses examples in each category. For dynamic routing protocols, it further divides them into interior gateway protocols used within an autonomous system and exterior gateway protocols used between autonomous systems. Specific dynamic interior routing protocols discussed in detail include distance vector protocols like RIP and link state protocols like OSPF.
Various routing algorithm are used for the purpose of deciding which route an incoming data packet needs to be transmitted on to reach destination efficiently.
These are the algorithms which change their routing decisions whenever network topology or traffic load changes
Various routing algorithm are used for the purpose of deciding which route an incoming data packet needs to be transmitted on to reach destination efficiently.
These are the algorithms which change their routing decisions whenever network topology or traffic load changes
Slides supporting the "Computer Networking: Principles, Protocols and Practice" ebook. The slides can be freely reused to teach an undergraduate computer networking class using the open-source ebook.
Slides supporting the "Computer Networking: Principles, Protocols and Practice" ebook. The slides can be freely reused to teach an undergraduate computer networking class using the open-source ebook.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Online aptitude test management system project report.pdfKamal Acharya
The purpose of on-line aptitude test system is to take online test in an efficient manner and no time wasting for checking the paper. The main objective of on-line aptitude test system is to efficiently evaluate the candidate thoroughly through a fully automated system that not only saves lot of time but also gives fast results. For students they give papers according to their convenience and time and there is no need of using extra thing like paper, pen etc. This can be used in educational institutions as well as in corporate world. Can be used anywhere any time as it is a web based application (user Location doesn’t matter). No restriction that examiner has to be present when the candidate takes the test.
Every time when lecturers/professors need to conduct examinations they have to sit down think about the questions and then create a whole new set of questions for each and every exam. In some cases the professor may want to give an open book online exam that is the student can take the exam any time anywhere, but the student might have to answer the questions in a limited time period. The professor may want to change the sequence of questions for every student. The problem that a student has is whenever a date for the exam is declared the student has to take it and there is no way he can take it at some other time. This project will create an interface for the examiner to create and store questions in a repository. It will also create an interface for the student to take examinations at his convenience and the questions and/or exams may be timed. Thereby creating an application which can be used by examiners and examinee’s simultaneously.
Examination System is very useful for Teachers/Professors. As in the teaching profession, you are responsible for writing question papers. In the conventional method, you write the question paper on paper, keep question papers separate from answers and all this information you have to keep in a locker to avoid unauthorized access. Using the Examination System you can create a question paper and everything will be written to a single exam file in encrypted format. You can set the General and Administrator password to avoid unauthorized access to your question paper. Every time you start the examination, the program shuffles all the questions and selects them randomly from the database, which reduces the chances of memorizing the questions.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
2. GROUP PRESENTATION
GROUP #5 (SECTION B)
PRESENTED TO: MADAM SARA SARWAR
PRESENTERS :
MAEDA QAISAR (19011556-078)
FAIZA (19011556-176)
ALISHBA SHAHBAZ (19011556-043)
4. ROUTING PROTOCOLS
Routing protocols are the set of rules used by the routers
to communicate between source & destination. They do
not move the information source to destination only
update the routing table. Each protocol has its own
algorithm to choose the best path.
5. METRICES BY ROUTING PROTOCOLS
• Number of network layer devices along with the path (hop count)
• Bandwidth
• Delay
• Load
• MTU
• Cost
Routing protocols store the result of these metrices in routing table.
6.
7. STATIC ROUTING PROTOCOLS
Static routing ,when an administrator manually assigns
the path from source to destination network. This is
feasible in small networks, but not in large networks.
8. ADVANTAGES & DISADVANTAGES
Advantages:
• No overhead on router CPU.
• No bandwidth usage between links.
• Security (only administrator add routes.)
Disadvantages:
• All link will be down on a link failure.
• Not practical on large networks.
• Administrator must update all routes.
9. DYNAMIC ROUTING PROTOCOLS
Dynamic routing is the process in which routing tables
are automatically updates by routing table of each
neighbor.
Dynamically discover & maintains routes.
Calculate routes
10. ADVANTAGES & DISADVANTAGES
Advantages:
• Less work in maintaining the configuration when adding &
deleting networks.
• Protocols automatically react to the topology changes.
• Configuration is less-prone.
Disadvantages:
• Routers resource are used
• More administrator knowledge is required for configuration.
11. EXTERIOR GATEWAY PROTOCOL
Exterior Gateway Protocol (EGP) is a protocol for
exchanging routing information between two
neighbor gateway hosts (each with its own router)
in a network of autonomous systems. EGP is
commonly used between hosts on the Internet to
exchange routing table information.
12. PATH VECTOR ROUTING PROTOCOL
A path-vector routing protocol is a network routing protocol
which maintains the path information that gets updated
dynamically. In a path vector protocol, a router does not just
receive the distance vector for a particular destination from its
neighbor; instead, a node receives the distance as well as path
information.
13. Border Gateway Protocol (BGP) is a standardized exterior
gateway protocol designed to exchange routing and reachability
information between autonomous systems (AS) on the Internet.
• It makes internet work.
• Classified as path vector routing protocol.
• BGP makes use of routing within an autonomous system.
• It is one of the most complex and Difficult to configuration
protocol but its emphasis on security and scalability makes its
usage essential.
BORDER GATEWAY PROTOCOL
14. DISTANCE VECTOR ROUTING PROTOCOL
Distance vector routing protocols use distance to determine the best path to a remote
network.
The distance is usually the number of hops (routers) to the destination network.
Distance vector protocols send complete routing table to each neighbor (a neighbor is
directly connected router that runs the same routing protocol)
RIPV1 and RIPV2 are examples of distance vector routing protocols.
15. DISTANCE VECTOR ROUTING PROTOCOL
Consider
• There is a network consisting of 4 routers.
• The weights are mentioned on the edges.
• Weights could be distances or costs or delays
16. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Step-01:
Each router prepares its routing table using its local knowledge.
Routing table prepared by each router is shown below-
Destination Distance Next HOP
A 0 A
B 2 B
C ∞ –
D 1 D
Destination Distance Next HOP
A 2 A
B 0 B
C 3 C
D 7 D
At Router A- AT Router B-
17. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Step 1
Destination Distance Next Hop
A ∞ –
B 3 B
C 0 C
D 11 D
Destination Distance Next Hop
A 1 A
B 7 B
C 11 C
D 0 D
At Router C- AT Router D-
18. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Step-02:
Each router exchanges its distance vector obtained in Step-01 with its neighbors.
After exchanging the distance vectors, each router prepares a new routing table.
This is shown below-
At Router A-
Router A receives distance vectors from its neighbors B and D.
Router A prepares a new routing table as-
19. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Cost of reaching destination B from router A = min { 2+0 , 1+7 } = 2 via B.
Cost of reaching destination C from router A = min { 2+3 , 1+11 } = 5 via B.
Cost of reaching destination D from router A = min { 2+7 , 1+0 } = 1 via D.
Thus, the new routing table at router A is-
Destination Distance Next Hop
A 0 A
B 2 B
C 5 B
D 1 D
20. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
At Router B-
Router B receives distance vectors from its neighbors A, C and D.
Router B prepares a new routing table as-
•Cost of reaching destination A from router B = min { 2+0 , 3+∞ , 7+1 } = 2 via A.
•Cost of reaching destination C from router B = min { 2+∞ , 3+0 , 7+11 } = 3 via C.
•Cost of reaching destination D from router B = min { 2+1 , 3+11 , 7+0 } = 3 via A
21. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Thus, the new routing table at router B is-
At Router C-
•Router C receives distance vectors from its
neighbors B and D.
•Router C prepares a new routing table as
Destination Distance Next Hop
A 2 A
B 0 B
C 3 C
D 3 A
22. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
• Cost of reaching destination A from router C = min { 3+2 , 11+1 } = 5 via B.
• Cost of reaching destination B from router C = min { 3+0 , 11+7 } = 3 via B.
• Cost of reaching destination D from router C = min { 3+7 , 11+0 } = 10 via B
• Thus, the new routing table at router C is-
Destination Distance Next Hop
A 5 B
B 3 B
C 0 C
D 10 B
23. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
At Router D
•Router D receives distance vectors from its neighbors A, B and C.
•Router D prepares a new routing table as-
•Cost of reaching destination A from router D = min { 1+0 , 7+2 , 11+∞ } = 1 via A.
•Cost of reaching destination B from router D = min { 1+2 , 7+0 , 11+3 } = 3 via A.
•Cost of reaching destination C from router D = min { 1+∞ , 7+3 , 11+0 } = 10 via B
24. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Thus, the new routing table at router D is-
Step-03:
• Each router exchanges its distance vector obtained in Step-02 with its neighboring routers
• After exchanging the distance vectors, each router prepares a new routing table
At Router A-
• Router A receives distance vectors from its neighbors B and D.
• Router A prepares a new routing table as
Destination Distance Next Hop
A 1 A
B 3 A
C 10 B
D 0 D
25. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
• Cost of reaching destination B from router A = min { 2+0 , 1+3 } = 2 via B
• Cost of reaching destination C from router A = min { 2+3 , 1+10 } = 5 via B
• Cost of reaching destination D from router A = min { 2+3 , 1+0 } = 1 via D
• Thus, the new routing table at router A is-
Destination Distance Next Hop
A 0 A
B 2 B
C 5 B
D 1 D
26. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
• Router B receives distance vectors from its neighbors A, C and D.
• Router B prepares a new routing table as-
• Cost of reaching destination A from router B = min { 2+0 , 3+5 , 3+1 } = 2 via A.
• Cost of reaching destination C from router B = min { 2+5 , 3+0 , 3+10 } = 3 via
• Cost of reaching destination D from router B = min { 2+1 , 3+10 , 3+0 } = 3 via A
Destination Distance Next Hop
A 2 A
B 0 B
C 3 C
D 3 A
27. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
Thus, the new routing table at router B is-
At Router C-
• Router C receives distance vectors from its neighbors B and D.
• Router C prepares a new routing table as
Destination Distance Next Hop
A 2 A
B 0 B
C 3 C
D 3 A
28. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
• Cost of reaching destination A from router C = min { 3+2 , 10+1 } = 5 via B.
• Cost of reaching destination B from router C = min { 3+0 , 10+3 } = 3 via B.
• Cost of reaching destination D from router C = min { 3+3 , 10+0 } = 6 via B.
• Thus, the new routing table at router C is-
• At Router D-
• Router D receives distance vectors from its neighbors A, B
• and C
• Router D prepares a new
routing table as-
Destination Distance Next Hop
A 5 B
B 3 B
C 0 C
D 6 B
29. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
• Cost of reaching destination A from router D = min { 1+0 , 3+2 , 10+5 } = 1 via A.
• Cost of reaching destination B from router D = min { 1+2 , 3+0 , 10+3 } = 3 via A.
• Cost of reaching destination C from router D = min { 1+5 , 3+3 , 10+0 } = 6 via A
• Thus, the new routing table at router D is
• These will be the final routing tables at each router.
Destination Distance Next Hop
A 1 A
B 3 A
C 6 A
D 0 D
30. DISTANCE VECTOR ROUTING PROTOCOL ALGORITHM
FINAL ROUTING TABLE:
Information stored at node
A B C D
A 0 2 5 1
B
2 0 3 3
C
5 3 0 6
D 1 3 6 0
31. LINK STATE PROTOCOL
Link state routing protocols are the second type of dynamic routing protocols.
They have the same basic purpose as distance vector protocols, to find a best path
to a destination, but use different methods to do so. Unlike distance vector
protocols, link state protocols don't advertise the entire routing table. Instead,
they advertise information about a network topology (directly connected links,
neighboring routers...), so that in the end all routers running a link state protocol
have the same topology database.
OSPF are the examples of link state routing protocols.
32. LINK STATE PROTOCOL ALGORITHM
Initialization
N = {A} // A is a root node.
for all nodes v
if v adjacent to A
then D(v) = c( A, v)
else D(v) = infinity
loop
find w not in N such that D(w) is a minimum.
Add w to N
Update D(v) for all v adjacent to w and not in N:
D(v) = min(D(v) , D(w) + c( w, v))
Until all nodes in N
33. Explain with the help
of this graph
A
E
D
C
B
F
1
3
2
2
5
1
1
2
5
34. LINK STATE PROTOCOL ALGORITHM
Step 1:
The first step is an initialization step. The currently known least cost path
from A to its directly attached neighbors, B, C, D are 2,5,1 respectively. The
cost from A to B is set to 2, from A to D is set to 1 and from A to C is set to 5.
The cost from A to E and F are set to infinity as they are not directly linked to
A.
Step A
N
B
D(B),P(B
)
C
D(C),P(C
)
D
D(D),P(D
)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
35. LINK STATE PROTOCOL ALGORITHM
Step 2:
In the above table, we observe that vertex D contains the least cost path in step 1.
Therefore, it is added in N. Now, we need to determine a least-cost path through D
vertex.
a)Calculating shortest path from A to B
v = B, w = D
D(B) = min( D(B) , D(D) + c(D,B) )
= min( 2, 1+2)>
= min( 2, 3)
The minimum value is 2. Therefore, the currently shortest path from A to B is 2
b) Calculating shortest path from A to C
v = C, w = D
D(C) = min( D(C) , D(D) + c(D,C) )
= min( 5, 1+3)
= min( 5, 4)
The minimum value is 4. Therefore, the currently shortest path from A to C is 4.
36. LINK STATE PROTOCOL ALGORITHM
c) Calculating shortest path from A to E
v = E, w = D
D(E) = min( D(E) , D(D) + c(D,E) )
= min( ∞, 1+1)
= min(∞, 2)
The minimum value is 2. Therefore, the currently shortest path from A to E is
2.
Step A
N
B
D(B),P(B)
C
D(C),P(C)
D
D(D),P(D)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
37. LINK STATE PROTOCOL ALGORITHM
Step 2:
In the above table, we observe that vertex D contains the least cost path in step 1.
Therefore, it is added in N. Now, we need to determine a least-cost path through D
vertex.
a)Calculating shortest path from A to B
v = B, w = D
D(B) = min( D(B) , D(D) + c(D,B) )
= min( 2, 1+2)
= min( 2, 3)
The minimum value is 2. Therefore, the currently shortest path from A to B is 2.
b) Calculating shortest path from A to C
v = C, w = D
D(C) = min( D(C) , D(D) + c(D,C) )
= min( 5, 1+3)
= min( 5, 4)
The minimum value is 4. Therefore, the currently shortest path from A to C is 4.
38. LINK STATE PROTOCOL ALGORITHM
c) Calculating shortest path from A to E
v = E, w = D
D(E) = min( D(E) , D(D) + c(D,E) )
= min( ∞, 1+1)
= min(∞, 2)
The minimum value is 2. Therefore, the currently shortest path from A to E is
2.
Step A
N
B
D(B),P(B)
C
D(C),P(C)
D
D(D),P(D)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
39. LINK STATE PROTOCOL ALGORITHM
Step 3:
In the above table, we observe that both E and B have the least cost path in step 2. Let's
consider the E vertex. Now, we determine the least cost path of remaining vertices through
E.
a) Calculating the shortest path from A to B.
v = B, w = E
D(B) = min( D(B) , D(E) + c(E,B) )
= min( 2 , 2+ ∞ )
= min( 2, ∞)
The minimum value is 2. Therefore, the currently shortest path from A to B is 2.
b) Calculating shortest path from A to C
v = C, w = E
D(C) = min( D(C) , D(E) + c(E,C) )
= min( 4 , 2+1 )
= min( 4,3)
The minimum value is 3. Therefore, the currently shortest path from A to C is 3.
40. LINK STATE PROTOCOL ALGORITHM
c) Calculating shortest path from A to E
v = F, w = E
D(F) = min( D(F) , D(E) + c(E,F) )
= min( ∞ , 2+2 )
= min(∞ ,4)
The minimum value is 4. Therefore, the currently shortest path from A to F is
4.
Step A
N
B
D(B),P(B)
C
D(C),P(C)
D
D(D),P(D)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
3 ADE 2,A 3,E 4E
41. LINK STATE PROTOCOL ALGORITHM
Step 4:
In the above table, we observe that B vertex has the least cost path in step 3. Therefore, it is added in N. Now, we determine the least cost
path of remaining vertices through B.
a) Calculating the shortest path from A to C.
v = C, w = B
D(C) = min( D(C) , D(B) + c(B,C) )
= min( 3 , 2+3 )
= min( 3,5)
The minimum value is 3. Therefore, the currently shortest path from A to C is 3.
b) Calculating shortest path from A to F
v = F, w = B
D(F) = min( D(F) , D(B) + c(B,F) )
= min( 4, ∞)
= min(4, ∞)
The minimum value is 4. Therefore, the currently shortest path from A to F is 4.
Step A N B D(B),P(B) C D(C),P(C) D D(D),P(D) E D(E),P(E) F D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
3 ADE 2,A 3,E 4E
4 ADEB 3,E 4,E
42. LINK STATE PROTOCOL ALGORITHM
Step 5:
In the above table, we observe that C vertex has the least cost path in step 4.
Therefore, it is added in N. Now, we determine the least cost path of remaining
vertices through C.
a) Calculating the shortest path from A to F.
v = F, w = C
D(F) = min( D(F) , D(C) + c(C,F) )
= min( 4, 3+5)
= min(4,8)
The minimum value is 4. Therefore, the currently shortest path from A to F is 4.
Step A
N
B
D(B),P(B)
C
D(C),P(C)
D
D(D),P(D)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
3 ADE 2,A 3,E 4E
4 ADEB 3,E 4,E
5 ADEBC 4,E
43. LINK STATE PROTOCOL ALGORITHM
Step A
N
B
D(B),P(B)
C
D(C),P(C)
D
D(D),P(D)
E
D(E),P(E)
F
D(F),P(F)
1 A 2,A 5,A 1,A ∞ ∞
2 AD 2,A 4,D 2,D ∞
3 ADE 2,A 3,E 4E
4 ADEB 3,E 4,E
5 ADEBC 4,E
6 ADEBCF
45. EXAMPLE OF LINK STATE ROUTING PROTOCOL
OSPF (Open Shortest Path First )
Open Shortest Path First (OSPF) is a link-state routing protocol that was developed for IP
networks and is based on the Shortest Path First (SPF) algorithm. OSPF is an Interior Gateway
Protocol (IGP).
The OSPF protocol is a link-state routing protocol, which means that the routers exchange
topology information with their nearest neighbors. The topology information is flooded
throughout the AS, so that every router within the AS has a complete picture of the topology
of the AS. This picture is then used to calculate end-to-end paths through the AS, normally
using a variant of the Dijkstra algorithm. Therefore, in a link-state routing protocol, the next
hop address to which data is forwarded is determined by choosing the best end-to-end path
to the eventual destination
CHARACTERISTICS:
• AD value is 110.
• Supports classless network.
• Supports VLSM/CIDR
• unlimited hop counts.
46. HYBRID ROUTING PROTOCOL
A Hybrid Routing protocol has the advantages of both Distance Vector and Link
State Routing protocols and merges them into a new protocol. Typically, hybrid routing
protocols are based on a Distance Vector protocol but contain many of the features
and advantages of Link State Routing protocols. Example: EIGRP (Enhanced Interior
Gateway Routing Protocol).
Hybrid Routing Protocol (HRP) Requires less memory and processing power than LSRP
EIGRP are examples of hybrid routing protocols.
47. EXAMPLE OF HYBIRD ROUTING PROTOCOL
EIGRP(Enhanced Interior gateway Routing Protocol)
It’s supports the features both distance vector & link state protocol. It is a
cisco proprietary protocol. By default, bandwidth & delay are the activated
metrics.
CHARACTERISTICS: -
• Supports classless network
• Supports VLSM/CIDR.
• It supports trigger updates.