Multi-user exhaustive system Consider arbitrary packet Let y s the duration of whole reservation intervals during which packet i must wait (ETY]=Y) W=R+ow+y Packet i may arrive during the reservation or data interval of any of the m streams with equal probability(1/ m) If it arrives during its own interval Yi=0, etc.,, hence, w,p.1m0≤<m Y=E[]=∑ V( R+y R 1-p)2,AE[X 2 2Multi-user exhaustive system • Consider arbitrary packet i • Let Yi = the duration of whole reservation intervals during which packet i must wait (E[Yi] = Y) W = R + ρW + Y • Packet i may arrive during the reservation or data interval of any of the m streams with equal probability (1/m) – If it arrives during its own interval Yi = 0, etc…, hence, Yi = {iV w. p. 1/ m 0 ≤ i < m V m −1 i = V ( m −1) Y = E [ Yi ] = m ∑i = 0 2 R + Y R = (1 − ρ) V2 + λE[ X2 ] Eytan Modiano W = (1 − ρ), 2 V 2 Slide 8