Fair and Stable Resource Allocation Methods for Guaranteed Service

Kazumasa OIDA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E84-B   No.1   pp.71-80
Publication Date: 2001/01/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Internet
Keyword: 
guaranteed service,  fairness,  deadlock,  RSVP,  admission control,  

Full Text: PDF(904.3KB)>>
Buy this Article




Summary: 
This paper deals with deadlock and fairness issues that may arise when network users request resources for guaranteed service with the resource reservation protocol (RSVP). A deadlock occurs when a request can only be satisfied if the resources reserved for another request are released, but the reserved resources are never released. The fairness issue occurs when some reservation requests may be satisfied but only after a very long wait. Our approach to these issues is based on our belief that a network should provide stable throughput and fairness whatever the behavior of the user. Our methods are unique in two respects. First, during the session setup phase, a node directly connected to the requesting users terminates the users' behavior and makes reservations fairly and efficiently in place of the users. Second, our three admission control methods allocate resources for each reservation request by considering not only the current residual bandwidth but also the properties of the requesting session; e.g., its weight (the number of resources it requires) or its age (how long it has been waiting for session setup). Our methods do not maximize the throughput since they always keep a certain amount of resources unreserved for fairness. From simulation results, however, they do provide quite fair behavior, and their throughput is stable regardless of the network size and the session holding time.