Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
The SP2 high-performance switch
IBM Systems Journal
The Mercury Interconnect Architecture: a cost-effective infrastructure for high-performance servers
Proceedings of the 24th annual international symposium on Computer architecture
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
ATLAS: A Single-Chip ATM Switch for NOWs
CANPC '97 Proceedings of the First International Workshop on Communication and Architectural Support for Network-Based Parallel Computing
A Cost-Effective Hardware Link Scheduling Algorithm for the Multimedia Router (MMR)
ICN '01 Proceedings of the First International Conference on Networking-Part 2
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
MMR: A High-Performance Multimedia Router - Architecture and Design Trade-Offs
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
Switch Scheduling in the Multimedia Router (MMR)
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Scheduling nonuniform traffic in high speed packet switches and routers
Scheduling nonuniform traffic in high speed packet switches and routers
Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Cisco Catalyst QoS: Quality of Service in Campus Networks
Cisco Catalyst QoS: Quality of Service in Campus Networks
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
MMR: A MultiMedia Router architecture to support hybrid workloads
Journal of Parallel and Distributed Computing
Concave piecewise linear service curves and deadline calculations
Information Sciences: an International Journal
Hi-index | 0.00 |
Quality of Service (QoS) support in local and cluster area environments has become an issue of great interest in recent years. Most current high-performance interconnection solutions for these environments have been designed to enhance conventional best-effort traffic performance, but are not well-suited to the special requirements of the new multimedia applications. The MultiMedia Router (MMR) aims at offering hardware-based QoS support within a compact interconnection component. One of the key elements in the MMR architecture are the algorithms used in traffic scheduling. These algorithms are responsible for the order in which information is forwarded through the internal switch. Thus, they are closely related to the QoS-provisioning mechanisms. In this paper, several traffic scheduling algorithms developed for the MMR architecture are described. Their general organization is motivated by chances for parallelization and pipelining, while providing the necessary support both to multimedia flows and to best-effort traffic. Performance evaluation results show that the QoS requirements of different connections are met, in spite of the presence of best-effort traffic, while achieving high link utilizations.