|
Volumn 31, Issue 4, 2001, Pages 211-222
|
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
|
Author keywords
End to end delay; Fair queueing; High speed networks; Packet scheduler; QoS; Time complexity
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTER SIMULATION;
DATA FLOW ANALYSIS;
ENCODING (SYMBOLS);
MATRIX ALGEBRA;
MULTIPROCESSING SYSTEMS;
PACKET NETWORKS;
QUALITY OF SERVICE;
REAL TIME SYSTEMS;
TIME SHARING SYSTEMS;
VECTOR QUANTIZATION;
BINARY VECTORS;
END-TO-END DELAY;
FAIR QUEUEING SCHEME;
GENERALIZED PROCESSOR SHARING;
HIGH SPEED NETWORKS;
MULTISERVICE PACKET NETWORKS;
SMOOTHED ROUND ROBIN;
TIME COMPLEXITY PACKET SCHEDULER;
WEIGHT MATRIX;
WEIGHT SPREAD SEQUENCE;
QUEUEING NETWORKS;
|
EID: 0034781942
PISSN: 01464833
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/964723.383076 Document Type: Conference Paper |
Times cited : (56)
|
References (31)
|