نتایج جستجو برای: cell formation queuing theory metaheurstic algorithm reliability
تعداد نتایج: 3568492 فیلتر نتایج به سال:
Since wireless resources are limited, an efficient way of utilizing wireless resources is needed in selecting IDSs. We propose a monitoring node selection scheme for intrusion detection in congested wireless sensor network. Network congestion is an important issue in mobile network. The network congestion does not guarantee a proper detection rate and congested networks should cause an unreliab...
We study the problem of predicting the performance of wormhole routed networks. A model of a single wormhole router is developed, and unlike previous methods we do the development by a probability analysis rather than queuing theory. The model is evaluated through a series of it level simulations. Then we indicate how our model can be extended to networks of routers, and argue that this extensi...
The Cell Formation Problem (CFP) involves the clustering of machines to enhance productivity and capitalize on various benefits. This study addresses a variant problem where alternative routes machine reliability are included, which we call Generalized with Machine Reliability (GCFP-MR). is known be NP-Hard, finding efficient solutions utmost importance. Metaheuristics have been recognized as e...
Roughly speaking, Large Deviations is a theory of rare events. It is probably the most active field in probability theory at present, one which has many surprising ramifications. One of its applications is to the analysis of the tails of probability distributions and, in recent years, this aspect of the theory has been widely used in queuing theory. The aim of this tutorial is to introduce the ...
In this paper, we are going to present the simulation results of comparison of five queuing algorithms (Drop Tail, Fair Queuing, Stochastic Fair Queuing, Deficit Round Robin and Random Early Detection) using ns-2 as simulation environment. Comparison of the queuing algorithms is based on attack-intensity. We are checking the performance of each queuing algorithm on a particular queue limit agai...
Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays ma...
a r t i c l e i n f o During the course of a construction project, there are many situations in which formation of waiting lines or queues is inevitable. The effect of resource delays in queues on the overall project completion time and cost has motivated researchers to employ simulation for analysis of queuing systems in order to identify the best operational strategies to reduce the time wast...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید