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

Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 30
Author(s):  
Irina Kochetkova ◽  
Yacov Satin ◽  
Ivan Kovalev ◽  
Elena Makeeva ◽  
Alexander Chursin ◽  
...  
Keyword(s):  
Numerical Analysis ◽  
Data Transmission ◽  
Queue Length ◽  
Time Of Day ◽  
Linear Operators ◽  
Processor Sharing ◽  
File Transfer ◽  
Logarithmic Norm ◽  
Elastic Traffic ◽  
Stationary Intensity

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

scholarly journals Ergodicity and perturbation bounds for $M_t/M_t/1$ queue with balking, catastrophes, server failures and repairs

2021 ◽  
Author(s):  
Alexander Zeifman ◽  
Yacov Satin ◽  
Ivan Kovalev ◽  
Sherif Ammar
Keyword(s):  
Rate Of Convergence ◽  
Queue Length ◽  
Specific Model ◽  
Linear Operators ◽  
Logarithmic Norm ◽  
Perturbation Bounds

In this paper, we display methods for the computation of convergence and perturbation bounds for $M_t/M_t/1$ system with balking, catastrophes, server failures and repairs. Based on the logarithmic norm of linear operators, the bounds on the rate of convergence, perturbation bounds, and the main limiting characteristics of the queue-length process are obtained. Finally, we consider the application of all obtained estimates to a specific model.

scholarly journals Some Time-Dependent Properties of Symmetric M/G/1 Queues

2005 ◽  
Vol 42 (01) ◽  
pp. 223-234 ◽  
Author(s):  
Offer Kella ◽  
Bert Zwart ◽  
Onno Boxma
Keyword(s):  
Queue Length ◽  
Marginal Distribution ◽  
Geometric Distribution ◽  
Time Dependent ◽  
Service Discipline ◽  
Processor Sharing ◽  
Tail Behavior ◽  
Exponential Time ◽  
Preemptive Resume ◽  
Number Of Customers

We consider an M/G/1 queue that is idle at time 0. The number of customers sampled at an independent exponential time is shown to have the same geometric distribution under the preemptive-resume last-in-first-out and the processor-sharing disciplines. Hence, the marginal distribution of the queue length at any time is identical for both disciplines. We then give a detailed analysis of the time until the first departure for any symmetric queueing discipline. We characterize its distribution and show that it is insensitive to the service discipline. Finally, we study the tail behavior of this distribution.

scholarly journals Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services

2018 ◽  
Vol 28 (1) ◽  
pp. 141-154 ◽  
Author(s):  
Alexander Zeifman ◽  
Rostislav Razumchik ◽  
Yacov Satin ◽  
Ksenia Kiseleva ◽  
Anna Korotysheva ◽  
...  
Keyword(s):  
Rate Of Convergence ◽  
Queueing Systems ◽  
Approximation Error ◽  
Linear Operators ◽  
Upper And Lower Bounds ◽  
Logarithmic Norm ◽  
Batch Arrivals ◽  
State Dependent ◽  
The Mean ◽  
Number Of Customers

AbstractIn this paper we present a method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically, we consider an inhomogeneous M/M/S queueing system with possible state-dependent arrival and service intensities, and additionally possible batch arrivals and batch service. A unified approach based on a logarithmic norm of linear operators for obtaining sharp upper and lower bounds on the rate of convergence and corresponding sharp perturbation bounds is described. As a side effect, we show, by virtue of numerical examples, that the approach based on a logarithmic norm can also be used to approximate limiting characteristics (the idle probability and the mean number of customers in the system) of the systems considered with a given approximation error.

scholarly journals A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics

1999 ◽  
Vol 12 (4) ◽  
pp. 311-338 ◽  
Author(s):  
Charles Knessl
Keyword(s):  
Diffusion Approximation ◽  
Queue Length ◽  
Heavy Traffic ◽  
Transient Behavior ◽  
Processor Sharing ◽  
Parallel Queues ◽  
Poisson Arrival ◽  
Heavy Traffic Limit ◽  
Service Rates ◽  
Dependent Probability

We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of rate λ and have service rates equal to μ. When both queues are non-empty, the two systems behave independently of each other. However, when one of the queues becomes empty, the corresponding server helps in the other queue. This is called head-of-the-line processor sharing. We study this model in the heavy traffic limit, where ρ=λ/μ→1. We formulate the heavy traffic diffusion approximation and explicitly compute the time-dependent probability of the diffusion approximation to the joint queue length process. We then evaluate the solution asymptotically for large values of space and/or time. This leads to simple expressions that show how the process achieves its stead state and other transient aspects.

scholarly journals Securing RF Communication Using AES-256 Symmetric Encryption: a Performance Evaluation

2018 ◽  
Vol 7 (4.11) ◽  
pp. 217
Author(s):  
A. Jamaluddin ◽  
N. N. Mohamed ◽  
H. Hashim
Keyword(s):  
Data Transmission ◽  
Vital Role ◽  
Performance Comparison ◽  
Transmission Time ◽  
Raspberry Pi ◽  
File Transfer ◽  
Significant Difference ◽  
Rf Communication ◽  
Data Expansion ◽  
Server Architecture

Radio Frequency (RF) communication plays a vital role for sensor node data transmission, which typically runs on top of lightweight protocol such as Constrained Application (CoAP) and Trivial File Transfer Protocol (TFTP). Introducing a cryptographic scheme to the process is known to be the common and most efficient method to protect RF communication. This paper presents the performance comparison of AES-encrypted data transmission over RF communication via Raspberry Pi boards, experimented on a client-server architecture. The performance analysis is measured based on throughput metric and the transmission time delay when sending three types of payload which are, a plaintext data, a ciphertext with padding and a ciphertext without padding. The result from the study indicates that there is a significant difference in data transmission time between the three types of data due to the data expansion factor. The result also showed that adding padding to the ciphertext has increased the data size slightly but not significant enough to affect transmission time of ciphertext. 

The Security of E-Commerce Data Transmission

2013 ◽  
Vol 760-762 ◽  
pp. 596-598
Author(s):  
Guo Fang Zhao ◽  
Zhan You Yan
Keyword(s):  
Electronic Commerce ◽  
Data Transmission ◽  
Data Transfer ◽  
Security Requirements ◽  
File Transfer ◽  
Transmission Unit ◽  
Transfer Unit ◽  
Internal Network ◽  
Large Flow

The amount of data transmission in Electronic commerce (E-commerce) is growing, and the security requirements are also increasing. During the data transmission , the data transmission module is divided into four parts, They are respectively: the Internal network, isolation module, firewall and the untrust domain or external network. At the isolation module, the exchange isolation unit, data transmission unit, file transfer unit, and other units and engines, are set. The security is enhanced in e-commerce in many ways, the large flow of data transfer between different trust domains.

GI/G/1 processor sharing queue in heavy traffic

1994 ◽  
Vol 26 (2) ◽  
pp. 539-555 ◽  
Author(s):  
Sergei Grishechkin
Keyword(s):  
Queue Length ◽  
Branching Processes ◽  
Heavy Traffic ◽  
Processor Sharing ◽  
Traffic Intensity ◽  
Random Measures ◽  
Processing Times ◽  
Processor Sharing Queues ◽  
Limiting Behaviour ◽  
Residual Processing

Consider GI/G/1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.

scholarly journals QoS based Admission Control using Multipath Scheduler for IP over Satellite Networks

2017 ◽  
Vol 7 (6) ◽  
pp. 2958 ◽  
Author(s):  
Lukman Audah ◽  
Zhili Sun ◽  
Haitham Cruickshank
Keyword(s):  
Admission Control ◽  
Queue Length ◽  
Scheduling Algorithm ◽  
Multipath Routing ◽  
Packet Delay ◽  
Satellite Networks ◽  
File Transfer ◽  
Current Time ◽  
Packet Reordering ◽  
Geo Satellites

<p>This paper presents a novel scheduling algorithm to support quality of service (QoS) for multiservice applications over integrated satellite and terrestrial networks using admission control system with multipath selection capabilities. The algorithm exploits the multipath routing paradigm over LEO and GEO satellites constellation in order to achieve optimum end-to-end QoS of the client-server Internet architecture for HTTP web service, file transfer, video streaming and VoIP applications. The proposed multipath scheduler over the satellite networks advocates load balancing technique based on optimum time-bandwidth in order to accommodate the burst of application traffics. The method tries to balance the bandwidth load and queue length on each link over satellite in order to fulfil the optimum QoS level for each traffic type. Each connection of a traffic type will be routed over a link with the least bandwidth load and queue length at current time in order to avoid congestion state. The multipath routing scheduling decision is based on per connection granularity so that packet reordering at the receiver side could be avoided. The performance evaluation of IP over satellites has been carried out using multiple connections, different file sizes and bit-error-rate (BER) variations to measure the packet delay, loss ratio and throughput.</p>

scholarly journals Securing RF Communication Using AES-256 Symmetric Encryption: A Performance Evaluation

2018 ◽  
Vol 7 (4.11) ◽  
pp. 257
Author(s):  
A. Jamaluddin ◽  
N. N. Mohamed ◽  
H. Hashim
Keyword(s):  
Data Transmission ◽  
Vital Role ◽  
Performance Comparison ◽  
Transmission Time ◽  
Raspberry Pi ◽  
File Transfer ◽  
Significant Difference ◽  
Rf Communication ◽  
Data Expansion ◽  
Server Architecture

Radio Frequency (RF) communication plays a vital role for sensor node data transmission, which typically runs on top of lightweight protocol such as Constrained Application (CoAP) and Trivial File Transfer Protocol (TFTP). Introducing a cryptographic scheme to the process is known to be the common and most efficient method to protect RF communication. This paper presents the performance comparison of AES-encrypted data transmission over RF communication via Raspberry Pi boards, experimented on a client-server architecture. The performance analysis is measured based on throughput metric and the transmission time delay when sending three types of payload which are, a plaintext data, a ciphertext with padding and a ciphertext without padding. The result from the study indicates that there is a significant difference in data transmission time between the three types of data due to the data expansion factor. The result also showed that adding padding to the ciphertext has increased the data size slightly but not significant enough to affect transmission time of ciphertext.  

Sign in / Sign up

Export Citation Format

Share Document