Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services

IEEE Transactions on Communications

Volumn 49, Issue 7, 2001, Pages 1145-1147

  Chang, C S ^a   Chen, W J ^a   Huang, H Y ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Generalized processor sharing; Input buffered switches; Rate guarantees; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CROSSBAR EQUIPMENT; SCHEDULING; TELECOMMUNICATION TRAFFIC;

INPUT-BUFFERED CROSSBAR SWITCHES;

SWITCHING SYSTEMS;

EID: 0035390407     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.935153     Document Type: Article

References (10)

1. Tres observaciones sobre el algebra lineal
2. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann
3. Analysis and simulation of a fair queueing algorithm
4. On a theorem of Frobenius-König and J. von Neumann's game of hide and seek
5. ATM input-buffered switches with guaranteed-rate property
6. An efficient SS/TDMA time slot assignment algorithm
7. Input-queued switching with QoS guarantees
8. A generalized processor sharing approach to flow control in integrated service networks: The single-node case
9. A certain zero-sum two-person game equivalent to the optimal assignment problem