:هلاقم هصلاخ This paper introduces an analytical method for approximating the performance of a -soft real-time system consisting of a number of parallel infinite-capacity single -server queues. The service discipline for the individual queues is earliest-deadline first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all ...

In this paper we consider M/G/1 queueing system. We assume that there is a single server and the customers arrive according to Poisson process with mean and service time distribution is general. Let the state of the system be defined by a pair of variables the number X(t) in the system at epoch t and the elapsed serviced time Y(t) of the customer who is under going service. Then we have studied...

The advent of multimedia applications over wireless networks has necessitated the need for high data rates and a reliable communication over dynamic wireless links. Adaptive Modulation and coding (AMC), Automatic Repeat re-Quest (ARQ) and Forward Error Correction (FEC) have been widely used to overcome the time varying nature of these links and consequently enhancing their performance. When AMC...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP=G=1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP/G/1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

Previously, we derived the two-dimensional transforms of the emptiness function, the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of thes...

In real stochastic systems, the arrival and service processes may not be renewal processes. For example, in many telecommunication systems such as internet traffic where data traffic is bursty, the sequence of inter-arrival times and service times are often correlated and dependent. One way to model this non-renewal behavior is to use Markovian Arrival Processes (MAP’s) and Markovian Service Pr...

We study the departure process of a single server queue with Markovian arrival input and Markov renewal service time. We derive the joint transform of departure time and the number of departures and, based on this transform, we establish several expressions for burstiness (variance) and correlation (covariance sequence) of the departure process. These expressions reveal that burstiness and corr...

EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by ooering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well as immediate actions (useful for performance abstraction), parametrized by priority levels (hence prioritized...

Abstract Here a two-state batch arrivals and batch service Markovian queue with server vacation model has been taken into consideration for its mathematical modelling and performance analysis under transient state. The present Markovian queueing model considers a single server with multiple vacations and both arrivals and services in batches of variable size. Arriving customers are processed by...