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
Resource sharing in advance reservation agents
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0002-4031-2872
Luleå tekniska universitet.
1998 (English)In: Journal of High Speed Networks, ISSN 0926-6801, E-ISSN 1875-8940, Vol. 7, no 3-4, p. 213-229Article in journal (Refereed) Published
Abstract [en]

We present an architecture where clients can make end-to-end resource reservations through agents. For each domain in the network, there is an agent responsible for immediate and advance admission control. Reservations from different sources to the same destination domain are aggregated as their paths merge toward the destination. We show that network resources can be shared between immediate and advance reservations without being pre-partitioned. Admission control for immediate reservations use information about resources to be allocated for advance reservations in the near future. An important parameter in the admission control algorithm is the so called lookahead time, i.e., the point at which we actually start making resources available for approaching advance reservations by rejecting immediate requests. In our model, preemption of immediate reservations is made in cases where the admission control cannot make resources available through rejection of immediate requests. The risk of preemption can be varied by changing the lookahead time. We explore, with simulations, the effects of providing advance reservations with this model. The results show the cost in terms of resource utilization, rejection probability and preemption probability.

Place, publisher, year, edition, pages
1998. Vol. 7, no 3-4, p. 213-229
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-13504Local ID: cba0ee00-b387-11db-bf94-000ea68e967bOAI: oai:DiVA.org:ltu-13504DiVA, id: diva2:986457
Note

Godkänd; 1998; 20070203 (ysko)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-05-09Bibliographically approved

Open Access in DiVA

fulltext(254 kB)29 downloads
File information
File name FULLTEXT01.pdfFile size 254 kBChecksum SHA-512
349afb6fb8691f6462d932b98d003233bc27eda248f2ac365b9262f2ad7dcd79e5c6cf1b714ae85f6432654d59c4c38769fc128a4c89f113206361ea59b6a91e
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Schelén, OlovPink, Stephen
By organisation
Computer Science
In the same journal
Journal of High Speed Networks
Computer Sciences

Search outside of DiVA

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