Heavy traffic response times for a priority queue with linear priorities
Operations Research
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Adaptive proportional delay differentiated services: characterization and performance evaluation
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
Quality-of-service differentiation on the internet: a taxonomy
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
Fair bandwidth sharing and delay differentiation: Joint packet scheduling with buffer management
Computer Communications
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
Enhancing web server relative delay services by an integrated SA-fuzzy logic controller
International Journal of Web Engineering and Technology
| Hi-index | 0.24 |
Proportional delay differentiation (PDD) model is an important approach to relative differentiated services provisioning on the Internet. It aims to maintain pre-specified packet queueing-delay ratios between different classes of traffic at each hop. Existing PDD packet scheduling algorithms are able to achieve the goal in long time-scales when the system is highly utilized. This paper presents a new PDD scheduling algorithm, called Little's average delay (LAD), based on a proof of Little's Law. It monitors the arrival rate of the packets in each traffic class and the cumulative delays of the packets and schedules the packet according to their transient queueing properties in order to achieve the desired class delay ratios in both short and long time-scales. Simulation results show that LAD is able to provide predictable and controllable services in various system conditions and that such services, whenever feasible, can be guaranteed, independent of the distributions of packet arrivals and sizes. In comparison with other PDD scheduling algorithms, LAD can provide the same level of service quality in long time-scales and more accurate and robust control over the delay ratio in short time-scales. In particular, LAD outperforms its main competitors significantly when the desired delay ratio is large.