0
- All packets should reach their destination (unless prevented by
other factors, e.g. congestion).
- Data transfer should be as quick and efï¬cient as possible. Using the
shortest or fastest route helps achieve this.
- Routing computations should be as quick and easy as possible.
- The algorithm should adapt to:
- Topology changes (new or removed channels).
- Changing load.
- The algorithm should treat different users fairly
Wiki User
∙ 10y ago
Add your answer:
Earn +20 pts
What is flow-based routing?
Flow based routing considers the flow in the network; mean consider the amount of traffic in the network before deciding on which outgoing line to place the packet. The key here is to be able to characterize the nature of the traffic flows over time. The basic idea behind the algorithm, is that any given line, if the capacity and average flow are known, it is possible to compute the mean packet delay on that line from queuing theory. The routing problem thus reduces to finding the routing algorithm that produces the minimum average delay for the subnet.
What type of routing algorithm does BGP use?
Best Path Algorithm, also known as Path-Vector Routing Internetworking with Cisco and Microsoft Technologies pg. 297 If you are in net+ 3rd edition like me, I do not belive this protocol is mention which leads me to believe the answer we are looking for in the study guide is Distance Vector, since BGP is a distance vector protocol. It can only be one of two in this case afaik, distance vector or Link State. :)
What is the method that a routing protocol uses to determine the best route to a destination network?
It depends on the routing protocol in use, for example RIP uses the hop-count to determine the best route where less hops is better, OSPF uses cost, EIGRP uses a composite metric (BW + Delay + Reliability + Load) etc.
What is the difference between routing and forwarding?
routing refers to deciding the route of the packet from one system (a computer) to another system (a computer). It involves many intermediate routers and routing table knowledge.forwarding is a rather simple process of passing a packet from one port/interface to another port /interface. It generally involves one of the routers and routers forwarding table informationThat's what they called call forwarding service in telecommunication.
What are the applications of Eigenvalue and Eigen vector in computer science?
Eigenvectors and eigenvalues are important for understanding the properties of expander graphs, which I understand to have several applications in computer science (such as derandomizing random algorithms). They also give rise to a graph partitioning algorithm. Perhaps the most famous application, however, is to Google's PageRank algorithm.
What is an IP routing algorithm?
An IP routing algorithm is routing used for IP networks to forward datagrams over a network. You can learn more about IP routing algorithms at the Wikipedia.
What is Non adaptive routing algorithm?
Answer: shortest path routing
Which routing protocol depends on the DUAL algorithm to calculate the shortest path to a destination?
Which routing protocol depends on the DUAL algorithm to calculate the shortest path to a destination
Where is the routing?
It is the process of forwarding packets in a network so that it reaches its intended destinations. To perform routing there are numbers of routing algorithm .
Is the routing?
It is the process of forwarding packets in a network so that it reaches its intended destinations. To perform routing there are numbers of routing algorithm .
Is shortest path routing algorithm adaptive?
yes
Which of is predetermined by an administrator and does not require a routing algorithm?
ospf and static route
A sequence of steps leading to a desired end?
Algorithm
What is the need of parallel line algorithm?
Do you mean "Why might a parallel line algorithm be needed?" or "What properties does a parallel line algorithm need to have?".
Is the statement 'Definiteness is one of the properties of an algorithm' True or false?
definiteness is on of the properties of an algorithms
What is algorithm write properties of algorithm?
An ALGORITHM is a sequence of steps that depicts the program logic independent of the language in which it is to be implemented. An algorithm should be designed with space and time complexities in mind.
Which routing algorithm does EIGRP use to calculate the best path to a destination within a network?
DUAL
