Convergence Bounds for Limited Processor Sharing Queue with Impatience for Analyzing Non-Stationary File Transfer in Wireless Network

نویسندگان

چکیده

The data transmission in wireless networks is usually analyzed under the assumption of non-stationary rates. Nevertheless, they strictly depend on time day, that is, intensity arrival and daily workload profiles confirm this fact. In article, we consider process downloading a file within single network segment unsteady speeds—for arrivals, sizes, losses due to impatience. To simulate scenario, queuing system with elastic traffic used. Formulas are given for main characteristics model: probability blocking new user, average number users service, queue. A method calculating boundaries convergence model proposed, which based logarithmic norm linear operators. rate limiting queue length were also established. For clarity influence parameters, numerical analysis was carried out presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity in the limited processor sharing queue

We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...

متن کامل

Fluid Limits for Processor-Sharing Queues with Impatience

We investigate a processor-sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue or renege before completing service. The random time representing a job’s patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable s...

متن کامل

Fluid approximations for a processor-sharing queue

This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...

متن کامل

Analysis of a non-work conserving Generalized Processor Sharing queue

Abstract. We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general results due to Fayolle et al, we first establish the stability condition for this system. We then determine the functional equation satisfied by the generating function of the numbers of jobs in both queues...

متن کامل

Policy Model for Sharing Network Slices in 5G Core Network

As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10010030