We consider a system consisting of single transmitter/receiver pair and N channels over which they may communicate. Packets randomly arrive to the transmitter’s queue wait be successfully sent receiver. The transmitter attempt frame transmission on one channel at time, where each includes packet if is in queue. For channel, an attempted successful with unknown probability. objective quickly ide...

Formal modeling is considered one of the fundamental phases in design network algorithms, including Active Queue Management (AQM) schemes. This article focuses on with Petri nets (PNs) a new scheme AQM. innovative AQM based discrete dynamical model random early detection (RED) for controlling bifurcations and chaos Internet congestion control. It incorporates parameters (α,β) that make possible...

AblJract Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service-durations, in both queues, are 'drawn independently from the sarpe distril?uUon. A ~etup time is. incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holding c...

In order to prevent congestion, the current internet uses endto-end congestion control protocol like TCP. In congestion control issues, queue management employed by router has been utmost important. Active queue management (AQM) has been proposed as a router-based mechanism for early detection of congestion inside the network. AQM scheme helps for end-to-end congestion control by having routers...

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n....

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite...