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

15th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Kempa, Wojciech M. Wozniak, Marcin Nowicki, Robert K. Gabryel, Marcin Damasevicius, Robertas Silesian Tech Univ Inst Math Ul Kaszubska 23 PL-44100 Gliwice Poland Czestochowa Tech Univ Inst Computat Intelligence Al Armii Krajowej 36 PL-42200 Czestochowa Poland Kaunas Univ Technol Software Engn Dept Studentu 50 Kaunas Lithuania

ISBN: (纸本)9783319393841

Time-dependent behavior of queueing delay distribution in the GI/M/1/K-type model with the "queued" server's waking up and balking is studied. After each idle period the server is being "queued" woken up, i.e. the processing is being started at the moment the number of packets accumulated in the buffer reaches the fixed level N. Moreover, each incoming packet can balk (resign from service) and leave the system irrevocably, with probability 1-beta, and join the queue with probability beta, where 0 < beta <= 1.

关键词： Balking finite-buffer queue N-policy queueing delay Transient state

来源：评论

学校读者我要写书评

暂无评论

Router interface as a queuing system with correlated service times

Router interface as a queuing system with correlated service...

引用

作者： Krzysztof Rusek AGH University of Science and Technology

学位级别：博士

This dissertation deals with router interface modeling towards queue characteristics calculation. The main focus of the presented analysis is the investigation of the memory architecture in the device and its implications on the analytical models. There is the enormous amount of research on traffic models reported, however, a model of router interface has not gained proper consideration yet. Experiments with a real device reveal that an incorrect model of the router interface can result in a significant disparity between drop probabilities measured on a physical interface and derived from a trace-driven simulation study. In this dissertation an accurate model of the router interface (Cisco IOS-based routers with a non-distributed architecture) is proposed. The interface is modeled as a packet buffer limited to a fixed number of packets regardless of their lengths. The buffer is described as a finite FIFO queuing system fed by the Markovian Arrival Process (MAP) with service times forming a semi-Markov (SM) process ( MAP/SM/ 1 /b in Kendall's notation). Such assumptions allow to obtain new analytical results for the queuing characteristics of the buffer. The following were considered: time to fill the buffer, local loss intensity, loss ratio, and the total number of losses in a given time interval. Predictions provided by the proposed model can be few orders of magnitude closer to the trace-driven simulation results compared to the prediction of the MAP/G/1/b model.

关键词： buffer router interface Markovian Arrival Process semi-Markov service time hidden Markov model finite-buffer queue packet loss first passage time transient state

来源：评论

学校读者我要写书评

暂无评论

TRANSIENT AND STATIONARY CHARACTERISTICS OF A PACKET buffer MODELLED AS AN MAP/SM/1/B SYSTEM

引用

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE 2014年第2期24卷 429-442页

作者： Rusek, Krzysztof Janowski, Lucjan Papir, Zdzislaw AGH Univ Sci & Technol Dept Telecommun Al A Mickiewicza 30 PL-30059 Krakow Poland

A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP/SM/1/b in Kendall's notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer. In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP/G/1/b model.

关键词： router interface Markovian arrival process semi-Markov service time hidden Markov model finite-buffer queue packet loss first passage time

来源：评论

学校读者我要写书评

暂无评论

Time-Dependent Behavior of queueing Delay in GI/M/1/K-type Model with N-policy: Analytical Study with Applications to WSNs

Time-Dependent Behavior of Queueing Delay in <i>GI</i>/<i>M<...

引用

21st International Conference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA)

作者： Kempa, Wojciech M. Silesian Tech Univ Inst Math PL-44100 Gliwice Poland

ISBN: (纸本)9783319082196;9783319082189

The transient queueing delay distribution in the GI/M/1/Ktype model with the N-policy is investigated. After finishing each busy period the service is being initialized simultaneously with the Nth packet arrival occurrence. Using the approach based on the idea of embedded Markov chain, the formula of total probability, renewal theory and linear algebra, the compact-form representation for the Laplace transform of the tail of delay distribution is obtained. The results can be useful in modeling the operation of wireless sensor networks (WSNs) with energy saving mechanism based on "queued" waking up of nodes. A network-motivated numerical example is attached.

关键词： finite-buffer queue N-policy queueing delay Transient state Wireless sensor network (WSN)

来源：评论

学校读者我要写书评

暂无评论

MAP/SM/1/b Model of a Store and Forward Router Interface

MAP/SM/1/b Model of a Store and Forward Router Interface

引用

International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS) Part of SummerSim Multiconference

作者： Rusek, Krzysztof Papir, Zdzislaw Janowski, Lucjan AGH Univ Sci & Technol Fac Elect Engn Automat IT & Elect Dept Telecommun Krakow Poland

ISBN: (纸本)9781618399823

The model of a router interface with a buffer limited to a fixed number of packets (regardless their lengths) is discussed. The interface is described as a finite FIFO queuing system with a Markovian Arrival Process (MAP) and semi-Markov (SM) service times. The new analytical results for the loss ratio, the local loss intensity or the total number of losses are developed. All results are suitable either for a transient or a stationary analysis and it is possible to extend them beyond the loss process.

关键词： router interface Markovian arrival process semi-Markov service time hidden Markov model finite-buffer queue packet loss

来源：评论

学校读者我要写书评

暂无评论

On the Distribution of the Time to buffer Overflow in a queueing System with a General-Type Input Stream

On the Distribution of the Time to Buffer Overflow in a Queu...

引用

35th International Conference on Telecommunications and Signal Processing (TSP)

作者： Kempa, Wojciech M. Silesian Tech Univ Gliwice Poland

ISBN: (纸本)9781467311182

A finite-buffer queueing system with a generally distributed interarrival times and exponential service times is considered. A compact formula for the Laplace transform of distribution of the time to the first buffer overflow is found and written down using a special-type sequence connected with "input" distributions of the system. Moreover, applying the formula of total probability, a representation for the distribution of the time to the kth buffer overflow for k >= 2 is derived. Numerical examples are attached as well.

关键词： buffer overflow period finite-buffer queue Markov moments packet losses

来源：评论

学校读者我要写书评

暂无评论

MAP/SM/1/b Model of a Store and Forward Router Interface

MAP/SM/1/b Model of a Store and Forward Router Interface

引用

International Symposium on Performance Evaluation of Computer and Telecommunication Systems

作者： Krzysztof Rusek Zdzislaw Papir Lucjan Janowski AGH University of Science and Technology Faculty of Electrical Engineering Automatics IT and Electronics Department of Telecommunications

ISBN: (纸本)9781467322355

关键词： Router interface Markovian arrival process Semi-Markov service time Hidden Markov model finite-buffer queue Packet loss

来源：评论

学校读者我要写书评

暂无评论

On Effectiveness of Application-Layer Coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第10期57卷 6673-6691页

作者： Choi, Yoojin Momcilovic, Petar Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA

The effectiveness of application-layer coding in a system with a large number of users is considered. The end users encode data packets before transmitting them. The effect of additional packets on the system performance is twofold: (i) additional packets increase offered load, which results in higher drop probability, and (ii) some of dropped packets can be recovered at the receivers after decoding. It is argued that the space of all systems can be partitioned into two regions where coding is beneficial and detrimental, respectively. In particular, the paper establishes an asymptotic regime that contains the boundary between these two regions. On the boundary, systems with and without coding have the same performance. Informally, our results indicate that application-layer coding improves the performance only in systems with low loss probabilities (without coding), and employing such coding in systems with high loss probabilities only degrades the performance.

关键词： Application-layer coding finite-buffer queue loss probability scaling laws

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a GI^[X]/Geo/m/N queue with partial- and total-batch rejection

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2007年第2期54卷 203-219页

作者： Goswami, V. Samanta, S. K. Kalinga Inst Ind Technol Dept Comp Sci Bhubaneswar 751024 Orissa India

This paper analyzes a discrete-time multiserver finite-buffer queueing system with batch renewal arrivals in which inter-batch time of batches and service times of customers are, respectively, arbitrarily and geometrically distributed. Each customer gets service from only one server. Using the supplementary variable and the imbedded Markov chain techniques, we obtain the state probabilities at prearrival, arbitrary and outside observer's observation epochs for partial- and total-batch rejection policies. The blocking probability of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with some numerical results have been discussed. The analysis of actual waiting-time distributions measured in slots of the first-, an arbitrary- and the last-customer in an accepted batch has also been investigated. Finally, it is shown that in the limiting case the results obtained in this paper tend to the continuous-time counterpart. (c) 2007 Elsevier Ltd. All rights reserved.

关键词： discrete-time finite-buffer queue multiserver partial-batch rejection total-batch rejection

来源：评论

学校读者我要写书评

暂无评论

Loss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue

引用

PERFORMANCE EVALUATION 2006年第7期63卷 682-699页

作者： Ishizaki, Fumio Korea Univ Dept Math Seoul 136701 South Korea Korea Univ Telecommun Math Res Ctr Seoul 136701 South Korea

In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptions, we derive an exact relation holding between the loss probability in the finite-buffer queue and the queue length distribution in the corresponding infinite-buffer queue. The exact relation is considered as an integration/generalization of the exact relations which have been derived in previous papers. By applying the exact relation, we also develop formulas to estimate the loss probability. (C) 2005 Elsevier B.V. All rights reserved.

关键词： loss probability finite-buffer queue infinite-buffer queue proportional relation exact relation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：