Guaranteed scheduling for switches with configuration overhead

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2002, Pages 342-351

  Towles, Brian ^a   Dally, William J ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATRIX ALGEBRA; OPTICAL COMMUNICATION; OPTICAL SWITCHES; OPTIMIZATION; THEOREM PROVING;

CONFIGURATION OVERHEAD; EXACT MATCHING ALGORITHM; SCHEDULING SWITCHES;

CONGESTION CONTROL (COMMUNICATION);

EID: 0036343318     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. MEMS technology for optical networking applications
2. A compact, scalable cross-connect switch using total internal reflection due to thermally-generated bubbles
3. Micromachined free-space matrix switches with submillisecond switching time for large-scale optical crossconnect
4. GaAs-based microelectromechanical waveguide switch
5. Electroholographic wavelength selective crossconnect
6. Analysis of a switch matrix for an SS/TDMA system
7. An efficient SS/TDMA time slot assignment algorithm
8. Minimizing the number of switchings in a SS/TDMA system
9. On an algorithm of G. Birkhoff concerning doubly stochastic matrices
10. The variation of the spectrum of a normal matrix
11. On edge coloring bipartite graphs
12. A conflict-free protocol for optical WDMA networks
13. A time-wavelength assignment algorithm for a WDM star network
14. Scheduling transmissions in WDM broadcast-and-select networks
15. Reduced complexity input buffered switches
16. Scheduling of an input-queued switch to achieve maximal throughput
17. Birkhoff-von Neumann input buffered crossbar switches
18. Open shop scheduling to minimize finish time
19. Two-machine open-shop scheduling problem with setup, processing, and removal times separated