東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Performance Approximations and Contr...

Yu, Yao.

FindBook

Google Book

Amazon

博客來

Performance Approximations and Controls to Queueing Networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Performance Approximations and Controls to Queueing Networks./
作者:	Yu, Yao.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	167 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Industrial engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10610851
ISBN:	9781369857344

Performance Approximations and Controls to Queueing Networks.
Yu, Yao.

Performance Approximations and Controls to Queueing Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 167 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--North Carolina State University, 2017.

This item is not available from ProQuest Dissertations & Theses.

This dissertation provides closed-form formulas to approximate the performance of general queueing models and effective control policies to reduce congestion in queueing networks. Queueing models are widely used in the analysis of service systems such as call centers and healthcare systems. For the smaller-scale system having exponential distributions, it is possible to obtain exact performance solutions. But when the scale is large or the system is endowed with more realistic stochastic features, it can be extremely difficult to develop closed-form performance formulas. Computer simulations can be used for studying system performance, but they are time-consuming and lack of structural insights. Hence, heavy-traffic limits, obtained from asymptotic analysis on queueing models, are widely used as efficient approximations.

ISBN: 9781369857344Subjects--Topical Terms:

526216
Industrial engineering.

Performance Approximations and Controls to Queueing Networks.
LDR:03780nmm a2200325 4500 001 2156446
005 20180517112611.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9781369857344
035 $a (MiAaPQ)AAI10610851
035 $a AAI10610851
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yu, Yao. $3 2105945
245 1 0 $a Performance Approximations and Controls to Queueing Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 167 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Yunan Liu.
502 $a Thesis (Ph.D.)--North Carolina State University, 2017.
506 $a This item is not available from ProQuest Dissertations & Theses.
520 $a This dissertation provides closed-form formulas to approximate the performance of general queueing models and effective control policies to reduce congestion in queueing networks. Queueing models are widely used in the analysis of service systems such as call centers and healthcare systems. For the smaller-scale system having exponential distributions, it is possible to obtain exact performance solutions. But when the scale is large or the system is endowed with more realistic stochastic features, it can be extremely difficult to develop closed-form performance formulas. Computer simulations can be used for studying system performance, but they are time-consuming and lack of structural insights. Hence, heavy-traffic limits, obtained from asymptotic analysis on queueing models, are widely used as efficient approximations.
520 $a To gain heavy-traffic limits, we need to justify the existence and uniqueness of heavy-traffic limits. Then, by appropriately scaling heavy-traffic limits, we can use to develop approximations for realistic queueing models. However, if approximations sometimes do not perform good, we refine approximations following some engineering principles to enhance the approximation accuracy.
520 $a In this dissertation, we study the heavy-traffic limits for various queueing models (networks) in Chapters 2-5. We start from establishing heavy-traffic limits for loss model (GI/GI/n/0) in Chapter 2. Due to the difficulty, we prove the existence of convergent sequences for GI/GI/ n/0 in the asymptotic analysis but left the uniqueness and the analytical form of heavy-traffic limits unsolved. In Chapters 3 and 4, based on the well established heavy-traffic limits for time-varying queues with customer abandonments (Gt/M/st + GI), we find approximations sometimes become ineffective to approximate system performance. Therefore, we develop simple engineering approximation formulas for the overloaded steady-state multi-server queues (GI/GI/n + GI) and time-varying queues with customer abandonments (Gt/GI/st + GI). We then conduct extensive numerical experiments to test the effectiveness of new approximations across a wide range of model parameters. In Chapter 5, we observe that, in real service systems with dedicated servers, customers usually experience pre-arrival delays before actually arrive at the dedicated server. When the pre-arrival delay is close to zero, the well-studied joining-the-shortest queue (JSQ) policy has been proven effective. However, JSQ starts to degrade significantly as this delay grows. We propose new routing policies which make the queue asymptotically achieve resource pooling and develop the corresponding heavy-traffic limits. We also conduct computer simulations to verify the efficiency of the new policy.
590 $a School code: 0155.
650 4 $a Industrial engineering. $3 526216
650 4 $a Operations research. $3 547123
690 $a 0546
690 $a 0796
710 2 $a North Carolina State University. $b Industrial Engineering. $3 2092179
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0155
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10610851