...
首页> 外文期刊>Journal of Mathematical Sciences >PERFORMANCE SIMULATION OF FINITE-SOURCE COGNITIVE RADIO NETWORKS WITH SERVERS SUBJECTS TO BREAKDOWNS AND REPAIRS
【24h】

PERFORMANCE SIMULATION OF FINITE-SOURCE COGNITIVE RADIO NETWORKS WITH SERVERS SUBJECTS TO BREAKDOWNS AND REPAIRS

机译:带有故障和修复的带有服务器的有限源认知无线电网络的性能模拟

获取原文
获取原文并翻译 | 示例
           

摘要

The present paper deals with the performance evaluation of a cognitive radio network with the help of a queueing model. The queueing system contains two interconnected, not independent sub-systems. The first part is for the requests of the Primary Units (PU). The number of sources is finite, and each source generates high priority requests after a exponentially distributed time. The requests are sent to a single server unit or Primary Channel Service (PCS) with a preemptive priority queue. The service times are assumed to be exponentially distributed. The second sub-system is for the requests of the Secondary Units (SU), which is finite sources system too; the inter-request times and service times of the single server unit or Secondary system Channel Service (SCS) are assumed to be exponentially distributed, respectively. A generated high priority packet goes to the primary service unit. If the unit is idle, the service of the packet begins immediately. If the server is busy with a high priority request, the packet joins the preemptive priority queue. When the unit is engaged with a request from SUs, the service is interrupted and the interrupted low priority task is sent back to the SCS. Depending on the state of the secondary channel, the interrupted job is directed to either the server or the orbit. In case the requests from SUs find the SCS idle, the service starts, and if the SCS is busy, the packet looks for the PCS. In the case of an idle PCS, the service of the low-priority packet begins at the high-priority channel (PCS). If the PCS is busy, the packet goes to the orbit. From the orbit it retries to be served after an exponentially distributed time. The novelty of our investigation is that each server is subject to random breakdowns, in which case the interrupted request is sent to the queue or orbit, respectively. The operating and repair times of the servers are assumed to be generally distributed. Finally, all the random times included in the model construction are assumed to be independent of each other. The main aim of the paper is to analyze the effect of the nonreliability of the servers on the mean and variance of the response time for the SUs by using simulation.
机译:本文借助排队模型来处理认知无线电网络的性能评估。排队系统包含两个相互连接的,不是独立的子系统。第一部分是针对主要单位(PU)的请求。源的数量是有限的,并且每个源在指数分布的时间后都会生成高优先级请求。请求被发送到具有抢先优先级队列的单个服务器单元或主通道服务(PCS)。假定服务时间呈指数分布。第二个子系统用于辅助单元(SU)的请求,它也是有限资源系统。假设单个服务器单元或辅助系统通道服务(SCS)的请求间时间和服务时间分别呈指数分布。生成的高优先级数据包将发送到主要服务单元。如果设备空闲,则数据包的服务立即开始。如果服务器忙于高优先级请求,则数据包将加入抢占式优先级队列。当单元处理来自SU的请求时,服务将中断,并且中断的低优先级任务将被发送回SCS。根据辅助通道的状态,被中断的作业将定向到服务器或轨道。如果来自SU的请求发现SCS空闲,则服务开始,并且如果SCS繁忙,则数据包将查找PCS。在空闲PCS的情况下,低优先级数据包的服务始于高优先级信道(PCS)。如果PCS繁忙,则数据包进入轨道。它从轨道重试以经过指数分布的时间。我们研究的新颖之处在于,每台服务器都会受到随机故障的影响,在这种情况下,被中断的请求分别发送到队列或轨道。假定服务器的运行和维修时间通常是分布式的。最后,假设模型构建中包括的所有随机时间都相互独立。本文的主要目的是通过仿真分析服务器的不可靠性对SU响应时间的均值和方差的影响。

著录项

  • 来源
    《Journal of Mathematical Sciences》 |2019年第5期|702-711|共10页
  • 作者

    H. Nemouchi; J. Sztrik;

  • 作者单位

    Faculty of Informatics, University of Debrecen, Debrecen, Hungary;

    Faculty of Informatics, University of Debrecen, Debrecen, Hungary,Faculty of Informatics, University of Debrecen, Debrecen, Hungary;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号