Article

A scalable architecture for end-to-end QoS provisioning

Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong, China
Computer Communications (Impact Factor: 1.35). 08/2004; DOI: 10.1016/j.comcom.2004.04.002
Source: DBLP

ABSTRACT The Differentiated Services (DiffServ) architecture has been proposed by the Internet Engineering Task Force as a scalable solution for providing end-to-end Quality of Service (QoS) guarantees over the Internet. While the scalability of the data plane emerges from the definition of only a small number of different service classes, the issue of a scalable control plane is still an open research problem. The initial proposal was to use a centralized agent, called Bandwidth Broker, to manage the resources within each DiffServ domain and make local admission control decisions. In this article, we propose an alternative decentralized approach, which increases significantly the scalability of both the data and control planes. We discuss in detail all the different aspects of the architecture, and indicate how to provide end-to-end QoS support for both unicast and multicast flows. Furthermore, we introduce a simple traffic engineering mechanism, which enables the more efficient utilization of the network resources.

0 Followers
 · 
251 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper focuses on QoS guarantees in an interdomain selfish network where each domain may sell QoS guarantees for its transit traffic. The main objective of the paper is to evaluate the benefit for some of these domains to develop together a privileged partnership in terms of economic alliance. This alliance permits the members to share their local knowledge of the network and to exchange some traffic network services. After defining the alliance model and the way each domain may use it to obtain better QoS guarantees, we analyse by simulation on realistic generated topologies the impact of such alliances on the QoS requests satisfaction.
    Communications, 2009. ICC '09. IEEE International Conference on; 07/2009
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The optimal QoS path provisioning of coexisted and aggregated traffic in networks is still demanding problem. All traffic flows in a domain are distributed among LSPs (Label Switching Path) related to N service classes, but the congestion problem of concurrent flows can appear. As we know the IGP (Interior Getaway Protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology. In QoS end-to-end provisioning where some links may be reserved for certain traffic classes (for particular set of users) it becomes insufficient technique. On other hand, constraint based explicit routing (CR) based on IGP metric ensures traffic engineering (TE) capabilities. The algorithm proposed in this paper may find a longer but lightly loaded path, better than the heavily loaded shortest path. LSP can be pre-computed much earlier, possibly during SLA (Service Level Agreement) negotiation process. As we need firm correlation with bandwidth management and traffic engineering (TE) the initial (pro-active) routing can be pre-computed in the context of all priority traffic flows (former contracted SLAs) traversing the network simultaneously. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. Also, such technique could be useful in inter-domain end-to-end provisioning, where bandwidth reservation has to be negotiated with neighbor ASes (Autonomous System). To be acceptable for real applications such complicated routing algorithm can be significantly improved. Algorithm was tested on the network of M core routers on the path (between edge routers) and results are given for N=3 service classes. Further improvements through heuristic approach are made and results are discussed.
  • Source
    International Journal of Communications, Network and System Sciences 01/2009; 2(05):422-432. DOI:10.4236/ijcns.2009.25047 · 0.90 Impact Factor

Preview

Download
2 Downloads
Available from