Performance Evaluation of the Preemptive Bandwidth Allocation Protocol

  • Nawel Chefaï
  • Gregor V. Bochmann
  • Nicolas D. Georganas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2899)


We present the Preemptive Bandwidth Allocation Protocol; a distributed QoS-aware signaling protocol that adapts the users’ bandwidth requirement to the limited resources of the network by preempting bandwidth of less prioritized streams. We assume that a connection will have different streams with predefined quality requirements and each stream will have a priority level assigned to it. When a new connection request comes to the network and there is a lack of bandwidth, the communication service will try to preempt some streams of existing connections to satisfy the new requests without disconnecting the basic stream of any of these existing connections. The aim is to accommodate the maximum number of users within the network with at least their minimum requirements (e.g. I frames in a MPEG-2 media data). We also present a performance evaluation that compares this distributed preemptive approach with a centralized version and the traditional non-preemptive approach.


Admission Control Priority Level Bandwidth Requirement Connection Request Source Address 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bernet, Y.: The Complementary Roles of RSVP and Differentiated Services in the Full- Service QoS Network. IEEE Communications Mag. 38(2) (February 2000)Google Scholar
  2. 2.
    Bernet, Y., et al.: A Framework for Integrated Services Operation Over DiffServ Networks. RFC 2998 (November 2000)Google Scholar
  3. 3.
    Chefai, N.: Issues of the Preemptive Bandwidth Allocation Protocol in Unicast and Multicast, Multi-Streams Environments, Ph.D. thesis (to be submitted)Google Scholar
  4. 4.
    Doar, M.B.: A better model for generating test networks. In: GLOBECOM 1996 (1996)Google Scholar
  5. 5.
    Peyravian, M., Kshemkalyani, A.D.: Decentralized Network Connection Preemption Algorithms. Computer Networks 30(11) (June 1998)Google Scholar
  6. 6.
    Sakate, H., Yamaguchi, H., Yasumoto, K.: Resource Management for Quality of Service Guarantees in Multi-party Multimedia Application. In: ICNP 1998 (1998)Google Scholar
  7. 7.
    Toutain, F., Huber, O.: A General Preemption-Based Admission Policy Using a Smart Market Approach. In: INFOCOM 1996 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nawel Chefaï
    • 1
  • Gregor V. Bochmann
    • 1
  • Nicolas D. Georganas
    • 1
  1. 1.SITEUniversity of OttawaOttawaCanada

Personalised recommendations