Conference Paper

On-line restoration for multi-path routing

DOI: 10.1109/DRCN.2005.1563841 Conference: Design of Reliable Communication Networks, 2005. (DRCN 2005). Proceedings.5th International Workshop on
Source: IEEE Xplore

ABSTRACT Not Available

  • [Show abstract] [Hide abstract]
    ABSTRACT: Rapid growth and increasing requirements for service quality, reliability, and efficiency have made traffic engineering an essential consideration in the design and operation of large public Internet backbone networks. Internet traffic engineering addresses the issue of performance optimization of operational networks. A paramount objective of Internet traffic engineering is to facilitate the transport of IP traffic through a given network in the most efficient, reliable, and expeditious manner possible. Historically, traffic engineering in the Internet has been hampered by the limited functional capabilities of conventional IP technologies. Recent developments in multiprotocol label switching (MPLS) and differentiated services have opened up new possibilities to address some of the limitations of the conventional technologies. This article discusses the applications of MPLS to traffic engineering in IP networks
    IEEE Communications Magazine 01/2000; · 4.46 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We motivate and formally define dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suffix matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K, the number of alternate paths between a source and a destination. We derive multipath forwarding schemes for suffix matched path sets computed by both de-centralized (link-state) and distributed (distance-vector) routing algorithms. We also prove that (1) distributed multipath routing algorithms compute suffix matched multipath sets, and (2) for the criterion of ranked k-shortest paths, decentralized routing algorithms also yield suffix matched multipath sets
    INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE; 02/1999
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Link-state protocols such as OSPF are the dominant routing technology in today's Internet. Despite their many advantages, these protocols require the flooding of new information across the entire routing area after changes in any link state (e.g., link failures). As the routing area grows or the frequency of link-state changes increases, the overhead (in terms of bandwidth and processing cost) of flooding becomes prohibitive. Furthermore, such flooding over a large area will cause temporary inconsistency of link states among many routers, potentially creating many transient routing loops that can last for a long time. This limits the scalability of the routing protocols to large routing areas. To overcome such problems, we present in this paper a novel algorithm that minimizes the amount of information distributed by link-state routing protocols. Upon a link failure, our algorithm will distribute the link-state changes to the minimum number of routers that are needed to ensure loop-free routing. Moreover, implementing our algorithm requires only a simple extension to any existing link-state protocol
    Computer Communications and Networks, 1999. Proceedings. Eight International Conference on; 02/1999