In this paper a study on a link buffer multiplexing scheme, fast buffer reservation (FBR), has been developed. A method for statistically reserving link buffers space to virtual circuits sharing a transmission resource in ATM networks is proposed. It takes advantages from the bursty nature of traffic while preserving user burst integrity. Effective network performance improvements has been observed by simulating real system behaviour in presence of homogeneous sources traffic for different burstiness values. An upper bound on burst loss probability, which can be used at the call set up phase, has been computed. It is useful for assuring a given network quality of service to each accepted virtual circuit, when the new method is adopted
Buffer statistical multiplexing for bursty data calls in ATM network / Beraldi, Roberto; A., Iera; V., Ruggi; S., Marano. - STAMPA. - (1994), pp. 765-769. (Intervento presentato al convegno Singapore ICCS '94 nel 14-18 novembre) [10.1109/ICCS.1994.474161].
Buffer statistical multiplexing for bursty data calls in ATM network
BERALDI, ROBERTO;
1994
Abstract
In this paper a study on a link buffer multiplexing scheme, fast buffer reservation (FBR), has been developed. A method for statistically reserving link buffers space to virtual circuits sharing a transmission resource in ATM networks is proposed. It takes advantages from the bursty nature of traffic while preserving user burst integrity. Effective network performance improvements has been observed by simulating real system behaviour in presence of homogeneous sources traffic for different burstiness values. An upper bound on burst loss probability, which can be used at the call set up phase, has been computed. It is useful for assuring a given network quality of service to each accepted virtual circuit, when the new method is adoptedI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
