Open Access Open Access  Restricted Access Subscription or Fee Access

Intelligent Multicast Network with a Hands of MIP and Fair Allocation Techniques

R. Keerthi Anithra

Abstract


In the current network architecture Network coding algorithms usually encourages the flow of transmission in the network medium. The difficulty of multicast connections over inherent packet networks cause exceed amount of cost and introduces a new procedure for evaluating the presentation of wireless network by exploring the complexity of high throughput via lower bandwidth. Multicast routing for wired as well as wireless networks has listened carefully on metrics that estimates the quality of data to maximize the throughput efficiency, and the nodes must work together in order to find out the shortest path  and transmit data. Network Coding helps boost up the throughput efficiency and reduce the cost of transmission, in multicast networks. A fascinating problem is to understand and count the coding advantage and cost advantage that is the potential remuneration of network coding by using MIP and Fair Allocation techniques. The supposition that all nodes are candid and act fittingly for the period of metric calculation, promulgation, and aggregation, as fit as for the period of information forwarding, leads to unanticipated costs within the adversarial networks wherever compromised nodes operate spitefully. The attacks make use of the neighborhood estimation and universal aggregation of the metric to permit attackers to magnetize an enormous quantity of traffic. The proposed system shows to these attacks are extremely valuable close to multicast protocols based on throughput and it is so intricate to hold up the packets at the same time as transferring to destinations. While it maximizes throughput and efficiency, it also increases attack effectiveness in the deficiency of defense mechanisms. This approach to defend against the branded attacks combines accusation-based retort techniques and measurement-based recognition. 


Keywords


Random Linear Network Coding (RLNC), Linear Network Coding (LNC), Multicast Incremental Power(MIP) algorithm.

Full Text:

PDF

References


Z. Li, B. Li, and L. Lau, “On achieving maximum multicast throughput in undirected networks,” IEEE Trans. Inf. Theory, vol. 52, no. 6, pp.2467–2485, Jun. 2006.

W. John and S. Tafvelin, “Differences between in- and outbound Internet backbone traffic,” in 2007 TERENA Networking Conference.

D. S. Lun, N. Ratnakar, M. M´edard, R. Koetter, D. R. Karger, T. Ho,E. Ahmed, and F. Zhao, “Minimum-cost multicast over coded packet networks,” IEEE/ACM Trans. Networking, vol. 14, pp. 2608–2623, Jun.2006.

S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, “Polynomial time algorithms for multicast network code construction,” IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973–1982,Jun. 2005.

S. Sengupta, S. Rayanchu, and S. Banerjee, “Network coding-aware routing in wireless networks,” IEEE/ACM Trans. Networking, vol. 18,no. 4, pp. 1158–1170, 2010.

Y. Wu, P. 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, 2005.

Y. Xu, I. Butun, R. Sankar, N. Sapankevych, and J. Crain, “Comparison of routing and network coding in undirected network group communications,”in Proc. 2012 IEEE Southeastcon..

D. M. Chiu, R. Yeung, J. Huang, and B. Fan, “Can network coding help in p2p networks?” in Proc. 2006 Internl Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

S. Maheshwar, Z. Li, and B. Li, “Bounding the coding advantage of combination network coding in undirected networks,” IEEE Trans. Inf.Theory, vol. 58, no. 2, pp. 570–584, 2012.

R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung, “Network information flow,” IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204–1216, Jul. 2000.

C. Chekuri, C. Fragouli, and E. Soljanin, “On average throughput and alphabet size in network coding,” IEEE Trans. Inf. Theory, vol.52, no. 6,pp. 2410–2424, Jun. 2006.

C. Fragouli and E. Soljanin, “Network coding fundamentals,” in foundations and Trends in Networking, 2007.

Z. Li, B. Li, and L. C. Lau, “A constant bound on throughput improvement of multicast network coding in undirected networks,” IEEE Trans.Inf. Theory, vol. 55, no. 3, pp. 1016–1026, Mar. 2009.

Z. Shao and S. Li, “To code or not to code: rate optimality of network coding versus routing in peer-to-peer networks,”IEEETrans.Commun.,vol. 59, no. 4, pp. 948–954, 2011.

A. M. Townsend, “Network cities and the global structure of the Internet,” American Behavioral Scientist, vol. 44, no. 10, pp. 1697–1716,June 2001.

Xi, Y. and Yeh, E.M., “Distributed algorithms for minimum cost multicast with network coding”, IEEE Transactions on Networking, volume 18, number 2, pages 379-392, 2010.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.