Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Adaptive threshold-based admission control
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0001-5408-0008
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0002-4031-2872
2005 (English)In: ICC 2005: 2005 IEEE International Conference on Communications ; 16 - 20 May 2005, Seoul, Korea, Piscataway, NJ: IEEE Communications Society, 2005, p. 48-52Conference paper, Published paper (Refereed)
Abstract [en]

We present an algorithm for performing dynamic per-link admission control. It is designed to be suitable for deployment using existing quality of service and router techniques. The rationale for the algorithm is to find a bitrate limit for reserved capacity, which enables efficient capacity utilization and statistical multiplexing gain. By using simple traffic meters configured with respect to defined service levels, a network resource controller estimates an admission limit. The estimated limit reflects the ratio between reserved capacity and the aggregate behavior of current flows. Simulations indicate that reliable admission limits can be estimated already at low reservation levels.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2005. p. 48-52
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-39793DOI: 10.1109/ICC.2005.1494319Scopus ID: 2-s2.0-24344491897Local ID: ead18500-b2a1-11db-bf9d-000ea68e967bISBN: 0-7803-8938-7 (print)OAI: oai:DiVA.org:ltu-39793DiVA, id: diva2:1013311
Conference
IEEE International Conference on Communications : 16/05/2005 - 20/05/2005
Note
Godkänd; 2005; 20060922 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2023-10-06Bibliographically approved

Open Access in DiVA

fulltext(125 kB)267 downloads
File information
File name FULLTEXT01.pdfFile size 125 kBChecksum SHA-512
5248c1175381e06110f7ba331533a860c7ccd858ce928ef1718f41e82c5e9cd15cfe938926977e6efe250f618b119c2edbf242f9730d728d9f8b67b1eff16f17
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Sandström, HelenaBodin, UlfSchelén, Olov

Search in DiVA

By author/editor
Sandström, HelenaBodin, UlfSchelén, Olov
By organisation
Embedded Internet Systems LabComputer Science
Computer Sciences

Search outside of DiVA

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

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 108 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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