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

buffer overflow probability for multiplexed on-off VoIP sources

ELECTRONICS LETTERS 2000年第6期36卷 523-524页

作者： Schormans, JA Pitts, JM Scharf, EM Pearmain, AJ Phillips, CI QMW Dept Elect Engn Telecommun Res Grp London E1 4NS England

The authors analyse the multiplexing of a large number of independent and homogenous on-off traffic sources into a single packet switched buffer: a possible model of VoIP. It is shown how a previously developed formula for queues can be applied to this system, allowing accurate calculation of the buffer overflow probability via the burst-scale decay rate of the buffer state probabilities. Numerical results comparing the expression with simulation and with other approximations shows that the approach gives superior accuracy, with equivalent complexity.

关键词： integrated voice/data communication Queueing systems Communication switching packet switching IP networks telecommunication traffic buffer state probabilities burst-scale decay rate multiplexing analysis packet switched buffer multiplexing multiplexed on-off VoIP sources buffer overflow probability probability queuing Queueing theory on-off traffic sources queueing theory

来源：评论

学校读者我要写书评

暂无评论

Generalized sub-Gaussian fractional Brownian motion queueing model

引用

QUEUEING SYSTEMS 2014年第1期77卷 75-96页

作者： Yamnenko, R. Kozachenko, Yu Bushmitch, D. Taras Shevchenko Natl Univ Kyiv Dept Probabil Theory Stat & Actuarial Math Kiev Ukraine Mitre Corp Eatontown NJ USA

It is well known that often the one-dimensional distribution of a queue content is not Gaussian but its tails behave like a Gaussian. We propose to consider a general class of processes, namely the class of -sub-Gaussian random processes, which is more general than the Gaussian one and includes non-Gaussian processes. The class of sub-Gaussian random processes contains Gaussian processes also and therefore is of special interest. In this paper we provide an estimate for the queue content distribution of a fluid queue fed by independent strictly -sub-Gaussian generalized fractional Brownian motion input processes. We obtain an upper estimate of buffer overflow probability in a finite buffer system defined on any finite time interval or infinite interval . The derived estimate captures more accurately the performance of the queueing system for a wider-range of input processes.

关键词： Fractional Brownian motion buffer overflow probability Sub-Gaussian processes

来源：评论

学校读者我要写书评

暂无评论

Queue performance of cognitive radio networks with general primary user activity model

引用

IET COMMUNICATIONS 2015年第15期9卷 1821-1828页

作者： Jiao, Wanguo Sheng, Min Lui, King-Shan Liu, Guoqing Xidian Univ State Key Lab Integrated Serv Networks Xian Shaanxi Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

The quality of service (QoS) performance analysis is of great guiding significance for a QoS guarantee of secondary users (SUs). However, the QoS performance of SUs has not been well studied, especially how it is impacted by the traffic property of primary users (PUs). In this study, the authors propose a method to analyse the queue performance of the SU when the active and inactive durations of PUs follow general distributions. To characterise the non-memoryless property of the channel when the distributions of PUs active/inactive durations are general distributions, they propose a two-dimensional Markov chain to model the states of the channel. By using this Markov chain, they derive the effective capacity (EC) function of the cognitive radio network. On the basis of the EC function and the effective bandwidth function, the queue performance of the SU, that is, the stationary tail distribution of the queue length, is estimated. The author's result can not only be used to calculate other QoS metrics, such as the buffer overflow probability and throughput, but also provide some guidelines for QoS guarantee of the SU. Finally, they verify their work by comparing the analytical results with simulation results.

关键词： cognitive radio queueing theory quality of service Markov processes statistical distributions wireless channels queue performance analysis cognitive radio networks general primary user activity model active PU duration distribution inactive PU duration distribution channel nonmemoryless property 2D Markov chain channel state model effective capacity function EC function effective bandwidth function stationary tail distribution estimation queue length buffer overflow probability throughput QoS guarantee

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of XOR two-way relay with finite buffers and instant scheduling

引用

IET COMMUNICATIONS 2017年第4期11卷 507-513页

作者： Shi, Shijie Ni, Wei Liu, Ren Ping Zhengzhou Univ Sch Informat Engn Zhengzhou 450001 Henan Peoples R China CSIRO CCI Marsfield NSW 21224 Australia Univ Technol Sydney Sch Comp & Commun Sydney NSW 2007 Australia

This study investigates the performance of practical wireless exclusive OR (XOR) two-way relay (TWR) system, in which finite buffer, lossy wireless channels and non-negligible signalling overhead are considered. Specifically, the authors develop a new analytical model to explicitly characterise the transmissions of both the end-nodes and the relay. The impact of scheduling on the throughput, queuing delay, power consumption and buffer overflow probability of XOR-TWR is evaluated. Validated by simulations, the model can precisely quantify the performance of XOR-TWR and adequately allocate the relay's buffer adapting to the wireless link qualities and signalling overhead.

关键词： relay networks (telecommunication) radio links buffer circuits telecommunication scheduling wireless channels telecommunication signalling queueing theory power consumption XOR two-way relay performance analysis finite buffer instant scheduling wireless exclusive OR two-way relay system wireless XOR-TWR system throughput lossy wireless channel nonnegligible signalling overhead end-node transmission relay transmission queuing delay power consumption buffer overflow probability wireless link quality

来源：评论

学校读者我要写书评

暂无评论

Quality of Service Performance Analysis of Relaying Networks With Multiple buffer-Aided Relays

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第4期68卷 4016-4026页

作者： Efazati, Sara Ghalamkari, Behbod Azmi, Paeiz Jorswieck, Eduard A. Iran Telecommun Res Ctr Commun Technol Inst Tehran *** Iran Islamic Azad Univ Sci & Res Branch Dept Elect & Comp Engn Tehran *** Iran Tarbiat Modares Univ Dept Elect & Comp Engn Commun Syst Lab Tehran 14115143 Iran Tech Univ Dresden Commun Lab Commun Theory D-01069 Dresden Germany

In this paper, we concentrate on a multi-relay network in which the source and the relays are equipped with limited buffers, and we study the maximum supportable arrival rates with buffer overflow quality of service (QoS) guaranteed at all buffered nodes. To this end, the effective capacity (EC) function of such a network is derived as a function of individual QoS exponents of the source and relays denoted by theta(S), theta(R1), ... , theta(RN). To reduce the computational complexity, a closed form expression for the EC is computed. Then, a time slot allocation algorithm is proposed based on the defined EC function. To show the results, both scenarios of heterogeneous and homogeneous queuing at the relays are investigated. The behavior of derived EC and the proposed algorithm are evaluated by some numerical results. It is shown for theta(S) > theta(R), EC remains constant versus theta(R) and varies versus theta(S) and vice versa, meaning that among theta(S) and theta(R), the higher one is determinative in the amount of E-C(theta(S), theta(R)). Also, it is found that the majority of resources is allocated to the node with a more stringent QoS constraint.

关键词： Statistical quality of service (QoS) guarantee buffer overflow probability effective capacity (EC) multi-relay networks buffer-aided (BA) relays half-duplex relaying

来源：评论

学校读者我要写书评

暂无评论

Optimal Resource Allocation for Energy-Harvesting Communication Networks Under Statistical QoS Constraints

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2019年第2期37卷 313-326页

作者： Zewde, Thwodros Aklilu Gursoy, M. Cenk Wichita State Univ Dept Elect Engn & Comp Sci Wichita KS 67260 USA Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

In this paper, we characterize the optimal strategies focusing on the throughput and the system energy efficiency of wireless-powered communication networks (WPCNs) in the presence of delay-limited sources. Each energy-harvesting user equipment is assumed to be subject to limitations on the buffer overflow probability, specified by the quality of service (QoS) exponent theta. Correspondingly, the time allocation strategies for downlink energy harvesting and uplink information transfer depend on these QoS constraints, potentially overriding the doubly near-far problem of WPCNs. We consider the non-orthogonal transmission and time-division multiple access protocols for the uplink information transfer of WPCN, and for both cases, we formulate energy efficiency and throughput maximizing problems to obtain the globally optimal solution that satisfy the statistical QoS constraints. Since these optimization problems fall into concave or pseudo-concave categories, Karush-Kuhn-Tucker conditions are necessary and sufficient for global optimality, using which we obtain analytical expressions for the optimal operating intervals. In addition, in several cases, due to difficulty in providing closed-form expressions, we develop algorithms to solve the problems numerically. Finally, we provide the simulation results to confirm and further analyze the theoretical characterizations. We mainly observe that QoS constraints primarily affect the optimal time allocation policies as well as achievable rate distribution among the users, enabling us to overcome the doubly near-far problem of energy-harvesting communications networks pointed out as one of the critical issues in the literature.

关键词： buffer overflow probability effective capacity energy efficiency energy harvesting throughput wireless information and power transfer

来源：评论

学校读者我要写书评

暂无评论

The Impact of Queue Length Information on buffer overflow in Parallel Queues

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第10期59卷 6393-6404页

作者： Jagannathan, Krishna Modiano, Eytan Indian Inst Technol Dept Elect Engn Madras 600036 Tamil Nadu India MIT Cambridge MA 02139 USA

We consider a system consisting of parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. We first characterize the exponent of the buffer overflow probability and the most likely overflow trajectories under the Longest Queue First (LQF) scheduling policy. Under statistically identical arrivals to each queue, we show that the buffer overflow exponents can be simply expressed in terms of the total system occupancy exponent of m parallel queues, for some m <= N. We next turn our attention to the rate of queue length information needed to operate a scheduling policy, and its relationship to the buffer overflow exponents. It is known that queue length blind policies such as processor sharing and random scheduling perform worse than the queue aware LQF policy, when it comes to buffer overflow probability. However, we show that the overflow exponent of the LQF policy can be preserved with arbitrarily infrequent queue length updates.

关键词： buffer overflow probability large deviations queue length-based scheduling

来源：评论

学校读者我要写书评

暂无评论

SCOQ: A Fast Packet Switch with Shared Concentration and Output Queueing

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1993年第1期1卷 142-151页

作者： Chen, David X. Mark, Jon W. Univ Waterloo Dept Elect Engn Waterloo ON N2L 3G1 Canada Univ Waterloo Dept Comp Engn Waterloo ON N2L 3G1 Canada

A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of the equilibrium queue length and waiting time, throughput and buffer overflow probability. Numerical results indicate that the proposed switch exhibits very good delay-throughput performance over a wide range of input traffic. The proposed switch compares favorably with the Knockout switch [10], the Sunshine switch [11], and the modular architecture proposed in [18] in terms of fewer basic building elements used to attain the same degree of output buffering.

关键词： Electronic Switching Systems Packet Switching Queueing Theory Switching Networks Space Division Nonblocking Packet Switch SCOQ Fast Packet Switch Shared Concentration Output Queueing Data Concentration Output buffering Packet Loss probability Equilibrium Queue Length Waiting Time Throughput buffer overflow probability Delay Throughput Performance Switches Packet Switching Fabrics Communication Switching Asynchronous Transfer Mode Traffic Control Sorting Throughput Delay buffer overflow

来源：评论

学校读者我要写书评

暂无评论

Design rules for buffering overlapping Pareto processes in packetised networks

引用

ELECTRONICS LETTERS 2000年第12期36卷 1086-1088页

作者： Schormans, J Pitts, J Mondragon, R Scharf, E Pearmain, A Phillips, C QMW Dept Elect Engn Telecommun Res Grp London England

A formula is presented that acts as a design rule when multiplexing many homogeneous long range dependent (LRD) ON-OFF processes through a buffer. The formula enables the buffer overflow probability, or the required buffer length, to be predicted. Sources have Pareto distributed ON periods and exponentially distributed OFT: periods. From the results (formulas and numerical), valuable tools and insight can be developed which will be applicable to the design of future packetised communication networks, switches and routers.

关键词： buffering Queueing systems switching networks buffer storage switches overlapping Pareto processes Communication switching packet switching design rules telecommunication traffic packetised networks Communication network design, planning and routing Pareto distribution routers long range dependent on-off processes buffer overflow probability communication networks telecommunication network routing exponentially distributed off periods buffer length prediction multiplexing Pareto distributed on periods Queueing theory queueing theory

来源：评论

学校读者我要写书评

暂无评论

Analysis of local internet/enterprise networking multiplexer for ON-OFF VoIP sources

引用

ELECTRONICS LETTERS 2000年第21期36卷 1825-1826页

作者： Stewart, RA Schormans, J Pitts, JM Scharf, EM Pearmain, AJ Phillips, CI Univ London Queen Mary & Westfield Coll Telecommun Res Grp Dept Elect Engn London E1 4NS England

The authors analyse the multiplexing of a small number of independent and homogenous ON-OFF traffic sources into a single packet switched buffer: a possible model of VoIP in a local internet. This work complements a previous paper, in which a large number of sources was considered. It is shown how a previously developed formula for queues can be applied to this system, allowing accurate calculation of the buffer overflow probability.

关键词： Protocols multiplexer local internet Communication switching packet switching ON-OFF VoIP sources Computer communications multiplexing equipment protocols homogenous ON-OFF traffic sources Internet telephony Other switching centres telephone traffic buffer overflow probability enterprise networking Information networks Local area networks single packet switched buffer intranets business communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：