The Experts below are selected from a list of 3744 Experts worldwide ranked by ideXlab platform
Madhu Jain - One of the best experts on this subject based on the ideXlab platform.
-
Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
International Journal of Engineering, 2003Co-Authors: M. R. Dhakad, Madhu JainAbstract:This paper provides steady state Queue-size distribution for a G/G/1 Queue by using principle of maximum entropy. For this purpose we have used Average Queue Length and normalizing condition as constraints to derive Queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arrival time is equal to one, the Average Queue Length provided tallies with the results for M/G/1 model. Other particulars cases have also been deduced which match with already existing results.
-
Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
International Journal of Engineering, 1999Co-Authors: Madhu JainAbstract:This paper reports a study on a single server Queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service times are exponentially distributed. By using generating function approach, the transient analysis for the Queue size distribution has been carried out. For steady state, the stability condition and Average Queue Length for various states have been derived. By taking a numerical illustration, the effect of various parameters on the Average Queue Length has been depicted graphically.
Mohamad Assaad - One of the best experts on this subject based on the ideXlab platform.
-
Whittle Index Policy for Multichannel Scheduling in Queueing Systems
arXiv: Networking and Internet Architecture, 2019Co-Authors: Saad Kriouile, Maialen Larranaga, Mohamad AssaadAbstract:In this paper, we consider a Queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total Average Queue Length of the system. This known scheduling problem falls in the framework of Restless Bandit Problems (RBP) for which an optimal solution is known to be out of reach for the general case. The contributions of this paper are as follows. We rely on the Lagrangian relaxation method to characterize the Whittle index values and to develop an index-based heuristic for the original scheduling problem. The main difficulty lies in the fact that, for some Queue states, deriving the Whittle's index requires introducing a new approach which consists in introducing a new expected discounted cost function and deriving the Whittle's index values with respect to the discount parameter $\beta$. We then deduce the Whittle's indices for the original problem (i.e. with total Average Queue Length minimization) by taking the limit $\beta \rightarrow 1$. The numerical results provided in this paper show that this policy performs very well and is very close to the optimal solution for high number of users.
-
ISIT - Whittle Index Policy for Multichannel Scheduling in Queueing Systems
2019 IEEE International Symposium on Information Theory (ISIT), 2019Co-Authors: Saad Kriouile, Maialen Larranaga, Mohamad AssaadAbstract:In this paper, we consider a Queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total Average Queue Length of the system. This known scheduling problem falls in the framework of Restless Bandit Problems (RBP) for which an optimal solution is known to be out of reach for the general case. The contributions of this paper are as follows. We rely on the Lagrangian relaxation method to characterize the Whittle index values and to develop an index-based heuristic for the original scheduling problem. The main difficulty lies in the fact that, for some Queue states, deriving the Whittle’s index requires introducing a new approach which consists in introducing a new expected discounted cost function and deriving the Whittle’s index values with respect to the discount parameter β. We then deduce the Whittle’s indices for the original problem (i.e. with total Average Queue Length minimization) by taking the limit β → 1. The numerical results provided in this paper show that this policy performs very well and is very close to the optimal solution for high number of users.
Lu Zhao-yi - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Threshold RED Algorithm Based on Multiple Priorities
Computer Engineering, 2008Co-Authors: Lu Zhao-yiAbstract:This paper proposes a novel RED algorithm based on multiple priorities namely Preferential Dynamic Threshold-RED(PDT-RED).It can adjust dynamically Average Queue Length thresholds respect to packets' priority and unused buffer space,and realize differentiated services.On the basis of PDT-RED,an optimized scheme——OPDT-RED is presented.Compared with RED,OPDT-RED can reduce loss rates of packets with higher priority by 56%～62% and the Average loss rates of all packets by 33%～41%.It is easy to implement,and satisfies higher buffer utilization.
Wu Qingliang - One of the best experts on this subject based on the ideXlab platform.
-
Traffic Predictability in Self-similar Network and Its Application in AQM
Computer Engineering, 2006Co-Authors: Wu QingliangAbstract:This paper classifies two kinds of predication method of self-similar traffic and compares them.Then it exploits the traffic predictability into active Queue management,and proposes a new AQM algorithm using predictability based on RED.In the simulation experiment,the new algorithm shows superior performance than RED in controlling the Average Queue Length of the router.
Saad Kriouile - One of the best experts on this subject based on the ideXlab platform.
-
Whittle Index Policy for Multichannel Scheduling in Queueing Systems
arXiv: Networking and Internet Architecture, 2019Co-Authors: Saad Kriouile, Maialen Larranaga, Mohamad AssaadAbstract:In this paper, we consider a Queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total Average Queue Length of the system. This known scheduling problem falls in the framework of Restless Bandit Problems (RBP) for which an optimal solution is known to be out of reach for the general case. The contributions of this paper are as follows. We rely on the Lagrangian relaxation method to characterize the Whittle index values and to develop an index-based heuristic for the original scheduling problem. The main difficulty lies in the fact that, for some Queue states, deriving the Whittle's index requires introducing a new approach which consists in introducing a new expected discounted cost function and deriving the Whittle's index values with respect to the discount parameter $\beta$. We then deduce the Whittle's indices for the original problem (i.e. with total Average Queue Length minimization) by taking the limit $\beta \rightarrow 1$. The numerical results provided in this paper show that this policy performs very well and is very close to the optimal solution for high number of users.
-
ISIT - Whittle Index Policy for Multichannel Scheduling in Queueing Systems
2019 IEEE International Symposium on Information Theory (ISIT), 2019Co-Authors: Saad Kriouile, Maialen Larranaga, Mohamad AssaadAbstract:In this paper, we consider a Queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total Average Queue Length of the system. This known scheduling problem falls in the framework of Restless Bandit Problems (RBP) for which an optimal solution is known to be out of reach for the general case. The contributions of this paper are as follows. We rely on the Lagrangian relaxation method to characterize the Whittle index values and to develop an index-based heuristic for the original scheduling problem. The main difficulty lies in the fact that, for some Queue states, deriving the Whittle’s index requires introducing a new approach which consists in introducing a new expected discounted cost function and deriving the Whittle’s index values with respect to the discount parameter β. We then deduce the Whittle’s indices for the original problem (i.e. with total Average Queue Length minimization) by taking the limit β → 1. The numerical results provided in this paper show that this policy performs very well and is very close to the optimal solution for high number of users.
