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

Networking, What is the implication of increasing and decreasing subnet Bit...

What is the implication of increasing and decreasing subnet Bits?

Define the term - proxy servers, Define the term - Proxy servers These ...

Define the term - Proxy servers These types of firewalls have been further classified into two types: application level gateways and circuit level gateways. The application

url connection instance, What is the difference among URL instance and URL...

What is the difference among URL instance and URL Connection instance? Ans) A URL instance represents the location of a resource, and a URL Connection instance shows a link for

Give the structure of an atm uni cell header, a) Consider a hypothetical a...

a) Consider a hypothetical arrangement of ‘self-learning' bridges shown in the figure below. Assuming all are initially empty, give the forwarding tables for each of the bridges B

Explain the routing table of solaris system, Question 1 Write a note on a)...

Question 1 Write a note on a) Internet layer b) strict source routing Question 2 Explain the routing table of Solaris system Question 3 Explain following concepts a) MIM

Illustrate the downside of groupware, Illustrate the downside of groupware ...

Illustrate the downside of groupware The downside of groupware is that they are very costly and with the increase in complexity or additional features, the cost increases propo

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.

Explain priority and reservation of token passing, Priority and Reservation...

Priority and Reservation Higher priority stations may possibly access the token sooner Each station has a priority code Since token passes by station waiting to t

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