In this paper, we develop a new multiscale modeling framework for characterizing positive-valued data with longrange-dependent correlations (1=f noise). Using the Haar wavelet transform and a special multiplicative structure on the wavelet and scaling coefficients to ensure positive results, the model provides a rapid O(N) cascade algorithm for synthesizing Npoint data sets. We study both the second-order and multifractal properties of the model, the latter after a tutorial overview of multifractal analysis. We derive a scheme for matching the model to real data observations and, to demonstrate its effectiveness, apply the model to network traffic synthesis. The flexibility and accuracy of the model and fitting procedure result in a close fit to the real data statistics (variance-time plots and moment scaling) and queuing behavior. Although for illustrative purposes we focus on applications in network traffic modeling, the multifractal wavelet model could be useful in a number of other areas involving positive data, including image processing, finance, and geophysics.

In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such that all nodes receive the packets successfully in a limited time. We employ the Protocol Model for successful packet reception usually adopted in network capacity studies and provide novel upper and lower bounds for the broadcast capacity for arbitrary connected networks. In a homogeneous dense network these bounds simplify to Θ(W/ max(1, ∆ d )) where W is the wireless channel capacity, ∆ the interference parameter, and d the number of dimensions of space in which the network lies. Interestingly, we show that the broadcast capacity does not change by more than a constant factor when we vary the number of nodes, the radio range, the area of the network, and even the node mobility. To address the achievability of capacity, we demonstrate that any broadcast scheme based on a backbone of size proportional to the Minimum Connected Dominating Set guarantees a throughput within a constant factor of the broadcast capacity. Finally, we demonstrate that broadcast capacity, in stark contrast to unicast capacity, does not depend on the choice of source nodes or the dimension of the network.

Abstract-Many studies have indicated the importance of capturing scaling properties when modeling traffic loads; however, the influence of long-range dependence (LRD) and marginal statistics still remains on unsure footing. In this paper, we study these two issues by introducing a multiscale traffic model and a novel multiscale approach to queuing analysis. The multifractal wavelet model (MWM) is a multiplicative, wavelet-based model that captures the positivity, LRD, and "spikiness" of non-Gaussian traffic. Using a binary tree, the model synthesizes an N-point data set with only 0 (N) computations.Leveraging the tree structure of the model, we derive a multiscale queuing analysis that provides a simple closed form approximation to the tail queue probability, valid for any given buffer size. The analysis is applicable. not only to the MWM but to tree-based models in general, including fractional Gaussian noise. Simulated queuing experiments demonstrate the accuracy of the MWM for matching real data traces and the precision of our theoretical queuing formula. Thus, the MWM is useful not only for fast synthesis of data for simulation purposes but also for applications requiring accurate queuing formulas such as call admission control. Our results clearly indicate that the marginal distribution of traffic at different time-resolutions affects queuing and that a Gaussian assumption can lead to over-optimistic predictions of tail queue probability even when taking LRD into account.

Abstract-We study the small-time (sub-seconds) scaling behaviors of Internet backbone traffic, based on traces collected from OC3/12/48 links in a tier-1 ISP. We observe that for a majority of these traces, the (second-order) scaling exponents at small time scales (1ms -100ms) are fairly close to 0.5, indicating that traffic fluctuations at these time scales are (nearly) uncorrelated. In addition, the traces manifest mostly monofractal behaviors at small time scales. The objective of the paper is to understand the potential causes or factors that influence the smalltime scalings of Internet backbone traffic via empirical data analysis. We analyze the traffic composition of the traces along two dimensions -flow size and flow density. Our study uncovers dense flows (i.e., flows with bursts of densely clustered packets) as the correlation-causing factor in small time scales, and reveals that the traffic composition in terms of proportions of dense vs. sparse flows plays a major role in influencing the small-time scalings of aggregate traffic.

No abstract

No abstract

Abstract-This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of colors. A node only forwards the message if it can assign it a color from the pool which it has not already overheard after a random time. In the closely related counter-based broadcast scheme a node simply counts the number of broadcasts not the colors overheard. The forwarding nodes form a so-called backbone, which is determined by the random timers and, thus, is random itself. Notably, any counter-generated backbone could result from pruning a color-generated backbone; the typical color-generated backbone, however, exhibits a connectivity graph richer than the counter-based ones. As a particular advantage, the colors reveal simple geometric properties of the backbones which we exploit to prove that the size of both, color-and counter-generated backbones are within a small constant factor of the optimum. We also propose two techniques, boosting and edge-growing, that improve the performance of color-and counter-based broadcast in terms of reachability and number of rebroadcasts. Experiments reveal that the powerful boosting method is considerably more effective with the color-based schemes. I. MOTIVATION AND BACKGROUNDIn ad hoc networks, broadcast plays a crucial role, relaying a message generated by one node to all other nodes. Several unicast routing protocols such Dynamic Source Routing (DSR), Ad Hoc On Demand Distance Vector (AODV), Zone Routing Protocol (ZRP), and Location Aided Routing (LAR), as well as multicast protocols employ broadcasting to detect and maintain routes in an ever changing environment.The simplest approach for broadcasting is flooding, where each node rebroadcasts a message as soon as it receives it for the first time. While ensuring a high success rate in reaching all nodes, flooding produces redundant broadcast messages. This redundancy can become overwhelming in dense wireless networks, leading to a loss of precious bandwidth and battery power and to a dramatic degradation of performance, a situation called "broadcast storm" [1].Several broadcast schemes have been developed that avoid broadcast storms. The performance of these schemes is measured in terms of reachability, that is the fraction of the total nodes that receive the broadcast message, the number of rebroadcasts, that is the number of nodes that forward the message, and the latency, that is the time between the first and last instant that the broadcast message is transmitted. The set of nodes which forward the broadcast message form the socalled backbone. Good broadcast schemes ensure reachability close to 1 and simultaneously a small backbone.Broadcast Probabilistic schemes, in contrast, rebuild a backbone from scratch during each broadcast. Nodes make instantaneous local decisions about whether to broadcast a message or not using information derived only from overheard broadcast messages. Consequently these schemes incur a smaller overhead ...

No abstract