دانلود و نمایش مقالات مرتبط با Queueing system::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Queueing system

تعداد مقالات یافته شده: 8
ردیف عنوان نوع
1 A simulation-based heuristic that promotes business profit while increasing the perceived quality of service industries
اکتشاف مبتنی بر شبیه سازی که باعث افزایش سود تجاری ضمن افزایش کیفیت درک شده از صنایع خدمات می شود-2019
This paper tackles the problem of minimising the direct server costs of complex multiple-server queueing systems while improving the quality perceived by customers. The problem is solved by finding the server roster, defined as the allocation of active individual servers in each time interval of the working day. As no closed solution is available at this time, it was obtained by simulation modelling. The complex queueing system was solved by a simulation-based heuristic that includes the dynamic arrivals, entity reneging and/or balking, multi-servicing, and the individual service-time distributions of servers. The distributions of the random variables of single or multiple-branch businesses were identified by sampling procedures for multiple company-branch deployment. The beneficial financial impact of the proposed solution is confirmed in numerical real-life banking scenarios. The quality perceived by customers (evaluated through the expected queueing time) was also improved. Finally, additional insights that might improve the system performance are highlighted.
Keywords: Heuristics | OR in banking | Productivity and competitiveness | Queueing | Simulation
مقاله انگلیسی
2 تحلیل کارایی سیستم‌های صف‌ اولویت‌ با استفاده از شبکه‌های پتری بهنگام
سال انتشار: 2018 - تعداد صفحات فایل pdf انگلیسی: 4 - تعداد صفحات فایل doc فارسی: 13
در این مقاله نتایج تحقیقات و تحلیل کارایی سیستم صف اولویت‌ (PQS) ارائه شده است که از کیفیت سرویس (QOS) پشتیبانی می‌کند. مدل‌های صف‌ اولویت‌ که از سه کلاس ترافیکی (اولویت بالا، متوسط و کم) در معماری 5-3-1 پشتیبانی می‌کنند، مورد طراحی و آزمایش واقع شدند. ارزیابی کارایی سیستم‌های آزمایش شده با استفاده از شبکه‌های پتری بهنگام(زمانبندی شده) انجام شده است. استفاده از ابزارهای شبیه‌سازی در قالب شبکه‌های پتری (PN) برای ارزیابی و اعتبارسنجی زمان انتظار، ساز و کارهای صف‌بندی و شدت ترافیک با استفاده از الگوریتم صف‌بندی مجاز است. ما در این مقاله به این نتیجه خواهیم رسید که مدل‌های شبکه‌های پتری زماندار می‌توانند به طور موثری در مدل‌سازی و تحلیل کارایی سیستم‌های صف‌بندی اولویت مورد استفاده قرار بگیرند.
کلمات کلیدی: تحلیل کارایی | شبکه‌های پتری | سیستم‌های صف‌ اولویت‌ | کیفیت سرویس‌.
مقاله ترجمه شده
3 Performance measurement of data flow processing employing software defined architecture
اندازه گیری عملکرد پردازش داده ها با استفاده از معماری تعریف شده نرم افزار-2018
With the development of information technology, the importance of big data is quickly highlighted. Big data applications show great value to individuals, companies and governments. Recently, researches on the storage and utilization of big data have achieved considerable results. The prosperity of big data applications is a thrust of drawing attention to the system performance such as timeliness, computational and communication resources. Data retransmission caused by the violation of the stringent delay bound may result in the reprocessing of these data, which would have a negative effect on user experience. To fill this gap, a software defined architecture is developed in this work so that the appropriate start point of processing can be found for the data need to be reprocessed. For further improvement of the processing performance, two models are presented to this software defined architecture. In the optimized model, a priority queue is employed to facilitate the processing efficiency. In addition, data flows transmitting through networks exhibit obvious self-similar characteristics. Performance analysis without taking traffic self-similarity into account may lead to unexpected results. In the optimized model, the tightly coupled system makes performance analysis difficult. Therefore, a decomposition approach is employed to divide the coupled system into a group of single server single queue systems. Finally, the developed model is validated through extensive experimental results.
Keywords: Software defined architecture ، Performance measurement ، Data flow processing ، Queueing system ، Self-similar
مقاله انگلیسی
4 Reduced-complexity delay-efficient throughput-optimal distributed scheduling with heterogeneously delayed network-state information
زمان بندی توزیع شده کارآمد با پیچیدگی کاهش یافته و عملکرد بهینه با اطلاعات ناهمگن تاخیردار وضعیت شبکه-2018
We consider the problem of distributed scheduling in wireless communication networks where heterogeneously delayed queue lengths and channel states of all links are available at all the transmitters. In an earlier work (by Reddy et al. in Queueing Systems, 2012), a throughput-optimal scheduling policy (which we refer to henceforth as the policy) for this setting was proposed. We study the policy, and examine its two drawbacks — (i) its huge computational complexity, and (ii) its non-optimal average per-packet queueing delay. We show that the policy unnecessarily constrains itself to work with information that is more delayed than that afforded by the system. We propose a new distributed scheduling policy that fully exploits the common state information available to all transmitters, thereby greatly improving upon the computational complexity and the delay performance relative to those of the policy. We also establish the throughput optimality of our policy analytically. We evaluate the performance of the proposed policy and validate our analytical results through extensive numerical simulation. Thus, our work enlarges the ambit of networks for which throughput-optimal scheduling is practicable.
keywords: Distributed scheduling |Heterogeneous delays |Network state information |Throughput optimality
مقاله انگلیسی
5 Structural properties and exact analysis of energy-aware multiserver queueing systems with setup times
ویژگی های ساختاری و تحلیل واقعی سیستمهای صف بندی چند سروری آگاه از انرژی با زمان های راه اندازی-2018
Energy consumption of today’s datacenters is a constant concern from the standpoints of monetary and environmental costs. An intuitive solution to address these immense energy demands is to turn servers off to incur less costs. As such, many different authors have modelled this problem as an queue where each server can be turned on, with an exponentially distributed setup time, or turned off instantaneously. What policy the model should employ, or rather when each server should be turned on and off is far from a trivial question. A specific policy is often examined, but determining which policy to study can be a difficult process and is often a product of intuition. Moreover, while a specific policy may do comparatively well against another, in general it may be far from optimal. This problem is further accentuated when one considers the case that a policy may do well or even be optimal under a specific cost function, but far from optimal under another. To address this issue we study the structural properties of the optimal policy under linear cost functions, allowing for a significant reduction in the search space. We then leverage these structural properties to intelligently select two policies for further study. Using the recursive renewal reward technique, we offer an exact analysis of these policies alongside offering insights, observations, and implications for how these systems behave. In particular, we provide insight into the question of the number of servers that should remain on at all times under a general cost function.
keywords: Continuous time Markov chain |Markov decision process |Green computing |Energy-aware server |Queueing analysis
مقاله انگلیسی
6 Analysis of a semi-open queueing network with Markovian arrival process
تحلیل یک شبکه صف بندی نیمه باز با فرآیند ورود مارکوف-2018
A semi-open queueing network having a finite number of nodes is considered. The nodes are modeled by single-server queueing systems with a finite buffer and an exponential service time distribution. Customers arrive to the network according to a Markovian arrival process. The number of customers, which can be processed in the network simultaneously, is restricted by a threshold. If the number of customers in the network is less than this threshold, when a new customer arrives, the customer is processed in the network. Choice of the first and the subsequent nodes for service is performed randomly according to a fixed stochastic vector and a transition probability matrix. If the number of customers in the network at the customer arrival epoch is equal to the threshold, the customer is queued into an input buffer with an infinite capacity. Customers in the input buffer are impatient. The stationary behavior of network states is analyzed. The Laplace–Stieltjes transform of the distribution of the customer’s waiting time in the input buffer is obtained. Expressions for computing performance measures of the network are derived. Numerical results are presented. The model is suitable, e.g., for analysis and optimization of wireless telecommunication networks and manufacturing systems with a finite number of machines and workers.
keywords: Queueing network |Restricted access |Markovian arrival process |Wireless telecommunication networks
مقاله انگلیسی
7 Coupled queues with customer impatience
صف های جفت با بی صبری مشتری-2018
Motivated by assembly processes, we consider a Markovian queueing system with multiple coupled queues and customer impatience. Coupling means that departures from all constituent queues are synchronised and that service is interrupted whenever any of the queues is empty and only resumes when all queues are non-empty again. Even under Markovian assumptions, the state–space grows exponentially with the number of queues involved. To cope with this inherent state–space explosion problem, we investigate performance by means of two numerical approximation techniques based on series expansions, as well as by deriving the fluid limit. In addition, we provide closed-form expressions for the first terms in the series expansion of the mean queue content for the symmetric coupled queueing system. By an extensive set of numerical experiments, we show that the approximation methods complement each other, each one being accurate in a particular subset of the parameter space.
keywords: Kitting process |Queues with customer impatience |Regular perturbation |Fluid limit
مقاله انگلیسی
8 مدلسازی و تحلیل عملکرد دیوارهای آتش شبکه
سال انتشار: 2012 - تعداد صفحات فایل pdf انگلیسی: 10 - تعداد صفحات فایل doc فارسی: 29
دیوار‌های آتش شبکه به‌عنوان اولین خط دفاعی در مقابل ترافیک ناخواسته و مخرب با هدف گیری سرورهای اینترنتی عمل می‌کنند. پیش‌بینی عملکرد کلی دیوار آتش برای مهندسان و طراحان امنیت شبکه در ارزیابی اثربخشی و انعطاف‌پذیری دیوار‌های آتش شبکه در برابر حملات DDoS (محروم سازی از سرویس توزیع شده) که معمولاً توسط بات نت های امروزی صورت می‌گیرند، بسیار مهم است. ما در این مقاله، مدل صف بندی تحلیلی را براساس زنجیره‌ی مارکوف نشانده‌شده ارائه می دهیم تا عملکرد دیوارهای آتش مبتنی بر قاعده را هنگام مواجهه با جریان‌های ترافیکی نرمال و همچنین جریان های حمله ی محروم سازی از سرویس توزیع شده با هدفگیری موقعیت های مختلف قاعده، مطالعه و تحلیل کنیم. معادلات را برای ویژگی ها و اندازه گیری های کلیدی عملکرد مهندسی و اهمیت طراحی به دست می آوریم. این ویژگی‌ها و اندازه‌گیری ها عبارتند از: توان عملیاتی، اتلاف بسته، تأخیر بسته و بهره وری CPU دیوار آتش. علاوه بر این، مدل تحلیلی خود را با استفاده از شبیه سازی و اندازه-گیری های تجربی واقعی بررسی و تأیید می کنیم.
اصطلاحات شاخص: دیوارهای آتش شبکه | مدلسازی عملکرد | تحلیل عملکرد | سیستم های صف بندی.
مقاله ترجمه شده
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 11653 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 11653 :::::::: افراد آنلاین: 78