Cart (Loading....) | Create Account
Close category search window

Multicast Dynamic Invulnerability Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhao Jianfeng ; Res. Inst. of Electron. Sci. & Technol., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Zong Zhulin ; Bai Yong ; Liu Tao

This paper outlines a multicast dynamic invulnerability algorithm, which is implemented and be combined by dynamic calculation and FRR (Fast Rerouting).The global network topology information is immediately acquired and the corresponding backup is established to protect the fault tree branches, when the current routing is fault. This algorithm can realize real-time protection for dynamic path and it will save a lot of routing resources in the small failure probability network topology. This paper mainly analyzes and designs the realizing process, invulnerability link failures protection and node failure protection of multicast dynamic invulnerability algorithm.

Published in:

Computational Intelligence and Design (ISCID), 2011 Fourth International Symposium on  (Volume:2 )

Date of Conference:

28-30 Oct. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.