Prediction of Queue Length Considering Upstream Ramp Flow under Abnormal Events on Expressway

2021 ◽  
Author(s):  
Manman He ◽  
Weining Liu ◽  
Yi Tang ◽  
Dihua Sun ◽  
Min Zhao ◽  
...  
Keyword(s):  
Author(s):  
Georgiy Aleksandrovich Popov

The article deals with a two-channel queuing system with a Poisson incoming call flow, in which the application processing time on each of the devices is different. Such models are used, in particular, when describing the operation of the system for selecting service requests in a number of operating systems. A complex system characteristic was introduced at the time of service endings on at least one of the devices, including the queue length, the remaining service time on the occupied device, and the time since the beginning of the current period of employment. This characteristic determines the state of the system at any time. Recurrence relations are obtained that connect this characteristic with its marginal values when there is no queue in the system. The method of introducing additional events was chosen as one of the main methods for analyzing the model. The relationships presented in this article can be used for analysis of the average characteristics of this system, as well as in the process of its simulation. Summarizing the results of work on multichannel systems with an arbitrary number of servicing devices will significantly reduce the time required for simulating complex systems described by sets of multichannel queuing systems.


2020 ◽  
Vol 4 (26) ◽  
pp. 59-66
Author(s):  
A. G. Morozkov ◽  
◽  
M. R. Yazvenko ◽  

The article presents simplified queuing system model of freight marine port. The article discusses the basic elements of queuing system, its mathematical solution and structure. Simulation model was created using AnyLogic to analyze an effect of system capacity on queue length. The results were analyzed and the solution for queue optimization was proposed. Key words: queuing system, simulation modeling, AnyLogic, marine port, servers, queue.


2020 ◽  
Vol 13 (3) ◽  
pp. 422-432
Author(s):  
Madan Mohan Agarwal ◽  
Hemraj Saini ◽  
Mahesh Chandra Govil

Background: The performance of the network protocol depends on number of parameters like re-broadcast probability, mobility, the distance between source and destination, hop count, queue length and residual energy, etc. Objective: In this paper, a new energy efficient routing protocol IAOMDV-PF is developed based on the fixed threshold re-broadcast probability determination and best route selection using fuzzy logic from multiple routes. Methods: In the first phase, the proposed protocol determines fixed threshold rebroadcast probability. It is used for discovering multiple paths between the source and the destination. The threshold probability at each node decides the rebroadcasting of received control packets to its neighbors thereby reducing routing overheads and energy consumption. The multiple paths list received from the first phase and supply to the second phase that is the fuzzy controller selects the best path. This fuzzy controller has been named as Fuzzy Best Route Selector (FBRS). FBRS determines the best path based on function of queue length, the distance between nodes and mobility of nodes. Results: Comparative analysis of the proposed protocol named as "Improved Ad-Hoc On-demand Multiple Path Distance Vector based on Probabilistic and Fuzzy logic" (IAOMDV-PF) shows that it is more efficient in terms of overheads and energy consumption. Conclusion: The proposed protocol reduced energy consumption by about 61%, 58% and 30% with respect to FF-AOMDV, IAOMDV-F and FPAOMDV routing protocols, respectively. The proposed protocol has been simulated and analyzed by using NS-2.


1973 ◽  
Vol 5 (01) ◽  
pp. 153-169 ◽  
Author(s):  
J. H. A. De Smit

Pollaczek's theory for the many server queue is generalized and extended. Pollaczek (1961) found the distribution of the actual waiting times in the model G/G/s as a solution of a set of integral equations. We give a somewhat more general set of integral equations from which the joint distribution of the actual waiting time and some other random variables may be found. With this joint distribution we can obtain distributions of a number of characteristic quantities, such as the virtual waiting time, the queue length, the number of busy servers, the busy period and the busy cycle. For a wide class of many server queues the formal expressions may lead to explicit results.


Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2347
Author(s):  
Yanyan Wang ◽  
Lin Wang ◽  
Ruijuan Zheng ◽  
Xuhui Zhao ◽  
Muhua Liu

In smart homes, the computational offloading technology of edge cloud computing (ECC) can effectively deal with the large amount of computation generated by smart devices. In this paper, we propose a computational offloading strategy for minimizing delay based on the back-pressure algorithm (BMDCO) to get the offloading decision and the number of tasks that can be offloaded. Specifically, we first construct a system with multiple local smart device task queues and multiple edge processor task queues. Then, we formulate an offloading strategy to minimize the queue length of tasks in each time slot by minimizing the Lyapunov drift optimization problem, so as to realize the stability of queues and improve the offloading performance. In addition, we give a theoretical analysis on the stability of the BMDCO algorithm by deducing the upper bound of all queues in this system. The simulation results show the stability of the proposed algorithm, and demonstrate that the BMDCO algorithm is superior to other alternatives. Compared with other algorithms, this algorithm can effectively reduce the computation delay.


2021 ◽  
Author(s):  
Chang-Heng Wang ◽  
Siva Theja Maguluri ◽  
Tara Javidi

Sign in / Sign up

Export Citation Format

Share Document