查詢教學大綱與進度

教學大綱與進度

課程基本資料：

學年期課號課程名稱階段學分時數修教師班級人撤備註

104-2 210404 排隊理論 1 3.0 3 ★ 吳和庭資工所 16 0 　

學年期	課號	課程名稱	階段	學分	時數	修	教師	班級	人	撤	備註
104-2	210404	排隊理論	1	3.0	3	★	吳和庭	資工所	16	0

教學大綱與進度：

教師姓名吳和庭

Email htwu@ntut.edu.tw

最後更新時間 2016-01-13 09:44:25

課程大綱 1.機率理論基礎 2.隨機變數之產生 3.隨機過程基礎 4.Markovian 排隊系統分析5.Semi-Markovian 排隊系統分析 6.開放及封閉型排隊網路分析 7.隨機存取/網路系統之效能分析 8.系統輸入模式之建立 9.交換網路之模型建立與分析

課程進度 Course Schedule: Week 1-2. Review of Probability Week 3. Poisson Process Week 4-5. Discrete Time Markov Chain (DTMC) Week 6-7. Continuous Time Markov Chain (CTMC) Week 8. Introduction to Queueing Systems Week 9. Simple Markovian Birth and Death Queueing Systems Week 10-11. Advanced Markovian Queueing systems Week 12-13. General Queueing Models Week 14-15. Queueing Networks Week 16-17. Selected Topic: Modeling of Communication Networks Week 18 Final Exam + Project presentation

評量方式與標準 Grading bases: 1. Homeworks + Class participation 30% 2. Mid Term 30% 3. Final Exam + Final Project 40%

使用教材、參考書目或其他 【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】

使用外文原文書：　
Course Webpage: http://www.ntut.edu.tw/~htwu/courses/SP2016QT/SP2016QT.htm Textbooks: 1. Gross, Shortle, Thompson & Harris, “Fundamentals of Queueing Theory”, 4th ed., John Wiley & Sons, 2008. 2. Yates and Goodman, “Probability and Stochastic Processes,” 2nd Ed., John Wiley & Sons, 2005. References: 1. S. Ross, “Introduction to Probability Models”, 7th ed., Academic Press, 2000. 2. Ng Chee-Hock & Soong Boon-Hee, “Queueing Modelling Fundamentals: With Application in Communication Networks,” 2nd ed., John Wiley & Sons.2008. 3. E. Cinlar, “Introduction to Stochastic Processes,” Prentice-Hall, 1975. 4. Bertsekas and Gallager, “Data Networks,” 2nd Ed., Prentice-Hall, 1992. 5. L. Kleinrock, “Queueing Systems,” Vol.1, John Wiley & Sons, 1975. 6. Robertazzi, ”Computer Networks and Systems” 3rd ed., Springer, 2000.

課程諮詢管道

課程對應SDGs指標

備註

教師姓名	吳和庭
Email	htwu@ntut.edu.tw
最後更新時間	2016-01-13 09:44:25
課程大綱	1.機率理論基礎 2.隨機變數之產生 3.隨機過程基礎 4.Markovian 排隊系統分析5.Semi-Markovian 排隊系統分析 6.開放及封閉型排隊網路分析 7.隨機存取/網路系統之效能分析 8.系統輸入模式之建立 9.交換網路之模型建立與分析
課程進度	Course Schedule: Week 1-2. Review of Probability Week 3. Poisson Process Week 4-5. Discrete Time Markov Chain (DTMC) Week 6-7. Continuous Time Markov Chain (CTMC) Week 8. Introduction to Queueing Systems Week 9. Simple Markovian Birth and Death Queueing Systems Week 10-11. Advanced Markovian Queueing systems Week 12-13. General Queueing Models Week 14-15. Queueing Networks Week 16-17. Selected Topic: Modeling of Communication Networks Week 18 Final Exam + Project presentation
評量方式與標準	Grading bases: 1. Homeworks + Class participation 30% 2. Mid Term 30% 3. Final Exam + Final Project 40%
使用教材、參考書目或其他	【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】使用外文原文書：　 Course Webpage: http://www.ntut.edu.tw/~htwu/courses/SP2016QT/SP2016QT.htm Textbooks: 1. Gross, Shortle, Thompson & Harris, “Fundamentals of Queueing Theory”, 4th ed., John Wiley & Sons, 2008. 2. Yates and Goodman, “Probability and Stochastic Processes,” 2nd Ed., John Wiley & Sons, 2005. References: 1. S. Ross, “Introduction to Probability Models”, 7th ed., Academic Press, 2000. 2. Ng Chee-Hock & Soong Boon-Hee, “Queueing Modelling Fundamentals: With Application in Communication Networks,” 2nd ed., John Wiley & Sons.2008. 3. E. Cinlar, “Introduction to Stochastic Processes,” Prentice-Hall, 1975. 4. Bertsekas and Gallager, “Data Networks,” 2nd Ed., Prentice-Hall, 1992. 5. L. Kleinrock, “Queueing Systems,” Vol.1, John Wiley & Sons, 1975. 6. Robertazzi, ”Computer Networks and Systems” 3rd ed., Springer, 2000.
課程諮詢管道
課程對應SDGs指標
備註