排隊理論

最新消息

1. 25-0312  期末報告相關事宜(2025.03.12 13:30)

報告時長：約 20 ~ 30 分鐘 

報告主題：排隊理論相關即可 

報告將於4/16開始進行

請在3/26(三) 23:59 前寄信至 ta@cans.ee.ncku.edu.tw

來信時標題：[排隊理論]_學號_期末報告

寄信內容包含以下兩點：
1. 報告主題（排隊理論相關）
2. 有哪一週無法報告

2. 25-0326  期中考相關事宜公告(2025.03.26 16:00)

04/09（三）將進行期中考

考試地點：電機系館 92926

考試時間：13:30 ~ 15:30

考試範圍：04/02 為止之上課內容

可攜帶一張A4筆記進入考場

當天座位表會貼在教室前方， 請同學依照座位表入座。

3. 25-0327  期末報告順序(2025.03.27 16:00)

報告順序公告於下方，順序如有異議，請自行找好同學交換報告週次，並寄信告知更換。 

報告順序與主題

04/16 (三)

1. NQ6131033 Markov Chain-based Data Privacy Prioritizing for Task Scheduling in Digital Twin Edge Networks

2. Q36131045 Viterbi Algorithm

04/23 (三)

1. NQ6121088 Performance Evaluation of an Internet of Healthcare Things for Medical Monitoring Using M/M/c/K Queuing Models

2. P76131644 Modelling of Healthcare IoT Using the Queueing Theory

04/30 (三)

1. Q36134132 Application of Queuing Theory of a Toll Plaza-A-Case Study

2. NQ6121070 Lane Work-Schedule of Toll Station Based on Queuing Theory and PSO-LSTM Model

05/07 (三)

1. NQ6121062 排隊理論相關

2. NQ6121020 Performance Analysis and Optimization on Scheduling Stochastic Cloud Service Requests: A Survey

3. Q36131061 QUEUING THEORY APPLIED IN OUR DAY TO DAY LIFE

05/14 (三)

1. Q36134085 A Queueing Model for Traffic Flow Control in the Road Intersection

2. Q36131320 Blockchain Queueing Theory

3. Q36131362 使用馬可夫模型改善車聯網中的資源分配

05/21 (三)

1. Q36131273 Distributed Economic Dispatch in Power Networks Incorporating Data Center Flexibility

2. Q36131299 Application of queueing theory in health care: A literature review

3. Q36121236 Practical Recommendations On The Application Of Markov Queuing Models With A Restricted Queue

05/28 (三)

1. NQ6124028 A Cloud-Based Computing Framework for Artificial Intelligence Innovation in Support of Multidomain Operations

2. Q36131100 排隊理論與聯邦學習相關

06/04 (三)

1. Q36121210 Day-Ahead Capacity Estimation and Power Management of a Charging Station Based on Queuing Theory

2. Q36121286 markov chain

課程資訊

學分數 3

開課學期 113學年度第二學期

教學目標

1. Markov chains

2. Steady state solutions of Markov chains

3. Transient solutions of Markov chains

4. Aggregation of stiff Markov Chains

5. Single station queueing Systems

6. Queueing Networks

教學大綱

本課程將介紹一些常見的佇列模型以及其數學分析,幫助同學瞭解網路佇列的理論分析:

一、Markov chains

二、Steady state solutions of Markov chains

三、Transient solutions of Markov chains

四、Aggregation of stiff Markov Chains

五、Single station queueing Systems

六、Queueing Networks。

QUEUEING THEORY

課程教材

講義

參考教材

Bolch, Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications.

講授方式

• 講義

成績考評

• 期中考(35%)

• 期末考(35%)

• 小組報告(30%)