The option that can be used to identify and analyze which characteristic of OSPF signifies this is known to be Low overhead, fast convergence.
<h3>What is OSPF about?</h3>
The OSPF is known to be called an open Shortest Path First protocol.
It belongs to the family of IP Routing protocols as it serves as Interior Gateway Protocol (IGP) used mainly for the Internet, and the option that can be used to identify and analyze which characteristic of OSPF signifies this is known to be Low overhead, fast convergence.
See full question below
A network administrator has asked Robin, a network engineer, to use OSPF (Open Shortest Path First) along with RIP (Routing Information Protocol) on an edge router in a network so that it demands more memory and CPU power for calculations but keeps network bandwidth to a minimum with a very fast convergence time. Identify and analyze which characteristic of OSPF signifies this.
Shared data
Low overhead, fast convergence
Stability
Multi-vendor routers
Learn more about OSPF from
brainly.com/question/14604232
#SPJ1
Answer:
It can improve the quality of human life because it can be used as a learning and education media, the mass communication media in promoting and campaigning practical and important issues, such as the health and social area. It provides wider knowledge and can help in gaining and accessing information.
<em>That</em><em>'</em><em>s</em><em> </em><em>my</em><em> </em><em>answer</em>
Answer: All the above questions should be asked
Explanation: Access report are the reports in access which provides the summarized and formatted information display in database. The information in the database is extracted from tables.The access report requires purpose of the report before preparation and the accessing users information to be known .
It is asked to make sure about that no unauthorized access of the report can take place. Distribution of the report among the other user or client is also a major question to be asked as to keep the record of the accessing of access report..Thus, all the question mentioned in the options are correct.
Answer:
2.6 seconds
Explanation:
We first start by calculating the speed up
The formula is given as:
n/1+(n-1)F
We have n = 3 which is the number of processors
F = 20% = percentage of algorithm
When we put values into the formula
3/1+(3-1)0.20
= 3/1+2*0.20
= 3/1+0.4
= 3/1.4
Speed up = 2.14
From here we calculate the expected time
T/speedups
= 5.6/2.14
= 2.6
Therefore the expected time is 2.6 seconds
