Developing Efficient and Effective Algorithms for Complete Analysis of a Class of Vacation Queueing Models

开发高效且有效的算法来完整分析一类假期排队模型

• 批准号: 6584-2013
• 负责人: Alfa, Attahiru
• 金额: $ 3.35万
• 依托单位: University of Manitoba
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=636665
• 关键词: Developing; Efficient; Effective; Algorithms; Complete

Queueing delays are one of the most intolerable, yet inevitable, aspects of all service systems. Vacation queues are a major class of queues that occur very frequently in real life. They are applied to systems in which the server is often interrupted (including priority systems), and more specifically used to approximate polling systems - queues in which service is provided through access to a shared medium. Examples include: wireless local area network, processing of manufacturing pieces at a workstation, traffic intersection control systems, and scheduling of patients, based on priorities, for healthcare procedures such as surgery, echocardiogram, etc, and recently cognitive radio networks. In order to provide effective and efficient services that minimize costs while ensuring the quality of service is at an acceptable level to the system users, managers need mathematical models for analyzing these systems and estimating delays so they can work at reducing them. The existing mathematical models for vacation models are either too complex to implement or make unrealistic simplifying assumptions that render them not truly reflective of the actual systems being represented. Our main goal in this proposal is to develop computationally feasible, efficient and effective tools, based on the matrix-analytic methods, for analyzing this very important class of queueing models. We will construct the models that are truly more representative of commonly occurring vacation systems and explore mathematical structures that make the solutions realistically tractable in terms of creating implementable algorithms. The results of this research include providing tools for accurately studying several classes of protocols in communication systems. This will assist in designing more efficient and cost effective communication systems that guarantee users the quality of service they expect. The results can also be applied in the areas of healthcare, transportation and manufacturing.

排队延迟是所有服务系统中最无法忍受的，但不可避免的方面之一。假期队列是现实生活中经常出现的主要队列。它们应用于通常会中断服务器（包括优先系统）的系统，更专门用于近似投票系统 - 通过访问共享媒体提供服务的队列。示例包括：无线局域网，工作站上的制造件处理，交通交叉控制系统以及基于优先级的患者安排，以进行医疗保健程序，例如手术，超声心动图等以及最近的认知无线电网络。为了提供有效，有效的服务，以最大程度地降低成本，同时确保服务质量对系统用户的可接受水平，经理需要数学模型来分析这些系统并估算延迟，以便他们可以减少它们。现有的度假模型的数学模型要么太复杂了，无法实施或做出不切实际的简化假设，使它们并不能真正反映所代表的实际系统。该提案中我们的主要目标是基于基质分析方法开发计算可行，有效和有效的工具，以分析这一非常重要的排队模型类别。我们将构建真正代表通常发生的度假系统的模型，并探索使解决方案在创建可实施算法方面现实探索的数学结构。这项研究的结果包括提供用于准确研究通信系统中的几类协议的工具。这将有助于设计更高效，更具成本效益的通信系统，以确保用户的服务质量。结果也可以应用于医疗保健，运输和制造领域。