本論文計有一冊，約五萬字，並分為六章十八節，其旨在於建立一模式來求得自動販 賣通路之經濟規模。茲將內容提要分示如左： １•第一章 緒論：共分五節，第一節研究動機及目的，第二節研究範圍及對象，第 三節研究方法，第四節研究架構，第五章研究假定及限制。 ２•第二章 學理及文獻探討：共分五節，第一節通路通理，第二節經濟規模理論， 第三節排隊理論，第四節存貨理論，第五章相關實證研究。 ３•第三章 自動販賣業特性及發展概況：共分三節，第一節自動販賣業特性，第二 節國外發展概況，第三節國內發展概況。 ４•第四章 分析模型：共分二節，第一節分析模型之前提，第二節分析模型之建立 。 ５•第五章 實證分析：共分二節，第一節實證結果，第二節實證結果之分析。 ６•第六章 結論與建議。

在服務經濟的時代，人們為了提升生活品質越來越重視心靈需求而非過往所重視的物質需求。文化創意產業提供的原創性以及內容扮演越來越重要的角色，文化創意產業近年來在世界各國之經濟地位也漸趨重要；本篇論文提出一個透過網際網路提供台灣國立故宮博物院動態展覽的嶄新影音廣播服務--「故宮影音頻道」。故宮影音頻道意圖透過影音多媒體展示，更全方位且完整地呈現中華文物的精緻特質和內涵，以帶給瀏覽者更清晰具體的文物觀賞體驗，以及激發瀏覽者之創意靈感。 故宮影音頻道為了符合高標準的服務品質以及處理來自世界各地使用者的潛在高峰需求而特別設計負載平衡的機制。本篇論文更進一步地探討故宮影音頻道平台後端作業流程的技術挑戰以及展示提供線上影音廣播服務的具備彈性、靈活、分散特性的雲端平台。首先，我們在雲端平台上建立具有處理大量使用者的負載平衡機制的故宮影音頻道。接著我們讓故宮影音頻道上線進行實驗、收集資料及分析。根據實驗的結果，我們為了維持高標準的服務品質應用排隊理論設計了兩階段的服務系統，最後探討在不同電腦及網路環境下，如何利用該服務系統計算出符合服務品質的設定。 / The iPalace Video Channel is a video-based website and provide people around the world a brand new video-broadcasting service on the Internet which introduces relics in National Palace Museum in Taiwan. The iPalace Video Channel is designed to meet the high standard of service quality which users can watch videos without delay and be capable of coping with potential high peak demands from worldwide. In this paper, first, we establish the iPalace Video Channel and an elastic and reliable mechanism via load balancing that is capable of handling potential huge peak-demand of video services. Second, we conduct an experiment by sampling the video-based service in practice and evaluating the presented approach online. Third, from the finding of evaluation, we establish the two phase service system for delivering video services with high standard of service quality. Finally, we discuss the formal queuing model of video services from which the settings of the queuing system that satisfy acceptable service quality could be calculated under various computer and network environments

本論文中，我們提出基於機場安全檢查的分層排隊理論模型，模型中的旅客基於歷史的安全數據被分成三組。我們運用二維馬可夫過程（two-dimensional Markov process）以及馬可夫調控卜瓦松過程（Markov modulated Poisson process）構建模型的排隊系統並加以分析。我們收集了台灣桃園國際機場和其它兩個機場的旅客數據以驗證我們提出的模型，並運用模擬退火法（simulated annealing）求得近似最佳解（near-optimum solution）。最後我們通過模型的旅客平均等候時間和另外兩種等候模型進行比較，之後得出我們的模型確實可以在不增加成本，甚至提升安全性的同時能夠有效地減少平均等候時間。 / This thesis proposes a tiered inspection system for airport security, wherein passengers are divided into three classes based on historical security records. A two-dimensional Markov process and a Markov modulated Poisson process (MMPP) queue were used in the formulation of the security inspection system. Simulated annealing was then used to obtain near-optimum solution for the model. The efficacy of the proposed model was evaluated using the arrival data of passengers at Taoyuan International Airport and other two international airports. A comparison with two conventional queueing models with regard to the average waiting time demonstrated the effectiveness of the proposed security inspection system in enhancing service efficiency and boosting the level of security.

近年來興起一個前瞻性無線技術，稱之為無線網狀網路（Wireless Mesh Networks），WMNs 以所費低廉方式提供無線網路最後一哩存取Internet，同時具備ad hoc 網路全部優點，例如自我組織（self-organization）、自我組態（self-configuration）等。儘管WMNs 骨幹部分與平面式ad hoc 網路相似，多網卡（multi-radio）的Mesh Routers 節點卻是固定不動且沒有電力限制。有鑑於此，設計於ad hoc 網路上之路由協定並不適合於WMNs。 WCETT（Weighted Cumulated Expected Transmission Time）metric 考量到intra-flow 干擾，卻未捕捉到inter-flow 干擾；而LBAR（Load-Balanced Ad hoc Routing）協定以計算節點之活躍值（nodal activity）與訊務流量干擾選擇路徑，並無支援多網卡路由，LBAR 可以在單一網卡環境表現良好，在多網卡環境卻不一定。因此，我們提出一個WMNs 上考量到Intra/Inter-flow干擾之多網卡路由協定，稱為MiRii。模擬結果顯示出我們路由協定可以改善網路效能，包含了封包成功傳送率及平均點對點延遲。 / A new promising wireless technology has emerged recently, called wireless mesh networks (WMNs). WMNs are inexpensive way to provide wireless last-mile broadband Internet access and have all the advantages of ad hoc network, such as self-organization, self-configuration. Although WMNs backbone is similar to flat ad hoc network, mesh routers with multi-radio are stationary and have no power constraints. As a result, routing protocols designed for ad hoc network may not be appropriate for WMNs. The WCETT (Weighted Cumulated Expected Transmission Time) metric takes intra-flow interference into consideration, but does not capture inter-flow interference. LBAR (Load-Balanced Ad hoc Routing) calculates nodal activity and traffic interference for choosing a path, but does not supporting multi-radio. LBAR may be perform well in single-radio environment, but do not perform as well in multi-radios. Consequently, we incorporate a new Multi-Interface Routing with Intra/Inter-flow Interference in Wireless Mesh Networks, called MiRii. The simulations show that our routing protocol can improve the network performance including the Packet Delivery Ratio and average end-to-end delay.

IEEE 802.16 是一支援都會型無線網路的協定，IEEE 802.16支援PMP模式(點對多點)和網狀模式兩種。在網狀模式中，所有節點的構成仿如ad-hoc方式，並依據在控制性子框中的排程資訊來計算下次遞送時間。在資料傳送之前，會有一段設定連線的時間。這段時間，每一個節點都必須跟鄰節點競爭，以取得廣播它的排程資訊給鄰節點的機會。這樣的行為跟它過去的歷史無關。換句話說，它具有”時間同質性”而適合以隨機程序來模擬。在這篇論文中，我們將用排隊程序來建立排程行為的模型，然後以馬可夫鏈來估計它的平均延遲時間，也就是一節點持續地競爭直到贏為止的這段等待時間。 / The IEEE 802.16 standard is a protocol for wireless metropolitan networks. IEEE 802.16 MAC protocol supports both of PMP (point to multipoint) and Mesh mode. In the mesh mode, all nodes are organized in a fashion similar ad-hoc and calculate their next transmission time based on the scheduling information performed in the control subframe. Before data transmission for a certain node, there is a period of time to setup the connection. During this period, each node has to compete with each other for the opportunity to advertise scheduling messages to its neighbors. This behavior does not depend on past history. In other words, it is a “Time Homogeneous” and suitable for being modeled by stochastic process. In this thesis, we will model this scheduling behavior by queuing process, and apply the Markov Chain to estimate its average delay time which a node keep waiting until it win the competition.

最近，金融科技(FinTech)和行動金融服務，吸引越來越多的目光。新的創新金融科技服務，改變了金融服務的消費行為。行動網路的發展使人們能夠隨時隨地的享受行動銀行的服務已經是個不爭的事實。然而，由於無線網路先天的特性以及行動裝置的移動性，使行動金融的服務品質受到網路不穩定的影響。而且，隨著Bank 3.0時代的來臨，將會有大量的使用者同時使用行動金融服務，特別是在股市開盤以及重大訊息揭露的時候。因著大量使用者瞬間湧入，以及無線網路不穩定的影響，交易系統的效能很可能會時好時壞，所以無法滿足即時金融市場的需求。 本論文中，我們提出「行動銀行訊息即服務」的框架，使系統能夠很容易的水平擴充，並且能夠輕易的實現雙向通訊和雙向交易等多項行動金融服務。為了達到最少成本追求最大利益的目的，我們發展了能夠適應突發流量以及網路不穩定性的任務分配演算法，使得不用增加額外硬體成本的前提下改善系統效能。然後，為了實驗欲模擬大量行動裝置的使用者，我們觀察真實網路的特性並發明了網路延遲自相關模型來驗證我們提出的任務分配演算法。結果顯示，透過此任務分配演算法，確實能夠有效改善系統資源管理的能力。最後，本研究將系統佈署於真實網路環境當中，並且發現進行同樣實驗的結果與採用網路延遲自相關模型的實驗結果一致。因此，本研究間接驗證了網路自相關模型的正確性，以及證明本任務分配演算法，在突發流量和網路不穩定的即時行動金融服務環境下，能有效降低系統響應時間。 / FinTech (financial technology) and mobile financial services are getting more and more attention recently. New innovative FinTech services change the consumption behavior for financial services. It is an indisputable fact development of the mobile Internet allows people to enjoy mobile banking everywhere and anytime. However, due to the nature of wireless networking and the mobility of the mobile device, the quality of mobile financial service will be affected by network instability. Moreover, with the coming of Bank 3.0, a huge amount of users would be in the mobile service of finance simultaneously, especially when the instances of the stock market opening or disclosure of highly important financial message. As the result of bursty traffic and network instability, the performance of transaction system is up and down, making it tough to satisfy the demand of real-time financial markets. In this thesis, we propose a “Mobile Banking Messaging as a Service Framework” that can easily scale out and fulfill functions comprising Bilateral Communication, Bilateral Trading, and many other mobile financial services. To pursuit of the greatest benefit along with investment of the least resources, we develop the task assignment algorithm which can adapt the system to bursty traffic and unstable networks to improve performance for free. Then, in order to simulate a large number of mobile users, we observe the characteristic of real-world network delay and propose a network delay autocorrelation model to verify our task assignment algorithm. The results of experiment show that we could actually use our task assignment algorithm to improve the ability of the system to manage resource. Finally, we deploy our system in a real-world network delay environment and find that the results obtained in the real condition are the same with our simulation results. Therefore, this research can indirectly verify the correctness of the network delay autocorrelation model, and prove that our task assignment algorithm can effectively reduce the system response time for real-time mobile financial service system under bursty traffic and unstable networks.