Analysis of a discrete-time queue with integrated bursty inputs in ATM networks

In this paper, we carry out an exact analysis of a discrete-time queue system with a number of independent Markov modulated inputs in ATM networks, using a generating function approach. We assume that the queueing system has an infinite buffer with M servers. The cell arrival process is characterized by a number of independent Markov modulated geometrical batch arrival processes. We first obtain the generating function of the queue-size distribution at steady-state in vector form, then derive an expression for the average queue-size in terms of the unknown boundary probabilities. To obtain those unknown probabilities, we use the technique proposed in Reference 1. This involves decomposing the system characteristic function to evaluate the roots and solving a set of linear equations. One of the contributions of this paper is presented in Lemma 1, which characterizes the property of the underlying eigenvalues. For one special case of at least M-1 cell arrivals during one slot at one Markov state and of at least M arrivals at all other states, the determination of the unknowns is straightforward. If every Markov modulated arrival process can be further decomposed into a number of i.i.d. two-state, or three-state, or even four-state Markov modulated arrival processes, then each root can be obtained separately using an iterative algorithm. Numerical results are presented to validate the proposed traffic models against actual traffic measurements.     

蜂窝移动网中基于MMPP业务输入模型的系统性能分析

文章针对现有的以Poisson过程作为输入业务流模型分析系统性能的不足,提出采用马尔可夫调制泊松过程(MMPP)作为输入业务流来分析系统的呼叫阻塞率和掉话率.数值和仿真结果表明,MMPP能够较好的对蜂窝移动网中的业务输入流近似建摸,它考虑了业务流本身的相关特性和突发特性,可以更加准确的用于分析系统性能.     

On the effects of the packet size distribution on the packet loss process

Real-time multimedia applications have to use forward error correction (FEC) anderror concealment techniques to cope with losses in today’s best-effort Internet. The efficiency of these solutions is known however to depend on the correlation between losses in the media stream. In this paper we investigate how the packet size distribution affects the packet loss process, that is, the distribution of the number of lost packets in a block, the related FEC performance and the average loss run length. We present mathematical models for the loss process of the MMPP+M/D/1/K and the MMPP+M/M/1/K queues; we validate the models via simulations, and compare the results to simulation results with an MPEG-4 coded video trace. We conclude that the deterministic packet size distribution (PSD) not only results in lower stationary loss probability than the exponential one, but also gives a less correlated loss process, both at a particular average link load and at a particular stationary loss probability as seen by the media stream.Our results show that for applications that can only measure the packet loss probability, the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior. Our results show that the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior and thus can improve the queuing performance by decreasing the variance of its PSD.     

Multi-stream pose convolutional neural networks for human interaction recognition in images

Recognizing human interactions in still images is quite a challenging task since compared to videos, there is only a glimpse of interaction in a single image. This work investigates the role of human poses in recognizing human–human interactions in still images. To this end, a multi-stream convolutional neural network architecture is proposed, which fuses different levels of human pose information to recognize human interactions better. In this context, several pose-based representations are explored. Experimental evaluations in an extended benchmark dataset show that the proposed multi-stream pose Convolutional Neural Network is successful in discriminating a wide range of human–human interactions and human poses when used in conjunction with the overall context provides discriminative cues about human–human interactions.     

Outage probability in Poisson‐cluster‐based LTE two‐tier femtocell networks

This paper analyzes two‐tier orthogonal frequency‐division multiplexing (OFDM)‐based cellular structure, when the traditional macrocell structure is extended with femtocells. The benefit of using femtocells is the capacity and coverage extension capability. To fulfill strict quality of service requirements in next‐generation mobile networks such as Long Term Evolution (LTE) or LTE‐Advanced, capacity and coverage enhancing becomes rather important. On the other hand, adding small cells such as femtocells next to macrocell modifies the interference pattern of the current region. Therefore, the number of small cells in a given area should be limited. In this paper, we provide an analytic framework to calculate the outage probability for a macrocell user in OFDM‐based femtocell networks when the deployed femto base stations are composing an independent Poisson cluster process such as Thomas cluster process. Cluster‐based femtocell modeling offers accurate network planning for mobile operators. In this cluster‐based realization, we give an interference characterization and consider the outage probability for a randomly deployed user when communication channel is infected with Rayleigh fading. Copyright © 2014 John Wiley & Sons, Ltd.     

Modeling MPEG Coded Video Traffic by Markov-Modulated Self-Similar Processes

Markov modulated self-similar processes are proposed to model MPEG video sequences that can capture the LRD (Long Range Dependency) characteristics of video ACF (Auto-Correlation Function). The basic idea is to decompose an MPEG compressed video sequence into three parts according to different motion/content complexity such that each part can individually be described by a self-similar process. Beta distribution is used to characterize the marginal cumulative distribution (CDF) of the self-similar processes. To model the whole data set, Markov chain is used to govern the transitions among these three self-similar processes. In addition to the analytical derivation, initial simulations have demonstrated that our new model can capture the LRD of ACF and the marginal CDF very well. Network cell loss rate using our proposed synthesized traffic is found to be comparable with that using empirical data as the source traffic.     

A simple model of contact patterns in delay-tolerant networks

Delay-tolerant networks, consisting of a number of intermittently connected wireless devices, are emerging as a promising application field, able to complement in some situations infrastructure-based service delivery. In this work, we propose a marked point process model for characterizing the pattern of contacts among nodes in such systems. The model can be used for deriving analytical results on various performance indexes. Validation of the model is performed through comparison with experimental traces obtained from real-world DTN deployments.     

Coverage analysis of cell‐edge users in heterogeneous wireless networks using Stienen's model and RFA scheme

In heterogeneous wireless networks, signal‐to‐interference‐plus‐noise ratio (SINR) suffers degradation due to strong interference received by users from offloaded macro base station (mBS). Similarly, cell‐edge users experience low SINR due to their distant locations. Moreover, small base stations (sBSs) located in the vicinity of mBS experience reduced coverage due to the high transmit power of mBS. To overcome these limitations, we use Stienen's model as a base station deployment strategy to improve network performance gain. More specifically, we use reverse frequency allocation (RFA) as an interference management scheme together with Stienen's model to significantly improve SINR, enhance edge user coverage, and avoid sBS deployment near the mBS. In the proposed set‐up, the available coverage region is divided into two noncontiguous regions, ie, center region and outer region. Furthermore, mBSs are uniformly distributed throughout the coverage region using independent Poisson point processes, while sBSs are deployed only in outer region using Poisson hole process (PHP). Closed‐form expressions for coverage probabilities are characterized for the proposed model. Numerical results show that the proposed scheme yields improved SINR with enhanced edge user coverage and requires fewer number of sBSs.     

基于马氏链的网络节点重要性评价方法

针对网络攻击与防御中资源分配时需对网络节点进行重要性评估的问题,提出了基于网络拓扑图的马氏链模型。并指出若网络中存在经过奇数次跳转能够回到自己的节点时,此网络图的马氏链就是遍历的,且其极限概率为该节点的度比上所有节点度之和。然后根据上述模型,提出把其它节点以最短路径到达该节点概率之和作为节点重要性评判指标。最后进行了实验分析,实验证实了所建模型的正确性,以及节点重要性评价算法的准确性。     

啁啾管理调制格式在高速接入网中传输分析

物联网、虚拟现实及人工智能等技术的发展加大了对光纤接入无源光网络带宽的需求,其中调制器成为制约无源光网络带宽的关键因素。结合了直接调制激光器和外调制器各自优势的啁啾管理激光器以产生结构简单、便于集成等特点受到了广泛关注。采用耦合速率方程理论研究了啁啾管理激光器的动力学特性,分析了40 Gbit/s啁啾管理调制格式的产生原理及时频域特性,并在高速无色散补偿接入网中与由外调制器产生的40 Gbit/s非归零调制格式进行了性能对比。结果表明,带宽为48.5 GHz的40 Gbit/s啁啾管理调制格式在1 dB灵敏度代价下所对应的色散容限为215 ps/nm,与非归零调制格式相比其无色散补偿传输距离增加了1.6倍,表现出了强的抗色散能力,在高速接入网中也体现了较高的应用价值。相关结果可为实际系统设计提供理论参考。     

Markov mobility model and registration area optimization in cellular networks

In cellular communication systems, in order for a network to keep track of inactive mobile stations (MSs), each inactive MS has to update its location from time to time, called location registration. To lighten the task of tracking inactive MSs, the network divides its cells into groups, called location areas (LAs) and tracks inactive MSs at the LA level: an inactive MS sends a registration message to the network to update its location only when it travels to a new LA. Obviously, the performance of a location area design depends on network traffic and the mobility of MSs. In the paper, we propose a general Markov mobility model for MSs in cellular networks, provide a procedure to automatically estimate the system parameters according to the network traffic, derive the performance of LA design, and provide a clustering algorithm to optimize LA designs. A numerical example is provided to show the effectiveness of the proposed procedures. Copyright © 2009 John Wiley & Sons, Ltd.     

基于攻击路径的漏洞风险评估模型

论文从漏洞评估的原理、攻击路径及漏洞本身,提出一种基于攻击路径的漏洞风险评估模型。结合Markov与Poisson过程改进攻击路径的转换方式,形成基于其上的评估数学模型。     

TFT-LCD过孔接触电阻研究

研究了过孔接触电阻变化规律,并进行机理分析,为优化薄膜晶体管的过孔设计提供依据。首先,运用开尔文四线检测法对不同大小、形状、数量的钼/铝/钼结构的栅极和源/漏层金属与氧化铟锡连接过孔的接触电阻进行测试。然后,通过扫描电子显微镜、能量色散X射线光谱仪和聚焦离子束显微镜对过孔内部形貌进行表征。最后,对过孔接触电阻变化规律进行机理分析。实验结果表明:过孔面积越大,接触电阻越小;过孔面积相同时,长方形过孔的接触电阻小于正方形过孔的接触电阻,多小孔的接触电阻小于单大孔的接触电阻,栅极金属与氧化铟锡的过孔接触电阻小于源/漏层金属与氧化铟锡的过孔接触电阻。为了降低钼/铝/钼与氧化铟锡连接过孔的接触电阻,过孔面积尽可能最大化,采用长方形过孔优于正方形过孔,多小过孔优于单大孔设计,同时优化过孔刻蚀工艺,减少过孔内顶层钼的损失。     

Routing protocol based on social characteristics for opportunistic networks简

Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people＇s movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing（SONR） was proposed which brings an adapted discrete Markov chain into nodes＇ mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.     

Optimal Threshold Policies for Admission Control in Communication Networks via Discrete Parameter Stochastic Approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.     

Optimized bandwidth allocation with fairness and service differentiation in multimedia wireless networks

In this article we present an optimal Markov Decision‐based Call Admission Control (MD‐CAC) policy for the multimedia services that characterize the next generation of wireless cellular networks. A Markov decision process (MDP) is used to represent the CAC policy. The MD‐CAC is formulated as a linear programming problem with the objectives of maximizing the system utilization while ensuring class differentiation and providing quantitative fairness guarantees among different classes of users. Through simulation, we show that the MD‐CAC policy potentially achieves the optimal decisions. Hence our proposed MD‐CAC policy satisfies its design goals in terms of call‐class‐differentiation, fairness and system utilization. Copyright © 2006 John Wiley & Sons, Ltd.     

Low-resistance polysilicon process in contact application for high density devices

For the lowest resistance, it is required to have the epitaxial silicon contact between the silicon plug and the substrate and good step coverage at the high aspect-ratio contact holes, simultaneously. In this work, a double polysilicon (DPS) deposition technique was proposed for the requirements. The first, thin silicon layer is deposited in a single-wafer process chamber with an in-situ H₂-RTP (rapid thermal process) treatment for the epitaxial contact, and the second silicon layer is formed in a batch-type furnace for good step coverage. From chain resistance, Kelvin R_c, and current-voltage (I–V) measurement, the DPS process meets both low resistance and good uniformity, so that it suggests a breakthrough in the small-sized, semiconductor device application.     

Locating hot nodes and data routing for efficient decision fusion in sensor networks

This paper presents a fundamentally new approach to integrating local decisions from various nodes and efficiently routing data in sensor networks. By classifying the nodes in the sensor field as “hot” or “cold” in accordance with whether or not they sense the target, we are able to concentrate on a smaller set of nodes and gear the routing of data to and from the sink to a fraction of the nodes that exist in the network. The introduction of this intermediary step is fundamentally new and allows for efficient and meaningful fusion and routing. This is made possible through the use of a novel Markov Random Field (MRF) approach, which, to the best of our knowledge, has never been applied to sensor networks, in combination with Maximum A Posteriori Probability (MAP) stochastic relaxation tools to flag out the “hot” nodes in the network, and to optimally combine their data and decisions towards an integrated and collaborative global decision fusion. This global decision supersedes all local decisions, and provides the basis for efficient use of the sensed data. Because of the MRF local nature, nodes need not see or interact with other nodes in the sensor network beyond their immediate neighborhood, which can either be defined in terms of distance between nodes or communication connectivity, hence adding to the flexibility of dealing with irregular and varying sensor topologies, and also minimizing node power usage and providing for easy scalability. The routing of the “hot” nodes’ data is confined to a cone of nodes and power constraints are taken into account. We also use the found location of the centroid of the hot nodes over time to track the movement of the target(s). This is achieved by using the segmentation at time t as an initial state in the stochastic MAP relaxation at time t + Δt.     

Congestion management techniques for disruption‐tolerant satellite networks

Delay and disruption‐tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end‐to‐end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay‐ and disruption‐tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.