RESOURCE-ALLOCATION FOR WORST-CASE TRAFFIC IN ATM NETWORKS

Citation
A. Gravey et al., RESOURCE-ALLOCATION FOR WORST-CASE TRAFFIC IN ATM NETWORKS, Performance evaluation, 30(1-2), 1997, pp. 19-43
Citations number
21
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
ISSN journal
01665316
Volume
30
Issue
1-2
Year of publication
1997
Pages
19 - 43
Database
ISI
SICI code
0166-5316(1997)30:1-2<19:RFWTIA>2.0.ZU;2-U
Abstract
This paper addresses the problem of resource allocation for ATM connec tions carrying either CBR or VER applications, for the first generatio n of ATM equipments. Evaluating the resources needed for the transfer phase of an ATM connection is a first step in the design of a CAC taki ng into account both call and transfer level QoS. The required amount of resources is estimated on the basis of traffic characteristics nego tiated at call set-up, under the assumption that the offered traffic i s a purely periodic pattern of active and inactive periods; this assum ption is currently considered to yield upper bounds for the amount of resources which must be allocated to a connection. The traffic charact eristics, and the corresponding periodic patterns of traffic are obtai ned using the ITU-T specification of ATM traffic control. We identify three frameworks (allocation on the basis of PCR, burst loss and burst delay framework in case of statistical multiplexing) and principles o n which resource allocation can be based in each of these frameworks a re highlighted. (C) 1997 Elsevier Science B.V.