Title :
Basic limits on protocol information in slotted communication networks
Author :
Dunn, Brian P. ; Laneman, J. Nicholas
Author_Institution :
Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN
Abstract :
We investigate the amount of protocol information required for a communication network to meet an average delay constraint for the delivery of messages that arrive according to a Bernoulli random process. We obtain a lower bound on this overhead as a function of the arrival rate and average delay. Our model is a discretetime analog of the Poisson arrival process considered by Gallager, and we show that in the limit as slot duration goes to zero, Gallagerpsilas bound is recovered.
Keywords :
protocols; random processes; stochastic processes; telecommunication networks; Bernoulli random process; Poisson arrival process; average delay; communication network; discretetime analog model; protocol information; slotted communication networks; Closed-form solution; Communication networks; Costs; Delay systems; Intelligent networks; Protocols; Random processes; Random variables; Rate-distortion; Timing;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595401
