Conference Paper

A backward-compatible inter-domain multipath routing framework

Tech. Univ. Carolo-Wilhelmina zu Braunschweig, Germany
DOI: 10.1109/INFCOMW.2011.5928794 Conference: Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on
Source: IEEE Xplore

ABSTRACT We present a framework to facilitate the inter-domain multipath routing for carrier networks that are based on circuit switching technologies, without significant changes to the existing inter-domain protocols. We first introduce a simple mechanism, namely, Single Routing Plane Multipath (SRPM) which can be easily implemented in the existing PCE-based inter-domain architectures. The main idea behind the SRPM method is to represent multiple link disjoint paths as a single virtual edge in the PCE and thus use the existing single path routing mechanisms to enable multipath routing. We further present a more generic mechanism, referred to as Multiple Routing Plane Multipath (MRPM) method, with the goal to facilitate the provisioning of multipath connections over dynamically selected domain chains. In this method, we propose to virtualize the network into multiple slices and represent as multiple routing topologies by the PCEs. In this way, multiple routing planes are constructed to facilitate inter-domain routing. For both methods, we consider the buffer size as constraint for multipath routing due to the resulting differential delay. The results show that the proposed methods can significantly improve the blocking performance and are backward compatible, while only slightly impacting the intra-domain traffic.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes the Pegasus framework that can be used to map complex scientific workflows onto distributed resources. Pegasus enables users to represent the workflows at an abstract level without needing to worry about the particulars of the target execution systems. The paper describes general issues in mapping applications and the functionality of Pegasus. We present the results of improving application performance through workflow restructuring which clusters multiple tasks in a workflow into single entities. A real-life astronomy application is used as the basis for the study.
    Scientific Programming. 01/2005; 13:219-237.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Internet consists of thousands of independent domains with different, and sometimes competing, business interests. However, the current interdomain routing protocol (BGP) limits each router to using a single route for each destination prefix, which may not satisfy the diverse requirements of end users. Recent proposals for source routing offer an alternative where end hosts or edge routers select the end-to-end paths. However, source routing leaves transit domains with very little control and introduces difficult sc alability and security challenges. In this paper, we present a multi-path inter- domain routing protocol called MIRO that offers substantial flexi- bility, while giving transit domains control over the flow of traffic through their infrastructure and avoiding state explosion in dissem- inating reachability information. In MIRO, routers learn default routes through the existing BGP protocol, and arbitrary pairs of do- mains can negotiate the use of additional paths (bound to tunnels in the data plane) tailored to their special needs. MIRO retains the simplicity of BGP for most traffic, and remains backwards com pat- ible with BGP to allow for incremental deployability. Experiments with Internet topology and routing data illustrate that MIRO offers tremendous flexibility for path selection with reasonable o verhead.
    Proceedings of the ACM SIGCOMM 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Pisa, Italy, September 11-15, 2006; 01/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.
    7th Annual Conference on Communication Networks and Services Research, CNSR 2009, 11-13 May 2009, Moncton, Canada; 01/2009

Full-text (2 Sources)

Available from
Sep 12, 2014