1st International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks

Research Article

Efficient policy-based routing without virtual circuits

  • @INPROCEEDINGS{10.1109/QSHINE.2004.21,
        author={B.R. Smith and J.J. Garcia-Luna-Aceves},
        title={Efficient policy-based routing without virtual circuits},
        proceedings={1st International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks},
        publisher={IEEE},
        proceedings_a={QSHINE},
        year={2004},
        month={12},
        keywords={},
        doi={10.1109/QSHINE.2004.21}
    }
    
  • B.R. Smith
    J.J. Garcia-Luna-Aceves
    Year: 2004
    Efficient policy-based routing without virtual circuits
    QSHINE
    IEEE
    DOI: 10.1109/QSHINE.2004.21
B.R. Smith1, J.J. Garcia-Luna-Aceves1
  • 1: Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

Abstract

The inclusion of multiple metrics in a routing computation is called policy-based routing. Previous work on solutions to this problem have focused on virtual-circuit-based solutions, and have resulted in computationally expensive algorithms. This paper presents a number of advances in the provision of policy-based routing services in networks and internetworks. An integrated policy-based routing architecture is formulated where the general problem is decomposed into a traffic engineering problem of computing routes in the context of administrative traffic constraints, and a quality-of-service (QoS) problem of computing routes in the context of performance-related path constraints. A family of routing algorithms are presented for computing routes in the context of these constraints which achieve new levels of computational efficiency. Lastly, a forwarding architecture is presented that efficiently supports hop-by-hop forwarding in the context of multiple paths to each destination, which is required for policy-based routing.