A bandwidth allocation model for a two-pass RSVP setup mechanism

Authors:
Tsang-Ling Sheu;Guan-Ying Pao
Affiliations:
Department of Electrical Engineering, National Sun Yat-Sen University, NSYSU, Kaohsiung 80424, Taiwan, ROC;Department of Electrical Engineering, National Sun Yat-Sen University, NSYSU, Kaohsiung 80424, Taiwan, ROC
Venue:
Computer Communications
Year:
2003

Citing 3
Cited 0

Two issues in reservation establishment

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Discrete and Combinatorial Mathematics: An Applied Introduction

Discrete and Combinatorial Mathematics: An Applied Introduction
RSVP: a new resource ReSerVation Protocol

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

Traditional one-pass RSVP may encounter a so-called killer reservation problem (KRP), when more than two reservation requests from different receivers are merged. Two-pass with advertising (TPWA) mechanism [RSVP Killer Reservation, Internet Draft, IETF (1999)] is, therefore, presented to inherently avoid the KRP. In this paper, we present an analytical model to reasonably allocate bandwidth in TPWA. TPWA issues pre-engaged bandwidth request at the first pass before effectively reserving bandwidth at the second pass. Since the pre-engaged bandwidth may be used to deliver non-QoS traffic before the second pass is actually enforced, allocation of adequate amount of pre-engaged bandwidth at a router becomes an important issue. We build a model to analyze the resource allocation in TPWA based on recursive law and Markov chains. In the model, we are interested in determining an optimal resource distribution among the pre-engaged bandwidth, the free bandwidth and the reserved bandwidth under the influence of the RSVP parameters, including message request rates, session lifetime, link-state refresh periods, timeout factor, and message loss probability.