dc.contributor.author |
KONTOVASSILIS, KP |
en |
dc.contributor.author |
TSILIGARIDIS, JT |
en |
dc.contributor.author |
STASSINOPOULOS, GI |
en |
dc.date.accessioned |
2014-03-01T01:43:50Z |
|
dc.date.available |
2014-03-01T01:43:50Z |
|
dc.date.issued |
1995 |
en |
dc.identifier.issn |
0140-3664 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/24216 |
|
dc.subject |
BUFFER DIMENSIONING |
en |
dc.subject |
DELAY LOSS-SENSITIVE TRAFFIC |
en |
dc.subject |
LOSS REQUIREMENTS |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.classification |
Telecommunications |
en |
dc.subject.other |
SYSTEMS |
en |
dc.title |
BUFFER DIMENSIONING FOR DELAY-SENSITIVE AND LOSS-SENSITIVE TRAFFIC |
en |
heal.type |
journalArticle |
en |
heal.language |
English |
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. |
en |
heal.publisher |
BUTTERWORTH-HEINEMANN LTD |
en |
heal.journalName |
COMPUTER COMMUNICATIONS |
en |
dc.identifier.isi |
ISI:A1995RC03900001 |
en |
dc.identifier.volume |
18 |
en |
dc.identifier.issue |
5 |
en |
dc.identifier.spage |
315 |
en |
dc.identifier.epage |
328 |
en |