Fifty years ago, the author published a paper in Operations Research with the title, “A proof for the queuing formula: L = ãW ” [Little, J. D. C. 1961. A proof for the queuing formula: L = ãW . Oper. Res. 9(3) 383–387]. Over the years, L = ãW has become widely known as “Little’s Law.” Basically, it is a theorem in queuing theory. It has become well known because of its theoretical and practical...

to improve the efficiency of hospital, reduce patients’ waiting time, as well as meet patients’ satisfaction, the optimization of patients’ queuing system which is based on the knowledge of queuing theory has the practical significance in the use of medical equipments. Based on the relevant data of the usage of Bultrasound in a hospital, the distribution model of queuing theory has been analyze...

Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both...

Purpose Each production process in construction is closely connected with the question of costs and deadlines. In every project an investor or customer, as well as the construction company, has to meet the planned completion date and the estimated costs associated with the construction. In practice, determining the duration of construction at minimum costs is still not based on the reliable cal...

AbsmcfA closed-form decomposition approximation for finding the data performance in voicddata queuing systems is presented. The approximation is based on Courtois’ decompositiodaggregation techniques and is applied to Senet hybrid multiplexing, movable boundary frame allocation schemes. The approximation is applied to both infinite and finite buffer systems. In the former case the app...

In this paper we consider the optimal trade-off between average transmission power and average queueing delay for a single user transmitting data over a wireless fading channel. In particular we study the behavior of this trade-off in the regime of asymptotically large power and small delay. Our focus is on channels which require infinite power to minimize the average delay. For such channels, ...

The network delay has a huge impact to the quality of a networked control system. This paper investigates modelling the network delay incurred by control system packets traversing a Mobile Ad Hoc Network from a plant to a controller using the queuing theory. Control systems can become unstable if information is lost or delayed so in this paper we compare voice traffic modelling with control pac...

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...