On Improving the Efficiency and Manageability of NotVia
Fri, 10/05/2007 - 17:36 by Pierre François
Abstract
This paper presents techniques that improve the efficiency and manageability of an intra-domain IP Fast Reroute (IPFRR) technique called NotVia. NotVia provides IP fast reroute service upon any single link or node failure for all destinations in an intra-domain network. However, it has a significant computational cost to restore its state upon topology changes, which slows the recovery of the IPFRR service itself upon a topology change. NotVia also increases the intra-domain forwarding table sizes, and poses potential obstacles for network management, as routers are unaware of the links (hence the amount of traffic) that they actually protect. This paper proposes techniques that can reduce both the computational costs and the forwarding table entries dedicated to NotVia addresses and that improve the manageability of NotVia. We use simulations to evaluate these techniques on real ISP topologies as well as randomly generated topologies using BRITE. The results show that the computational costs and the forwarding table size increments dedicated to restore the NotVia state are reduced to a fraction of their previous values for large topologies, suggesting that the techniques proposed in this paper make NotVia a more efficient and easy-to-manage technique for practical deployment.
- Authors
- Ang Li, Pierre Francois and Xiaowei Yang
- Source
proceedings of ACM CoNEXT , 2007.
- Full text
-
(463.22 KB) - Cite it
- BibTex
- Copyright
- See here
IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.