SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:kth-203016"
 

Search: id:"swepub:oai:DiVA.org:kth-203016" > A partially-blockin...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • AT, Andersen (author)

A partially-blocking queueing system with CBR/VBR and ABR/UBR arrival streams

  • Article/chapterEnglish2002

Publisher, publication year, extent ...

  • Baltzer Academic Publisher,2002
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-203016
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-203016URI
  • https://doi.org/10.1023/A:1012242313914DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • UT: 000173658100003; ScopusID: 0141462500. QCR 20170322
  • In this paper we consider an ATM transmission link., to which CBR or VBR and ABR or UBR calls arrive according to independent Poisson processes. CBR/VBR calls (characterized by their equivalent bandwidth) are blocked and leave the system if the available link capacity is less than required at the time of arrival. ABR/UBR calls, however, accept partial blocking, meaning that they may enter service even if the available capacity is less than the specified required peak bandwidth, but greater than the so called minimal accepted bandwidth. Partially blocked ABR/UBR calls instead experience longer service time, since smaller given bandwidth entails proportionally longer time spent in the system, as first suggested in [3] and analyzed in details herein. Throughout the life time of an ABR/UBR connection, its bandwidth consumption fluctuates in accordance with the current load on the link but always at the highest possible value up to their peak bandwidth (greedy sources). Additionally, if this minimal accepted bandwidth is unavailable at the time of arrival, ABR/UBR calls are allowed to wait in a finite queue. This system is modeled by a Continuous Time Markov Chain (CTMC) and the CBR/VBR and ABR/UBR blocking probabilities and the mean ABR/UBR waiting- and service times are derived.

Added entries (persons, corporate bodies, meetings, titles ...)

  • S, Blaabjerg (author)
  • Fodor, G (author)
  • M, Telek (author)

Related titles

  • In:Telecommunications Systems: Baltzer Academic Publisher19:1, s. 75-991018-48641572-9451

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
AT, Andersen
S, Blaabjerg
Fodor, G
M, Telek
Articles in the publication
Telecommunicatio ...
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view