Minstrel PIE: Curtailing queue delay in unresponsive traffic environments

2019 ◽  
Vol 139 ◽  
pp. 16-31 ◽  
Author(s):  
Sachin D. Patil ◽  
Mohit P. Tahiliani
Keyword(s):  
Author(s):  
Jaeyoung Jung ◽  
Joseph Y. J. Chow

With major investments in electric taxis emerging around the world, there is a need to better understand resource allocation trade-offs in subsidizing electric vehicle taxis (e-taxis) and investing in electric charging infrastructure. This is addressed using simulation experiments conducted in New York City: 2016 taxi pickups/drop-offs, a Manhattan road network (16,782 nodes, 23,337 links), and 212 charging stations specified by a 2013 Taxi & Limousine Commission study. The simulation is based on a platform used to evaluate taxi operations in California and Seoul. Eleven scenarios are analyzed: a baseline of 7,000 non-electric taxis, five scenarios ranging from 1,000 e-taxis to 5,000 e-taxis, and another five scenarios in which the e-taxis have infinite chargers as an upper bound. The study finds that the number of charging locations recommended in the earlier study may be insufficient at some locations even under the 3,000+ e-taxi scenarios. More importantly, despite an average revenue of $260 per taxi for the 7,000 non-electric taxis and about $247 per taxi for electric taxis over the finite charger scenarios, the revenue gap between e-taxis and non-electric taxis in a mixed fleet increases significantly as the e-taxi share increases. This is because the increasing queue delay imposed on e-taxis gives non-electric taxis an increasing competitive advantage, raising their average revenue from $260 per taxi (1,000 e-taxis) up to $286 per taxi (5,000 e-taxis, 150% revenue gap increase), all other operating costs being equal. This has implications for individual versus whole-fleet policies, as the individual-oriented policies may be less effective.


Author(s):  
Laura Poplawski Ma ◽  
Stephen Zabele ◽  
Christophe J. Merlin ◽  
Gregory Lauer ◽  
Stephen Dabideen
Keyword(s):  

Author(s):  
Wisam Mahmood Lafta ◽  
Ahmed A. Alkadhmawee ◽  
Mohammed A. Altaha

The control and transmission of huge data constitute an immense challenge in various types of networks (wired and wireless). Congestion caused by the high traffic and low throughput of huge data continues to be major problems in a heterogeneous platforms such as internet of things (IoT) technology and internet-of-robotic-things (IoRT). The heterogeneous network requires new models and mechanisms to deal with the increased challenges posed by IoT and IoRT. Accordingly, eliminating the issues that emerge has compelled finding improved solutions as a new strategy. This study proposed a new strategy called routing information and distance vector (RIDV) to create the best improvement of a heterogeneous network. The RIDV strategy activates the routing information protocol (RIPv2) on a router in wire network parallel with the ad-hoc on-demand distance vector (AODV) protocol on the wireless network. The RIDV strategy is used to solve the problems of the diversity of heterogeneous networks as the basis of the infrastructure IoRT technology. Hence, this strategy can reduce or avoid congestion through the use of enhanced and effective best routing protocols. Simulation results using OPNET show that the proposed method improved the quality of service (QoS) compared with other related strategies and AODV and RIPv1 protocols in terms of data drop, traffic drop, queue delay, and throughput.


2003 ◽  
Vol 43 (5) ◽  
pp. 619-631 ◽  
Author(s):  
Kyungsup Kim ◽  
Chong-Ho Choi

Author(s):  
Amar A. Mahawish ◽  
Hassan J. Hassan

The congestion on the internet is the main issue that affects the performance of transition data over the network. An algorithm for congestion control is required to keep any network efficient and reliable for transfer traffic data of the users. Many Algorithms had been suggested over the years to improve the control of congestion that occurs in the network such as drop tail packets. Recently there are many algorithms have been developed to overcome the drawback of the drop tail procedure. One of the important algorithms developed is active queue management (AQM) that provides efficient congestion control by reducing drop packets, this technique considered as a base for many other congestion control algorithms schema. It works at the network core (router) for controlling the drop and marking of packets in the router's buffer before the congestion inception. In this study, a comprehensive survey is done on the AQM Algorithm schemas that proposed and modification these algorithms to achieve the best performance, the classification of AQM algorithms based on queue length, queue delay, or both. The advantages and limitations of each algorithm have been discussed. Also, debate the intelligent techniques procedure with AQM algorithm to achieve optimization in performance of algorithm operation. Finally, the comparison has been discussed among algorithms to find the weakness and powerful of each one based on different metrics.


Sign in / Sign up

Export Citation Format

Share Document