Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
suppose a tcp vegas connection measures the rtt of its first packet and sets base rtt to that but then a network link
in tcp vegas the calculation of actual rate is done by dividing the amount of data transmitted in one rtt interval by
defeating tcp congestion-control mechanisms usually requires the explicit cooperation of the sender however consider
consider the tcp trace in figure 629 identify time intervals representing slow start on startup slow start after
suppose a tcp connection has a window size of eight segments an rtt of 800 ms the sender sends segments at a regular
consider a red gateway with maxp p and with an average queue length halfway between the two thresholdsa calculate the
suppose the r-b link in the previous exercise changes from a bandwidth delay to a propagation delay so that two packets
you are an internet service provider your client hosts connect directly to your routers you know some hosts are using
suppose two tcp connections share a path through a router r the routers queue size is six segments each connection has
suppose tcp is used over a lossy link that loses on average one segment in four assume the band width times delay
consider a red gateway with maxp 002 and with an average queue length halfway between the two thresholdsa find the
discuss the relative advantages and disadvantages of marking a packet as in the decbit mechanism versus dropping a
suppose you are downloading a large file over a 3-kbps phone link your software displays an average-bytes-per-second
in fair queuing the value fi was interpreted as a timestamp the time when the ith packet would finish transmitting give
suppose a router has three input flows and one output it receives the packets listed in table 63 all at about the same
suppose host a reaches host b via routers r1 and r2 a-r1-r2-b fast retransmit is not used and a calculates time out as
suppose a r and b are as in the previous exercise except that rs queue now has a size of three packets in addition to
suppose that between a and b there is a router r the a-r bandwidth is infinite that is packets are not delayed but the
suppose we were to add host-based congestion control to blastchan rpc what form might this take would it be better to
during linear increase tcp computes an increment to the congestion window as increment mss times msscongestion
consider a router that is managing three flows on which packets of constant size arrive at the following wall clock
consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start