Congestion avoidance and control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Large deviations of sojourn times in processor sharing queues
Queueing Systems: Theory and Applications
Tail equivalence for some time-shared systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The Foreground-Background queue: A survey
Performance Evaluation
| Hi-index | 0.00 |
We study the mean sojourn times in two M/G/1 weighted round-robin systems: the weight of a customer at any given point in time in the first system is a function of its age (imparted service), while in the second system the weight is a function of the customer's remaining processing time (RPT). We provide a sufficient condition under which the sojourn time of a customer with large service requirement (say, x) and that arrives in the steady state is close to that of a customer which starts a busy period and has the same service requirement. A sufficient condition is then provided for continuity of the performance metric (the mean sojourn time) as the quanta size in the discrete time system converges to 0. We then consider a multi-class system and provide relative ordering of the mean sojourn times among the various classes.