Sciweavers

201 search results - page 5 / 41
» An Improved Algorithm for CIOQ Switches
Sort
View
CCR
2006
122views more  CCR 2006»
14 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
TON
2010
115views more  TON 2010»
14 years 4 months ago
Feedback-Based Scheduling for Load-Balanced Two-Stage Switches
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
Bing Hu, Kwan L. Yeung
PRIS
2001
14 years 11 months ago
Improving the Robustness of Parametric Shape Tracking with Switched Multiple Models
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
Jacinto C. Nascimento, Jorge S. Marques
INFOCOM
2005
IEEE
15 years 3 months ago
Improving VoIP quality through path switching
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
Shu Tao, Kuai Xu, Antonio Estepa, Teng Fei, Lixin ...
SIGCOMM
2004
ACM
15 years 3 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong