I&C SCI 11 Lecture Notes - Lecture 3: Queuing Delay, Packet Loss, End System
15 Jan 2017
School
Department
Course
Professor
Document Summary
Nodal delay: most complicated component is queuing delay, numerous studies and books written about it, characterize queuing delay using average, variance and probability. Pretend a is the average rate that the packets get to queue. L will be the bits that the package consists of. Can use this to estimate the queuing delay. If la/r is greater than 1, the rate at which the packets arrive is exceeding the rate that the packets can be transmitted. The queue then increased and the queuing delay: basically, traffic intensity must not be greater than one approaches infinity. If la/r is less than 1, only the nature of the traffic will affect the queuing delay. Such as if they arrive periodically, or rather in bursts. Packet loss: a queuing capacity is finite. Packet delays do not actually approach infinity as the traffic intensity approaches 1. When a packet gets to a full queue, it drops the packet.
