IRIS - Institutional Research Information System
IRIS è il sistema di gestione integrata dei dati della ricerca adottato dalla Luiss Guido Carli. Il Catalogo dei prodotti della ricerca della Luiss raccoglie e rende disponibile, dove possibile nel rispetto del diritto d'autore, la produzione scientifica dei docenti e ricercatori dell'Ateneo. Il Catalogo alimenta inoltre i siti docenti del MIUR.
EnglishIn this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any particular arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.
A Robust Connection Admission Control Applicable to Long Range Dependent Traffic / P. L., Conti; H., Saito; DE GIOVANNI, Livia. - In: IEICE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0916-8516. - E81-B:5(1998), pp. 849-857.
| Titolo: | A Robust Connection Admission Control Applicable to Long Range Dependent Traffic | |
| Autori: | ||
| Data di pubblicazione: | 1998 | |
| Rivista: | ||
| Citazione: | A Robust Connection Admission Control Applicable to Long Range Dependent Traffic / P. L., Conti; H., Saito; DE GIOVANNI, Livia. - In: IEICE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0916-8516. - E81-B:5(1998), pp. 849-857. | |
| Abstract: | In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any particular arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound. | |
| Handle: | http://hdl.handle.net/11385/6060 | |
| Appare nelle tipologie: | 01.1 - Articolo su rivista (Article) |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| abstractIEICE1998.pdf | Abstract | DRM non definito | Administrator | |
| IEICE1998.pdf | Documento in Post-print | DRM non definito | Administrator |
Pubblicazioni consigliate
http://hdl.handle.net/11385/6060
Copyright © 2022