The currently available queue model for multilane traffic control is based on priority discipline. This priority discipline based technique is not suitable to be applied for multilane-multiple intersections, since all vehicles in each lane move simultaneously according to its respective signal phase. In view of this scenario, a new general traffic model for multilane-multiple intersections base...

A family of approaches for the implementation of Dynamic Programming optimization can be improved for real time applications if the queuing stage is improved. The computational cost of maintaining a priority queue (PQ) for the standard Dijkstra’s algorithm has a theoretical lower bound that is function of the queue population. However a perfect PQ is not a necessary condition for implementing t...

Problem definition : This paper studies the optimal design of referral priority programs, in which customers on a waiting list can jump line by inviting their friends to also join list. Academic/practical relevance Recent years have witnessed growing presence programs as novel customer-acquisition strategy for firms that maintain Different variations this scheme are seen practice, raising quest...

The concept of reneging has been exploited to a great extent in recent past by the queuing modelers. Reneging leads to loss of potential customers. Keeping into mind this negative impact of reneging, a new queuing model has been developed which deals with retention of reneged customers. In this paper, we have developed an M/M/1/N queuing model which deals with retention of reneged customers. Th...

Abstract Under many scenarios where resources may be scarce or a good Quality of Service is requirement, appropriately sizing components and devices one the main challenges. New scenarios, such as IoT, mobile cloud computing, edge computing fog have emerged recently. The ability to design, model simulate those infrastructures critical dimension them correctly. Queuing theory models provide appr...

This paper is concerned with the stochastic modeling of processor scheduling and of queuing due to contention for resources in data base management systems. The processing services rendered in searching the data base and retrieving and processing information are modeled explicitly, as is the algorithm used to schedule these services on the processor. The scheduling of the processor is based on ...

Abstract Under the assumption of a low intensity flow incoming requests and high speed their service, M|M|1 system utilization factor model is considered. It estimated for small part observation time. Approximate relations are obtained factor. Its simple probabilistic in form mixture proposed. A comparison with results simulation carried out.