离散时间多重休假的Geom<em>x/G/1 排队系统的队长分布

近几年来,由于在制造系统与电讯交换系统的设计和控制中和在计算机通信网络的模型刻画和分析中的广泛应用,使得离散时间排队系统受到越来越多的注意.本文考虑离散时间多重休假成批到达的Geom/G/1排队系统,从任意初始状态出发,使用全概率分解技术和u-变换,研究了队长的瞬态性质和稳态性质,首次导出了队长瞬态分布的u-变换形式的递推表达式和队长稳态分布的递推表达式,进一步也获得稳态队长的随机分解结果.特别地,通过本文可直接获得一系列特殊离散时间排队系统相应的结果.     

基于Kappa-mu/M分布的联合多用户分集与并行中继继选择RF/FSO系统性能研究

本文在能够表征大多数信道条件的Kappa-mu/M分布混合统计模型组合下,研究了存在同频干扰的联合多用户分集与并行中继选择射频技术/自由空间光通信系统,分别推导出系统的中断概率的Meijer G解析表达式和渐近近似表达式.通过仿真解析、渐近近似表达式,分析了信道衰落、指向误差、同频干扰、用户选择和并行中继选择等关键因素...     

等距码的对偶距离分布及其性质

本文主要讨论了等距码的对偶距离分布及其性质，然后利用这些性质将［１］中的某些结果推广到ｑ元等距码情形，并得到了其对偶距离分布的递推关系式，最后，本文给出了ｑ元等距码的码字数目的一个上界。     

基于Rayleigh噪声统计分布的有音区检测

依据噪声能量谱密度(PSD)分布的拖尾特性,本文采用瑞利(Rayleigh)分布表示噪声能量谱密度的分布,推导出基于Rayleigh分布的新判决阈值更新表达式,并提出一种改进的有音区检测(VAD)算法.由于Rayleigh分布下虚警概率具有解析表达式,从而避免了计算逆互补误差函数,降低了算法的复杂度.实验结果表明,在非平稳噪声环境下,其性能指标值优于文献[8]的算法.     

几种适用于VLSI离子注入新工艺的模型研究,

本文采用能较精确模拟沟道效应的两个Pearson-IV 分布的线性组合来模拟硅中B注入分布,提出了一个基于剂量匹配求解等效厚度的两层结构注入分布修正射程表达式,用该式对B注入 MoSi_2/Si、CoSi_2/Si,P注入CoSi_2/Si 进行了模拟和验证,本文还给出了利用等效厚度概念导出的多层结构注入修正射程递推表达式,并以 Pol_7-Si/SiO_2/Si三层结构为例进行了验证。     

深亚微米多层互连的温度分布特性分析

本文从热扩散方程出发,推导了简单互连的温度分布解析表达式,采用65nm工艺参数,详细讨论了热扩散长度和介质层厚度对互连温度分布的影响;进一步给出了复杂多层互连的温度分布解析表达式并用于其特性模拟,结果显示全局互连的温升远大于半全局互连和局部互连的温升。     

固体激光器板状介质的三维温度分布

本文讨论有限长度三维板状介质的热分布,给出了在不同的泵浦及冷却条件下的温度分布表达式,数值计算求解,得到定量说明。     

高斯光束的偏心分布

本文人正常高斯光束的复振幅表达式出发，通过傍轴光波传输公式，得到偏心高斯光束的复振幅和光强分布表达式以及数值模拟光强分布曲线，并与正常高斯光束光强分布的对称性进行了比较。     

一种考虑温度时间-空间分布的解析互连延时模型

本文从热扩散方程出发,得到了互连温度时间-空间分布的解析表达式.考虑互连温度对互连电阻和Elmore延时的影响,同时提出了一种用以分析互连时间-空间温度分布效应对互连延时影响的等效内阻模型.基于所提出的模型,详细地分析了互连长度、输入信号频率和功率对互连延时的影响.所提出的互连温度分布和延时解析模型可以应用于深亚微米温度相关的互连性能分析中.     

广义复合杂波建模及其统计特性研究

高分辨力雷达体制下,杂波散斑分量与调制分量更适合用广义Gamma分布模型描述,在此基础上本文推导了广义复合模型表达式;然后通过对广义复合模型选取特定参数,得到了广义K分布表达式,同时分析了取不同参数时广义K分布与经典杂波概率分布的联系;进而研究了上述有关模型的统计特性,得出了参数估计表达式;最后,进行了仿真实验,实验结果验证了本文的结论.     

修正开关泊松过程（RSPP）和RSPP／M／1排队

在通信网互连中，若被连子网具有不同的最大允许分组长度，那么有信关中一个较长的分组就可能要被拆分为多个较小的分组，这就是公组再分问题，已经证明，在某些情况下。再分后的公组流可以用一个修正的开关泊松过程来，本文ＲＳＰＰ和ＲＳＰＰ／Ｍ／１排队。文中推导出了ＲＳＰＰ到达间隔分布的表达式，并给出了平均到达率。文中还给出了队长分布，平均等候时间的表达式；信关输出流的特性对于全网的性能分析是必需的，因此本文着重     

Galois环导出p元序列中元素组的分布及其渐近均匀性

r-样式的分布是有限域上序列伪随机性的一个重要方面。就此问题本文对域R/pR上一类序列作了考察，这类序列得自于Galois环R＝GR（p^m,p^n）上其特征多项式f(x）在模p下本原的线性递归序列（包括极大长序列）的p-adic展开，即所谓Galois环导出p元序列，我们得到了这种序列上独立r-样式分布的一个估计，作为推论，r-样式的分布关于f(x)的次数是渐近均匀的。     

Self-Similar Traffic in G/M/1 Queue Defined by the Weibull Distribution

The work considers a queuing system of the G/M/1 type that simulates service of self-similar traffic in a NodeB (e-NodeB) base station of a mobile operator. The feature of quality of service (QoS) characteristics estimation process for the self-similar traffic defined by the Weibull distribution is the solution based on the Laplace–Stieltjes transformation. The Laplace transformation for an infinite number of items under the Weibull distribution condition was found. It was shown that this series was equiconvergent to some convergence domain. The following QoS characteristics were obtained for the self-similar traffic: the average amount of time that a request spends in the system; the average number of requests waiting in the queue and the average queue length. The obtained results allowed to consider the real values of traffic serviced by a NodeB (e-NodeB) for their optimal deployment over a covered territory at the stage of frequency planning and operation of the 3G/UMTS and 4G/LTE networks.     

N*DPT/D/1排队系统分析

多路离散周期串到达、单个服务台定长服务排队系统,是在研究CBR业务下ATM网络中间节点性能时所遇到的一种排队模型。在有线ATM网的CBR业务接进无线ATM网时也会遇到这种排队模型。本文分析了这一排队系统,得到了其队长剩余分布的计算公式。     

A batchSPP/G/1 queue with multiple vacations and exhaustive service discipline

This paper considers a batch-arrival single-server queueing system with multiple vacations and exhaustive service discipline. Customers arrive to the system in accordance with a batch switched Poisson process (batchSPP). Using the supplementary variable technique, we analyze the stationary queue length distribution and derive various formulas for queue lengths and waiting times. In particular, we analytically show the decomposition property for the waiting time distributions. Therefore, the waiting time formulas developed in this paper can also be applied to a batchSPP/G/1 queue without vacations.     

The M/G/1 Finite Capacity Queue with Delays

A steady-state analysis of theM/G/1finite capacity queue with delays is being made. In this model every busy period is followed by the execution of a noninterruptable task other than the servicing of ordinary customers; the duration of this task, called a delay, is a random variable with general distribution. Closed form expressions, easy to evaluate, are given for the distribution of the queue length and the first two moments of the queueing time distribution. A variant is also studied in which a busy period is followed by as many delays as possible, new delays being reinitiated as long as no customer has arrived.     

Output-queue contents in a ‘minislot’ synchronized ATM switch

An N × N switching element with output queueing, as used in a large ATM switching network, is considered. All the inlets of the switching element are synchronized on ‘minislots’, where a minislot is the fixed-length time unit for the transmission of one ‘minicell’. When entering the switching network, an ATM cell is converted into a ‘minicell-train’, consisting of a fixed number of minicells. Using an active/silent model, it is assumed that on each inlet of the switching element, the number of minicelltrains in an active period and the length of a silent period are both geometrically distributed, and the arriving minicell-trains are uniformly distributed among all the outlets. The performance of the switching element can be obtained by analysing one single output queue, which is modeled as a discrete-time single-server queuing system with train arrivals. In this paper, an upper bound and an approximate expression for the mean queue length are derived. More importantly, an analytical method is developed to obtain a tight upper bound and a good approximation for the tail distribution of the queue length. This analytical method is very useful in buffer dimensioning of ATM switches.     

Repairable single server systems with multiple breakdown modes

Typically the availability, steady-state queue length distribution, and mean queue length of Markov queueing systems subject to random breakdowns are computed by generating function or matrix geometric numerical methods. In this paper we point out that, for single server systems, a simple partition balance approach is easier. We illustrate this observation by deriving expressions for the availability, steady-state queue length distribution, mean queue length, and server utilization of a single server system subject to multi-mode, bi-level, Poisson distributed breakdowns of exponentially distributed duration. A numerical example illustrating some of the relations between these measures is also given. Our setup provides a simple, computationally tractable, Markov model for systems in which breakdowns of different types occur and are repaired at rates dependent on the type and severity of the breakdown.     

Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback

In a Jackson-type queuing network with feedback, the equilibrium state distribution of each queue is that of anM/M/ssystem. In support of a previous conjecture that nevertheless the input processes in such a network are not Poisson, the marginal interarrival-time distribution for an equilibriumM/M/1queuing system with feedback, counting both fed-back and exogenous customers as arrivals, is calculated. Since this distribution is a mixture of two exponentials, the total input to such a system is not Poisson.