PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches

Conference Record / IEEE Global Telecommunications Conference

Volumn 1, Issue , 2001, Pages 35-39

  Oki, Eiji ^a   Rojas Cessa, Roberto ^a   Chao, H Jonathan ^a  

^a NTT Corporation   (Japan)

Author keywords

Input buffered switch; Maximal sized matching; Pipeline; Scheduling

Indexed keywords

ALGORITHMS; BUFFER STORAGE; ITERATIVE METHODS; PIPELINE PROCESSING SYSTEMS; SCHEDULING; TELECOMMUNICATION TRAFFIC;

PIPELINE-BASED MAXIMAL-SIZED MATCHING (PMM);

SWITCHING SYSTEMS;

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

References (15)

1. OPTIMA: Scalable, multi-stage, 640-Gbit/s ATM switching system based on advanced electronic and optical WDM technologies
2. On the provision of quality-of-service guarantees for input queued switches
3. A 10-Gb/s (1.25 Gb/s × 8) 4 × 2 0.25-μm CMOS/SIMOX ATM switch based on scalable distributed arbitration
4. CIXB-1: Combined input-one-cell-crosspoint buffered switch
5. Architectural choices in large scale ATM switches
6. Input versus output queueing on a space-division packet switch
7. An algorithm for maximum matching in bipartite gragphs
8. Achieving 100% throughput in an input-queued switches
9. The iSLIP scheduling algorithm for input-queued switches
10. Centralized contention resolution schemes for a large-capacity optical ATM switch
11. Saturn: A terabit packet switch using dual round-robin
12. RRGS-round-robin greedy scheduling for electronic/optical terabit switches
13. Flexible bandwidth allocation in terabit packet switches
14. Analysis of nonblocking ATM switches with multiple input queues