Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A simulation study of fair queueing and policy enforcement
ACM SIGCOMM Computer Communication Review
Finding Clusters and Planes from 3D Line Segments with Application to 3D Motion Determination
ECCV '92 Proceedings of the Second European Conference on Computer Vision
Burst scheduling: architecture and algorithm for switching packet video
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Delay Guarantee of Virtual Clock Server
Delay Guarantee of Virtual Clock Server
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Sharc: Managing CPU and Network Bandwidth in Shared Clusters
IEEE Transactions on Parallel and Distributed Systems
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Modelling run-time arbitration by latency-rate servers in dataflow graphs
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Provisioning of parameterized quality of service in 802.11e based wireless mesh networks
Mobile Networks and Applications
Service level agreement for multithreaded processors
ACM Transactions on Architecture and Code Optimization (TACO)
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey on performance analysis of embedded and conventional networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Per-domain packet scale rate guarantee for expedited forwarding
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Approximation for a two-class weighted fair queueing discipline
Performance Evaluation
On the modeling of delay and burstiness for calculating throughput
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Characterization of advanced round robin scheduler
WSEAS TRANSACTIONS on COMMUNICATIONS
Flow aggregation using dynamic packet state
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
A self-adversarial approach to delay analysis under arbitrary scheduling
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-by-Packet Generalized Processor Sharing and Self-Clocked Fair Queuing. For networks that employ scheduling algorithms belonging to GR, we present a method for determining an upper bound on end-to-end delay. The method facilitates determination of end-to-end delay bounds for a Variety of sources. We illustrate the method by determining end-to-end delay bounds for sources conforming to Leaky Bucket and exponentially bounded burstiness.