We propose burst based bandwidth reservation method called FRP (Fast Reservation Protocol) in ATM LAN with general topology, and evaluate its performance. In FRP, the bandwidth is allocated on each link on burst basis, not on call basis. This enables an effective use of network resources when it is applied to highly bursty traffic, which can be typically found in data communications. The problem of FRP is that VCs traversing the different number of links experience different blocking probabilities as can be found in the conventional circuit-switching networks. In this paper, we treat a fairness issue in FRP-based ATM local area networks. The Max-Min flow control is adopted as the fair bandwidth allocation method to accomplish the fairness in the throughput. However, the original Max-Min flow control works in a centralized fashion, which is not desirable in the FRP-based ATM LAN. We therefore propose a "semi"-distributed Max-Min flow control suitable to FRP, in which each switch maintains its own local information about bandwidth usage of the connected links. Through simulation experiments, we show that the proposed semi-distributed Max-Min flow control can achieve the fairness among VCs as the original Max-Min flow control when the propagation delays are not large and the number of VCs is not so much.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Naoki WAKAMIYA, Masayuki MURATA, Hideo MIYAHARA, "Fair Bandwidth Allocation in FRP-Based ATM Local Area Networks" in IEICE TRANSACTIONS on Communications,
vol. E79-B, no. 5, pp. 627-638, May 1996, doi: .
Abstract: We propose burst based bandwidth reservation method called FRP (Fast Reservation Protocol) in ATM LAN with general topology, and evaluate its performance. In FRP, the bandwidth is allocated on each link on burst basis, not on call basis. This enables an effective use of network resources when it is applied to highly bursty traffic, which can be typically found in data communications. The problem of FRP is that VCs traversing the different number of links experience different blocking probabilities as can be found in the conventional circuit-switching networks. In this paper, we treat a fairness issue in FRP-based ATM local area networks. The Max-Min flow control is adopted as the fair bandwidth allocation method to accomplish the fairness in the throughput. However, the original Max-Min flow control works in a centralized fashion, which is not desirable in the FRP-based ATM LAN. We therefore propose a "semi"-distributed Max-Min flow control suitable to FRP, in which each switch maintains its own local information about bandwidth usage of the connected links. Through simulation experiments, we show that the proposed semi-distributed Max-Min flow control can achieve the fairness among VCs as the original Max-Min flow control when the propagation delays are not large and the number of VCs is not so much.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e79-b_5_627/_p
Copy
@ARTICLE{e79-b_5_627,
author={Naoki WAKAMIYA, Masayuki MURATA, Hideo MIYAHARA, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair Bandwidth Allocation in FRP-Based ATM Local Area Networks},
year={1996},
volume={E79-B},
number={5},
pages={627-638},
abstract={We propose burst based bandwidth reservation method called FRP (Fast Reservation Protocol) in ATM LAN with general topology, and evaluate its performance. In FRP, the bandwidth is allocated on each link on burst basis, not on call basis. This enables an effective use of network resources when it is applied to highly bursty traffic, which can be typically found in data communications. The problem of FRP is that VCs traversing the different number of links experience different blocking probabilities as can be found in the conventional circuit-switching networks. In this paper, we treat a fairness issue in FRP-based ATM local area networks. The Max-Min flow control is adopted as the fair bandwidth allocation method to accomplish the fairness in the throughput. However, the original Max-Min flow control works in a centralized fashion, which is not desirable in the FRP-based ATM LAN. We therefore propose a "semi"-distributed Max-Min flow control suitable to FRP, in which each switch maintains its own local information about bandwidth usage of the connected links. Through simulation experiments, we show that the proposed semi-distributed Max-Min flow control can achieve the fairness among VCs as the original Max-Min flow control when the propagation delays are not large and the number of VCs is not so much.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Fair Bandwidth Allocation in FRP-Based ATM Local Area Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 627
EP - 638
AU - Naoki WAKAMIYA
AU - Masayuki MURATA
AU - Hideo MIYAHARA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E79-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1996
AB - We propose burst based bandwidth reservation method called FRP (Fast Reservation Protocol) in ATM LAN with general topology, and evaluate its performance. In FRP, the bandwidth is allocated on each link on burst basis, not on call basis. This enables an effective use of network resources when it is applied to highly bursty traffic, which can be typically found in data communications. The problem of FRP is that VCs traversing the different number of links experience different blocking probabilities as can be found in the conventional circuit-switching networks. In this paper, we treat a fairness issue in FRP-based ATM local area networks. The Max-Min flow control is adopted as the fair bandwidth allocation method to accomplish the fairness in the throughput. However, the original Max-Min flow control works in a centralized fashion, which is not desirable in the FRP-based ATM LAN. We therefore propose a "semi"-distributed Max-Min flow control suitable to FRP, in which each switch maintains its own local information about bandwidth usage of the connected links. Through simulation experiments, we show that the proposed semi-distributed Max-Min flow control can achieve the fairness among VCs as the original Max-Min flow control when the propagation delays are not large and the number of VCs is not so much.
ER -