A Study of the Fairness of the Fast Reservation Protocol
Fast Reservation Protocol (FRP) is a Traffic Control scheme intended to multiplex bursty data sources. In this paper we focus on the analysis of the FRP when different sources are multiplexed together in order to study the fairness of the protocol. We present two analytical models to analyse the case in which a set of identical sources is multiplexed with another one of higher rate. Analytical results are compared with simulation results.
KeywordsService Time Round Trip Time Type Source Blocking Probability Burst Duration
Unable to display preview. Download preview PDF.
- Bernstein G. M. and Nguyen D. H. (1994) Blocking Reduction in Fast Reservation Protocols, IEEE INFOCOM’94, 9c. 2, 1208–15.Google Scholar
- Enssle J., Briem U. and Kröner H. (1994) Performance Analysis of Fast Reservation Protocols for ATM, IFIP TC6 2nd Workshop on Performance Modelling and Evaluation of ATM Networks, pp. 24/1–24/9.Google Scholar
- ITU (1995) ITU-T Recommendation 1.371, Traffic Control and Congestion Control in B-ISDN (Temporary Document), ITU Telecommunication Standardization Sector Study Group 13, Geneva.Google Scholar
- Neuts M. F. (1989) Chapter 1: The M/G/ 1 Queue and Some of its Variants, in Structured Stochastic Matrices of M/G/ 1 Type and Their Applications, Marcel Dekker, New York.Google Scholar
- Suzuki H. and Tobagi F. A. (1992) Fast Bandwidth Reservation Scheme with multi-Link & Multi-Path Routing in ATM Networks, IEEE INFOCOM’92, 10A. 2, 2233–40.Google Scholar
- Yin N. and Hluchyj M. G. (1994) On Closed-Loop Rate Control for ATM Cell Relay Networks, IEEE INFOCOMN’94, 1c. 4, 99–108.Google Scholar