TaxishaveavitalroleinthetransportationsystemandInternetofVehicles(IoV)techniquescanbe usedtoimprovethefuelandtimeefficienciesoftaxis.However,theexistingworkdoesnotaddressthe trafficcongestionthatmayoccurwhenalargeamountoftaxisgathersincertainqueuingareas.This paperproposesanadaptiveandhotspot-awaretaxizonequeuingsystemtodealwithth...

Available bandwidth is an important factor that can be used to adapt the sending rate to network conditions, so that packet loss, caused by congestion, can be significantly reduced before error control mechanisms are employed. To this end, we propose an active probing-based queuing delay propagation model (QDPM)-based scheme for available bandwidth estimation. Common assumptions, including use ...

In CT examination, the emergency patients (EPs) have highest priorities in the queuing system and thus the general patients (GPs) have to wait for a long time. This leads to a low degree of satisfaction of the whole patients. The aim of this study is to improve the patients' satisfaction by designing new queuing strategies for CT examination. We divide the EPs into urgent type and emergency typ...

Bufferbloat is excessive latency due to overprovisioned network buffers. PIE and CoDel are two recently proposed Active Queue Management (AQM) algorithms, designed to tackle bufferbloat by lowering the queuing delay without degrading the bottleneck utilization. PIE uses a proportional integral controller to maintain the average queuing delay at a desired level; however, large Round Trip Times (...

The main objective of this research is to simulate and analyze the quality of service (QoS) in Internet Protocol (IP) networks with video traffic. We use network simulator ns-2 to simulate networks and their behaviors in the presence of video traffic. The video traffic is generated by genuine MPEG-1 video traces transmitted over the User Datagram Protocol (UDP). The selected MPEG-1 video traces...

in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...

this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...