检索结果-内蒙古大学图书馆

Performance Analysis in Satellite Communication With Beam Hopping Using discrete-time queueing theory

IEEE INTERNET OF THINGS JOURNAL 2024年第7期11卷 11679-11692页

作者： Feng, Yizhe Sun, Yaohua Peng, Mugen Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Satellite communication with beam hopping is a promising approach to meeting wide-area user traffic demands under on-board resource limitation. However, there is currently a lack of theoretical models that characterize the impact of beam hopping on user uplink transmission performance. In this article, two simplified beam hopping modes for satellite communication are proposed, namely, probabilistic beam hopping and deterministic beam hopping. Based on these two modes, two Markov chain models are established, which describe the states and state transitions of users. In the first model, the user state incorporates only user queue length, while the state in the second model considers both user queue length and time slot index. For both models, we first derive their steady-state probabilities and state transition probabilities, and then the steady-state probability of successful packet transmission is solved through a numerical method. Further, we theoretically derive the explicit expressions of various user performance metrics based on the steady-state probability of successful packet transmission, such as average throughput, buffer occupancy rate, packet loss rate, and transmission delay, and simulation results verify the correctness of all expressions. By simulation, it is shown that the minimum beam illumination probability or time length can be determined given specific performance requirements to guide system design, and there is an inflection point for the improvement in system performance with the increase of beam resource. Moreover, it is found that deterministic beam hopping achieves lower user delay compared to probabilistic beam hopping when the system is near to saturation.

关键词： Beam hopping discrete-time queueing theory performance analysis satellite communication

来源：评论

学校读者我要写书评

暂无评论

A discrete-time queueing SYSTEM WITH CHANGES IN THE VACATION timeS

引用

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE 2016年第2期26卷 379-390页

作者： Atencia, Ivan Univ Malaga Higher Polytech Sch Campus Teatinos E-29071 Malaga Spain

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

关键词： discrete-time queueing theory changes in the remaining vacation times busy period sojourn times

来源：评论

学校读者我要写书评

暂无评论

Place reservation: Delay analysis of a novel scheduling mechanism

引用

COMPUTERS & OPERATIONS RESEARCH 2008年第8期35卷 2447-2462页

作者： De Vuyst, S. Wittevrongel, S. Bruneel, H. Univ Ghent SMACS Res Grp Dept Telecommun & Informat Proc TELIN B-9000 Ghent Belgium

We study the delay performance of a queue with a place reservation mechanism. The objective of this discipline is to provide a better quality of service to arriving packets that are delay sensitive at the cost of allowing higher delays for the best effort packets and was first proposed by Burakowski and Tarasiuk. In our model, we consider a discrete-time queue with arrivals of type 1 (delay sensitive) and type 2 (best-effort). Whenever a packet of type 1 enters the queue, it takes the position of the reservation that was created there by a previous arrival of type 1 and creates a new reservation at the end of the queue. Type 2 arrivals always take place at the end of the queue in the usual way. We present the analysis of this model based oil the use of generating functions and provide results for the mean value, variance and tail behaviour of the delay experienced by both the delay-sensitive and the best-effort traffic. For a specific example, we compare the delay performance of this reservation discipline to the performance of all absolute priority discipline on the one hand, and to the reference discipline first-in first-out on the other. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： discrete-time queueing theory priority scheduling probability-generating functions reservations

来源：评论

学校读者我要写书评

暂无评论

ON THE BEHAVIOR OF BUFFERS WITH RANDOM SERVER INTERRUPTIONS

引用

PERFORMANCE EVALUATION 1983年第3期3卷 165-175页

作者： BRUNEEL, H Department of Computer Science Ghent State University B-9000 Gent Belgium

The behavior of buffers in computer communication systems is studied under the following conditions: 1. (i) infinite buffer size; 2. (ii) periodic opportunities for service (synchronous transmission); 3. (iii) random server interruptions; 4. (iv) periods during which server is available are i.i.d. random variables with geometric density function; 5. (v) periods during which server is blocked are i.i.d. with arbitrary density function; 6. (vi) numbers of arrivals during consecutive clock time intervals are i.i.d. with arbitrary density function. An expression is derived for the probability generating function of the buffer contents at customer departure times. Previous solutions to this problem are shown to be less general than the one presented here, because of more restrictive assumptions concerning the server interruption process and the arrival process.

关键词： Performance Evaluation Communication Systems Synchronous Transmission Buffering discrete-time queueing theory M/G/1 Analysis Buffer Blocking Server Blocking

来源：评论

学校读者我要写书评

暂无评论

Analysis of a queue with general service demands and correlated service capacities

引用

ANNALS OF OPERATIONS RESEARCH 2020年第1期293卷 73-99页

作者： De Muynck, Michiel Bruneel, Herwig Wittevrongel, Sabine Univ Ghent Dept TELIN Sint Pietersnieuwstr 41 B-9000 Ghent Belgium

We present the study of a non-classical discrete-time queueing model in which the customers each request a variable amount of service, called their "service demand", from a server which is able to execute a variable amount of work, called its "service capacity", during each time slot. We assume that the numbers of arrivals in consecutive time slots and the service demands of consecutive customers form two independent and identically distributed sequences. However, we allow the service capacities in consecutive time slots to be correlated according to a discrete-batch Markovian process. We study this model analytically and obtain expressions for the probability generating function of the steady-state system content and customer delay, as well as their moments and an approximation for their tail probabilities. The results are illustrated with several numerical examples.

关键词： discrete-time queueing theory Service demands Correlated service capacities discrete-batch Markovian service process

来源：评论

学校读者我要写书评

暂无评论

Randomly interrupted GI-G-1 queues: Service strategies and stability issues

引用

ANNALS OF OPERATIONS RESEARCH 2002年第1-4期112卷 171-183页

作者： Fiems, D Steyaert, B Bruneel, H State Univ Ghent Vakgrp TELIN TW07V SMACS Res Grp B-9000 Ghent Belgium

We consider a discrete-time queueing system subjected to random server interruptions. As customers arriving in the queue require generally distributed service times, the server can be interrupted during a customer's service. Therefore, nine different service strategies are proposed and analyzed using a probability generating functions approach. Performance measures under investigation include moments of steady-state buffer contents at random slot boundaries in equilibrium and moments of the customer delay. In particular we focus on the stability requirements for the strategies under consideration.

关键词： discrete-time queueing theory interruptions service strategies

来源：评论

学校读者我要写书评

暂无评论

A preemptive repeat priority queue with resampling: Performance analysis

引用

ANNALS OF OPERATIONS RESEARCH 2006年第1期146卷 189-202页

作者： Walraevens, Joris Steyaert, Bart Bruneel, Herwig Univ Ghent Dept Telecommun & Informat Proc IR07 B-9000 Ghent Belgium

In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures is illustrated by some numerical examples.

关键词： discrete-time queueing theory priority scheduling

来源：评论

学校读者我要写书评

暂无评论

Delay Analysis of a Queue with General Service Demands and Phase-Type Service Capacities 10th

Delay Analysis of a Queue with General Service Demands and P...

引用

10th International Conference on queueing theory and Network Applications (QTNA)

作者： De Muynck, Michiel Bruneel, Herwig Wittevrongel, Sabine Univ Ghent Stochast Modeling & Anal Commun Syst Res Grp Dept Telecommun & Informat Proc Sint Pietersnieuwstr 41 B-9000 Ghent Belgium

ISBN: (纸本)9783319222677;9783319222660

We present the analysis of a non-classical discrete-time queueing model where customers demand variable amounts of work from a server that is able to perform this work at a varying rate. The service demands of the customers are integer numbers of work units. They are assumed to be independent and identically distributed (i.i.d.). The service capacities, i.e., the numbers of work units that the server can process in the consecutive slots, are also assumed to be i.i.d. and have a rational probability generating function (pgf). Finally, the numbers of customer arrivals in each slot are i.i.d. as well. We analyze this model analytically using contour integration. Our main result is an expression for the pgf of the customer delay in steady state, from which expressions for the moments of the delay can be derived.

关键词： discrete-time queueing theory Service demands Service capacities Complex contour integration

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：