We derive asymptotic expressions for the distribution of the total queue length in a polling model with two classes of customers and unequal service rates. The server employs a scheduling policy that alternately visits each queue, with the maximum number served in each visit potentially being different for each queue. We provide sufficient conditions for the behaviour to lie in one of two regim...

In this study, the disturbance and uncertainty on nonlinear and time varying systems as Active Queue Management (AQM) is analyzed. Many of AQM schemes have been proposed to regulate a queue size close to a reference level with the least variance. We apply a normal range of disturbances and uncertainty such as variable user numbers, variable link capacity, noise, and unresponsive flows, to the t...

Empirical studies show that queue discharge rate is lower than pre-queue capacity in congestion. This the drop phenomenon. All previous research about this event used data during clear weather conditions. first time empirical relationships between and conditions have been studied. Previous triggered by a critical density. Once density reached, expected. We decreases any condition. also prove re...

How to efficiently assign system resource to route the Client demand by Gateway servers is a tricky predicament. In this paper, we tender an enhanced proposal for autonomous recital of Gateway servers under highly vibrant traffic loads. We devise a methodology to calculate Queue Length and Waiting Time utilizing Gateway Server information to reduce response time variance in presence of bursty t...

We study the Tukey layers and convex of a planar point set, which consists n points independently uniformly sampled from polygon with k vertices. show that expected number vertices on first t is O ( log ⁡ / ) 3 2 . also lower bound Ω for both quantities in special cases where = , 4 The implications those results average-case analysis two computational geometry algorithms are then discussed.