HEAL DSpace

Buffer dimensioning for delay- and loss-sensitive traffic

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Kontovassilis, KP en
dc.contributor.author Tsiligaridis, JT en
dc.contributor.author Stassinopoulos, GI en
dc.date.accessioned 2014-03-01T01:10:50Z
dc.date.available 2014-03-01T01:10:50Z
dc.date.issued 1995 en
dc.identifier.issn 01403664 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/11463
dc.subject buffer dimensioning en
dc.subject delay/loss-sensitive traffic en
dc.subject loss requirements en
dc.subject.other Algorithms en
dc.subject.other Asynchronous transfer mode en
dc.subject.other Bandwidth en
dc.subject.other Buffer circuits en
dc.subject.other Computer networks en
dc.subject.other Mathematical models en
dc.subject.other Queueing theory en
dc.subject.other Random processes en
dc.subject.other Resource allocation en
dc.subject.other Buffer dimensioning en
dc.subject.other Buffer entry priorities en
dc.subject.other Buffer exit priorities en
dc.subject.other Buffer sharing schemes en
dc.subject.other Delay sensitive traffic en
dc.subject.other Loss requirements en
dc.subject.other Loss sensitive traffic en
dc.subject.other Telecommunication traffic en
dc.title Buffer dimensioning for delay- and loss-sensitive traffic en
heal.type journalArticle en
heal.identifier.primary 10.1016/0140-3664(95)96833-C en
heal.identifier.secondary http://dx.doi.org/10.1016/0140-3664(95)96833-C en
heal.publicationDate 1995 en
heal.abstract Multiplexing of delay- and loss-sensitive traffic requires a common analytical framework for buffer dimensioning, buffer sharing schemes, as well as buffer entry and exit priorities. This paper performs a relevant study by employing discrete-time queueing techniques, appropriate for the small buffer sizes envisaged in ATM technology. The model, solution method and relevant metrics are presented. The numerical results are critically reviewed. These give rise to a buffer dimensioning algorithm. Loss requirements are primarily satisfied. However, an acceptable upper bound for the delay of the delay-sensitive traffic can also be accommodated. © 1995. en
heal.journalName Computer Communications en
dc.identifier.doi 10.1016/0140-3664(95)96833-C en
dc.identifier.volume 18 en
dc.identifier.issue 5 en
dc.identifier.spage 315 en
dc.identifier.epage 328 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής