0
1.robust
2.correct
3.optimal
4.error free
5.reliable
Wiki User
∙ 12y ago
Wiki User
∙ 9y ago1. Adaptive algorithm 2. Non-adaptive algorithm
Add your answer:
Earn +20 pts
Which is the easiest sorting method?
There are generally eight sorting algorithms that are studied in school by computer science students. They are as follows: insertion, bubble, quick, quick3, merge, shell, heap, and selection sorting. There are different types of sorting algorithms. One would be considered good if it is accurate and efficient. Different types of sorting includes; sequential, ascending, and descending.
What are the different cryptography algorithms?
There are many different algorithms used in cryptography - RSA, DES and Rabine ciphers are a few that can be used - as well as others that are used to help determine the constants in a system like Euclid's algorithm.
What is routing table?
A routing table has columns for at least three types of information, Network ID, the Cost and The ID of the next Router called Next Hop.
Types of clustering algorithm?
Clustering algorithms may be classified as listed below:Exclusive ClusteringOverlapping ClusteringHierarchical ClusteringProbabilistic Clustering
Is spiht algorithm a part of JPEG 2000 coding?
No. SPIHT and JPEG are two different compression algorithms.
What is the difference between inter domain routing and intra domain routing and what are they for?
Routing algorithms that are restricted to only work within the domain are referred as intera-domain routing algorithms and if they are not restricted only within the domains then they are inter-domain algorithms.
What are different cryptography algorithms?
There are two types of cryptography algorithms: 1) Public key cryptography 2) Secret key cryptography
What two names refer to the same algorithm used by all link-state routing protocols?
Link-state routing algorithms, also known as shortest path first (SPF) algorithms.
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 dynamic routing?
Routing refers to the process of moving packets of information across a network. Static and dynamic routing are the two types of routing algorithms used for this transfer of information.The term routing encapsulates two tasks. These tasks are deciding the paths for data transferred and sending the packets on these paths. The routing is a process that is a function carried out at layer 3 of the OSI reference model. The routing algorithm decides the output line to transfer the incoming packets. The routing algorithms are based on the routing protocol that uses metrics to assess whether a particular path is the optimal path available for transfer of the data packets. The metrics used for evaluating the paths are bandwidth, delay and reliability. The routing algorithms use these protocols to determine an optimal path from the source to the destination. The routing tables maintain all the information related to routing. There are various routing algorithms and depending on these routing algorithms, the information stored in the routing table varies. Every router has its own routing table and it fills this table with the required information to calculate the optimal path between the source router and the destination router. To understand the basic points of static vs dynamic routing, let us get to know what are routing tables.Routing tableA routing table is a document stored in the router or a network computer. The routing table is stored in the form of a database or is simply a file stored in the router. The data entered in the routing table is referred to when the best possible path to transfer information across two computers in a network is to be determined. The two classifications, viz., static and dynamic routing, are based on the way in which the routing tables are updated every time they are used. The routers in which the data is stored and updated manually are called static routers. On the other hand, the routers in which the information is changed dynamically, by the router itself, are referred to as dynamic routers. Let us compare the two types of routing algorithms based on the static and dynamic routing algorithm used, in the static vs. dynamic routing section given below.Static Vs. Dynamic RoutingStatic routing manually sets up the optimal paths between the source and the destination computers. On the other hand, the dynamic routing uses dynamic protocols to update the routing table and to find the optimal path between the source and the destination computers.The routers that use the static routing algorithm do not have any controlling mechanism if any faults in the routing paths. These routers do not sense the faulty computers encountered while finding the path between two computers or routers in a network. The dynamic routing algorithms are used in the dynamic routers and these routers can sense a faulty router in the network. Also, the dynamic router eliminates the faulty router and finds out another possible optimal path from the source to the destination. If any router is down or faulty due to certain reasons, this fault is circulated in the entire network. Due to this quality of the dynamic routers, they are also called adaptive routers.The static routing is suitable for very small networks and they cannot be used in large networks. As against this, dynamic routing is used for larger networks. The manual routing has no specific routing algorithm. The dynamic routers are based on various routing algorithms like OSPF (Open Shortest Path First), IGRP (Interior Gateway Routing Protocol) and RIP (Routing Information Protocol).The static routing is the simplest way of routing the data packets from a source to a destination in a network. The dynamic routing uses complex algorithms for routing the data packets.The static routing has the advantage that it requires minimal memory. Dynamic router, however, have quite a few memory overheads, depending on the routing algorithms used.The network administrator finds out the optimal path and makes the changes in the routing table in the case of static routing. In the dynamic routing algorithm, the algorithm and the protocol is responsible for routing the packets and making the changes accordingly in the routing table.Nowadays, the static routing is seldom used. With the technological advancements, the dynamic routing is used to route the packets in the network, efficiently. Thus, the above algorithm explains routing, routing tables and static vs dynamic routing.
What are different types of CPU scheduling algorithms?
Round robin schedulingPriority schedulingShortest job firstBy Tirok
Explain any two dynamic routing algorithms?
Dynamic or adaptive Routing algorithms in contrast change their routing decisions to reflect changes in topology and usually the traffic as well Dynamic routing attempts to solve this problem by constructing routing tables automatically, based on information carried by routing protocols, and allowing the network to act nearly autonomously in avoiding network failures and blockages. Dynamic routing dominates the Internet. However, the configuration of the routing protocols often requires a skilled touch; one should not suppose that networking technology has developed to the point of the complete automation of routing.
How are traditional Algorithms different from student invented strategies?
How are traditional algorithms different from student-invented strategy
What has the author IC Tsilogiannis written?
I.C Tsilogiannis has written: 'A study of routing algorithms in SDH based transport networks'
How are expanded and standard algorithms different?
No
What is dynamic routing technology?
Dynamic routing is a networking technique that provides optimal data routing. Unlike static routing, dynamic routing enables routers to select paths according to real-time logical network layout changes. In dynamic routing, the routing protocol operating on the router is responsible for the creation, maintenance and updating of the dynamic routing table. In static routing, all these jobs are manually done by the system administrator. Dynamic routing uses multiple algorithms and protocols. The most popular are Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).
Which is the easiest sorting method?
There are generally eight sorting algorithms that are studied in school by computer science students. They are as follows: insertion, bubble, quick, quick3, merge, shell, heap, and selection sorting. There are different types of sorting algorithms. One would be considered good if it is accurate and efficient. Different types of sorting includes; sequential, ascending, and descending.
