Throughput and latency in finite-buffer line networks

IEEE Transactions on Information Theory

Volumn 57, Issue 6, 2011, Pages 3622-3643

  Vellambi, Badri N ^a   Torabkhani, Nima ^b   Fekri, Faramarz ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Finite buffer; line network; Markov chain; network coding; packet delay; throughput capacity

Indexed keywords

FINITE BUFFER; LINE NETWORK; MARKOV CHAIN; PACKET DELAY; THROUGHPUT CAPACITY;

COMPUTER SIMULATION; INFORMATION THEORY; MARKOV PROCESSES; PACKET NETWORKS; THROUGHPUT;

NETWORK CODING;

EID: 79957642089     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2137070     Document Type: Article

References (25)

1. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 789-804, Mar., 2006. (Pubitemid 46444874)
2. A. F. Dana, R. Gowaikar, and B. Hassibi, "On the capacity region of broadcast over wireless erasure networks," presented at the Annu. Allerton Conf. Communication, Control and Computing, Oct. 2004.
3. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding schemes for line networks," presented at the IEEE Int. Symp. Information Theory, Sep. 2005.
4. R.Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
5. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
6. D. S. Lun, N. Ratnakar, R. Koetter,M.Médard, E. Ahmed, and H. Lee, "Achieving minimum-cost multicast: A decentralized approach based on network coding," presented at the 24th Annu. Joint Conf. IEEE Computer and Communications Societies, Mar. 2005.
7. D. S. Lun, M. Médard, and R. Koetter, "Efficient operation of wireless packets networks using network coding," presented at the Int. Workshop Convergent Technology, 2005.
8. D. S. Lun, M. Médard, and M. Effros, "On coding for reliable communication over packet networks," presented at the Annu. Allerton Conf. Communication, Control, and Computing, Oct. 2004.
9. H. G. Perros, Queueing Networks With Blocking. New York: Oxford Univ. Press, 1994.
10. T. Altiok, "Approximate analysis of queues in series with phase-type service times and blocking," Oper. Res., vol. 37, pp. 301-310, Jul. 1989.
11. T. Altiok, "Approximate analysis of exponential tandem queues with blocking," Eur. J. Oper. Res., vol. 11, no. 4, pp. 390-398, 1982.
12. A. Brandwajn and Y.-L. L. Jow, "An approximation method for tandem queues with blocking," Oper. Res., vol. 36, no. 1, pp. 73-83, 1988. (Pubitemid 18621598)
13. K. C. So and K.-T. E. Chin, "Performance bounds on multiserver exponential tandem queues with finite buffers," Eur. J. Oper. Res., vol. 63, no. 3, pp. 463-477, 1992.
14. Y. Dallery and Y. Frein, "On decomposition methods for tandem queueing networks with blocking," Oper. Res., vol. 41, no. 2, pp. 386-399, 1993.
15. R. Serfozo, Introduction to Stochastic Networks, 1st ed. New York: Springer-Verlag, 1999.
16. B. N. Vellambi, N. Rahnavard, and F. Fekri, "The effect of finite memory on throughput of wireline packet networks," presented at the Information Theory Workshop, Lake Tahoe, CA, Sep. 2007.
17. D. S. Lun, P. Pakzad, C. Fragouli, M. Médard, and R. Koetter, "An analysis of finite-memory random linear coding on packet streams," presented at the 2nd Workshop on Network Coding, Theory, and Applications, Boston, MA, Apr. 3-7, 2006.
18. C. E. Shannon, "The zero error capacity of a noisy channel," IEEE Trans. Inf. Theory, vol. IT-2, pp. 8-19, Sep. 1956.
19. J. R. Norris, Markov Chains. New York: Cambridge Univ. Press, 1998.
20. W. Feller, An Introduction to Probability Theory and Its Applications, 2nd ed. Hoboken, NJ: Wiley, 1957.
21. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
22. J. D. C. Little, "A proof for the queuing formula: L=λW," Oper. Res., vol. 9, no. 3, pp. 383-387, 1961.
23. G. B. Folland, Real Analysis, 2nd ed. Hoboken, NJ:Wiley, Apr. 1999.
24. R. A. Horn, Topics in Matrix Analysis. New York: Cambridge Univ. Press, 1986.
25. S. K. Bose, An Introduction to Queueing Systems. New York: Kluwer/Plenum, 2002.