Despite the widespread deployment of IEEE 802.1 1 Wireless Local Area Network (WLAN) protocol, not much analysis has been done on modeling its performance. In this paper, we modify a previously introduced station model along with a channel model to deduce the channel throughput under finite load traffic. Our approach allows modeling of all system parameters like the channel state and the average service time of a frame. Although our model assumes a Poisson arrival process, the proposed approach could be easily extended to more general processes.

No abstract

No abstract

No abstract

No abstract

No abstract

Abstract.We address the issue of reserving resources at packet switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the Packet-by-Packet Generalized Processor Sharing (PGPS) scheduling discipline. We propose an algorithm for call admission control (CAC) and a number of resource reservation policies that are used to map the end-to-end delay requirement into a local rate to be reserved at each switch. The proposed reservation policies are the uniform reservation (EVEN) policy, the capacity proportional (CP) policy, and the remaining capacity proportional (RCP) policy. We present extensive simulation results to evaluate the performance of these resource allocation policies for various topologies and traffic characteristics. We also propose a resource-based routing algorithm and show the performance gain when it is used.

No abstract