TY - GEN
T1 - QoS guarantees of point-to-multipoint VPLS connections
AU - Ali, Najah Abu
AU - Mouftah, Hussein
AU - Gazor, Saeed
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Guaranteeing the statistical delay for real time connections is an area of interest for many researchers, consequently, several analytical and Measurement Based Admission Control algorithms (MBAC) are proposed. The proposed analytical algorithms provide solutions based on traffic fluid models or service disciplines which do not isolate the different flows at the schedular. The proposed MBAC algorithm can not meet the distinct violation probability requirements of a connection. Thus, in this paper we propose a new MBAC algorithm, which is capable of meeting the distinct violation probability requirement. The algorithm utilizes the Weighted Fair Queueing (WFQ) scheduler that is capable of isolating the traffic flows. The proposed algorithm is different from other MBAC algorithms, since it admits requests based on delay measurement rather than bandwidth measurement as most MBAC algorithms do. This facilitates meeting the distinct violation probability requirement of the connections. The simulation results revealed that the proposed algorithm can admit three times the deterministic algorithm for distinct delay requirements.
AB - Guaranteeing the statistical delay for real time connections is an area of interest for many researchers, consequently, several analytical and Measurement Based Admission Control algorithms (MBAC) are proposed. The proposed analytical algorithms provide solutions based on traffic fluid models or service disciplines which do not isolate the different flows at the schedular. The proposed MBAC algorithm can not meet the distinct violation probability requirements of a connection. Thus, in this paper we propose a new MBAC algorithm, which is capable of meeting the distinct violation probability requirement. The algorithm utilizes the Weighted Fair Queueing (WFQ) scheduler that is capable of isolating the traffic flows. The proposed algorithm is different from other MBAC algorithms, since it admits requests based on delay measurement rather than bandwidth measurement as most MBAC algorithms do. This facilitates meeting the distinct violation probability requirement of the connections. The simulation results revealed that the proposed algorithm can admit three times the deterministic algorithm for distinct delay requirements.
UR - http://www.scopus.com/inward/record.url?scp=33846635514&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846635514&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2005.1577946
DO - 10.1109/GLOCOM.2005.1577946
M3 - Conference contribution
AN - SCOPUS:33846635514
SN - 0780394143
SN - 9780780394148
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1732
EP - 1736
BT - GLOBECOM'05
T2 - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Y2 - 28 November 2005 through 2 December 2005
ER -