
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi, Minyi Guo, "Topology Design of NetworkCodingBased Multicast Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 5, pp. 627640, May, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70743, author = {Kaikai Chi and Xiaohong Jiang and Susumu Horiguchi and Minyi Guo}, title = {Topology Design of NetworkCodingBased Multicast Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {5}, issn = {10459219}, year = {2008}, pages = {627640}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70743}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Topology Design of NetworkCodingBased Multicast Networks IS  5 SN  10459219 SP627 EP640 EPD  627640 A1  Kaikai Chi, A1  Xiaohong Jiang, A1  Susumu Horiguchi, A1  Minyi Guo, PY  2008 KW  Network coding KW  multicast networks KW  topology design KW  heuristic algorithms VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[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. 12041216, 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, “MinimumCost Multicast over Coded Packet Networks,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 26082623, 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. 24102424, 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. 22352245, 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. 6368, Jan. 2006.
[10] A. Kershenbaum, Telecommunications Network Design Algorithms. McGrawHill, 1993.
[11] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. 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. 455460, Nov. 1969.
[13] M. Gerla and L. Kleinrock, “On the Topological Design of Distributed Computer Networks,” IEEE Trans. Comm., vol. 25, no. 1, pp. 4860, 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. 503513, Apr. 1991.
[15] F. Glover, M. Lee, and J. Ryan, “LeastCost Network Topology Design for a New Service: An Application of a Tabu Search,” Annals of Operations Research, vol. 33, pp. 351362, 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. 6169, 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. 127134, 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. 617671, 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. 17301734, Sept. 2005.
[22] Y. Wu, P.A. Chou, and S.Y. Kung, “MinimumEnergy Multicast in Mobile Ad Hoc Networks Using Network Coding,” IEEE Trans. Comm., vol. 53, no. 11, pp. 19061918, 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. 339348, July 2005.
[24] K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, and C. Diot, “Measurement and Analysis of SingleHop Delay on an IP Backbone Network,” IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 908921, 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. E89B, no. 1, pp.4756, Jan. 2006.
[26] B. Jackson and T. Jordan, “A Near Optimal Algorithm for Vertex Connectivity Augmentation,” LNCS 1969, pp. 312325, 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. 8292, 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. 7391, 1999.