Policy Based QoS support using BGP Routing

Abstract -Routing protocols are important to exchange routing information between neighboring routers. Such information is Key words: BGP, QoS, Autonomous System (AS) Introduction Current Internet architecture is based on the Best Effort (BE) model, where packets can be dropped indiscriminately in the event of congestion. Such architecture attempts to deliver all traffic as soon as possible within the limits of its abilities, but without any guarantee about throughput, delay, packet loss, etc. Though such a model works well for certain traditional applications such as FTP, E-mail and less QoS constrained applications, it can be intolerable for newly emerged real-time, multimedia applications such as Internet Telephony (VoIP), Video-Conferencing and Video on-Demand, as well as future services. Hence, with massive deployment of Internet based applications in recent years and the need to manage them efficiently, current Internet structure needs a major shift from the BE model to a service oriented model with support for desired QoS. Current research in this direction is focused towards providing better than BE service over the Internet through a new architecture. Also the new architecture should be both scalable and guarantee end-to-end QoS for different services/applications while supporting different levels of performance. Current Internet architecture lacks standardization while deployed across various domains, hence affecting end-to-end QoS significantly. In this paper our effort is to find a scalable and uniform solution mainly addressing routing and its effect on end to end QoS. In this regard, we consider current inter-domain routing based on BGP as the central component and develop an algorithm allowing QoS domains to be easily identified and enable policy based routing to support QoS for various applications. One of the main objectives in setting up an end-to-end path for any service over the Internet is providing support for its service requirements to achieve necessary QoS, and such tasks are difficult to achieve through current Internet architecture. In this regard, our algorithm is designed to address such heterogeneous service parameter requirements for different services between ASs, and tries to find a viable solution by integrating network policies with routing and traffic engineering objectives. We mainly focus on Inter-domain traffic engineering issues in resolving the policy requirements of different services. In doing so, we have identified and addressed two core problems in the Internet today in relation to QoS

Fair intelligent admission control over resource-feedback DiffServ network

The basic DiffServ model lacks mechanisms to prevent itself from being overloaded and to inform its internal capability to the external world. This paper addresses the problem by presenting a Fair Intelligent Admission Control (FIAC) over an enhanced-DiffServ architecture. The central idea is to make admission decision based on both informed internal network QoS states and the external traffic QoS requirements at the edge node. This model has several advantages: (1) it is backward compatible with DiffServ, (2) it adapts to traffic load and network QoS state changes, and (3) it provides interactive communication between the external QoS requirements and the internal DiffServ network capability. In this paper, we use simulation to evaluate the performance of DiffServ with or without FIAC. The performance demonstrates that the new scheme is able to admit traffic fairly and achieve edge-to-edge QoS under heavy traffic conditions and network state changes. © 2005 Published by Elsevier B.V