نتایج جستجو برای: cell formation queuing theory metaheurstic algorithm reliability

تعداد نتایج: 3568492  

2016
Gaetano Carlucci Luca De Cicco Saverio Mascolo

Real-time media communication requires not only congestion control, but also minimization of queuing delays to provide interactivity. In this work we consider the case of real-time communication between web browsers (WebRTC) and we focus on the interplay of an end-to-end delay-based congestion control algorithm, i.e. the Google congestion control (GCC), with two delay-based AQM algorithms, name...

Journal: :Ad Hoc & Sensor Wireless Networks 2015
Hamidreza Tavakoli Jelena V. Misic Majid Naderi Vojislav B. Misic

In this paper, we analyze CSMA-CA access for interconnection of IEEE 802.15.4 beacon enabled network clusters using ordinary network nodes as bridge nodes. Bridge design involves uplink transmission to the coordinator and downlink transmission to the bridge. Bridge periodically visits upper and lower clusters and exchanges data using CSMACA access. We develop the queuing model for bridging algo...

Nadia Bhuiyan Shahram Sharifi Stayaveer.S. Chauhan

This paper presents the idea of creating cells while reducing part-level sequence-dependent setup time in general cellular manufacturing systems (CMS). Setup time reduction in CMS has gained modest attention in the literature. This could be attributed to the fact that the fundamental problem in cell formation in CMS has been mainly related to material handling and machine utilization while setu...

2009
Muhammad Marsudi

Queuing theory is a major topic of applied mathematics that deals with phenomenon of waiting and arises from the use of powerful mathematical analysis to describe production processes. This study examines the use of production capacity of facilities in Fujitsu Components (M) Sdn. Bhd. based on queuing theory. The aim of this study is to achieve an appropriate queuing analytical model and determ...

Journal: :Theor. Comput. Sci. 2009
Marcos A. Kiwi Mauricio Soto Christopher Thraves

We look at routing and scheduling problems on Kelly type networks where the injection process is under the control of an adversary. The novelty of the model we consider is that the adversary injects requests of distinct types. Resources are subject to switch-over delays or setups when they begin servicing a new request class. In this new setting, we study the behavior of sensible policies as in...

2006
Krzysztof GROCHLA Piotr PECKA

A novel Markov-chain model of RED is proposed by the authors in the article. The paper gives a detailed description of the model and some preliminary results for exponential and self-similar traffic. The Markov chain analysis results are verified by a simulation model. 1. The RED (Random Early Drop) active queuing management algorithm The majority of nowadays network technologies is based on tr...

Journal: :CoRR 2015
Srinath Narasimha Joy Kuri

We consider the problem of distributed schedulingin wireless networks where heterogeneously delayed informationabout queue lengths and channel states of all links are availableat all the transmitters. In an earlier work (by Reddy et al. inQueueing Systems, 2012), a throughput optimal scheduling policy(which we refer to henceforth as the R policy) for this setting wasprop...

Journal: :Journal of Industrial Engineering International 2015

Journal: :Agriculture and Agricultural Science Procedia 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید