Example on multiplicative decrease, Computer Networking

Assignment Help:

Q. Example on Multiplicative Decrease?

w = 1

for (each new ACK received)

w = w+1

until (loss detected or w >= ssthresh)

2311_Example on Multiplicative Decrease.png

Not so slow

- Exponential increase in transmission rate.

Continues until:

- Loss detected or...

- w > ssthresh

At first, we don't know what ssthresh is.

- Will carry on until a loss is detected.

- ssthresh = w / 2

- Restart slowstart.

  • Optimistically makes it to ssthresh before another loss.

Related Discussions:- Example on multiplicative decrease

What is the last step in data encapsulation, The Five steps to data encapsu...

The Five steps to data encapsulation (IN ORDER): 1) User information is changed into data. 2) Data is changed into segments. 3) Segments are changed into datagram and pack

Sharing information - network layer and routing , Sharing  information  ...

Sharing  information  To understand  how distance vector routing  works examine the  internet shown in  the  clouds represents local  area network . the  number  inside each c

What is the equivalent layer, What is the equivalent layer or layers of the...

What is the equivalent layer or layers of the TCP/IP Application layer in terms of OSI reference model? The TCP/IP Application layer really has three counterparts on the OSI mo

Differentiate between rarp and arp, TCP/IP Protocol Suite 1. What is th...

TCP/IP Protocol Suite 1. What is the concept of Multi-protocol encapsulation in ATM networks? 2. Differentiate between RARP and ARP. 3. Differentiate TDP and UDP. 4. D

Name the layers of osi, List the layers of OSI There are seven layers i...

List the layers of OSI There are seven layers in OSI model a. Physical Layer b. Data Link Layer c. Network Layer d. Transport Layer e. Session Layer f. Presen

What is the standard isdn term for a native isdn modem, TA is the standard...

TA is the standard ISDN term for a native ISDN modem

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

Pvm library routines, In this part we shall give a short description of the...

In this part we shall give a short description of the routines in the PVM 3 user library. Each PVM program should include the PVM header file "pvm3.h" (in a C program) or "fpvm3.h"

eigrp finds its successor and feasible successor, Describe how EIGRP finds...

Describe how EIGRP finds its successor and feasible successor?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd