We derive the bounds of the mean queue length of an infinite phase size BMAP/M/1 queue which has anM/M/∞-type phase transition, and use them to evaluate the performance of secure group communication. Secure communication inside a groups on an open network is critical to enhance the internet capability. Extending the usual matrix analysis to the operator analysis, we derive a new estimation of t...

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formulas are derived for the j-th moments (j ∈ N) of the (conditional) stationary sojourn time in the M/G/1—EPS queue with K (K ∈ 0 ∪ N) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. The proposed RAQM algorithm works in two modes: queue-independent and queuedependent. In the queue-independent mode, it only relies on the aggregate traffic input rate to regulate the input rate to the expect...

We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the singleserver retrial queue analyzed in Keilson and Servi [1]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues ([1] and [2]). The main contribution of the present paper is the derivation of the explicit form of the stationary system...

We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numeric...

This paper quantifies the performance of typical functional unit interface designs in single-chip systems. We introduce a specific equation to guide the design of optimal module interfaces. We show how the equation and interface considerations lead to more efficient queue structures for request buffering. For a specific single-chip design, we use simulation to show that: 1) For low request rate...

Scheduling algorithms in CDMA packet systems need to allocate codes and power based on channel state information and queue information. For finite queue sizes, the allocated rate should be less than or equal to the maximum rate required to clear the whole queue. This ensures that resources are not under-utilized. Although queue size and head-of-the-line packet delays have been considered in exi...

We present in this paper the joint optimization of a dynamic queue scheduling scheme for the provision of Quality of Service (QoS) over Wireless Local Area Networks (WLANs). Previous works tune the size of the queue of the scheduler according to the requirements of the users either in terms of expected delay or required throughput. In this paper, we present a joint optimization of the scheduler...

Virtual output queue is the pragmatic and high performance packet switching architecture used to eliminate head-of-line (HOL) problem. There are some simple iterative algorithms proposed for the virtual output queue architecture and lot of research has been done. The detailed simulated analysis of iSlip, FIRM and maximum size matching algorithm called Static round robin (SRR) is investigated in...