Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Probe-based admission control in IP networks
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
2003 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

The current Internet design is based on a best–effortservice, which combines high utilization of network resourceswith simplicity. As a consequence of this design, the Internetis unable to provide guaranteed or predictable quality ofservice (QoS), required to offer real–time services thathave constraints on end–to–end delay, delay jitterand packet loss.

To add QoS capabilities to the present Internet, newfunctions need to be simple to implement, while allowing highnetwork utilization. In recent years, different methods havebeen investigated to provide the required QoS. Most of thesemethods include some form of admission control so that newflows are only admitted to the network if the admission doesnot decrease the quality of connections that are already inprogress below some defined level. To achieve the requiredsimplicity a new family of admission control methods, calledend–to–end measurement–based admission control(EMBAC) moves the admission decision to the edges of thenetwork.

This thesis presents the probe–based admission control(PBAC), which belongs to the family of EMBAC schemes. PBACprovides a reliable upper bound to the packet loss probabilitya flow will suffer in the network. The delay in the network isbounded by using small, packet–scale buffering in therouters. The admission control is done by measuring the lossratio of a stream of probe packets. Probe packets and datapackets of accepted flows are transmitted with low and highpriority respectively, to protect accepted flows from the loadof the probe streams. The probing is done at the peak rate ofthe connection and the flow is accepted if the probe packetloss rate is below a predefined threshold. This procedureensures that the packet loss of accepted flows is always belowthe threshold value.

The thesis offers a description of the probing procedure,with an extensive performance analysis by simulation, as wellas a mathematical model for the admission decision. The authoralso addresses the application of the admission control formulticast communications, and gives a general method to providesecurity features to measurement–based admission controlschemes.

Place, publisher, year, edition, pages
Kista: Mikroelektronik och informationsteknik , 2003. , vii, 21 p.
Identifiers
URN: urn:nbn:se:kth:diva-1571OAI: oai:DiVA.org:kth-1571DiVA: diva2:7494
Note
NR 20140805Available from: 2003-08-04 Created: 2003-08-04Bibliographically approved

Open Access in DiVA

fulltext(1701 kB)319 downloads
File information
File name FULLTEXT01.pdfFile size 1701 kBChecksum MD5
5e4c6ea940a44038817607178687e524a08e2dd322bb4038c94e9878a604d91434887e4d
Type fulltextMimetype application/pdf

By organisation
Microelectronics and Information Technology, IMIT

Search outside of DiVA

GoogleGoogle Scholar
Total: 319 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 251 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf