Batch Processor Sharing with Hyper-Exponential Service Time

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Sophia Antipolis, France, 03 May 2007

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Batch Processor Sharing with Hyper-Exponential Service Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Batch Processor Sharing with Hyper-Exponential Service Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Batch Processor Sharing with Hyper-Exponential Service Time will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-496994

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.