Results 1  10
of
1,577,739
SelfSimilarity in World Wide Web Traffic: Evidence and Possible Causes
, 1996
"... Recently the notion of selfsimilarity has been shown to apply to widearea and localarea network traffic. In this paper we examine the mechanisms that give rise to the selfsimilarity of network traffic. We present a hypothesized explanation for the possible selfsimilarity of traffic by using a p ..."
Abstract

Cited by 1413 (28 self)
 Add to MetaCart
Recently the notion of selfsimilarity has been shown to apply to widearea and localarea network traffic. In this paper we examine the mechanisms that give rise to the selfsimilarity of network traffic. We present a hypothesized explanation for the possible selfsimilarity of traffic by using a
Analysis, Modeling and Generation of SelfSimilar VBR Video Traffic
, 1994
"... We present a detailed statistical analysis of a 2hour long empirical sample of VBR video. The sample was obtained by applying a simple intraframe video compression code to an action movie. The main findings of our analysis are (1) the tail behavior of the marginal bandwidth distribution can be accu ..."
Abstract

Cited by 546 (6 self)
 Add to MetaCart
be accurately described using "heavytailed" distributions (e.g., Pareto); (2) the autocorrelation of the VBR video sequence decays hyperbolically (equivalent to longrange dependence) and can be modeled using selfsimilar processes. We combine our findings in a new (nonMarkovian) source model
SelfSimilarity Through HighVariability: Statistical Analysis of Ethernet LAN Traffic at the Source Level
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is selfsimilar or longrange dependent in nature (i.e., bursty over a wide range of time scales)  in sharp contrast to commonly made tr ..."
Abstract

Cited by 740 (24 self)
 Add to MetaCart
A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is selfsimilar or longrange dependent in nature (i.e., bursty over a wide range of time scales)  in sharp contrast to commonly made
WideArea Traffic: The Failure of Poisson Modeling
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1995
"... Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session and con ..."
Abstract

Cited by 1772 (24 self)
 Add to MetaCart
time scales; and that FTP data connection arrivals within FTP sessions come bunched into “connection bursts,” the largest of which are so large that they completely dominate FTP data traffic. Finally, we offer some results regarding how our findings relate to the possible selfsimilarity of widearea
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 534 (48 self)
 Add to MetaCart
How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include heavy tails for in and outdegree distributions, communities, smallworld phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time. Here we study a wide range of real graphs, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should increase slowly as a function of the number of nodes (like O(log n) orO(log(log n)). Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a “forest fire” spreading process, that has a simple, intuitive justification, requires very few parameters (like the “flammability” of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
Proof of a Fundamental Result in SelfSimilar Traffic Modeling
 COMPUTER COMMUNICATION REVIEW
, 1997
"... We state and prove the following key mathematical result in selfsimilar traffic modeling: the superposition of many ON/OFF sources (also known as packet trains) with strictly alternating ON and OFFperiods and whose ONperiods or OFFperiods exhibit the Noah Effect (i.e., have high variability or ..."
Abstract

Cited by 287 (9 self)
 Add to MetaCart
We state and prove the following key mathematical result in selfsimilar traffic modeling: the superposition of many ON/OFF sources (also known as packet trains) with strictly alternating ON and OFFperiods and whose ONperiods or OFFperiods exhibit the Noah Effect (i.e., have high variability
Knowledgebased Analysis of Microarray Gene Expression Data By Using Support Vector Machines
, 2000
"... We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
of gene function to identify unknown genes of similar function from expression data. SVMs avoid several problems associated with unsupervised clustering methods, such as hierarchical clustering and selforganizing maps. SVMs have many mathematical features that make them attractive for gene expression
Selfsimilar polytropic champagne flows
 in H II
"... We explore largescale hydrodynamics of H II regions for various selfsimilar shock flows of a polytropic gas cloud under selfgravity and with quasispherical symmetry. We formulate cloud dynamics by invoking specific entropy conservation along streamlines and obtain global selfsimilar “champagne ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
flows ” for a conventional polytropic gas with shocks as a subclass. Molecular cloud cores are ionized and heated to high temperatures after the onset of nuclear burning of a central protostar. We model subsequent evolutionary processes in several ways and construct possible selfsimilar shock flow
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
, 1998
"... SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity. This pape ..."
Abstract

Cited by 1334 (4 self)
 Add to MetaCart
SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity
Results 1  10
of
1,577,739