Fast matching algorithms for repetitive optimization: An application to switch scheduling

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 1266-1271

  Deb, Supratim ^a   Shah, Devavrat ^b   Shakkottai, Sanjay ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT SENSITIVE GRAMMARS; INFORMATION SCIENCE; QUEUEING NETWORKS; THROUGHPUT;

BUFFERED SWITCH; MATCHING ALGORITHMS; MAXIMUM WEIGHT MATCHING (MWM); SWITCH SCHEDULING;

BUFFER CIRCUITS;

EID: 44049097762     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286659     Document Type: Conference Paper

References (16)