Statistical multiplexing of video sources for packet switching networks

Communication networks are fast evolving towards truly integrated networks handling all types of traffic. They employ integrated switching technologies for voice. video and data. Statistical or asynchronous time division multiplexing of full motion video sources is an initial step towards packetized video networks. The main goal is to utilize the common communication channel efficiently, without loosing quality at the receiver. This work discusses the concept of using statistical multiplexing for packet video communications. The topology of a single internal packet network to support ISDN services has been adopted. Simulations have been carried out to demonstrate the statistical smoothing effect of packetized video in the networks having high speed links. Results indicate that the channel rate per source decreased in an exponential manner as the number of sources increased. An expression for the average usage time t of the channel has been derived in terms of channel rate per source and the number of sources multiplexed. Also the average usage time of the channel is higher for buffered data than that of the multiplexed data. The high speed communication links in the internal network are lightly loaded, which indicates that these links can accommodate more data

Self-similar traffic and network dynamics

Copyright © 2002 IEEEOne of the most significant findings of traffic measurement studies over the last decade has been the observed self-similarity in packet network traffic. Subsequent research has focused on the origins of this self-similarity, and the network engineering significance of this phenomenon. This paper reviews what is currently known about network traffic self-similarity and its significance. We then consider a matter of current research, namely, the manner in which network dynamics (specifically, the dynamics of transmission control protocol (TCP), the predominant transport protocol used in today's Internet) can affect the observed self-similarity. To this end, we first discuss some of the pitfalls associated with applying traditional performance evaluation techniques to highly-interacting, large-scale networks such as the Internet. We then present one promising approach based on chaotic maps to capture and model the dynamics of TCP-type feedback control in such networks. Not only can appropriately chosen chaotic map models capture a range of realistic source characteristics, but by coupling these to network state equations, one can study the effects of network dynamics on the observed scaling behavior. We consider several aspects of TCP feedback, and illustrate by examples that while TCP-type feedback can modify the self-similar scaling behavior of network traffic, it neither generates it nor eliminates it.Ashok Erramilli, Matthew Roughan, Darryl Veitch and Walter Willinge

Spatio-Temporal Low Count Processes with Application to Violent Crime Events

There is significant interest in being able to predict where crimes will happen, for example to aid in the efficient tasking of police and other protective measures. We aim to model both the temporal and spatial dependencies often exhibited by violent crimes in order to make such predictions. The temporal variation of crimes typically follows patterns familiar in time series analysis, but the spatial patterns are irregular and do not vary smoothly across the area. Instead we find that spatially disjoint regions exhibit correlated crime patterns. It is this indeterminate inter-region correlation structure along with the low-count, discrete nature of counts of serious crimes that motivates our proposed forecasting tool. In particular, we propose to model the crime counts in each region using an integer-valued first order autoregressive process. We take a Bayesian nonparametric approach to flexibly discover a clustering of these region-specific time series. We then describe how to account for covariates within this framework. Both approaches adjust for seasonality. We demonstrate our approach through an analysis of weekly reported violent crimes in Washington, D.C. between 2001-2008. Our forecasts outperform standard methods while additionally providing useful tools such as prediction intervals

On the time scales in video traffic characterization for queueing behavior

To guarantee quality of service (QoS) in future integrated service networks, traffic sources must be characterized to capture the traffic characteristics relevant to network performance. Recent studies reveal that multimedia traffic shows burstiness over multiple time scales and long range dependence (LRD). While researchers agree on the importance of traffic correlation there is no agreement on how much correlation should be incorporated into a traffic model for performance estimation and dimensioning of networks. In this article, we present an approach for defining a relevant time scale for the characterization of VER video traffic in the sense of queueing delay. We first consider the Reich formula and characterize traffic by the Piecewise Linear Arrival Envelope Function (PLAEF). We then define the cutoff interval above which the correlation does not affect the queue buildup. The cutoff interval is the upper bound of the time scale which is required for the estimation of queue size and thus the characterization of VER video traffic. We also give a procedure to approximate the empirical PLAEF with a concave function; this significantly simplifies the calculation in the estimation of the cutoff interval and delay bound with little estimation loss. We quantify the relationship between the time scale in the correlation of video traffic and the queue buildup using a set of experiments with traces of MPEG/JPEG-compressed video. We show that the critical interval i.e. the range for the correlation relevant to the queueing delay, depends on the traffic load: as the traffic load increases, the range of the time scale required for estimation for queueing delay also increases. These results offer further insights into the implication of LRD in VER video traffic. (C) 1999 Elsevier Science B.V. Ail rights reserved

Optimal Random Access and Random Spectrum Sensing for an Energy Harvesting Cognitive Radio with and without Primary Feedback Leveraging

We consider a secondary user (SU) with energy harvesting capability. We design access schemes for the SU which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ) feedback. We study two problem-formulations. In the first problem-formulation, we characterize the stability region of the proposed schemes. The sensing and access probabilities are obtained such that the secondary throughput is maximized under the constraints that both the primary and secondary queues are stable. Whereas in the second problem-formulation, the sensing and access probabilities are obtained such that the secondary throughput is maximized under the stability of the primary queue and that the primary queueing delay is kept lower than a specified value needed to guarantee a certain quality of service (QoS) for the primary user (PU). We consider spectrum sensing errors and assume multipacket reception (MPR) capabilities. Numerical results show the enhanced performance of our proposed systems.Comment: ACCEPTED in EAI Endorsed Transactions on Cognitive Communications. arXiv admin note: substantial text overlap with arXiv:1208.565