Browse > Article

Network Coding Performance Analysis with Multicast Topology  

Lee, Mi-Sung (Chonbuk National University)
Balakannan, S.P. (K.S. Rangasamy University of Technology)
Lee, Moon-Ho (Chonbuk National University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.47, no.11, 2010 , pp. 30-35 More about this Journal
Abstract
Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. The exploration of numerical, theoretical and operational networking issues from new perspectives that consider coding at network nodes. We have presented a network coding approach which asymptotically achieves optimal capacity in multi-source multicast networks. Our analysis uses connections that we make between network coding. In this paper we analysed with and without network coding performance. Also we discussed the simulation results on network coding with linear optimization problem and it shows how network coding can be used.
Keywords
Network coding; multicast; optimization; linear combinations;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Fragouli, D. S. Lun, M. M'edard, and P. Pakzad, "On feedback for network coding", in Proc. of 2007 Conference on Information Sciences and Systems (CISS 2007).
2 P. A. Chou, Y. Wu, and K. Jain, "Practical network coding", Proc. of Allerton Conference on Communication, Control, and Computing, 2003.
3 S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing", Proc. of ACM SIGCOMM 2007, August 2007.
4 S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inform. Theory, vol. 51, No.6, June 2005.
5 T. Ho, M. M'edard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "Toward a random operation of networks", IEEE Trans. Inform. Theory, vol 2004, pp. 1-8, 2004.
6 T. Ho, M. M'edard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding", In Proc. 41st Annual Allerton Conference on Communication, Control and Computing, Oct 2003.
7 P. A. Chou, Y.Wu, and K. Jain, "Practical network coding", In Proc. 41st Annual Allerton Conference on Communication, Control and Computing, Oct 2003.
8 L. Zosin and S. Khuller, "On directed Steiner trees", In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 59–63, 2002.
9 M. Charikar, C. Chekuri, T.Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems", In Proc. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 192–200, 1998.
10 C. Fragouli and A. Markopoulou, "A network coding approach to overlay network monitoring", In Allerton, Sept. 2005.
11 Balakannan S.P, Yier Yan, Jae Seung Yang and Moon Ho Lee, "End-to-End Network Delay- Constrained for QoS Multicast Routing", The First International Conference on Networks & Communications (NetCoM-2009), DOI 10.1109/ NetCoM.2009.50, pp.178-183, Dec 27-29, 2009. (912)
12 R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Trans. Inform. Theory, 46(4):1204-1216, July 2000.   DOI   ScienceOn
13 T. Salonidis, M. Garetto, A. Saha, and E. Knightly, "Identifying High Throughput Paths in 802.11 Mesh Networks: A Model-Based Approach", Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 21-30, 2007.