查詢結果分析
來源資料
頁籤選單縮合
題 名 | Polling Systems with First-Come-First-Served Service Discipline=先到先服務之輪詢系統 |
---|---|
作 者 | 張國華; | 書刊名 | 中原學報 |
卷 期 | 28:3 2000.09[民89.09] |
頁 次 | 頁85-91 |
分類號 | 448.945 |
關鍵詞 | 輪詢系統; 服務者有服務假期之M/G/l系統; Polling systems; M/G/l queue; Vacations; |
語 文 | 英文(English) |
中文摘要 | 輪詢系統之建立最重要之目的是為了公平性。在大部份之輪詢系統其公平性著眼在等候站,例如服務者會先服務等候隊伍較長之站並在該站服務較多之顧客,然而較少討論顧客間之公平性。本文則探討顧慮顧客間最基本公平性之輪詢系統:顧客先到先服務輪詢系統。 我們分別探討中央控制與分散控制兩種輪詢系統。因有中央控制站,前者之運作直接且簡單而後者之服務者則必須自行搜集顧客到達之時間。在文中我們提出一動態輪詢法則使服務者可按照先到先服務之順序服務顧客。 在將我們的系統關聯至服務者有服務假期之M/G/1系統情況下,我們討論了兩種輪詢系統中顧客之平均等候時間。 |
英文摘要 | One criterion for operating a polling system is the fairness. In most of the polling systems, the fairness is considered on queues. We serve the queue with more customers first or serve more in that queue. However, in some system we should concern more about the fairness issue among customers, for example, we may serve customers on the basic fairness criterion: first-come-first-served (FCFS). In this paper, we study the FCFS polling systems. Both of the central-controlled and distributed systems are investigated. In a central-controlled polling system, the server can always obtain the arrival times of customers and it is easy for him to fulfill this criterion. However, in a distributed polling system, the server must obtain those arrival times by himself. For a distributed system, we propose a semi-dynamic polling policy by which the server can serve customer on the FCFS basis. By further studying the corresponding M/G/1 systems and applying them to our systems, the average waiting times in queue for both systems are derived. |
本系統中英文摘要資訊取自各篇刊載內容。