Inter-domain Quality Of Service Routing Research Articles

An IPv6 Based QoS Unicast Routing Mechanism

IPv6 is the core protocol of Future Internet. Thus, IPv6 based QoS (Quality of Service) routing mechanisms need to be developed to support diverse QoS requirements of new network applications. In this paper, an IPv6 based QoS unicast routing mechanism is proposed based on OSPFv3 and BGP4 +. By introducing QoS state message and extending the link state database and link state advertisement, the collection, storage and release of intra-domain QoS information are realized. By introducing NLRI (Network Layer Reachability Information) which supports QoS, the release and revocation of inter-domain QoS routing information are realized. The mechanism not only provides QoS support, but also is compatible with the existing routing protocols. It can be quickly and effectively deployed in networks. A prototype implementation of the proposed mechanism is completed, which is tested under a video conference application over the CERNET2 topology. The results indicate that it is feasible and effective with good performance.

A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks

Inter-domain quality of service (QoS) routing is a challenging problem for today's Internet. This problem requires the computation of paths that cross multiple domains and meet different QoS constraints. In addition, the used computation methods must meet the constraints of confidentiality and autonomy imposed by the domains of different operators. Path computation element (PCE)-based architecture offers a promising solution for inter-domain QoS routing. It ensures the computation of end-to-end QoS paths while preserving the confidentiality and the autonomy of the domains. In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks. HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Moreover, it integrates a crankback mechanism for improving path computation results in a single domain or in multiple domains based on the PCE architecture. Detailed analyses are provided to assess the performance of our algorithm in terms of success rate and computational complexity. The simulation results show that our algorithm has an acceptance rate of the requests very close to the optimal solution; precisely, the difference is lower than 1 % in a realistic network. Moreover, HID-MCP has a low computational complexity. Besides, our solution relies on the PCE architecture to overcome the limitations related to inter-domain routing such as domain autonomy and confidentiality.

Interdomain quality of service routing: setting the grounds for the way ahead

A common criticism of the current Internet is the fact that it does not offer quality of service (QoS) guarantees across autonomous system boundaries. The Border Gateway Protocol (BGP) is central to solve this problem, since it enables AS to distribute reachability information. However, BGP is agnostic of any performance or QoS metrics. For this reason, the debate about the requirements for the future interdomain routing architecture and about whether these requirements are best met by an approach of introducing changes into BGP or by replacing BGP is still open. This article provides an insight into the interdomain QoS routing problem. First, the main drawbacks of current interdomain routing with regard to the provision of QoS are identified. Second, a survey of the most relevant interdomain QoS routing approaches are described and discussed. We also give a broad perspective on challenges surrounding the issue of whether to extend or replace BGP to support QoS, with particular emphasis on the technical challenges. However, we also point out some nontechnical unsolved challenges that, in our perspective, are still almost certainly the biggest barrier to the development of interdomain QoS routing.

Quality-of-Service routing with path information aggregation

Most of the research proposals on Quality-of-Service (QoS) mechanisms have focused on providing guarantees in a single domain. Supporting QoS guarantees in the interdomain setting has been receiving more research attention recently. Most of the proposals for interdomain QoS routing has focused on a link-state protocol and/or a single QoS metric. Our proposal differs from the existing work in the literature in three major ways: (1) our approach is based on a distance-vector protocol, similar to BGP; the de facto interdomain routing protocol in the Internet, (2) we consider both bandwidth and delay simultaneously unlike the other studies which either considered one metric or made the decision on only one of metrics even when they disseminated more than one metric, and (3) we use a line segment to represent the domain level QoS information. To the best of our knowledge, our study is the first proposal in the literature that models the domains by a line segment for inter-domain QoS routing purposes under a distance-vector routing protocol to find a path that satisfy both bandwidth and delay requirements.

Capacity-aware state aggregation for interdomain QoS routing

Quality-of-service (QoS) routing between domains is an essential component for providing service differentiation in the Internet. State aggregation is a technique that makes QoS routing scalable to large internetworks, by presenting a concise and accurate representation of the domain to the routing process. The concept of using a domain's routing capacity as a bandwidth aggregate has been in existence for some time. However, no methodology has been suggested in the literature for its estimation and usage. Also, the impact of a domain's routing capacity on the routing performance has not been studied before. This paper aims to fill these voids by presenting a framework based on flows for estimating a domain's routing capacity and evaluating its efficacy on the routing performance. The routing capacity is used in conjunction with the conventional widest path bandwidth as the domain aggregate. Analytical and experimental results show that appropriate use of routing capacity along with the widest path bandwidth reduces the tendency of the advertised aggregate to overestimate bandwidth availability, and makes the routing process more robust to the frequency of domain state updates. During periods of congestion, the use of routing capacity can improve the bandwidth admitted into the network by as much as 20%

End-to-end quality of service provisioning through inter-provider traffic engineering

This paper addresses the issue of delivering solutions that will enable the incremental implementation of inter-domain quality of service (QoS) in the multi-provider commercial Internet. The paper first introduces a holistic architecture that describes the key functions required to support inter-domain QoS, and then proceeds to present results from two major components of the architecture. A genetic algorithm for QoS-aware offline inter-domain traffic engineering is first presented, and it is shown through simulation studies how this can optimise the apportionment of QoS provisioning between adjacent domains. Secondly, QoS enhancements to BGP are proposed and the results of a testbed implementation are described, demonstrating how this QoS-enhanced BGP can deliver inter-domain QoS routing.

Inter-domain QoS routing on Diffserv networks: a region-based approach

Quality of Service (QoS) routing is inherently a difficult problem. Inter-domain QoS routing is even harder, because it involves entities residing in distinct administrative domains. There are two problems that need to be solved in inter-domain QoS routing: topology distribution in a scalable fashion and finding paths that satisfy QoS constraints and provide connectivity. In this paper we present region-based, link-state, source-specified, inter-domain QoS routing architecture that addresses these questions. Our architecture is scalable and does not suffer from the problems caused by hierarchical routing. Analysis results show that the average region size and the average shortest path length (SPL) are inversely proportional and scalability of the approach increases as the region size decreases. Gain from the scalability is far more than the loss from the average SPL, especially with larger topologies.