Network coding in node-constrained line and star networks

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4452-4468

  Tabatabaei Yazdi, S M Sadegh ^a   Savari, Serap A ^a   Kramer, Gerhard ^b  

^a Texas AandM University   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Index coding; line network; linear network coding; network coding; node constrained network; star network

Indexed keywords

CAPACITY REGIONS; CODING FRAMEWORK; CODING THEOREMS; CODING WITH SIDE INFORMATION; COMBINATORIAL OPTIMIZATION PROBLEMS; DIRECTED GRAPHS; EDGE CONSTRAINTS; INDEX CODING; LINE NETWORK; LINEAR CODING; MULTICASTS; NODE-CONSTRAINED NETWORK; OPTIMAL LINEAR CODE; OPTIMALITY; STAR NETWORK; UNICAST PROBLEMS; UPPER BOUND;

CODES (SYMBOLS); COMBINATORIAL OPTIMIZATION; OPTIMAL SYSTEMS; OPTIMIZATION; STARS;

NETWORK CODING;

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

References (38)

1. B. W. Abeysundara and A. E. Kamal, "High-speed local area networks and their performance: a survey," ACMComput. Surv. (CSUR), vol. 23, Jun. 1991.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 1204-1216, Jul. 2000.
3. M. S. Alfiad, D. van den Borne, T. Wuth, M. Kuschnerov, B. Lankl, C. Weiske, E. de Man, A. Napoli, and H. de Waardt, "111 Gb/s POLMUX-RZ-DQPSK transmission over 1140 km of SSMF with 10.7 Gb/s NRZ-OOK neighbours," presented at the Proc. ECOC, Brussels, Belgium, Sep. 21-25, 2008.
4. M. Bakshi, M. Effros, W. Gu, and R. Koetter, "On network coding of independent and dependent sources in line networks," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 24-29, 2007, pp. 1096-1100.
5. U. Black, Optical Networks: Third Generation Transport Systems. Upper Saddle River, NJ: Prentice-Hall, 2002.
6. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, "Index coding with side information," in Proc. 47th Annu. IEEE Symp. Foundations of Computer Science, Oct. 2006, pp. 197-206. (Pubitemid 351175509)
7. C. Chen and J. Chen, "Nearly optimal one-to-many parallel routing in star networks," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 12, pp. 1196-1202, Dec. 1997. (Pubitemid 127767764)
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. A. Dasylva and R. Srikant, "Optimal WDM schedules for optical star networks," IEEE/ACM Trans. Netw., vol. 7, no. 3, pp. 446-456, Jun. 1999.
10. S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the relation between the index coding and the network coding problems," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1823-1827.
11. R. C. Elsenpeter and T. J. Velte, Optical Networking: A Beginner's Guide. Berkeley, CA: McGraw-Hill/Osborne, 2002.
12. R.-J. Essiambre, G. Kramer, P. J. Winzer, G. J. Foschini, and B. Goebel, "Capacity limits of optical fiber networks," IEEE/OSA J. Lightw. Technol., vol. 28, no. 4, pp. 662-701, Feb. 15, 2010.
13. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
14. A. Frank, B. Shepherd, V. Tandon, and Z. Vegh, "Node-capacitated ring routing," Math. Oper. Res., vol. 27, no. 2, pp. 372-383, May 2002. (Pubitemid 34715202)
15. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," ACMSIGCOMM Comput. Commun. Rev., vol. 36, no. 4, Oct. 2006.
16. L. Kerschberg, P. D. Ting, and S. B. Yao, "Query optimization in star computer networks," ACM Trans. Database Syst., vol. 7, no. 4, pp. 678-711, Dec. 1982. (Pubitemid 13478665)
17. G. Kramer, "Communication on line networks with deterministic or erasure broadcast channels," presented at the IEEE Information Theory Workshop, Taormina, Italy, Oct. 11-16, 2009.
18. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Netw. Syst. Manage., vol. 14, no. 1, pp. 49-67, Mar. 2006.
19. G. Kramer and S. A. Savari, A. Ashikhmin and A. Barg, Eds., "On networks of two-way channels," in Proc. DIMACSWorkshop on Algebraic Coding Theory and Information Theory, 2005, vol. 68, pp. 133-143, (Dec. 15-18, 2003, Rutgers Univ., Piscataway, NJ), American Mathematical Society, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
20. G. Kramer, S. M. S. T. Yazdi, and S. A. Savari, "Network coding on line networks with broadcast," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 19-21, 2008, pp. 781-784.
21. E. Lubetzky and U. Stav, "Non-linear index coding outperforming the linear optimum," in Proc. 48th Annu. IEEE Symp. Foundations of Computer Science, Oct. 2007, pp. 161-168.
22. C. L. Lucchesi, "A Minmax Equality for Directed Graphs," Ph.D. dissertation, Univ. Waterloo, Waterloo, ON, Canada, 1976.
23. A. Natarajan, M. Motani, B. de Silva, K. Yap, and K. C. Chua, "Network architectures and support: Investigating network architectures for body sensor networks," in Proc. 1st ACM SIGMOBILE Int. Workshop on Systems and Networking Support for Healthcare and Assisted Living Environments, Jun. 2007, pp. 19-24. (Pubitemid 350003844)
24. U. Niesen, C. Fragouli, and D. Tuninetti, "On the capacity of line networks," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4039-4058, Nov. 2007.
25. U. Niesen, C. Fragouli, and D. Tuninetti, "On cascaded channels with finite complexity processing at intermediate nodes," presented at the 43rd Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2005.
26. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding schemes for line networks," presented at the IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005.
27. V. Ramachandran, "A minmax arc theorem for reducible flow graphs," SIAM J. Discrete Math., vol. 3, pp. 554-560, 1990.
28. S. A. Savari and G. Kramer, "The multimessage unicast capacity region for bidirectional ring networks," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006, pp. 763-767.
29. J. L. Szwarcfiter, "On minimum cuts of cycles and maximum disjoint cycles," in Graphs and Algorithms. Providence, RI: Amer. Math. Soc., 1989, pp. 153-166, (Boulder, CO, 1987), volume 89 of Contemp. Math.
30. S. M. S. Tabatabaei Yazdi, S. A. Savari, and G. Kramer, "Network coding in star networks," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 6-11, 2008, pp. 325-329.
31. S. M. S. Tabatabaei Yazdi, S. A. Savari, and G. Kramer, "Network coding capacity region of line networks with node and edge constraints," in 45th Annu. Allerton Conf. Commun., Control, and Comp., Monticello, IL, Sep. 26-28, 2007, pp. 949-958.
32. C.Wang, E. L. Floyd, and M. L. Soffa, "Feedback vertex sets and cyclically reducible graphs," J. ACM (JACM), vol. 32, no. 2, pp. 296-313, Apr. 1985. (Pubitemid 15488347)
33. J. Wilson, Sensor Technology Handbook. New York: Elsevier, Dec. 2004.
34. Y. Wu, P. Chou, Q. Zhang, K. Jain, W. Zhu, and S. Kung, "Network planning in wireless ad hoc networks: A cross-layer approach," IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 136-150, Jan. 2005.
35. Y.Wu, P. A. Chou, and S.-Y. Kung, "Information exchange in wireless networks with network coding and physical-layer broadcast," presented at the Conf. Information Sciences and Systems, Mar. 16-18, 2005, The Johns Hopkins Univ.
36. Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," IEEE Trans. Commun., vol. 53, no. 11, pp. 1906-1918, Nov. 2005. (Pubitemid 41763708)
37. S. Yao, "Polarization in Fiber Systems: Squeezing Out More Bandwidth," in The Photonics Handbook. New York: Laurin Publishing, 2003, p. 1.
38. J. W. Yeh and W. Siegmund, "Local network architectures," in Proc. 3rd ACM SIGSMALL Symp./1st SIGPC Symp. Small Systems SIGSMALL, Sep. 1980, pp. 10-14.