The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2008 vol.19)
pp: 627-640
Kaikai Chi , IEEE
Minyi Guo , IEEE
ABSTRACT
It is anticipated that a large amount of multicast traffic need to be supported in the future communication networks. Network coding technique proposed recently is promising for establishing multicast connections with significantly lower bandwidth requirement than that of the traditional Steiner treebased multicast connections. How to design multicast network topologies with the consideration of efficiently supporting multicast by network coding technique becomes an important issue now. It is notable, however, that the conventional algorithms for network topology design are mainly unicast-oriented, and they cannot be adopted directly for efficient topology design of network coding-based multicast networks by simply treating each multicast as multiple unicasts. In this paper, we consider for the first time the novel topology design problem of network coding-based multicast networks. Based on the characteristics of multicast and network coding, we first formulate this problem as a mixed-integer nonlinear programming problem, which is NP- ard, and then propose two heuristic algorithms for it. The effectiveness of our heuristics is verified through simulation and the comparison with the exhaustive search method. We demonstrate in this paper that in the topology design of multicast networks, adopting network coding technique to support multicast transmissions can significantly reduce the overall topology cost as compared to the conventional unicast-oriented design and the Steiner tree-based design.
INDEX TERMS
Network coding, multicast networks, topology design, heuristic algorithms
CITATION
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi, Minyi Guo, "Topology Design of Network-Coding-Based Multicast Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 5, pp. 627-640, May 2008, doi:10.1109/TPDS.2007.70743
REFERENCES
[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, “Network Information Flow,” IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] Z. Li and B. Li, “Network Coding: The Case of Multiple Unicast Sessions,” Proc. 42nd Ann. Allerton Conf. Comm., Control, and Computing, Sept. 2004.
[3] D.S. Lun, M. Médard, and M. Effros, “On Coding for Reliable Communication over Packet Networks,” Proc. 42nd Ann. Allerton Conf. Comm., Control, and Computing, Sept. 2004.
[4] D.S. Lun, M. Médard, and R. Koetter, “Network Coding for Efficient Wireless Unicast,” Proc. Int'l Zurich Seminar Comm. (IZS'06), Feb. 2006.
[5] D.S. Lun, N. Ratnakar, M. Médard, R. Koetter, D.R. Karger, T. Ho, E. Ahmed, and F. Zhao, “Minimum-Cost Multicast over Coded Packet Networks,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2608-2623, June 2006.
[6] C. Chekuri, C. Fragouli, and E. Soljanin, “On Average Throughput and Alphabet Size in Network Coding,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2410-2424, June 2006.
[7] M. Charikar and A. Agarwal, “On the Advantage of Network Coding for Improving Network Throughput,” Proc. IEEE Information Theory Workshop (ITW '04), Oct. 2004.
[8] C. Gkantsidis and P. Rodriguez, “Network Coding for Large Scale Content Distribution,” Proc. IEEE INFOCOM '05, pp. 2235-2245, May 2005.
[9] C. Fragouli, J. Boudec, and J. Widmer, “Network Coding: An Instant Primer,” ACM SIGCOMM Computer Comm. Rev., vol. 36, no. 1, pp. 63-68, Jan. 2006.
[10] A. Kershenbaum, Telecommunications Network Design Algorithms. McGraw-Hill, 1993.
[11] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[12] K. Steiglitz, P. Weiner, and D.J. Kleitman, “The Design of Minimum Cost Survivable Networks,” IEEE Trans. Circuit Theory, vol. 16, no. 4, pp. 455-460, Nov. 1969.
[13] M. Gerla and L. Kleinrock, “On the Topological Design of Distributed Computer Networks,” IEEE Trans. Comm., vol. 25, no. 1, pp. 48-60, Jan. 1977.
[14] A. Kershenbaum, P. Kermani, and G.A. Grover, “MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing,” IEEE Trans. Comm., vol. 39, no. 4, pp. 503-513, Apr. 1991.
[15] F. Glover, M. Lee, and J. Ryan, “Least-Cost Network Topology Design for a New Service: An Application of a Tabu Search,” Annals of Operations Research, vol. 33, pp. 351-362, 1991.
[16] S. Pierre, M.-A. Hyppolite, J.-M. Bourjolly, and O. Dioume, “Topological Design of Computer Communication Networks Using Simulated Annealing,” Eng. Applications of Artificial Intelligence, vol. 8, no. 1, pp. 61-69, 1995.
[17] S. Pierre and G. Legault, “An Evolutionary Approach for Configuring Economical Packet Switched Computer Networks,” Artificial Intelligence in Eng., vol. 10, no. 2, pp. 127-134, 1996.
[18] M. Grötschel, C.L. Monma, and M. Stoer, “Design of Survivable Networks,” Handbook in Operations Research and Management Science, vol. 7, pp. 617-671, 1995.
[19] D.S. Lun, M. Médard, T. Ho, and R. Koetter, “Network Coding with a Cost Criterion,” Proc. Int'l Symp. Information Theory and Its Applications (ISITA '04), Oct. 2004.
[20] D. Bertsekas and R. Gallager, Data Networks, second ed. Prentice Hall, 1992.
[21] K. Bhattad, N. Ratnakar, R. Koetter, and K.R. Narayanan, “Minimal Network Coding for Multicast,” Proc. IEEE Int'l Symp. Information Theory (ISIT '05), pp. 1730-1734, Sept. 2005.
[22] Y. Wu, P.A. Chou, and S.-Y. Kung, “Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding,” IEEE Trans. Comm., vol. 53, no. 11, pp. 1906-1918, Nov. 2005.
[23] R. Bolla, R. Bruschi, F. Davoli, and M. Repetto, “Analytical/Simulation Optimization System for Access Control and Bandwidth Allocation in IP Networks with QoS,” Proc. Int'l Symp. Performance Evaluation of Computer and Telecomm. Systems (SPECTS '05), pp. 339-348, July 2005.
[24] K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, and C. Diot, “Measurement and Analysis of Single-Hop Delay on an IP Backbone Network,” IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 908-921, Aug. 2003.
[25] K. Ishibashi, R. Kawahara, T. Asaka, M. Aida, S. Ono, and S. Asano, “Detection of TCP Performance Degradation Using Link Utilization Statistics,” IEICE Trans. Comm., vol. E89-B, no. 1, pp.47-56, Jan. 2006.
[26] B. Jackson and T. Jordan, “A Near Optimal Algorithm for Vertex Connectivity Augmentation,” LNCS 1969, pp. 312-325, 2000.
[27] S.-C. Fang and S. Puthenpura, Linear Optimization and Extensions: Theory and Algorithms. Prentice Hall, 1993.
[28] D.W. Corne, M.J. Oates, and G.D. Smith, Telecommunications Optimization: Heuristic and Adaptive Techniques. John Wiley & Sons, 2000.
[29] M. Listanti, V. Eramo, and R. Sabella, “Architectural and Technological Issues for Future Optical Internet Networks,” IEEE Comm. Magazine, vol. 38, no. 9, pp. 82-92, Sept. 2000.
[30] M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, “Approximation Algorithms for Directed Steiner Problems,” J. Algorithms, vol. 33, no. 1, pp. 73-91, 1999.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool