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

69th IEEE Vehicular Technology Conference

作者： Yu, Ke Wang, Xuan Sun, Songlin Zhang, Lin Wu, Xiaofei Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Commun Network Lab Beijing 100088 Peoples R China

ISBN: (纸本)9781424425167

IEEE 802.16 is a promising technology in broadband wireless access area. In multiservice IEEE 802.16 network, connection admission control (CAC) plays a critical role for resource management and QoS guarantee. In this paper, a statistical CAC mechanism is proposed for IEEE 802.16 network. In order to avoid the QoS degradation, the proposed CAC mechanism considers the traffic variability and overflow. Furthermore, a model of traffic and air interface capacity is provided to make the CAC mechanism easy to be implemented. Then, a performance analysis model based on Markov chains is proposed. Numerical and simulation results show that the proposed CAC mechanism can prevent the traffic overflow and achieve a good packet level QoS.

关键词： IEEE 802.16 connection admission control quality of service complete sharing overflow probability

来源：评论

学校读者我要写书评

暂无评论

Dimensioning of a dejittering buffer for variable bit rate video streams

Dimensioning of a dejittering buffer for variable bit rate v...

引用

13th International Conference on Analytical and Stochastic Modelling Techniques and Applications

作者： Spaey, Kathleen Blondia, Chris Univ Antwerp IBBT Performance Anal Telecommun Syst Res Grp B-2020 Antwerp Belgium

ISBN: (纸本)0955301807

In this paper a Markov model is developed that, given a simple description of the network delay and the packet interarrival times of a variable bit rate video stream, can be used to dimension the two important parameters of the dejittering process: the capacity Q the dejittering buffer should have and the dejittering delay T-jit the dejittering process should wait before starting the playout of the first packet. The correct setting of these parameters is important to keep both the packet loss due to dejittering buffer overflow and/or underflow and the introduced dejittering delay below some acceptable limits.

关键词： dejittering buffer Markov model underflow probability overflow probability

来源：评论

学校读者我要写书评

暂无评论

ε-overflow Rate: Buffer-aided Information Transmission over Nakagami-m Fading Channels

ε-Overflow Rate: Buffer-aided Information Transmission over...

引用

8th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC)

作者： Dong, Yunquan Fan, Pingyi Ben Letaief, Khaled Murch, Ross D. Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol TNList Beijing 100084 Peoples R China Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781457713798

Analysis of effective information transmission rate over fading channels has attracted much attentions in the last few years. Ergodic capacity and out age capacity, as two conventional indices, have been widely investigated in various scenarios. However, there exists a gap between them for any fixed average signal to noise ratio. Thus, one problem is raised naturally: How to fill this gap? To answer it, we shall propose a new concept, epsilon-overflow rate, which is used to characterize the transmission capability of a fading channel when a finite size buffer is employed at the transmitter. With this buffer, the constant rate source data stream is matched with the time varying channel status so that the fading channel can support a higher rate source data stream. It will be proved that the epsilon-overflow rate is larger than the epsilon-outage capacity under the same outage constraint and can converge to the ergodic capacity in all signal to noise ratio region.

关键词： overflow probability finite length buffer epsilon-overflow rate block Nakagami-m fading channel

来源：评论

学校读者我要写书评

暂无评论

Statistical connection admission control for mobile WiMAX systems

Statistical connection admission control for mobile WiMAX sy...

引用

IEEE Wireless Communications and Networking Conference

作者： Lee, Ju Yong Kim, Ki Baek Univ Toronto Dept ECE Toronto ON Canada Samsung Elect Co LTD Telecommun Network Business Suwon South Korea

ISBN: (纸本)9781424419968

In this paper, we propose a new connection ad mission control (CAC) algorithm accommodating various classes of traffic, which can easily be implemented in mobile WiMAX system. The proposed CAC algorithm has three characteristics: first, the variation of air capacity is taken into account by measuring the distribution of modulation and coding scheme (MCS) levels offline;second, we estimate the mean and variance of frame occupancy ratio of each QoS How based on declared traffic descriptors;and third, the admission region is determined to satisfy the target overflow probability in the bufferless model. Through numerical analysis, we show that the accuracy of the proposed CAC is satisfactory.

关键词： mobile WiMAX OFDMA connection admission control admissible region overflow probability resource occupancy QoS

来源：评论

学校读者我要写书评

暂无评论

Effective Bandwidth Estimation in Highly Reliable Regenerative Networks 2

Effective Bandwidth Estimation in Highly Reliable Regenerati...

引用

2nd International Symposium on Stochastic Models in Reliability Engineering, Life Science, and Operations Management (SMRLO)

作者： Morozov, Evsey Kalinina, Ksenia Rykov, Vladimir RAS Karelian Res Ctr Inst Appl Math Res Pushkinskaya 11 Petrozavodsk 185910 Russia Gubkin Russian State Univ Oil & Gas Leninsky Ave 65 Moscow 119991 Russia

ISBN: (纸本)9781467399418

In this paper, we study the accuracy of different estimators of the effective bandwidth (EB), i.e. a required server capacity C to guarantee a given QoS requirement. We assume that the input sequence is regenerative and study the accuracy of the estimator which is based on the actual regeneration cycles of the basic process describing dynamics of the server. Then, by simulation, we compare this estimator with alternative estimators. In particular, we compare the property of the regeneration-based estimation and the estimation obtained by the so-called Batch Means method. It is shown that the regeneration-based estimator of C in all cases overestimates predefined QoS requirement. Then we discuss how this property can be applied to calculate the required EB for the components of highly reliable telecommunication systems.

关键词： effective bandwidth regeneration estimation batch means QoS overflow probability

来源：评论

学校读者我要写书评

暂无评论

Algorithms for rare event simulation with Markov chains

Algorithms for rare event simulation with Markov chains

引用

5th International Industrial Simulation Conference

作者： Radev, Dimitar Lokshina, Izabella Univ Rousse 8 Studentska St Rousse 7017 Bulgaria SUNY Coll Oneonta Oneonta NY 13820 USA

ISBN: (纸本)9789077381342

An approach to overflow probability estimation in the queuing systems based on rare event simulation with Markov chains is proposed in this paper. Rare event probability that content of the second buffer exceeds some high level L before it becomes empty starting from a given state is considered. The approach is based on Markov additive representation of buffer processes, leading to exponential change of measure used in Importance Sampling (IS) procedure. The considered examples demonstrate that when the first buffer is finite, the relative error is bounded independent on some high level L. When the first buffer is infinite, a natural extension of exponential change of measure for finite buffer case is proposed. The relative error is shown to be bounded (independent on L) only when the second server is a bottleneck. However, when the first server is a bottleneck, experimental results confirm that the relative error is linearly bounded to level L. IS algorithms with cross-entropy are developed and used to speed up the overflow probability simulation. Numerical results are shown.

关键词： rare event simulation overflow probability queuing theory Markov chains

来源：评论

学校读者我要写书评

暂无评论

An Upper Bound of the Large Deviation probability in Multi-server Constant Retrial Rate System 22nd

An Upper Bound of the Large Deviation Probability in Multi-s...

引用

22nd International Conference on Distributed Computer and Communication Networks (DCCN)

作者： Morozov, Evsey Zhukova, Ksenia Karelian Res Ctr Inst Appl Math Res Pushkinskaya 11 Petrozavodsk Russia Petrozavodsk State Univ Lenina 33 Petrozavodsk Russia

ISBN: (纸本)9783030366254;9783030366247

In this paper, a multiserver retrial system with constant retrial policy is considered. The input is assumed to be a general renewal process, service times are iid with a general distribution and the retrial attempts follow an exponential distribution. The system is described with a regenerative process, and we focus on the logarithmic asymptotics of the large deviation (overflow) probability that the orbit size reaches a high level N within regeneration cycle. To analyze the upper bound of this probability, we interpret the retrial system as a buffered system with service times of a special type. Simulation results show the accuracy of the obtained bound for Weibull/M/2 retrial system.

关键词： Retrial system Large deviations overflow probability Upper bound Constant retrial rate Logarithmic asymptotics

来源：评论

学校读者我要写书评

暂无评论

A Poisson limit for buffer overflow probabilities

A Poisson limit for buffer overflow probabilities

引用

21st Annual Joint Conference of the IEEE-Computer-and-Communications-Societies

作者： Cao, J Ramanan, K Bell Labs Stat & Data Min Res Dept Lucent Technol Murray Hill NJ 07974 USA

ISBN: (纸本)0780374762

A key criterion in the design of high-speed networks is the probability that the buffer content exceeds a given threshold. We consider n independent identical traffic sources modelled as point processes, which are fed into a link with speed proportional to n. Under fairly general assumptions on the input processes we show that the steady state probability of the buffer content exceeding a threshold b > 0 tends to the corresponding probability assuming Poisson input processes. We verify the assumptions for a large class of long-range dependent sources commonly used to model data traffic. Our results show that with superposition, significant multiplexing gains can be achieved for even smaller buffers than suggested by previous results, which consider O(n) buffer size. Moreover, simulations show that for realistic values of the exceedance probability and moderate utilisations, convergence to the Poisson limit takes place at reasonable values of the number of sources superposed. This is particularly relevant for high-speed networks in which the cost of high-speed memory is significant.

关键词： long-range dependence overflow probability Poisson limit heavy tails point processes multiplexing

来源：评论

学校读者我要写书评

暂无评论

Bstj 45: 1. January 1966: Sequential Decoding - the Computation Problem. (Savage, E.J.)

引用

2016年

Bstj 45: 1. January 1966: Sequential Decoding - the Computation Problem. (Savage, E.J.) by published by

关键词： (savage, bell system buffer buffer overflow computation computation exponent correct path decoding e.j.) january metric node overflow overflow probability path probability problem. random random code random variable sequential sequential decoding static computation system technical

来源：评论

学校读者我要写书评

暂无评论

A large deviation analysis of retrial models with constant and classic retrial rates

引用

PERFORMANCE EVALUATION 2019年 135卷 102021-102021页

作者： Morozov, Evsey Zhukova, Ksenia Russian Acad Sci Karelian Res Ctr Inst Appl Math Res 11 Pushkinskaya Str Petrozavodsk 185910 Karelia Russia Petrozavodsk State Univ 33 Lenina Pr Petrozavodsk 185000 Karelia Russia

In this paper, a large deviation analysis of the retrial systems is developed. We consider both classical and constant retrial rate models. We focus on the (overflow) probability that the orbit size in the single-server system reaches a high level N within a regeneration period. Under natural assumptions, it is shown that, as N -> infinity, the overflow probability has an exponential decay rate. We find a lower bound and an upper bound for the exponential decay rate. At that these bounds have different exponential rates, because, to construct these bounds, we consider different (majorant and minorant) classical buffered systems. Then we apply the technique that has been developed earlier to analyze large deviation in a tandem queueing network. We also establish analogous large deviation result for a multiserver retrial system. Stability conditions are discussed as well. Simulation results are also included to demonstrate the accuracy of the obtained lower and upper bounds. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Large deviations Stationarity Retrial system overflow probability Classic and constant retrial rate discipline Decay rate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：