answersLogoWhite

0


Best Answer

RTT = alpha * RTT + (1-alpha)*M

RTT = 30

RTT = 0.9 * 30 + 0.1 * 26 = 29.6

RTT = 0.9 * 29.6 + 0.1 * 32 = 29.84

RTT = 0.9 * 29.84 + 0.1 * 24 = 29.256

hope it's right

User Avatar

Wiki User

14y ago
This answer is:
User Avatar
User Avatar

Anonymous

Lvl 1
3y ago
Thanks
More answers
User Avatar

Anonymous

Lvl 1
3y ago

d\

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: If the tcp round trip time rtt is currently 30 msec and the following acknowledgements come in after 26 32 and 24 msec respectively what is the new rtt estimate using the jacobson algorithm use a0.9?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Computer Science

Which fields are required within digital certificates in a public key infrastructure?

Type your answer here... Serial Number and IssuerAnswer Explanation: Digital certificates in a PKI have nine required fields, two of which are the Serial Number and Issuer fields. The Serial Number is an identification number for the certificate. The name of the organization that issued the certificate is required in the Issuer field. Other required fields include the following: Version, Algorithm ID, Validity, Subject, Subject Public Key Info, the digital signature of its issuer, and an algorithm identifier.


What programming language does Amazon.com use?

Hi guys! Amazon.com is currently the largest company in the word. This company uses the following technologies for the site. 1. OSLinux2. programming languagesjavac++pythonasp.netphp3. DBMSoraclsqlmysqlsimpldb


What is running in the back ground in the computer?

You can find out what is running in the background of your computer. Check out the processess and that will show you what is currently running. You can find the processes by holding down the following three buttons all at the same time, ctrl, alt, and delete. This will bring up a box where you can check to see what is running.


What are the scheduling criteria for CPU scheduling?

CPU Scheduling Criteria: There are many scheduling algorithms and various criteria to judge their performance. Different algorithms may favor different types of processes. Some criteria are. as follows: • CPU utilization: CPU must be as busy as possible in performing different tasks. CPU utilization is more important in real-time system and multi-programmed systems. • Throughput: The number of processes executed in a specified time period is called throughput. The throughput increases .for short processes. It decreases if the size of processes is huge. • Turnaround Time: The amount of time that is needed to execute a process is called turnaround time. It is the actual job time plus the waiting time. • Waiting Time: The amount of time the process has waited is called waiting time. It is the turnaround time minus actual job time. • Response Time: The amount of time between a request is Submitted and the first response is produced is called response time. A CPU scheduling algorithm should try to maximize the following: • CPU utilization • Throughput A CPU scheduling algorithm should try to minimize the following: • Turnaround time • Waiting time • Response time by manish kumar gnit g.noida


A passive hub does not do which of the following?

function as a repeater

Related questions

Write an algorithm in c to convert an infix expression to a postfix expressionexecute your algorithm with the following infix expression as your input. m nk pgh a bc?

An algorithm can not be written with the following infix expression without knowing what the expression is. Once this information is included a person will be able to know how to write the algorithm.


How do you write algorith of C programs?

There is no specific Hard and Fast rule for writing algorithm. The normal method is the following: 1. get a problem 2. find or invent an algorithm to solve it 3. implement the algorithm in a programming language (C, for example)


Are algorithms limited to computing applications?

An algorithm is any procedure composed of fundamental steps, in a clearly defined order, that is guaranteed to halt. It need not be done on a computer, or be related to computation. For example, baking a cake using a recipe is an algorithm. Playing Snakes-and-Ladders is an algorithm. Backing a car out of a driveway can be done by following an algorithm.


Can someone provide the C program for Prim's algorithm?

The C code for Prim's algorithm can be found in the following link. https://sites.google.com/site/itstudentjunction/lab-programming-solutions/data-structures-programs/program-to-find-minimal-spanning-tree-using--prims-algorithm


What are the characteristics of a good algorithm?

Every algorithm should have the following five characteristics: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination


Which of the following do VPN products use to authenticate users?

the md5 algorithm ike passwords assigned by the network administrator


How do you RSA algorithm c?

Perform encryption on the following PT using RSA and find the CT p = 3; q = 11; M = 5


Which of the following gods are worshipped in sanctum of badrinath and kedarnath temples respectively?

vishnu and shiva


What is a sequential algorithm?

A sequential algorithm has the following characteristics:a dependence on the standard environment,a relevant name,a main method (function/subroutine) with no parameters,supplementary methods using a top-down modular design,input of boolean values,output exemplifying the relevant criteria.


Analysis of algorithm question bank?

An algorithm is a set of instructions that performs a particular task making sure that those instructions are followed. Analysis of algorithm question bank is needed when any of the following occurs: when a working program is not good enough, when program may be inefficient or when a running time of a program becomes an issue.


What is fundamental algorithm?

Algorithm It is the combination of sequential steps (these steps can be calculations, data processing, and reasoning tasks) use to resolve a problem in a very simple and efficient way. It is designed most efficiently that it can be expressed within a finite amount of space and time. we can implement it in any programming language. Properties of an algorithm : following are the main properties of an algorithm:- An algorithm must have a unique name. It should have explicitly defined sets of inputs and output. Algorithm must be in sequential order with unambiguous operations. It must have some endpoint, i.e., it halts in a finite amount of time. Visit for basic information about algorithms----> geeksjournal.in/2020/01/20/introduction-to-design-and-analysis-of-algorithm/


The answers to a 5th grade study link 8.7?

Use fraction multiplication algorithm to calcule the following products. 5/3 *9