In developing a new model for communication protocol analysis, we should examine the seminal work in the area, by C. Shannon. His work explains the operation of many communication models. This is a comparison of Mirage to it. It is also hoped that the Mirage model will reduce to ShannonÕs, in the case where latency is negligible relative to the other communication parameters.
ShannonÕs mathematical model of communication defines channel bandwidth and capacity, and analyzes the capacity of the channel under the constraint of transmission error [Sh63]. In his model, nodes are connected by channels characterized by bandwidth alone (latency is ignored). His analysis determines the amount of information transmitted across a channel, given the transmission errors of that channel.
In this model, the channel can viewed as a pipe between the communicating nodes (Figure A.1). Bandwidth is a unit of volume of flow in this pipe – bits wide times signal duration. Note that the propagation (latency) of this volume as it traverses the pipe is ignored – Mirage adds this factor, in its extension of this model.

Figure A.1
ShannonÕs communication channel
Mirage adds a spatial measure to the connectivity measure of ShannonÕs communication theory. In addition to width, the connecting channel thus has a length (Figure A.2).

Figure A.2
MirageÕs communication channel
One the test of the Mirage model is that it reduce to ShannonÕs where latency is negligible. Mirage adds a latency measure to the channel characterization, but this can be ignored if the state transformation equations ignore the latency measure, so the reduction holds.
ShannonÕs model is based on a denoting the state of a node as a point in state space, implying that the values at the node are known precisely at remote nodes. This is implicit in the communication model, which attempts to emulate the transitions of the transmitter by equivalent transitions in the receiver (Figure A.3).
The communication is based on a model of the channel as it corrupts information that traverses it. Each action of a participant alters the state space point by moving it to a new point. Sending and receiving data are both modeled as motions of single points in state space. The elapsing of time is not modeled in this scheme.

Figure A.3
State space point transformation
In Mirage, the sender models the receiver as a set of points in state space. The endpoints of the channel are considered, rather than the channel itself. Each node in the system models each other, to some extent. These models are sets of points, which, in an appropriately transformed space, comprise a volume. Transformations on that volume represent the functions of the communicating system (Figure A.4). When a node sends a message, its model of the state of the destination of that message expands; when a node receives a message, its model of the source of that message contracts. Time causes the model of the remote node to expand, reflecting the increased uncertainty in the knowledge of the remote state.

Figure A.4
Visualization of state space volume transformations
In the introduction to ShannonÕs work, W. Weaver describes three levels of communication [Sh63]. These levels define the layering of the communication problem, each level being dependent on the successful communication of information at the previous level. Associated with each level is a problem, which determines the extent to which the communication at that level can succeed (Table A.1).
The first level is called the PRECISION level, and it is associated with the technical problem of determining the transmitted symbol from the received signal. Communication at this level assures that a mapping is established between the signals on the opposite ends of the channel. The extent to which the symbol association is repeatable determines the most fundamental limit of communication.
The second level is called the ACCURACY level, and it is associated with the semantic problem of identifying the meaning of the symbol received. This determines the correctness of the received information, relative to the intended information sent.
The third level is called the BEHAVIORAL level, and it is associated with the effectiveness of the communicated message. Effective communication is correlated with the desired behavior of the receiver, i.e., if the receiver acts as if it received the correct information, then we infer that it has.
|
Level Name |
Defined Characteristic |
Net result on communication |
|
technical |
precision |
repeatable |
|
semantic |
accurate |
correct |
|
effective |
correlate to desired behavior |
reaction |
Table A.1
WeaverÕs 3 levels of communication
ShannonÕs work focuses on the technical problems at the precision level, although there are applications of his theory to the other levels as well. Each of these levels is concerned with errors in communication, either in reliability, correctness, or resulting behavior.
In Mirage we are interested in extending ShannonÕs theory to its application in high speed, wide area networks. We have already discussed that the major effort here is to sensitize the problem to communication latency, as such, we consider how to extend ShannonÕs model to account for latency, as it already accounts for error.
One constraint of our extension is that, where latency is negligible, it collapses to the original model; thus it will be an extension to the model. Other constraints are that the model be useful, i.e., that it describes the new domain effectively and that it enables the derivation of protocols that account for this increased latency. We also prefer the model to exhibit these characteristics by an extension that is minimal, but this is not addressed here.
One of the fundamental results of ShannonÕs theory is that any amount of channel error (below 100%) can be removed by sufficient encoding. Given encodings over arbitrarily long sequences of transmitted symbols, the effective error of the channel can be reduced as low as desired (but never removed completely). The effect of error compensation and reduction is to require encoding, which requires delaying the symbol stream by the length over which encoding is performed. As such, error reduction is traded for an increase in propagation delay.
Mirage examines the complement of this, where latency is reduced by increasing the error across the channel; the error will be exhibited by the imprecision of information about remote nodes in the network. Error and latency are thus conjugate spaces, where each may be traded for the other, and some minimal product persists. The error thus introduced will be constrained, in a Ôwell-behavedÕ way, which represents the evolution of imprecision of information caused by elapsed time and other causes.
We define three additional levels of communication, associated with the introduction of measured latency in the channels, called lag and stability. The lag level is associated with the timeliness problem, or how to communicate some amount information within some time delay. The stability level is associated with the synchronization problem, or whether two sets of information can be synchronized to within some error in the given time lag (Table A.2). Each level has a corresponding Weaver level, as shown.
|
Level Name |
Defined Characteristic |
Net result on communication |
Corresponding Weaver level |
|
timeliness |
effect within Dt |
lag |
Technical (repeatable) |
|
synchrony |
synchronize to within Dt |
stability |
Effectiveness (reaction) |
Table A.2
MirageÕs 2 levels of latency
This gives a hint at the justification for seeking additional models for protocol analysis. Current models yield situations in the emerging high speed, wide-area domains where utilization of the communication capacity can be low. New models may explain this phenomenon more precisely, and perhaps indicate methods that alleviate such degradation.
In Mirage, there are three forms of communication: real, virtual direct, and virtual indirect. Real communication corresponds to ShannonÕs communication, where information is transmitted, and the intent of the sender is decrypted by the receiver. Virtual indirect communication is derived information about a set of nodes, given global constraints on the state spaces of all nodes combined with real communication from some other set of nodes. This is also known as inferred or derived communication, and corresponds to common knowledge.
Mirage uses a third form of communication, that of virtual indirect. This is information derived from local constraints about the state evolution of a node and the absence of other communication from that node. Virtual indirect information is contained in the state evolution function of a nodeÕs individual perception, i.e., in the time transformation function of Mirage.
Mirage was originally conceived of in terms of quantum physics analogs [To89]. These analogies helped develop the Mirage model, so it is useful to present some of these discussions here, for historical purposes.
The origins of Mirage began with discussions of state space evolution, and with the imprecisions in that space introduced by communication latency. This latency corresponds to a latency of interaction, which governs the degree of coupling of systems separated in time. This is loosely analogous to particle interaction by force-carrier exchange. Mirage is an attempt to integrate ideas from particle interaction of quantum physics and information theoretic analysis to develop a communication protocol model, as depicted in Figure B.1.

Figure B.1
MirageÕs relationship to other sciences
A protocol can be considered analogous to field interaction as explained by particle exchange in quantum physics (Table B.1). In this analogy, a field is communication, i.e., action at a distance. The mechanism of interaction is field quantum exchange, analogous to packet exchange. Traditional particles in the field are nodes, thus emphasizing the blurred distinction between particles and field quantum, i.e., between data packets and nodes. Uncertainty of particle interaction corresponds to latency of interaction, and the effects of high speed extend the model of interaction, in the manner of relativistic effects.
|
Physics |
Protocol / Network |
|
field |
communication |
|
field quantum |
packet |
|
particles |
nodes |
|
relativistic effects |
high speed |
|
uncertainty |
latency |
Table B.1
Physics analogs of protocol components
In physics, interaction between particles is accomplished by the exchange of other, force-carrying particles. A matter particle emits a force particle by creating it from nothingness (and is recoiled as a result); that force particle is absorbed, causing an impulse where absorbed. If the force particle has high mass, it is hard to exchange over long distances, due to the high temporary energy debt cause by the creation of the force particle. Force particles are thus virtual, i.e., measurable only by their effect. This is discussed in further detail in [Ha88b].
There are, in physics, four forces: electromagnetism, the strong nuclear and weak nuclear forces, and gravity. The strength of the force and distance over which it acts is governed by the mass of the force-carrying particle. Electromagnetism is effective over infinite distances, but affects only charged particles. Photons carry the electromagnetic force, and are bosons (spin-0).
The weak nuclear force governs radioactivity, and is effective over very small (nuclear) distances, and affects only matter particles (fermions, i.e., spin-1/2 particles, not bosons, i.e., integral spin particles). This force is carried by spin-1 vector bosons.
The strong nuclear force holds the nucleus together, and is thus effective over only nuclear distances. It is carried by gluons, which are bosons.
Gravity affects all particles, is weak, and effective over infinite ranges. Further, it is always attractive. Gravitons, which are bosons, are proposed to carry the gravitational force.
Communication is also effected by an exchange. Intuition is that the larger the packet of an exchange, the smaller the effective distance of the data of the packet, because interaction is restricted by latency. Larger packets incur higher latencies.
The analogies between fields and communication have been examined before, in the Computational Field Model (CFM) [To90b], as also discussed as Prior Work in Chapter 3. CFM equates a distributed system with a field and particles, context-switch overhead with inertia, and communication bandwidth with force. It is used to develop a self-optimizing process migration system. Mirage differs from CFM by using physics analogies to guide protocol design, where the analogy ÔhomomorphismÕ is given semantic justification.
With regard to the remainder of the discussion, there are a few notable references. First, [Kl75] contains a good description of the difference between probability density and distribution functions. A good overview of quantum concepts is contained in [Re91], [Ha91], [Sh88]. Original discussions of the Many-Worlds principle are contained in [De73], and an introduction to this principle is given in [Ha91]. An overview of quantum principles for non-scientists is given in [Ga65]. Lastly, an excellent historical overview and presentations on quantum principles are given in [Pe89], although this book is more commonly presented as a discussion of the ÔmentalÕ capabilities of discrete systems.
The existing analogies between communication and physics include similarities between entropy and information, uncertainty and stability, and the Hamiltonian function and state change functions.
Entropy in physics is related to information in communication, as first noted by John von Neumann [Ha28]. The two are inverses, so that the negative of entropy is proportional to information; information is thus sometimes also called Ônegentropy.Õ Both are proportional to the logarithm of possible state space, and are additive where systems are combined. The use of entropy in communications has thus become common.
Some discussions consider physics entropy and information entropy similar but otherwise unrelated, whereas others consider the two identical. We consider them identical for the following reason.
In physics, specifically thermodynamics, entropy is a measure of disorder. The units are calories/degree. Calories are a measure of work, energy, or heat (equivalently). Temperature is defined as energy per degree of freedom, i.e., a measure of energy extracted when degrees of freedom are unified.
In information, entropy is a measure of the log of the number of possible states, or the average number of bits required to specify a state within a partition. Entropy thus measures imprecision of state, or disorder among elements of a partition that information removes.
In both cases, entropy measures disorder, and the amount of ÔworkÕ required to compensate for the disorder. In physics, ÔworkÕ is work, heat, or energy, whereas in communication ÔworkÕ is information, or bits. Thus we consider physics entropy equivalent to communication entropy because we consider work equivalent to information. The only difference is that in physics the degrees of freedom are continuous[1], and in information they are binary.
One result of the true equivalence between physics entropy and information entropy observation concerns uncertainty. The Heisenberg uncertainty principle is characterized by units of Ôaction.Õ [Gr84] An ÔactionÕ is defined as energy*time, or work*time; in communication, this is bits*time, or bit-latency, the unit of ÔdistanceÕ in Mirage. Uncertainty is a measure of imprecision of state in physical systems, and bit-latency governs the imprecision of state in communicating systems.
Further, ÔactionsÕ share a property with entropy – that of observer invariance [Gr84]. In relativistic physics, some measures are not observer invariant; the length of an object depends on the relative velocity between the observer and the object. Time-of-traversal, or distance/time is invariance, because the object shortening is always coupled with a corresponding decrease in the relative time frames.
The Hamiltonian function describes the state transformation of a physical system [Pe89]. The quantum equivalent of the Hamiltonian is the wave-function. In Newtonian (conventional) state space, the Hamiltonian of object location and velocity is denoted by a pair of partial derivatives, Eqs. B.1 and B.2.
Equation B.1: ![]()
Equation B.2: ![]()
ÔHÕ denotes the Hamiltonian, ÔpÕ denotes the momentum, and ÔxÕ denotes the position. The Hamiltonian encodes both the position and momentum. This will be augmented in the quantum description of the equivalent of the Hamiltonian. The pair of equations obey the Heisenberg uncertainty principle, in which the error in position times the error in momentum is always larger than a fixed constant (Eq. B.3).
Equation B.3: ![]()
Although there are some analogies between Newtonian physics and telecommunications, there are others involving quantum physics which have not yet been exploited.
In quantum physics, the state space of a system has a single dimension for each system variable, and is called a phase space. One point in phase space thus denotes an entire configuration of the system; multiple points denote copies (or possible copies) of versions of entire systems [Pe89]. This latter phenomenon has evoked the title Multiple-Worlds, in which each world contains one system [Gr84]. In Mirage, a node models a remote state as a set of possible states, or worlds.
One implication of having multiple simultaneous possible states is that of state collapse, in which a single definite state among the possible is denoted. The denotation occurs because of some external event. In Mirage, this event is the reception of a message from the remote state being modeled.
The canonical physics example of simultaneous state is SchršdingerÕs Cat experiment [Gr84]. In this experiment a delayed choice is modeled in one of two possible ways – either there are two possible worlds in which the cat is correspondingly dead and alive, or the state of the cat (dead, alive) is superimposed in the single world of the experimenter. In the former case, the state of the cat is known precisely in whatever world exists; it is the lack of information in the experimenter that causes the confusion in the choice of the correct world. In the latter, so-called Copenhagen interpretation, the cat exists in two superimposed states, and the delayed opening of the box causes the state vector to collapse.
Mirage is based on the Multiple-Worlds interpretation of quantum interaction, although we often denote the choice of the correct world as Ôstate collapseÕ, because we model state as an expanding set that message reception collapses. The distinction is that the collapse occurs in the mind of the observer only in Multiple-Worlds, whereas that collapse is a property of the actual state of the system in the Copenhagen interpretation.
One interesting characteristic of the Multiple-Worlds interpretation is that the state of the system can be determined by the actions of the observer, in certain cases. When physical experiments were designed that emit particles (i.e., light quanta), and then the experimental apparatus is modified while the quanta are in transit, the results of the experiment change. The answer depends on the questions.
Compare the observer-creation of results with a game of Twenty-Questions, in which the participants agree not to select a goal object. The participants create replies that are random, but necessarily consistent with previous replies and some possible object. The result is that the random choices and the questions asked determine the final object, delaying the choice of the goal object (as in the delayed-choice cat experiment).
The collapse of the state set occurs in the perception of the observer or in the actual system state. In either case, the evolution of the state space set is governed by the so-called wave-function, y, and the Hamiltonian describing this evolution in Newtonian physics becomes SchršdingerÕs wave equation, Eq. B.4. In this equation, the partial of the wave-function with respect to time is the same as the Hamiltonian of the wave-function [Pe89] (with appropriate constants).
Equation B.4: ![]()
The wave-function thus denotes the evolution of the system over time, even when a set of states describes the possible system states. The wave-function describes the Time Transformation of Mirage.
One model for interaction in quantum physics uses virtual particles. A particle is virtual if it can be measured only indirectly, through its effect on other, real (directly measurable) particles. One form of virtual particle is a member of a virtual pair, a particle and its negative image, which can be temporarily created in a vacuum by creating a temporary energy debt in the vacuum.
A second form of virtual pair denotes the two possible paths of a single particle in space. Consider the canonical double-slit experiment, using electrons rather than light. A single electron is a real particle, that should go through only one of the two slits, by Newtonian laws.
In quantum physics, the real electron becomes a set of virtual, mutually-exclusive electrons. These virtual particles travel through all paths in space-time from the emitter to the detector. Two of these paths go through the two slits. The virtual electron going through one slit interacts with the virtual electron going through the other slit, forming an interference pattern. The seeming paradox is that a single real, measurable particle apparently must go through two paths in space-time simultaneously for the interference pattern to occur.
ÒAny other situation in quantum mechanics, it turns out, can always be explained by saying, ÔYou remember the case of the experiment with the two holes? ItÕs the same thing.ÕÓ
- Feynman, quoted in [Gr84]
In Mirage, this latter form of virtual, mutually-exclusive particles corresponds to the possible paths in state-space-time. These virtual paths and particles are denoted more explicitly in the application of Mirage to Petri Nets, in Appendix F.
Real particle paths are the integral of the mutually-exclusive virtual particle paths and interactions therein. Richard Feynman described these path integrals in quantum physics [Gr84].
In quantum interactions, the virtual splitting is not restricted, so a real particle path is described by the integral of an infinite number of virtual particle paths. This introduces an infinity that can be removed by FeynmanÕs technique of renormalization.
Mirage uses a direct analog of Feynman paths in the description of the computation function governing Time Transformations, i.e., in the wave-equation. Mirage does not require renormalization, because the remote state being modeled is equivalent to a Turing Machine (TM). Over a finite time interval, a fixed number of TM state changes occur, and each state change is finitely bounded, so the resulting number of possible state paths of the TM is also bounded. This prevents the need for renormalization, because infinite path lengths and numbers are not possible.
There are a few useful observations from these analogies between physics and communication, and particularly involving quantum interactions. Some of these observations have been presented in the Mirage model description (Chapter 2), in Prior Work (Chapter 3), and in the Mirage extension of Petri Nets (Appendix F). Other observations include the relationship between error and latency, and the interpretation of stability as denoted by these analogies.
Error and latency are conjugates, in which the units of the product of such conjugates are ÔactionsÕ, as described before [Gr84]. The limitation of the product in communication is the bit-latency of the channel. This limit determines the smallest error in stability, in the absence of other constraint information.
Stability in Mirage consists of either traditional stability, or entropic stability (Chapter 2). Traditional stability guarantees constraint of state evolution over time to a fixed subset of possible states. Entropic stability guarantees the evolution of the size of the possible states over time, but doesnÕt restrict the state values to a fixed set. The Time Transformation indicates the evolution of the state space over time.
In physics, the Hamiltonian function denotes each point in phase space as a vector to the subsequent point, i.e., ÔHÕ defines a vector field on phase space. Stability exists when a phase space region is closed with respect to the vector field, i.e., no vector exits the region [Pe89].
The Liouville theorem indicates that the volume of a region of phase space remains constant, but permits the size of the region to grow. The volume of a region is a measure of the number of possible states in the region, whereas the size of the region is a measure in relation to the extremes of the dimensions. The components in the region can disperse throughout phase space, but the total number of components cannot decrease; this latter view is described as the incompressibility of the vector field flow.
By the Liouville theorem, if no vector exits a region, no vector can enter either. This implies that stability violates the theorem. An example of this paradox is shown in the Hawking box.
A Hawking box is a box in thermal equilibrium, containing one black hole [Pe89]. The Hamiltonian in the box has vectors converging in the hole, i.e., there is a confluence (compression, merging) of flow lines. By the Liouville theorem, there must be a corresponding divergence of flow lines, because flow lines remain constant in overall number (incompressible flow of the Hamiltonian).
Hawking himself noted that, ÒI am indeed claiming that it is an objective (sic) quantum-mechanical process of state-vector reductionÉwhich causes the flow lines to bifurcateÉÓ[Pe89] – implying that flow lines can converge (lose information) or diverge (create alternatives).
This may seem contradictory with MirageÕs interpretation of information creation as divergence, and information reception (state-vector reduction) as convergence. This states that state vector-reduction causes flow lines in the Hamiltonian to bifurcate, whereas we claim that the reduction causes state alternatives to collapse (reducing the entropy of the state).
Divergence of flow lines corresponds to a collapse of the state space, because 1 previous state with imprecision becomes one of 2 with precision, i.e., 1 large space becomes 1 of 2 small spaces. The large ¨ small transformation represents the collapse of the space and the increase in information (decrease in entropy). The 1 to 1 of 2 transformation corresponds to the bifurcation of the flow lines.
Mirage thus resolves the paradox with the creation of information by an external party, i.e., the user. A similar paradox removal involves the introduction of information to a formerly closed system by biological participants [Ja55].
This is an analysis of the comparison of the exact and continuous channel utilization formulae from Chapter 2. It will show that the complete discrete formula of channel utilization under finite branching of the message stream (Equation C.1, as repeated below) is bounded by the continuous form (Equation C.2, also as repeated below). We claim that the continuous form is an upper bound for the complete discrete form.
Equation C.1: ![]()
Equation C.2: ![]()
In order for Equation C.2 to be an upper bound to Equation C.1, Equation C.3 must hold. This simplifies (via Eqs. C.4, C.5) to Equation C.6. If Equation C.6 holds under the domain of the original formula, then the upper bound is proven.
Equation C.6 has at least two zeroes, at the endpoints (x=0, x=1) of the domain. It is also positive at arbitrary points within the domain, and continuous within the domain. Its derivative (Equation C.7) has only one zero, i.e., there is only one zero of the slope in the domain. Equation C.6 has two zeroes at the endpoints, is continuous, positive between those endpoints, and its slope has only one zero (a maximum), thus we conclude that it holds for all points in the interior of the domain.
Equation C.3: ![]()
Equation C.4: ![]()
Equation C.5: ![]()
Equation C.6: ![]()
where x ë [0,1)
D ³ 2
Equation C.7: ![]()
Equation C.6 is presented graphically below (Figure C.1), denoting the difference between the upper bound and the exact formula. ÔFractionÕ denotes FRAC(tree-depth); note that as branch degree increases from 2, the deviation increases, and the upper bound becomes less exact, especially for larger values of FRAC(tree-depth).

Figure C.1
Error between upper bound and exact channel utilization
The Liouville theorem is a result of statistical mechanics, which states constraints on the temporal evolution of state space volumes in models of closed systems [Hi56]. The terminology used here is different from that of statistical mechanics (SM), where the theorem is usually presented. What Mirage call state space, SM calls phase space. Mirage refers to a volume in that state space as representing a subset of that space that denotes a set of possible system values; SM refers to the probability density function as describing this set, and its distribution in phase space.
In our notation, the Liouville theorem states that the volume of state space representing the local state of a node cannot add or delete points. The theorem claims that every point in the original state space lies on a unique trajectory of points, of a system as it evolves in time. A systemÕs trajectory is completely described by one such point, because other constraints on the system completely determine its subsequent state from its current.
This indicates that, whereas the points in the original volume may later spread out in space, the overall number of points (the integral of this volume) remains constant. If the integral were to decrease or increase, it would imply that two trajectories merged, indicating that the system had been incompletely described by the state space variables and transformation rules. A closed system is permitted to move through state space, but never to bifurcate into two system instances. Volumes in the state space represent ÔcompetingÕ instances of a system, but only one actually exists. Each system instance has its own unique trajectory, so whereas the volume can move through state space (by translation or deformation) the integral (number of possible state values in the volume) must remain constant.
The theorem applies only to closed systems; the integral of the volume of state space representing remote nodes is not part of such a system, and it thus is not a violation to speak of that volume as expanding (increasing the integral) or collapsing (decreasing the integral). The theorem is meant to convey the notion that information, in a closed system, is neither created nor destroyed over the long term. Within a node, however, information can be created. This occurs whenever I/O occurs at the node, such that the state of the system is now enhanced by external information.
The quantum aspect of this phenomenon is necessitated by the discrete values of the variables in our system – the integral is more properly a (discrete) summation. The theorem applies to the quantum domain in a similar, though distinct fashion. The implications of maintaining this theorem as it applies to Mirage will be discussed more completely in subsequent research.
Mirage uses state space volumes to describe the possible states of a remote node. One instance of this model is a description in terms of sets of states, so that each set represents a ÔvolumeÕ in state space. This set notation can be extended by including a probability for each state. The continuous form of state sets with probabilities is a probability density function (pdf). The following is an elaboration of the definition of the state space volume description of Mirage from Chapter 2, in terms of sets.
Consider the set of nodes in the network. These nodes are
herein completely connected, each pair (i,j)
connected with a finite maximum communication bandwidth (
) and a finite minimum communication delay (
). The following definitions will be used; the ÔequationsÕ
below represent these definitions.
denotes a
nodeÕs finite storage. This storage is
used both to denote the nodeÕs dedicated local storage and perceptions of the
storage of remote nodes.
denotes the local state of the node i, the local component of
its storage.
denotes
node iÕs perception of
node j, which is some subset of the set
of all states of node j, namely
(Eq. E.1).
denotes
node iÕs view of the
network, comprised of its own local state
and the set of
perceptions
of the other nodes (j) in the network (Eq. E.2).
The only constraint thus far is that the size of the node be sufficient to store its view (Eq. E.3). Note also that mutually recursive knowledge is permitted, provided that the recursion is bounded and finite, as required by the fixed size of local storage at each node.
Equation E.1: ![]()
Equation E.2: ![]()
Equation E.3: ![]()
Time transforms the perception by expanding it, thus
reducing the precision in the knowledge of the state of the remote node. The
temporal transformation of a perception of a remote node P over the interval
is denoted by a function
; this function describes the known bounds on the state space
evolution as a function of time. A nodeÕs view thus changes over time as its
local state changes, and as the time transformations of its perceptions change
(Eq. E.4).
Equation E.4: ![]()
The extent to which the remote node is correctly modeled depends on the precision of this function, as characterized by the amount of state space expansion per unit time, a form of induced entropy[2], E. The ratio of the volumes describes the expansion, equivalent to the entropy increase (Eq. E.5). The imprecision describes the difference between node jÕs actual state and node iÕs model of that state. The entropy change per unit time is a measure of the minimum bandwidth required to compensate for the entropy change (Eq. E.6).
Equation E.5: ![]()
Equation E.6: