Although the resource reservation protocol (RSVP) is considered efficient for fixed access networks, its performance is problematic over wireless links, due to the variable available bandwidth they provide, asking for adaptable resource management techniques. If, for example, the channel quality falls to a level that the available bandwidth cannot support all reservations of admitted flows, then none of them is operating properly. One solution to this problem is to reject one or more of the flows in order to maintain quality of service (QoS) to the rest. In this paper describes a flow rejection mechanism that is based on priorities and bandwidth requirements, and aims at minimizing the number of rejected flows. Simulation results have shown that, compared to a random rejection mechanism, the attained flow rejection probability is significantly reduced, especially for high priority flows, while, at the same time, the bandwidth utilization remains at the same level.
[1]
Mohammad Mirhakkak,et al.
Dynamic bandwidth management and adaptive applications for a variable bandwidth wireless environment
,
2001,
IEEE J. Sel. Areas Commun..
[2]
Scott Shenker,et al.
Integrated Services in the Internet Architecture : an Overview Status of this Memo
,
1994
.
[3]
P. P. White,et al.
RSVP and integrated services in the Internet: a tutorial
,
1997,
IEEE Commun. Mag..
[4]
David L. Black,et al.
An Architecture for Differentiated Service
,
1998
.
[5]
Zheng Wang,et al.
An Architecture for Differentiated Services
,
1998,
RFC.