Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
How congestion is controlled in TCP?
One of the most significant aspects of TCP is a mechanism for congestion control. In main modern internets, extreme long delays or packet loss are more probable to be caused through congestion than a hardware failure.
Interestingly, transports protocols which retransmit can exacerbate the problem of congestion through injecting further copies of a message.
To ignore such a problem, TCP all the time uses packet loss as a measure of congestion and responds to congestion through reducing the rate at that it retransmits data.
TCP doesn't compute a specific transmission rate. In place, TCP bases transmission on buffers. It is the receiver advertises a window size and the sender can transmit data to fill the receiver's window before received an ACK. To control the data rate, TCP inflicts a restriction on the window size - through temporarily reducing the window size, the sending TCP effectively decreases the data rate.
TCP congestion control takes over while a message is lost. In place of retransmitting adequate data to fill the receiver's buffer as the receiver's window size, TCP starts through sending a particular message having data. If the acknowledgement arrives without any additional loss, TCP doubles the amount of data to be sent and sends two additional messages. TCP sends four more and the rest, if acknowledgement arrives for those two.
All nodes in the structure of LDB need not be defined in the ABAP/4 Dictionary False. One has to describe all nodes in the Dictionary or single has to select all nodes that a
A COCOMO model is :- COCOMO:- Constructive Cost Estimation Model.
Define class P The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.
Odd-Even Merging Circuit Let's firstly understand the idea of merging two sorted sequences using an odd-even merging circuit. The functioning of a merging circuit is as given b
Explain Garbage collection In this method two passes are made over the memory to identify new areas. In the first pass it traverses all pointers pointing to allocated areas an
The runqueue is the list of runnable processes on a given processor. There is only one runqueue per processor. Each runqueue contains two priority arrays: Active and Expired. Each
The access time of ROM using bipolar transistors is about ? Ans. About 1 µ sec is the access time of ROM using bipolar transistors.
Q. Define HEX directive? HEX: HEX directive enables the coding of hexadecimal values in body of the program. That statement directs assembler to treat tokens in source file wh
What are various types of Shift Registers ? Ans: Kinds of Shift Registers: (i) SISO that is Serial-In Serial-Out Shift Register (ii) SIPO that is Serial-In P
General Considerations for Research -artificial intelligence: If we can specify the initial state, the operators or a consumer and the goal check for a search problem, that al
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd