Back to Results
First PageMeta Content
Queueing model / M/M/1 queue / M/G/1 queue / Markov chain / Erlang / Poisson process / Queue area / FIFO / Queue / Statistics / Stochastic processes / Queueing theory


Quantiles of sojourn times Peter G. Harrison William J. Knottenbelt Department of Computing, Imperial College London
Add to Reading List

Document Date: 2007-06-24 09:16:04


Open Document

File Size: 768,58 KB

Share Result on Facebook

Company

GE / semi-Markov / Markov / /

Country

United Kingdom / /

/

Facility

Imperial College London South Kensington Campus / /

IndustryTerm

transaction processing / tractable solution / open tree-like network / analytical solution / open and closed networks / particular server / computer-communication systems / logistical systems / analytical solutions / threequeue network / technology advances / batch processing / closed tree-like queueing network / realistic systems / spectral analysis solution / solvable networks / tree-like networks / on-line transaction processing / tree-like network / operational systems / real-time systems / steady state network / /

Organization

Ku Klux Klan / Peter G. Harrison William J. Knottenbelt Department of Computing / /

Person

Ai / Hans Daduna / Onno Boxma / William J. Knottenbelt / Peter G. Harrison / /

Position

general / recent application / head / /

ProgrammingLanguage

Erlang / /

Technology

Quality of Service / Service Level Agreement / /

SocialTag