A probabilistic priority scheduling discipline for multi-service networks

IEEE Symposium on Computers and Communications - Proceedings

Volumn , Issue , 2001, Pages 450-455

  Jiang, Y ^a   Tham, C K ^a   Ko, C C ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; QUALITY OF SERVICE; QUEUEING THEORY; TELECOMMUNICATION TRAFFIC;

MULTI-SERVICE NETWORKS; PROBABILISTIC PRIORITY (PR) SCHEDULING;

TELECOMMUNICATION NETWORKS;

EID: 0034868346     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. A calculus for network delay, Part I: Network elements in isolation
2. A probabilistic priority scheduling discipline for high speed networks
3. Analysis of a two-class priority queue with Bernoulli schedules
4. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
5. A generalized processor sharing approach to flow control in intergrated services networks: The single-node case
6. Efficient fair queueing using deficit round robin
7. A connectionist implementation of the VCQ ATM switch