Sciweavers

45 search results - page 3 / 9
» Scheduling Communication Requests Traversing a Switch: Compl...
Sort
View
ITNG
2006
IEEE
13 years 11 months ago
K-Selector-Based Dispatching Algorithm for Clos-Network Switches
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
Mei Yang, Mayauna McCullough, Yingtao Jiang, Jun Z...
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 7 days ago
Backlog Aware Scheduling for Large Buffered Crossbar Switches
—A novel architecture was proposed in [1] to address scalability issues in large, high speed packet switches. The architecture proposed in [1], namely OBIG (output buffers with i...
Aditya Dua, Benjamin Yolken, Nicholas Bambos, Wlad...
IPPS
2007
IEEE
14 years 2 days ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 3 days ago
Distributed Scheduling in Input Queued Switches
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...
ICC
2007
IEEE
14 years 3 days ago
Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch
— In this paper, we propose a fair and simple high-performance scheduling algorithm for Combined Input-Crosspoint-Queued Switches, which is called Tracking Fair Quota Allocation ...
Nan Hua, Peng Wang, Depeng Jin, Lieguang Zeng, Bin...