International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 2 | Year 2013 | Article Id. IJCTT-V4I2P121 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I2P121

Routers Optimization and Minimizing Forwarding States with Explicit Multicast Forwarding

D.Evangelin, J.Jelsteen, J.Alice Pushparani, J.Nelson Samuel Jebastin

Citation :

D.Evangelin, J.Jelsteen, J.Alice Pushparani, J.Nelson Samuel Jebastin, "Routers Optimization and Minimizing Forwarding States with Explicit Multicast Forwarding," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 2, pp. 160-163, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I2P121

Abstract

Now a day’s plenty of algorithms and techniques are available for optimization and multicast forwarding. But in this research we are improving the scalability (Efficiency) of IP multicast and source specific multicast and to reduce the number of routers for required storing the forwarding states. The Multicast forwarding mechanism optimizes the allocation of forwarding states in routers and which can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Our mechanism needs fewer routers in a multicast tree to store forwarding states and therefore leads to a more balanced distribution of forwarding states among routers. There are two problems are available here. The first one is by using the MINSTATE algorithm to reduce the sum of the number of routers that store forwarding states in a multicast tree. The Second one is BALANCESTATE to minimize the maximum number of forwarding states stored in a router for all multicast groups. By getting the Optimal Solution for MINSTATE we used distributed algorithm and approximation algorithm for the BALANCESTATE.

Keywords

Multicast, Explicit Multicast, Routers, Forwarding States.

References

[1] R. Boivie, N. Feldman, Y. Imai, W. Livens, and D. Ooms, Explicit Multicast (Xcast) Concepts and Options, IETF RFC 5058. 
[2] A. Boudani, B. Cousin, and J. Bonnin, “An Effective Solution for Multicast Scalability: The MPLS Multicast Tree (MMT),” IETF Internet Draft. 
[3] Fei, A, Cui, J., M. Gerla, and Faloutsos, M. ‘Aggregated Multicast: An Approach to Reduce Multicast State’, Proc. IEEE GLOBECOM ’01, pp. 1595-1599. 
[4] P. V. Mieghem, G. Hooghiemstra, and R. Hofstad, “On the efficiency of multicast,” IEEE/ACM Transactions on Networking, vol. 9, no. 6, pp. 719-732, Dec. 2001. 
[5] W. Fenner, "Internet group management protocol, version 2," IETF RFC 2236, Nov. 1997. 
[6] D. Waitzman, C. Partridge, and S. Deering, “Distance vector multicast routing protocol,” IETF RFC 1075, Nov. 1988. 
[7] J. Moy, “Multicast routing extensions for OSPF,” Communications of the ACM, vol. 37, no. 8, pp 61-66, Aug. 1994. 
[8] T. Ballardie, P. Francis, and J. Crowcroft, “Core based trees (CBT),” ACM SIGCOMM, 1993, pp. 85-95.
[9] S. Deering et al., “The PIM architecture for wide-area multicast routing,” IEEE/ACM Transactions on Networking, vol. 4, no. 2, pp. 153-162, Apr. 1996.  
[10] D. Thaler, M. Handley, and D. Estrin, “The Internet multicast address allocation architecture,” RFC 2908, Sep. 2000. 
[11] H. Holbrook and B. Cain, “Source-specific multicast for IP,” IETF Internet Draft, draft-ietf-ssm-arch-04.txt, Oct. 2003.  
[12] P. I. Radoslavov, E. Estrin, and R. Govindan, “Exploiting the bandwidth-memory tradeoff in multicast state aggregation,” Tech. Rep. 99-697, USC Computer Science Department, 1999.
[13] S. Song, Z. Zhang, B. Choi, and D. H. C. Du, “Protocol independent multicast group aggregation scheme for the global area multicast,” IEEE GLOBECOM, pp. 370-375, 2000.
[14] S. Song, Z. Zhang, B. Choi, and D. H. C. Du, “Protocol independent multicast group aggregation scheme for the global area multicast,” IEEE GLOBECOM, pp. 370-375,  2000.  A. Fei, J. Cui, M. Gerla, and M. Faloutsos, “Aggregated multicast: an approach to reduce multicast State,” IEEE GLOBECOM, pp. 15951599, 2001.