SUMMARYThe token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services. The bandwidth allocation mechanism integrates the leaky bucket structure with priority handling to address the problem of providing quality-of-service (QoS) guarantees to heterogeneous applications in the next generation packet-switched wireless networks. Scheduling algorithms are often tightly integrated with the wireless medium access control (MAC) protocol. However, when heterogeneous wireless systems need to be integrated and interoperate with each other, it is desirable from the QoS provisioning standpoint to decouple scheduling algorithm from the MAC protocol. In this paper we propose a framework of seamless QoS provisioning and the application of TBFQ for uplink and downlink scheduling in wireless networks. We study its performance under a generic medium access framework that enables the algorithm to be generalized to provide QoS guarantees under various medium access schemes. We give a brief analysis of the algorithm and compare its performance with common scheduling algorithms through simulation. Our results demonstrate that TBFQ significantly increases wireless channel utilization while maintaining the same QoS, unlike many fair queuing algorithms, TBFQ does not require timestamping information of each packet arrival}an impractical feature in an already resource scarce environment. This makes TBFQ suitable for wireless multimedia communication.
Spatial Reuse can significantly increase the throughput of optical ring networks by allowing multiple stations to transmit concurrently over distinct segments of the ring. Buffer Insertion Ring (BIR) scheme is widely used to achieve spatial reuse. However, because non-preemptive priority is usually given to the ring (pass-through) traffic, BIR scheme may cause fairness problems in allocating the ring bandwidth among distinct nodes. In this paper, we propose a novel approach that can prevent starvation and maximize the throughput with low complexity. The main idea of this method is that for every node of the ring to provide a separate queue for each source that shares the output link of the particular node. We then fairly allocate the output link bandwidth to all the sources based on the weight of the corresponding queues. Simulations and analysis show that this new scheme can provide fairness with less end-to-end delay compare to BIR scheme.
In this paper a queuing analysis based on Internet traffic measurements is provided. First a finite-size Pareto queuing model for the heavy-tailed behavior of Internet flow traffic is presented. The derivation of the flow blocking probability with a finite buffer based on Internet flow traffic is provided. The flow blocking probability is given as a function of the buffer size, system load and parametera of the measured flow duration distribution. These results are very useful for design trade-off of admission control algorithm or general network engineering where heavy tail phenomenon exists. In addition the behavior of the Internet consecutive packet loss duration (outage duration) is studied. The implicit relationship between heavy tail flow duration and heavy tail outage duration is identitied in queuing aspect.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.