Change search
ReferencesLink to record
Permanent link

Direct link
PBAC: Probe-Based Admission Control
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-3704-1338
2001 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2156, 97-109 p.Article in journal (Refereed) Published
Abstract [en]

Different end-to-end measurement based admission control (MBAC) schemes have recently been proposed to support quality of service for real-time data. All these designs share the idea of decentralizing the admission decision by requiring each end host or gateway to probe the network before sending data. This probing provides certain measurements on the network status that can be used to accept or reject the incoming flow. In this paper, we study a probing procedure to perform an admission decision for a controlled load service (CLS). The admission control offers a reliable upper bound on the packet loss for the new session even with short probing phase durations (e.g. half a second). Our probing mechanism only requires the routers to differentiate between two classes of packets: high priority data and low priority probes. Some simulation results on the performance of the scheme are presented.

Place, publisher, year, edition, pages
2001. Vol. 2156, 97-109 p.
National Category
URN: urn:nbn:se:kth:diva-8722DOI: 10.1007/3-540-45412-8_8OAI: diva2:14120
QC 20100826. Ingår i Proc. of the 2nd COST 263 International Workshop.Available from: 2008-06-10 Created: 2008-06-10 Last updated: 2013-09-09Bibliographically approved
In thesis
1. On Admission Control for IP Networks Based on Probing
Open this publication in new window or tab >>On Admission Control for IP Networks Based on Probing
2008 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The current Internet design is based on a best-effort service, which combines high utilization of network resources with architectural simplicity. As a consequence of this design, the Internet is unable to provide guaranteed or predictable quality of service (QoS) to real-time services that have constraints on end-to-end delay, delay jitter and packet loss.

To add QoS capabilities to the present Internet, the new functions need to be simple to implement, while allowing high network utilization. In recent years, different methods have been investigated to provide the required QoS. Most of these methods include some form of admission control so that new flows are only admitted to the network if the admission does not decrease the quality of connections that are already in progress below some defined level. To achieve the required simplicity a new family of admission control methods, called end-to-end measurement-based admission control moves the admission decision to the edges of the network.

This thesis presents a set of methods for admission control based on measurements of packet loss. The thesis studies how to deploy admission control in an incremental way: First, admission control is included in the audiovisual real-time applications, without any support from the network. Second, admission control is enabled at the transport layer to differentiate between elastic and inelastic flows, by embedding the probing mechanism in UDP and using the inherent congestion control of TCP. Finally, admission control is deployed at the network layer by providing differentiated scheduling in the network for probe and data packets, which then allows the operator to control the blocking probability for the inelastic flows and the average throughput for the elastic flows.

The thesis offers a description of the incremental steps to provide QoS on a DiffServ-based Internet. It analyzes the proposed schemes and provides extensive figures of performance based on simulations and on real implementations. It also shows how the admission control can be used in multicast sessions by making the admission decision at the receiver.

The thesis provides as well two different mathematical analyses of the network layer admission control, which enable operators to obtain initial configuration parameters for the admission decision, like queue sizes, based on the forecasted or measured traffic volume.

The thesis ends by considering a new method for overload control in WLAN cells, closely based on the ideas for admission control presented in the rest of the articles.

Place, publisher, year, edition, pages
Stockholm: KTH, 2008. v, 37 p.
Trita-EE, ISSN 1653-5146 ; 2008:026
Admission control; QoS; IP networks
National Category
urn:nbn:se:kth:diva-4818 (URN)978-91-7415-012-4 (ISBN)
Public defence
2008-06-13, KTH, 13:15
QC 20100826Available from: 2008-06-10 Created: 2008-06-10 Last updated: 2010-08-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Más Ivars, IgnacioKarlsson, Gunnar
By organisation
Microelectronics and Information Technology, IMIT
In the same journal
Lecture Notes in Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 60 hits
ReferencesLink to record
Permanent link

Direct link