High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Current issues in packet switch design
ACM SIGCOMM Computer Communication Review
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
Work-conserving distributed schedulers for Terabit routers
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Localized asynchronous packet scheduling for buffered crossbar switches
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Max-Min Fair Scheduling in Input-Queued Switches
IEEE Transactions on Parallel and Distributed Systems
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
Saturn: a terabit packet switch using dual round robin
IEEE Communications Magazine
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
On the speedup required for work-conserving crossbar switches
IEEE Journal on Selected Areas in Communications
Scalable electronic packet switches
IEEE Journal on Selected Areas in Communications
Output-queued switch emulation by fabrics with limited memory
IEEE Journal on Selected Areas in Communications
An evolution to crossbar switches with virtual output queuing and buffered cross points
IEEE Network: The Magazine of Global Internetworking
Credit-based flow control for ATM networks
IEEE Network: The Magazine of Global Internetworking
Packetized smooth switching for buffered crossbar switches
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Generalized dynamic frame sizing algorithm for finite-internal-buffered networks
IEEE Communications Letters
Fair queueing based packet scheduling for buffered crossbar switches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed WFQ scheduling converging to weighted max-min fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Scalability considerations drive the evolution of switch design from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, CICQ switches with credit-based flow control face new challenges of scalability and predictability. In this paper, we propose a novel approach of rate-based smoothed switching, and design a CICQ switch called the smoothed buffered crossbar or sBUX. First, the concept of smoothness is developed from two complementary perspectives of covering and spacing, which, commonly known as fairness and jitter, are unified in the same model. Second, a smoothed multiplexer sMUX is designed that allocates bandwidth among competing flows sharing a link and guarantees almost ideal smoothness for each flow. Third, the buffered crossbar sBUX is designed that uses the scheduler sMUX at each input and output, and a two-cell buffer at each crosspoint. It is proved that sBUX guarantees 100% throughput for real-time services and almost ideal smoothness for each flow. Fourth, an on-line bandwidth regulator is designed that periodically estimates bandwidth demand and generates admissible allocations, which enables sBUX to support best-effort services. Simulation shows almost 100% throughput and multi-microsecond average delay. In particular, neither credit-based flow control nor speedup is used, and arbitrary fabric-internal latency is allowed between line cards and the switch core, simplifying the switch implementation.