On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability

AbstractIn this paper, we are interested in wireless schedulingalgorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity.We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of scheduling algorithms collectively referred to as the algorithms. For a given , the -algorithm picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power . We show that when the overflow metric is appropriately modified, the minimum-cost-to-overflow under the -algorithm can be achieved by a simple linear path, and it can be written as the solution of a vector-optimization problem. Using this structural property, we then show that when approaches infinity, the -algorithms asymptotically achieve the largest decay rate of the queueoverflow probability. Finally, this result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow pr obabilities over queuelength ranges of practical interest.

AIM: To Minimize the Queue-Overflow Probability in the wireless Network by using an Scheduling algorithm alpha in the router side. Synopsis: The link scheduling algorithm mainly focuses on to reduce the queue overflow rate over queue length. Let us consider a cellular network in which there are N users to transmit the data through the router in that each user connects with a router to transmit that makes the queue in the other end. To overcome the queue the base station selects user based on the service rate, after it reaches the threshold. The goal is to find algorithms for scheduling the transmissions such that the queues are stabilized at given offered loads. An important result along this direction is the development of the so-called throughput-optimal algorithms. In our system we have approached the scheduling algorithm in the Online Mobile Banking of the Mobile User. Existing System: The Constrained queuing system is used as a model of a radio networks, the server correspond to the link and the constraints disallows simultaneous transmission. At each time slot routing decision are taken for served customer and eligible set consider for activation.

Proposed System:

In scheduling algorithms collectively referred to as the alpha algorithms. For a given, the alpha algorithm picks the user for service at each time that has the largest product of the transmission rate. This result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow probabilities over queue-length ranges of practical interest. Modules:

Client form. Request Send. Queuing in Router. Server Response.

Client Form: In this Mobile user front end will be designed with the following features 1. Login Form. 2. SMS Banking. 3. Account Summary.

4. Bill Payment.

Request Send : Here Client request will be send to Router with transmission Rate .For Example If client Request for Account summary that request will be processed through router with the transmission rate of the specific request in the router. Queuing in Router : Router design will contain the client name, requested service, Request status, Transmission rate and Server Name. In router request will be maintained in the queue until it reaches the threshold value, after it reaches the request will be processed based on the transmission rate. Server Response In this Server will get the details of the client request from the router based on the transmission each request will be served back to router and response will be send to client. After receiving the response from the server it request status will be changed.