Back to Results
First PageMeta Content
Scheduling algorithms / Stochastic processes / Scheduling / Gittins index / M/G/1 queue / Priority queue / Pareto distribution / Queueing model / FIFO / Statistics / Queueing theory / Probability and statistics


Optimal Policy for Multi-Class Scheduling in a Single Server Queue Natalia Osipova Urtzi Ayesta
Add to Reading List

Document Date: 2009-06-08 02:58:12


Open Document

File Size: 154,78 KB

Share Result on Facebook

City

Using / Vs1 / San Diego / Vs2 / /

Company

Applied Probability Trust / G/1 QUEUE Let us / John Wiley and Sons / Let us / /

Country

France / /

/

IndustryTerm

class single server / by-product / stochastic systems / policy algorithm / Web traffic / Internet Computing / Internet routers / stochastic varying processing rate / shared-processor systems / Internet access lines / Web service / bottleneck router / Internet traffic measurement / /

Organization

Royal Statistical Society / Least Attained Service / European Commission / PS LAS / U.S. Securities and Exchange Commission / /

Person

Konstantin Avrachenkov / Sophia Antipolis / /

Position

author / scheduler at the packet level / /

Product

Gittins / /

ProvinceOrState

California / /

PublishedMedium

Journal of the ACM / Journal of the Royal Statistical Society / /

Technology

LAS algorithm / Internet routers / bottleneck router / We implement Gittins policy algorithm / Simulation / /

SocialTag