The successful operation of the present Internet depends mainly upon TCP/IP which employs end-to-end congestion control mechanisms built in the end hosts. In order to further enhance this paradigm of end-to-end control the Random Early Detection algorithm has been proposed, which starts to mark or drop packets at the onset of congestion. The paper addresses issues related to the choice of queue...

Satellite edge computing (SEC) has garnered significant attention for its potential to deliver services directly users. However, the uneven distribution of receiving tasks among satellites in constellation can lead utilization resources. This paper proposes a task offloading strategy SEC that aims minimize average delay and energy consumption by assigning them appropriate satellite nodes. The a...

This paper deals with the study of multi-server queueing model in a fuzzy environment imposition reneging customers. Entry customers system is assumed to be Poisson process and exponential service time distribution under first-come-first-served basis. Specific this investigation derive various performance measures such as queue length, waiting queue, response optimal number servers explicit for...

A major hurdle of recent x86 superscalar processor designs is limited instruction issue rate due to the overly complex x86 instruction formats. To alleviate this problem, the machine states must be preserved and the instruction address routing paths must be simplified. We propose an instruction address queue, whose queue size has been estimated to handle saving of instruction addresses with thr...

To analyze the performance of multimedia service systems, which have unreliable resources, and to estimate the capacity requirement of the systems, we have developed a capacity planning model using an open queueing network. By acquisition of utilization, queue length of the resources and packet delay, and reliability of the systems, we have derived the service capacity of the systems along with...

  This paper deals with the cellular manufacturing system (CMS) that is based on group technology concepts. CMS is defined as identifying the similar parts that are processed on the same machines and then grouping them as a cell. The most proposed models for solving CMS are focused on cell formation problem while machine layout is considered in few papers. This paper addresses a mathematical mo...

We develop a queueing model for an appointment-based service system that consists of two queues in tandem: the appointment queue followed by the service queue. Customers join the appointment queue when they call for appointments, stay there (not physically) until the appointment time comes, and then leave the appointment queue and may physically join the service queue, and wait there until serv...

The problem considered is that of estimating the tail stationary probability for two exponential server queues in series fed by renewal arrivals. We compute the tail of the marginal queue length distribution at the second queue. The marginal at the first queue is known by the classical result for the GI/M/1 queue. The approach involves deriving necessary and sufficient conditions on the paths o...

We consider the FCFS GI/GI/n queue in the Halfin-Whitt heavy traffic regime, in the presence of heavy-tailed distributions (i.e. infinite variance). We prove that under minimal assumptions, i.e. only that processing times have finite 1 + moment for some > 0 and inter-arrival times have finite second moment, the sequence of stationary queue length distributions, normalized by n 1 2 , is tight in...

We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a measure-valued state descriptor, from which we conclude a similar theorem for the queue length proces...