Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1002/elps.201500011

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Sufficient conditions for protection routing in IP

Authors: János Tapolcai
Publish Date: 2012/02/25
Volume: 7, Issue: 4, Pages: 723-730
PDF Link

Abstract

Providing fully distributed fault tolerant hopbyhop routing is one of the key challenges for intradomain IP networks This can be achieved by storing two nexthops for each destination node in the forwarding table of the routers and the packets are forwarded to primary nexthop PNH unless PNH is unreachable and secondary nexthop SNH is used instead We follow the architecture by Kwong et al in On the feasibility and efficacy of protection routing in IP networks University of Pennsylvania 2010 where the routing tables are configured in a centralized way while the forwarding and failure recovery is in a fully distributed way without relying on any encapsulation and signaling mechanisms for failure notification to meet the standard IP forwarding paradigm A network is protected if no single link of node failure results in forwarding loops Kwong et al On the feasibility and efficacy of protection routing in IP networks University of Pennsylvania 2010 conjectured that network node connectivity is not sufficient for a network to be protectable In this paper we show that this conjecture is in contradiction with a conjuncture by Hasunuma Discrete Math 2341–3149–157 2001 in GraphTheoretic Concepts in Computer Science Springer Berlin pp 235–245 2002 and show that every four connected maximal planar graph and every underlying graph of a 2connected line digraph has feasible protection routing

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. Generalized solutions of quasi variational inequalities
  10. A composite model in the context of a production-inventory system
  11. Preserving maximal monotonicity with applications in sum and composition rules
  12. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  13. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  14. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  15. Polynomial-time identification of robust network flows under uncertain arc failures
  16. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  17. Maximizing strike aircraft planning efficiency for a given class of ground targets
  18. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions
Search Result: