<--- Back to Details
First PageDocument Content
Scheduling algorithms / Queueing theory / Stochastic processes / Adisak Mekkittikul / Thai people / Scheduling / Throughput / Queueing model / Time complexity / Theoretical computer science / Applied mathematics / Mathematics
Date: 2002-01-05 02:29:11
Scheduling algorithms
Queueing theory
Stochastic processes
Adisak Mekkittikul
Thai people
Scheduling
Throughput
Queueing model
Time complexity
Theoretical computer science
Applied mathematics
Mathematics

Add to Reading List

Source URL: tiny-tera.stanford.edu

Download Document from Source Website

File Size: 93,93 KB

Share Document on Facebook

Similar Documents

Introducing Propositional Logic and Queueing Theory with the InfoTraffic Interactive Learning Environments Ruedi Arnold Institute for Pervasive Computing ETH Zurich 8092 Zurich, Switzerland

DocID: 1sNXW - View Document

Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130

DocID: 1rZWk - View Document

Worst-Case Efficiency Analysis of Queueing Disciplines? Damon Mosk-Aoyama ?? and Tim Roughgarden1? ? ? Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, CA 94305

DocID: 1rNMD - View Document

Queueing theory / Telecommunications engineering / Adversarial queueing network / Inter-process communication / Packet loss / Computer network / FIFO / Engineering / Computing / Network management

How real is the threat of instability events predicted by Adversarial Queueing Theory? Daniel S. Berger Martin Karsten

DocID: 1rtNX - View Document

Network performance / Computing / Network management / Information theory / Throughput / Transmission time / Queueing theory / Transmission Control Protocol / Quality of service / Measuring network throughput / Linear network coding / ALOHAnet

1 Optimal Throughput-Delay Scaling in Wireless Networks – Part I: The Fluid Model Abbas El Gamal, James Mammen, Balaji Prabhakar, and Devavrat Shah

DocID: 1rroQ - View Document