A fair resource allocation protocol for multimedia wireless networks

Abstract

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with Quality-of-Service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes

Dynamic buffer tuning: An ambience-intelligent way for digital ecosystem success

“…This finding concurs with those by others (e.g. [4,8]). The mass transit can seriously increase the volume of communication between SFF mobile clients and the surrogate at peak hours.…”

Improving node behaviour in a QoS control environment by means of load-dependent resource redistributions in LANs

“…Then, evidently, no longer a reservation for the worst case would be required but QoS requirements could become violated temporarily, unless applications have the capability to adapt to network changes [26]. For applications tolerating transient fluctuations in the QoS, different approaches for resource management exist, in particular, in the context of wireless networks [27,28].…”

User QoS-based Multi-Channel Assignment Schemes under Multimedia Traffic Conditions

“…For example, the work reported in [2] proposed service-dependent weighted round robin scheduling policies and demonstrated the need to adapt the service user weight on the system load. An example of a channel assignment scheme seeking to fairly distribute available resources can be found in [3]. This proposal first estimates the user needed bandwidth to achieve certain QoS levels.…”

“…Based on such estimates, the reported scheme equally distributes resources among users. However, it is important to note that the work in [3] distributes continuous and infinitively divisible frequency bands. On the other hand, this work focuses on multi-channel assignment policies where radio resources (time slots or codes) are discrete.…”