142 research outputs found
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
We use the incompressibility method based on Kolmogorov complexity to
determine the total number of bits of routing information for almost all
network topologies. In most models for routing, for almost all labeled graphs
bits are necessary and sufficient for shortest path routing. By
`almost all graphs' we mean the Kolmogorov random graphs which constitute a
fraction of of all graphs on nodes, where is an arbitrary
fixed constant. There is a model for which the average case lower bound rises
to and another model where the average case upper bound
drops to . This clearly exposes the sensitivity of such bounds
to the model under consideration. If paths have to be short, but need not be
shortest (if the stretch factor may be larger than 1), then much less space is
needed on average, even in the more demanding models. Full-information routing
requires bits on average. For worst-case static networks we
prove a lower bound for shortest path routing and all
stretch factors in some networks where free relabeling is not allowed.Comment: 19 pages, Latex, 1 table, 1 figure; SIAM J. Comput., To appea
Kolmogorov Random Graphs and the Incompressibility Method
We investigate topological, combinatorial, statistical, and enumeration
properties of finite graphs with high Kolmogorov complexity (almost all graphs)
using the novel incompressibility method. Example results are: (i) the mean and
variance of the number of (possibly overlapping) ordered labeled subgraphs of a
labeled graph as a function of its randomness deficiency (how far it falls
short of the maximum possible Kolmogorov complexity) and (ii) a new elementary
proof for the number of unlabeled graphs.Comment: LaTeX 9 page
Compact Routing on Internet-Like Graphs
The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing
scheme delivering a nearly optimal local memory upper bound. Using both direct
analysis and simulation, we calculate the stretch distribution of this routing
scheme on random graphs with power-law node degree distributions, . We find that the average stretch is very low and virtually
independent of . In particular, for the Internet interdomain graph,
, the average stretch is around 1.1, with up to 70% of paths
being shortest. As the network grows, the average stretch slowly decreases. The
routing table is very small, too. It is well below its upper bounds, and its
size is around 50 records for -node networks. Furthermore, we find that
both the average shortest path length (i.e. distance) and width of
the distance distribution observed in the real Internet inter-AS graph
have values that are very close to the minimums of the average stretch in the
- and -directions. This leads us to the discovery of a unique
critical quasi-stationary point of the average TZ stretch as a function of
and . The Internet distance distribution is located in a
close neighborhood of this point. This observation suggests the analytical
structure of the average stretch function may be an indirect indicator of some
hidden optimization criteria influencing the Internet's interdomain topology
evolution.Comment: 29 pages, 16 figure
On Compact Routing for the Internet
While there exist compact routing schemes designed for grids, trees, and
Internet-like topologies that offer routing tables of sizes that scale
logarithmically with the network size, we demonstrate in this paper that in
view of recent results in compact routing research, such logarithmic scaling on
Internet-like topologies is fundamentally impossible in the presence of
topology dynamics or topology-independent (flat) addressing. We use analytic
arguments to show that the number of routing control messages per topology
change cannot scale better than linearly on Internet-like topologies. We also
employ simulations to confirm that logarithmic routing table size scaling gets
broken by topology-independent addressing, a cornerstone of popular
locator-identifier split proposals aiming at improving routing scaling in the
presence of network topology dynamics or host mobility. These pessimistic
findings lead us to the conclusion that a fundamental re-examination of
assumptions behind routing models and abstractions is needed in order to find a
routing architecture that would be able to scale ``indefinitely.''Comment: This is a significantly revised, journal version of cs/050802
On two-way communication in cellular automata with a fixed number of cells
The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their size of description is studied. kC-OCAs are a parallel model for the regular languages that consists of an array of k identical deterministic finite automata (DFAs), called cells, operating in parallel. Each cell gets information from its right neighbor only. In this paper, two models with different amounts of two-way communication are investigated. Both models always achieve quadratic savings when compared to DFAs. When compared to a one-way cellular model, the result is that minimum two-way communication can achieve at most quadratic savings whereas maximum two-way communication may provide savings bounded by a polynomial of degree k
Kolmogorov Complexity of Graphs
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be measured by its compressibility; that is, a string’s complexity is the length of the shortest program that produces that string. We explore applications of this measure to graph theory
An algorithmically random family of MultiAspect Graphs and its topological properties
This article presents a theoretical investigation of incompressibility and randomness in generalized representations of graphs along with its implications on network topological properties. We extend previous studies on plain algorithmically random classical graphs to plain and prefix algorithmically random MultiAspect Graphs (MAGs). First, we show that there is an infinite recursively labeled infinite family of nested MAGs (or, as a particular case, of nested classical graphs) that behaves like (and is determined by) an algorithmically random real number. Then, we study some of their important topological properties, in particular, vertex degree, connectivity, diameter, and rigidity
Recommended from our members
Modeling single-phase flow and solute transport across scales
textFlow and transport phenomena in the subsurface often span a wide range of length (nanometers to kilometers) and time (nanoseconds to years) scales, and frequently arise in applications of CO₂ sequestration, pollutant transport, and near-well acid stimulation. Reliable field-scale predictions depend on our predictive capacity at each individual scale as well as our ability to accurately propagate information across scales. Pore-scale modeling (coupled with experiments) has assumed an important role in improving our fundamental understanding at the small scale, and is frequently used to inform/guide modeling efforts at larger scales. Among the various methods, there often exists a trade-off between computational efficiency/simplicity and accuracy. While high-resolution methods are very accurate, they are computationally limited to relatively small domains. Since macroscopic properties of a porous medium are statistically representative only when sample sizes are sufficiently large, simple and efficient pore-scale methods are more attractive. In this work, two Eulerian pore-network models for simulating single-phase flow and solute transport are developed. The models focus on capturing two key pore-level mechanisms: a) partial mixing within pores (large void volumes), and b) shear dispersion within throats (narrow constrictions connecting the pores), which are shown to have a substantial impact on transverse and longitudinal dispersion coefficients at the macro scale. The models are verified with high-resolution pore-scale methods and validated against micromodel experiments as well as experimental data from the literature. Studies regarding the significance of different pore-level mixing assumptions (perfect mixing vs. partial mixing) in disordered media, as well as the predictive capacity of network modeling as a whole for ordered media are conducted. A mortar domain decomposition framework is additionally developed, under which efficient and accurate simulations on even larger and highly heterogeneous pore-scale domains are feasible. The mortar methods are verified and parallel scalability is demonstrated. It is shown that they can be used as “hybrid” methods for coupling localized pore-scale inclusions to a surrounding continuum (when insufficient scale separation exists). The framework further permits multi-model simulations within the same computational domain. An application of the methods studying “emergent” behavior during calcite precipitation in the context of geologic CO₂ sequestration is provided.Petroleum and Geosystems Engineerin
Internet Traffic Engineering : An Artificial Intelligence Approach
Dissertação de Mestrado em Ciência de Computadores, apresentada à Faculdade de Ciências da Universidade do Port
- …