Statistical dealy garantees of VPLS connections over MPLS networks

Najah Abu Ali, Hussein Mouftah, Saeed Gazor

Research output: Contribution to journalConference articlepeer-review


Virtual Private LAN Services (VPLS) connection requests have different QoS requirements such as delay and violation probability bounds. Each VPLS connection requirements are to be met in isolation from other VPLS connections. However, intensive studies by some researchers of the existing Measurement Based Admission Control (MBAC) algorithms revealed that none of these algorithms where able to meet the distinct violation probability requirements of the connections. This paper presents an online distributed algorithm, which is based on measuring the delay of the link traffic. The empirical histogram of the measured delay is fitted into a gamma distribution, which is used to calculate the required bandwidth to be reserved to meet each connection QoS requirements. The simulation results for evaluating the algorithm performance show that the algorithm is capable of meeting the distinct QoS requirements of the connections. The algorithm admitted two to three times more than the number of connections a deterministic admission control algorithm can admit.

Original languageEnglish
Article number1556877
Pages (from-to)61-64
Number of pages4
JournalCanadian Conference on Electrical and Computer Engineering
Publication statusPublished - 2005
Externally publishedYes
EventCanadian Conference on Electrical and Computer Engineering 2005 - Saskatoon, SK, Canada
Duration: May 1 2005May 4 2005


  • Admission control
  • MBAC
  • MPLS
  • QoS
  • Statistical multiplexing
  • VPLS

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering


Dive into the research topics of 'Statistical dealy garantees of VPLS connections over MPLS networks'. Together they form a unique fingerprint.

Cite this