IEEE/ACM Transactions on Networking (TON)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
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
IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Computer networks: a systems approach
Computer networks: a systems approach
IP Routers: New Tool for Gigabit Networking
IEEE Internet Computing
Tiny Tera: A Packet Switch Core
IEEE Micro
Exploring the Switch Design Space in a CC-NUMA Multiprocessor Environment
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Providing bandwidth guarantees in an input-buffered crossbar switch
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Issues and trends in router design
IEEE Communications Magazine
On the provision of quality-of-service guarantees for input queued switches
IEEE Communications Magazine
Dynamics of TCP traffic over ATM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Lexicographic QoS scheduling for parallel I/O
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling with QoS in parallel I/O systems
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Fault Tolerant Interleaved Switching Fabrics For Scalable High-Performance Routers
IEEE Transactions on Parallel and Distributed Systems
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
Hi-index | 14.98 |
Input buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling(i FS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100 percent throughput. The iFS is evaluated both under synthetic workload and with Web traces from the Internet. Compared to the commonly used synthetic input, our simulation results reveal significant difference in performance when the real network traffic is employed. We then consider fair scheduling under various buffer management mechanisms and analyze their impact on the fairness in bandwidth allocation. Our studies indicate that early packet discard in anticipation of congestion is necessary and per-flow based buffering is effective for protecting benign users from being adversely affected by misbehaved traffic. Buffer allocation according to bandwidth reservation is especially helpful when the input traffic is highly bursty.