3,293 research outputs found
Efficient Resource Management Mechanism for 802.16 Wireless Networks Based on Weighted Fair Queuing
Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases in host devices. This can effectively lead to very huge bottlenecks in the network causing slow sluggish performance, which may eventually reduce the speed of the network. With continuous advancement being the trend in this technology, the proposal of an efficient scheme for wireless resource allocation is an important solution to the problem of congestion. The primary area of focus will be the emerging standard for wireless networks, the 802.16 or “WiMAX”. This project, attempts to propose a mechanism for an effective resource management mechanism between subscriber stations and the corresponding base station
Queuing for an infinite bus line and aging branching process
We study a queueing system with Poisson arrivals on a bus line indexed by
integers. The buses move at constant speed to the right and the time of service
per customer getting on the bus is fixed. The customers arriving at station i
wait for a bus if this latter is less than d\_i stations before, where d\_i is
non-decreasing. We determine the asymptotic behavior of a single bus and when
two buses eventually coalesce almost surely by coupling arguments. Three
regimes appear, two of which leading to a.s. coalescing of the buses.The
approach relies on a connection with aged structured branching processes with
immigration and varying environment. We need to prove a Kesten Stigum type
theorem, i.e. the a.s. convergence of the successive size of the branching
process normalized by its mean. The technics developed combines a spine
approach for multitype branching process in varying environment and geometric
ergodicity along the spine to control the increments of the normalized process
Mixed Polling with Rerouting and Applications
Queueing systems with a single server in which customers wait to be served at
a finite number of distinct locations (buffers/queues) are called discrete
polling systems. Polling systems in which arrivals of users occur anywhere in a
continuum are called continuous polling systems. Often one encounters a
combination of the two systems: the users can either arrive in a continuum or
wait in a finite set (i.e. wait at a finite number of queues). We call these
systems mixed polling systems. Also, in some applications, customers are
rerouted to a new location (for another service) after their service is
completed. In this work, we study mixed polling systems with rerouting. We
obtain their steady state performance by discretization using the known pseudo
conservation laws of discrete polling systems. Their stationary expected
workload is obtained as a limit of the stationary expected workload of a
discrete system. The main tools for our analysis are: a) the fixed point
analysis of infinite dimensional operators and; b) the convergence of Riemann
sums to an integral.
We analyze two applications using our results on mixed polling systems and
discuss the optimal system design. We consider a local area network, in which a
moving ferry facilitates communication (data transfer) using a wireless link.
We also consider a distributed waste collection system and derive the optimal
collection point. In both examples, the service requests can arrive anywhere in
a subset of the two dimensional plane. Namely, some users arrive in a
continuous set while others wait for their service in a finite set. The only
polling systems that can model these applications are mixed systems with
rerouting as introduced in this manuscript.Comment: to appear in Performance Evaluatio
Analysis of a queuing model for slotted ring networks
We study a multi-server multi-queue system which is intended to model a local area network with slotted ring protocol. Two special cases of the model are analysed and the results are used to motivate an approach to approximate mean queue lengths in the general model
- …