2007/05/03 by Natalia Osipova, Osipova, Natalia
Business, Management and Accounting · Computer Science · Engineering · Mathematics · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #Batch processing #Computer network #Computer science #Distributed computing #Due date #Exponential distribution #Exponential function #FOS: Computer and information sciences #Mathematical optimization #Mathematics #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #Operating system #Poisson distribution #Processor sharing #Queue #Queueing theory #Scheduling (production processes) #Statistics #The Internet #Time-sharing #cs.NI
paper · pdf · doi:10.48550/arxiv.0705.0425
published in arXiv (Cornell University) (Cornell University) · Sophia Antipolis, France, 03 May 2007
arxiv created 2007/06/22 · arxiv updated 2016/09/08
We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, which is used in differentiation between Short and Long flows in the Internet. In the case of hyper-exponential service time distribution we find an analytical expression of the expected conditional response time for the BPS queue. We show, that the expected conditional response time is a concave function of the service time. We apply the received results to the Two Level Processor-Sharing (TLPS) model with hyper-exponential service time distribution and find the expression of the expected response time for the TLPS model. TLPS scheduling discipline can be applied to size-based differentiation in TCP/IP networks and Web server request handling.