Amanote Research
Register
Sign In
Linear-Complexity Algorithms for QoS Support in Input-Queued Switches With No Speedup
IEEE Journal on Selected Areas in Communications
- United States
doi 10.1109/49.772432
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Networks
Electronic Engineering
Electrical
Communications
Date
June 1, 1999
Authors
A.C. Kam
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
A Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches
Computer Networks and ISDN Systems
Multicast Support in Multi-Chip Centralized Schedulers in Input Queued Switches
Computer Networks
Computer Networks
Communications
Thermal Control for Crossbar-Based Input-Queued Switches
Frame Occupancy-Based Round-Robin Matching Scheme for Input-Queued Packet Switches
A Distributed QoS Scheduler for Smoothing Output Traffic of Input Buffered Switches
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Simulation-Based Comparison of Multimedia Traffic Prioritization Schemes for High-Performance Input-Queued Packet Switches
Journal of Computer Science
Computer Networks
Software
Artificial Intelligence
Communications
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Multicast FCFS Output Queued Switch Without Speedup
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Providing Performance Guarantees for Buffered Crossbar Switches Without Speedup
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Computer Networks
Communications
