# Patent

## Title
Communications network system including acknowledgement indicating

## Abstract

This is a continuation of application Ser. No. 08/554,251 filed Nov. 8, 1995, now abandoned, and a continuation of application Ser. No. 08/311,303 filed Sep. 23, 1994, now abandoned.

## Background
The present invention relates to an algorithmic methodology for automating Transform-Expand-Sample (TES) modeling and specifically for use as an input analysis method for simulation analysis in general and in broadband video traffic modeling, in particular.

Stochastic dependence is quite common in real-world random phenomena, including bursty traffic in high-speed communications networks. Compressed video, also known as VBR (variable bit rate) video, is a case in point. Intuitively, burstiness is present in a traffic process, if arrival points appear to form visual clusters on the time line. The mathematical underpinning of burstiness is complex; two main factors contributing to traffic burstiness are the marginal distribution and autocorrelation function of traffic interarrival times or of the magnitudes of arriving workloads. Strong positive short-term autocorrelations are good indicators of traffic burstiness. Analytical models, however, tend to ignore dependence in order to gain analytical tractability; in particular, the bulk of queuing models is devoted to the study of queues with independent interarrival and service times. The impact of autocorrelation in traffic processes on queueing measures (e.g., mean queue length, mean waiting times and loss probabilities in finite buffers) can be very dramatic, even in light traffic regimes; worse still, ignoring correlations leads to over-optimistic predictions which are often off by orders of magnitude.

Modeling temporal dependence in time-series often involves a trade-off between model accuracy and computational feasibility. The histogram construct, which models first-order properties, is one example of this trade-off. The autocorrelation function, which models second-order properties, is another. The latter is a popular statistical proxy of dependence, especially in engineering disciplines. A natural idea is to capture first-order and second-order properties of empirical time series (assumed to be from a stationary probability law) by fitting simultaneously both the empirical distribution (histogram) and empirical autocorrelation function.

Transform-Expand-Sample (TES) is a versatile class of stationary stochastic processes with general marginals, a wide variety of autocorrelation functions (e.g., monotone, oscillatory and others), and broad range of sample path behaviors (e.g., directional and reversible). From a Monte Carlo simulation prospective, TES generation algorithms are fast and require little memory. In essence, TES is a first-order nonlinear autoregressive scheme with modulo-1 reduction and additional transformations. Its specification comprises two kinds of parameters from two distinct sets. The first set, which is algorithmically determined, guarantees an exact match to the empirical distribution (histogram). The second set largely determines the autocorrelation structure. In order to approximate the empirical autocorrelation function, the TES modeling methodology to-date employs a heuristic search approach on a large parametric space.

Effective TES modeling requires software support. An interactive visual modeling environment, called TEStool, was designed and implemented to support heuristic searches for TES models under human control. TEStool is described in an article by D. Geist and B. Melamed entitled "TEStool: An Environment for Visual Interactive Modeling of Autocorrelated Traffic" in Proceedings of the 1992 International Conference on Communications, Vol. 3, pp. 1285 to 1289, 1992. TEStool allows the user to read in empirical time series and calculate their statistics (histogram, autocorrelation function and spectral density) in textual and graphical representations. It provides services to construct and modify TES models and to superimpose the corresponding TES statistics on their empirical counterparts. The search proceeds in an interactive style, guided by visual feedback: each model modification triggers a recalculation and redisplay of the corresponding statistics. This approach has several limitations. First, effective TES modeling requires qualitative understanding of TES processes as well as experience; second, the search scope and speed are fundamentally limited by the speed of the human response bounded by the individual limits of human patience; and third, modeling precision is constrained by screen resolution as perceived by the human eye. A TES modeling algorithm is described and illustrated in U.S. Pat. No. 5,257,364 issued to B. Melamed and D. Jagerman and entitled "Method for Generating a Correlated Sequence of Variates with Desired Marginal Distribution for Testing a Model of a Communication System", which is hereby incorporated herein by reference.

The present invention provides an algorithmic methodology for automating TES modeling, thereby shifting the modeling burden from a human conducting a heuristic search over a large parametric space. The modeling problem is solved in a nonlinear programming environment, taking advantage of fast and accurate computation of TES autocorrelation functions and their partial derivatives to implement a steepest-descent technique based on Zoutendijk's Feasible Direction Method. Among the different techniques which can be used to practice the invention, for example, gradient projection, penalty method or the like, Zoutendijk's Feasible Direction Method was found to be the best. This method depends heavily on an efficient "linear" search for the optimal feasible direction which constitutes a solution to a linear programming subproblem. An explicit solution is possible, owing to the relatively simple constraints involved. In addition, the apparent smooth local behavior of the objective function contributes significantly to the overall good performance of the modeling algorithm.

The TES modeling algorithm has been incorporated into the TEStool modeling environment to supplement its heuristic search support, largely automating the search. The user is only asked to specify a few discretization parameters which determine the accuracy and the computational complexity of the search. The end-product of the algorithm are multiple candidate TES models whose number is a user-supplied parameter. The final selection of a model is made by the user, by inspecting the associated simulated sample paths and judging their "resemblance" to their empirical counterpart. TEStool permits the display of intermediate results, mainly as a didactic means of elucidating TES modeling and the intuition behind it.

This last step is not automated, since in the absence of an agreed upon mathematical measure, sample path "resemblance" is necessarily subjective. However, users are routinely called upon to make such subjective judgments. The present modeling approach centers on the so-called GSLO (Global Search Local Optimization) algorithm which combines a global search with a local nonlinear programming to minimize an objective function comprising the distance between the empirical autocorrelation function and its candidate model counterpart. The notion of distance is taken as a weighted sum of squared differences between autocorrelations of corresponding lags. Key to this approach is the existence of fast and numerically stable analytical formulas for calculating the objective function and its partial derivatives, as well as the simplicity of the constraints in the ensuing nonlinear optimization problem. The method is described in conjunction with three examples: two from the domain of compressed video traffic, and one representing results from a physics laboratory experiment on laser intensity.

Experimentation with the modeling algorithm, as implemented in TEStool, has yielded remarkably accurate TES models of empirical records in a relatively short period of time, typically on the order of minutes. Experience with a variety of empirical data sets confirms that the algorithmic TES modeling methodology can serve as a powerful input analysis technique for simulation analysis in general, and broadband video traffic modeling, in particular.

The invention will more clearly be understood when the following description is read in conjunction with the accompanying drawing.

FIG. 1 is pseudo-code for the Optimal Feasible Direction Subproblem;

FIG. 2 shows a TEStool screen showing the results for algorithmic TES modeling of a empirical sample path of VBR video;

FIG. 3 shows a TEStool screen showing the algorithm TES modeling results for a P-frame model;

FIG. 4 shows a TEStool screen showing the algorithm TES modeling results for the fluctuation intensity of an NH.sub.3 laser experiment; and

FIG. 5 is a flow diagram of a preferred method of simulation analysis in accordance with the teachings of the present invention.

In order to better understand the present invention, a brief background regarding TES processes is provided. A more detailed overview is found in an article by B. Melamed entitled "An Overview of TES Processes and Modeling Methodology" in Performance Evaluation of Computer and Communication Systems (L. Donatiello and R. Nelson, Eds.) pp 359 to 393, Springer-Verlag Lecture Notes in Computer Sciences 1993.

In the following description .function. will denote the Laplace transform of a function, .function., and 1.sub.A will denote the indicator function of set A.

The construction of a TES process involves two random sequences in lockstep. The first sequence, called a background TES process, plays an auxiliary role. It is chosen as either {U.sub.n.sup.+ }.sub.n=0.sup..infin. or {U.sub.n.sup.- }.sub.n=0.sup..infin., defined recursively by ##EQU1## The value of, U.sub.O is distributed uniformly on (0,1); V={V.sub.n }.sub.n=1.sup..infin. is a sequence of iid random variables, independent of U.sub.0, called the innovation sequence; and angular brackets denote the modulo-1 (fractional part) operator (.chi.)=.chi.-max{integer n: n.ltoreq..chi.}. The superscript notation in equation (1) is motivated by the fact that U.sup.+ ={U.sub.n.sup.+ } and U.sup.- ={U.sub.n.sup.- } can generate lag-1 autocorrelations in the ranges 0,1! and -1,0!, respectively. There will always be appended plus or minus superscripts to other mathematical objects associated with {U.sub.n.sup.+ } and {U.sub.n.sup.- }, but the superscript is omitted when the distinction is immaterial. Intuitively, the modulo-1 arithmetic used in the definition of the background TES processes in equation (1) gives rise to a simple geometric interpretation as random walks on a circle of circumference 1 (unit circle), with mean step size EV.sub.n !.

The second sequence, called a foreground sequence, is the target TES model. Foreground TES sequences are denoted {X.sub.n.sup.+ }.sub.n=0.sup..infin. or {X.sub.n.sup.- }.sub.n=0.sup..infin., respectively, and given by

where D is a real-valued measurable transformation from 0,1), called a distortion. Equation (2) defines two classes of TES models, denoted TES.sup.+ and TES.sup.-, respectively.

The autocorrelation functions of TES processes, with common variance, 0<.sigma..sub.X.sup.2 <.infin., can be calculated numerically from fast and accurate formulas. Specifically, for any .tau..gtoreq.0, the corresponding autocorrelations of lag .tau. for {X.sub.n.sup.+ } and {X.sub.n.sup.- }, respectively, are given by ##EQU2##

Analytical formulas for .function..nu.(i2.pi..nu.) and D(i2.pi..nu.,) are given in an article by D. J. Jagerman and B. Melamed entitled "The Transition and Autocorrelation Structure of TES Processes Part II" "Special Cases", in Stochastic Models, Vol. 8(3), pp 499 to 527, 1992.

Given an empirical time series, {Y.sub.n }.sub.n=0.sup.N, one uses in practice a composite distortion of the form .chi..epsilon..vertline.0, 1).                            (5)

Here, the inner transformation, S.sub..xi., is a "smoothing" operation, called a stitching transformation, parameterized by 0.ltoreq..xi..ltoreq.1, and given by ##EQU3##

The outer transformation, H.sub.Y.sup.-1, is the inverse of the empirical (histogram) distribution function computed from {Y.sub.n } as ##EQU4## where J is the number of histogram cells, l.sub.j, r.sub.j) is the domain of cell j with width .omega..sub.j =r.sub.j -l.sub.j >0, p.sub.j is the probability estimator of cell j and {C.sub.i }.sub.i=0.sup.J is the cumulative distribution function (cdf) of {p.sub.j }.sub.j-1.sup.J, i.e., C.sub.j =.SIGMA..sub.i=1.sup.j p.sub.i, 1.ltoreq.j.ltoreq.J (C.sub.0 =0 and C.sub.J =1).

The rationale for TES processes stems from the following facts. First, all TES background sequences are stationary Markovian, and their marginal distribution is uniform on 0,1), regardless of the probability law of the innovations {V.sub.n } selected, as a consequence of the General Iterated Uniformity Lemma in the article by D. L. Jagerman and B. Melamed entitled "The Transition and Autocorrelation Structure of TES Processes Part I; General Theory", in Stochastic Models Vol 8(2) pp 193 to 219 1992. Second, the inversion method described by L. Devroye in a book entitled "Non-Uniform Random Variate Generation", Springer-Verlag, 1986, permits, in principle, transforming any uniform variate to others with arbitrary distributions as follows: if U is uniform on 0,1) and F is a prescribed distribution, then X=F.sup.-1 (U) has distribution F, the case F=H.sub.Y being a special case. And third, for 0<.xi.<1, the effect of S.sub..xi. is to render the sample paths of background TES sequences more "continuous-looking". As stitching transformations preserve uniformity, the inversion method can still be applied to stitched background processes, {S.sub..xi. (U.sub.n)}, so that any foreground TES variate of the form X.sub.n =H.sub.Y.sup.-1 (S.sub..xi. (U.sub.n)), obtained from any background sequence {U.sub.n }, is always guaranteed to obey the empirical distribution (histogram), H.sub.Y, regardless of the innovation density .function..nu. and stitching parameter .xi. selected, while the choice of (.function..nu., .xi.) determines its dependence structure and, in particular, its autocorrelation function. Thus, TES modeling decouples the fitting of the empirical distribution from the fitting of the empirical autocorrelation function. Since the former is guaranteed, one can concentrate on the latter.

An important property of the autocorrelation functions in equation (3) is their uniform absolute summability in .tau., which is an easy consequence of the facts ##EQU5##

This allows the fixing of D.sub.Y,.xi. and the use of the same finite sum in calculating autocorrelations for all lags, .tau., thereby achieving a uniformly bounded error. These calculations are both fast and accurate. Experimentation has shown that just seven terms in the sums of equation (3) suffice to keep the error under 0.01, uniformly in .tau..

Having set forth the background of TES processes, the formulation of the TES fitting problem for TES processes of specialized form will now be described. The following description will restrict the treatment to distortions, D.sub.Y,.xi., from equation (5), which represent TES parameters of the first kind, and to pairs, (.function..nu., .xi.), of step-function innovation densities and stitching parameters, which represent TES parameters of the second kind. These choices of D.sub.Y,.xi. and .function..nu. have the merit of simplicity, without loss of generality (every density can be approximated arbitrarily closely by step functions).

An exact match to the empirical histogram is guaranteed by equation (5). Thus, the problem reduces to one of approximating the empirical autocorrelation function, .rho..sub.Y, by some TES model autocorrelation function, .rho..sub..function..nu.,.xi., to be determined through the choice of (.function..nu., .xi.). To this end, a metric on the space of autocorrelation functions is needed. This metric should reflect the fact that in most applications (e.g., queueing systems), it is more important to approximate the lower-lag auto-correlations than the higher-lag ones. This consideration leads us to employ an objective function whose general form is a weighted sum of squared differences between the empirical and modeled autocorrelations, namely, ##EQU6## where T is the maximal autocorrelation lag to be approximated, and the 0<.alpha..sub..tau. .ltoreq.1 are weight coefficients. The modeling problem can now be set up in a nonlinear optimization framework, namely, a search for a pair, (.function..nu., .xi.), which minimizes the autocorrelation distance in the sense of equation (9). What is sought is the solution to the following nonlinear optimization problem:

For a fixed inverse histogram distribution of equation (7), find an optimal innovation density and stitching parameter, (.function..sub..nu. *, .xi.*), such that ##EQU7## where g(.function..nu., .xi.) is given in equation (9).

Next, restrict the scope of innovation densities considered. In spite of their generality and convenience, general step-function densities still constitute a very large class, and from a computational viewpoint, have the drawback that constituent functions have unbounded supports. Referring to equation (1), observe that

which implies that only innovation variates of the form (V.sub.n) need be considered. Consequently, it is possible to restrict consideration to step-function densities .function..nu., whose support is contained in 0,1); in fact, owing to the modulo-1 arithmetic in equation (1), any support interval of length one will do. The interval -0.5,0.5) is chosen as a convenient particular case.

Next, to render the minimization procedure tractable, further restrict admissible .function..sub..nu. to lie in the set Q=U.sub.k=1.sup..infin. Q.sub.k, where Q.sub.k is the set of step-function innovation densities, .function..sub..nu., over -0.5,0.5) of the form ##EQU8## parameterized by the set P.sub.k of discrete densities of the form P=(P.sub.1, . . . , P.sub.k). In practice, approximate the set Q by a subset Q.sub.K for a large K (say, K=100), and define the parameter space

The original optimization problem then reduces to, for a fixed inverse histogram distribution of equation (7) and a fixed K>0, find an optimal pair, (P*, .xi.*) .epsilon.g.sub.K, such that ##EQU9## and T and .alpha..sub..tau. are as in equation (9).

The latter problem is a reduction of the former problem to a finite-dimensional nonlinear optimization problem with two favorable properties. First, it is subject to simple linear constraints; and second, there exist analytical formulas for the objective function and its partial derivatives with respect to every optimization variable. Consequently, the latter problem is amenable to a variety of standard nonlinear programming techniques.

The following description concerns the derivation of the partial derivatives of the objective function, g.sub.k, in equation (14). To simplify the notation, write (P.sub.1, . . . , P.sub.K, .xi.), rather than ((P.sub.1, . . . , P.sub.K), .xi.), interchangeably with (P, .xi.). Clearly, g.sub.K (P.sub.1, . . . , P.sub.K,.xi.) has partial derivatives, if .rho..sub.P.sbsb.1, . . . , .sub.P.sbsb.K.sub.,.xi. (.tau.) does. A direct calculation of the Laplace transform, .function..nu., of .function..nu..epsilon.Q.sub.K yields (see equation (11) with k=K), ##EQU10##

Equation (8) ensures that the series in equation (3) are uniformly convergent, so that it is possible to interchange there the order of differentiation and summation, leading to ##EQU11##

Since from equation (15), ##EQU12## for all .nu..gtoreq.1, it is concluded again with the aid of equation (8) that equation (16) is uniformly summable in .tau. for all 1.ltoreq.n.ltoreq.K and all (P, .xi.) .epsilon.g.sub.K ; this implies that it is possible to use the same finite sum representation for the partial derivatives in equation (16) for all 1.ltoreq.n.ltoreq.K, all (P, .xi.) .epsilon.g.sub.K, and each .tau., while retaining a uniformly bounded error. The situation in equation (17) is more complex due to the fact that equation (8) is no longer guaranteed to hold. For every .nu..gtoreq.1, represent D.sub.Y,.xi. (i2,.pi..nu.)=.alpha..sub..xi.,.nu. +i b.sub..xi.,.nu.. From Proposition 4 in Jagerman and Melamed supra it follows that ##EQU13##

A careful analysis of the formulas for .alpha..sub..xi.,.nu., b.sub..xi.,.nu. and the corresponding partial derivatives shows that ##EQU14## for 0.ltoreq..xi..ltoreq.1. This fact, together with the observation .vertline..function..nu.(i2.pi..nu.).vertline.=O(1/.nu.), allows the conclusion that the error of a finite-sum approximation of equation (17) with L summands is on the order of O(1/L).

The foregoing discussion provides the basis for a numerical procedure for fast and accurate calculation of the autocorrelation function and its partial derivatives (with respect to all optimization variables) associated with the TES processes under consideration.

The following description presents an algorithmic solution for latter problem, which is termed the GSLO (Global Search Local Optimization) algorithm. It is described below with reference to FIG. 5 for given integers, K and B. The method commences with obtaining the data signals in step 10.

For global search (GS) step 12, discretize the parameter space, g.sub.K, into a finite number of points. Then, for each point, evaluate the objective function, g.sub.K, in equation (14), and keep the best B points (those points, x .epsilon.g.sub.K, which give rise to the B smallest values of g.sub.K (x)).

For local optimization (LO) step 14, using each of these B points as a starting point, find a local minimum of g.sub.K via a nonlinear programming algorithm. Then, select among them that point, x*, which gave rise to the smallest local minimum, g.sub.K (X*). The result (in step 16) is a TES model for simulation analysis.

Note that the global search first selects the B most promising initial points for the local search, so as to increase the chance that the best local minimum found is relatively close to the global minimum. However, the user is free to select a less optimal model, if its simulated realizations are judged to bear a "better resemblance" to the empirical record.

In addition to K and B, the global search algorithm requires the specification of two additional parameters, N.sub.P and N.sub..xi. ; these are the number of equidistant values that each P.sub.n and .xi. can assume, respectively. The total number, N.sub.tot, of points, x, at which the GSLO Algorithm needs to evaluate g.sub.K (x) in the global search step above is ##EQU15## where the factor 2 is due to the fact that both the TES.sup.+ and TES.sup.- classes of processes are searched. Clearly, the parameters N.sub.P, N.sub..xi. and K must be moderate, since N.sub.tot grows very fast in them.

A computer implementation of the global search step is straightforward. The objective function is calculated inside K+1 nested loops (K loops for the discretization of each P.sub.n, and one for that of .xi.); the computed value is then compared with the current best set, namely, the running set of best (at most B) values in some sorting order. If the newly computed value improves on the worst value in the current best set, then the worst value is discarded and the new value is added in the sorted order. The process continues this way until the whole discretized space is searched. Finally, since the number of loops, K+1, is a parameter of the algorithm, loop traversal was implemented by recursive calls.

The local optimization in the local optimization step above is implemented, using the nonlinear programming method, called Zoutendijk Feasible Direction Method. This method is an iterative procedure where at each iteration one determines (i) the optimal feasible direction for the choice of the next point, and (ii) the optimal step size in that direction. Let .gradient.g.sub.K (x) denote the vector of the partial derivatives (gradient) of g.sub.K evaluated at x .epsilon.g.sub.K. A direction in g.sub.K is any real vector, d=(d.sub.1, . . . , d.sub.K,d.sub.K+1). Given a feasible point, x=(P,.xi.) in the feasible space, G.sub.K, a direction, d, is feasible, if x+.lambda.d .epsilon.g.sub.K, for some .lambda.>0. A feasible direction, d, is an improving feasible direction, if in addition, .gradient.g.sub.K (x) d.sup.t <0, t being the transpose operator. The process is described in Lemma 10.1.2 in the book by M. S. Bazaraa et al entitled "Nonlinear Programming," John Wiley & Sons, Inc. 1993. Thus, the optimal feasible direction, d*, is a solution of the following linear optimal feasible direction subproblem (for given x .epsilon.g.sub.K): d.sub.K,d.sub.K+1)                                        (20)

subject to d is a feasible direction and -1.ltoreq.d.sub.j .ltoreq.1, 1.ltoreq.j.ltoreq.K+1 (normalization).

Once the optimal feasible direction, d*, is found, then .lambda..sub.max (x)=max{x+.lambda.d* .epsilon.g.sub.K } is the maximal feasible step size, and one may proceed to solve for the optimal step size, .lambda.*, in the following optimal step size subproblem (for given x .epsilon.g.sub.K and d*): (Optimal Step Size) 0.ltoreq..lambda..ltoreq..lambda..sub.max (x).            (21)

Once the optimal value, .lambda.*, is found, replace x by x+.lambda.*d* and solve again for new optimal feasible direction and step size. The algorithm terminates when the optimal value of .gradient.g.sub.K (x) d.sup.t in equation (20) falls below a prescribed threshold. Clearly, it is essential to find efficient solutions for equation (20) and equation (21), since these are solved repeatedly.

Suppose for now that equation (20) in the optimal feasible direction subproblem been solved, and consider equation (21) in the optimal step size subproblem. Since this line search is conducted on the finite interval (0, .lambda..sub.max (x)), it is possible, in principle, to find the global minimum on the line segment, with arbitrary precision. However, prescribing a high precision, can render the solution overly time consuming. Note also that the optimal feasible direction in equation (20) is not exact, being based on a linear approximation of the objective function, using its first partial derivatives only. In the theory of nonlinear programming, this is known as the zigzagging effect. Therefore, there is no reason to invest heavily in a precise solution of equation (21). One widely-accepted practical solution to this problem is the so-called Armijo's Rule which may be described briefly as follows. Suppose that the line search is at point x, and that d is an improving feasible direction. Let .theta.(.lambda.)=g.sub.K (x+.lambda.d), 0.ltoreq..lambda..ltoreq..lambda..sub.max, and let 0<.epsilon.<1 and .alpha.>1 be two parameters (our implementation used .alpha.=2, .epsilon.=0.2). Define further, .theta.(.lambda.)=.theta.(0)+.lambda..epsilon..theta.'(0), where prime indicated the derivative. Armijo's Rule initially sets .lambda.=.lambda..sub.max ; then, while .theta.(.lambda.)>.theta.(.lambda.), set .lambda.=.lambda./.alpha. and repeat, and otherwise, set .lambda.*=.lambda. and exit.

Returning to the solution of equation (20), observe that a closed form solution can be obtained, owing to the relatively simple linear constraints involved. Since P.sub.K =1-.SIGMA..sub.n=1.sup.k-1 P.sub.n, a reduction in the problem dimension may be attained as follows. First, replace the original parameter space, g.sub.K, by the reduced parameter space, ##EQU16## and second, replace the original objective function g.sub.K, by a new objective function h.sub.K-1, over H.sub.K-1, given by ##EQU17##

Consider a new optimization problem equation (20), with g.sub.K replaced by H.sub.K-1, g.sub.K replaced by h.sub.K-1, and direction vectors of the form d=(d.sub.1, . . . , d.sub.K). Assuming that the normalization constraints (but not the feasibility constraints) in equation (20) are satisfied for the new problem, it is clear that the minimum of .gradient.h.sub.K-1 (y)d.sup.t is attained for ##EQU18## where sign(z) is +1 or -1 according as z is non-negative or negative, respectively. The goal is to change d.sub.j in such a way that the feasibility constraints in equation (20) are satisfied, while the objective function, .gradient.h.sub.K-1 (y) d.sup.t, is increased as little as possible. To this end, first fix the coordinate boundary constraints; for example, if P.sub.n =0 and d.sub.n =-1, then set d.sub.n =0. Similar action is taken for other boundary values, e.g., if P.sub.n =1, and .xi.=0 or .xi.=1. Finally, the only constraint left is .SIGMA..sub.n=1.sup.K-1 P.sub.n .ltoreq.1. An infeasible direction will ensue, provided .SIGMA..sub.n=1.sup.K-1 P.sub.n =1 and .SIGMA..sub.j=1.sup.K-1 d.sub.j >0. The best feasible d.sub.j are obtained when their sum vanishes, coupled with a minimal increase of .gradient.h.sub.K-1 (y)d.sup.t. Let =1)}

be the set of indices j, for which d.sub.j can be decreased without violating the normalization constraint in equation (20). It is readily seen that .gradient.h.sub.K-1 (y)d.sup.t would increase the least by decreasing that d.sub.n, such that -.differential.h.sub.K-1 (y)/.differential.P.sub.n is minimized over I.sub.k-1 (d). For such an index n, decrease d.sub.n just enough to obtain .SIGMA..sub.j=1.sup.K-1 d.sub.j =0; if this is not possible, set d.sub.n =-1, remove n from I.sub.K-1 (d) and repeat. The optimal direction is obtained when the corresponding sum of d.sub.j vanishes. Pseudo-code for this optimal feasible direction algorithm appears in FIG. 1.

Having described in detail the derivation and theory of the algorithm TES modeling methodology, the algorithm's efficiency will be shown by way of three examples: two from the domain of compressed video traffic, and one from a laboratory experiment on an NH.sub.3 laser intensity. All examples utilize K=100, N.sub.P =4, N.sub..xi. =11, and B=150, resulting in a total of 3.89.times.10.sup.6 searches in the global search algorithm.

Data compression is extensively used to reduce the transmission bandwidth requirements of telecommunications traffic. The idea is to code the data at the source, thereby compressing it to a fraction of its original size, and then transport the compressed data over the network and decode it at its destination. Video service in emerging ISDN (Integrated Service Digital Networks) is a typical application, for which the exact reproduction of the original signal is not necessary. In fact, redundant visual information, to which the human eye is relatively insensitive, may be removed without degrading the perceptual quality of the decoded image. H.261 is a popular coding standard, which makes use of DCT (Discrete Cosine Transform) and other techniques to compress video spatial units (frames or subframes). Since such coded units have random (but highly autocorrelated) transmission requirements (say, in bits), the corresponding coding schemes are referred to as VBR (Variable Bit Rate).

FIG. 2 shows a TEStool screen showing the results of the algorithmic TES modeling of an empirical sample path of VBR video (frame sizes), in which the coding scheme used was a variant of the H.261 standard. The video scene content was a football sequence and the depicted results are for a TES.sup.+ model. Note the excellent agreement of the TES model histogram and autocorrelation function with their empirical counterparts in the upper-right and lower-left portion of FIG. 2, respectively. Furthermore, the corresponding sample paths in the upper-left portion of FIG. 2 bear are markedly "similar". The OSLO-obtained innovation density is depicted in the lower-right portion of FIG. 2.

MPEG (Moving Picture Expert Group) is an emerging family of compression standards designed to encode audio-visual signals over broadband transmission channels. The importance of MPEG derives from its planned central role in facilitating future delivery of multi-media services to customer premises. The following description focuses on MPEG-based video, designed to compress a full-motion video stream to about 1.5 Mbits/second.

Coded picture sequences in MPEG are composed of cycles. A coded picture can be either an Intrapicture (I-frame), Predicted picture (P-frame) or Bidirectionally Predicted picture (B-frame). The sequence of picture (frame) types within each cycle is deterministic, though the corresponding bit rates are random. MPEG type sequences can be chosen as an MPEG parameter, depending on the application. The probability laws of frame types are markedly different. In particular, the marginal distributions of I-frames, P-frames, and B-frames are well separated, with descending means in this order. Consequently, MPEG-compressed sequences are non-stationary, due to the determinism of the frame type sequence. The particular type sequence chosen in the case study described here had a length-nine cycle of the form IBBPBBPBB . . . . The modeling approach called for a composite TES model. First, each subsequence of MPEG frame types was modeled as a separate TES sequence, I-frames and B-frames each by a TES.sup.+ model and P-frames by a TES.sup.- model. FIG. 3 depicts a TEStool screen showing the algorithmic modeling results for the P-frame subsequence. The video scene content was a "busy" sequence of a toy train in motion, combined with a moving calendar. The figure is similar in structure to the previous one, and the model statistics are again in excellent agreement with their empirical counterparts.

The Santa Fe Institute conducts competitions in time series prediction, using neural net methods. An empirical set of partial random data is made available and competitors are asked to predict the rest of the time series. The data set in this example consisted of 1000 data points, representing a clean physics laboratory of the fluctuating intensity of an NH.sub.3 laser experiment, reposited in ftp.santafe.edu. The GSLO algorithm assumed a maximal autocorrelation lag of T=15. The results are displayed in the TEStool screen of FIG. 4. Again, the figure is similar in structure to the previous ones, and the model statistics are in excellent agreement with their empirical counterparts. Furthermore, the model exhibits considerable predictive power in the sense that in the time interval (0, 30), the sample path of the model is very close to its empirical counterpart.

While there has been described and illustrated an algorithmic modeling of TES processes and its application to several specific examples, it will be apparent to those skilled in the art that variations and modifications are possible without deviating from the broad principles and spirit of the present invention which shall be limited solely by the scope of the claims appended hereto.

## Claims

1. A method of simulation analysis of a network comprising the steps of: for local search, which points result in the smallest values of the objective function g.sub.K (P,.xi.)=.SIGMA..sub..tau.=1.sup.T .alpha..sub..tau. .vertline..rho..sub.P,.xi. (.tau.)-.rho..sub.Y (.tau.).vertline..sup.2, (P, .xi.) .epsilon.g.sub.K, where P are the discretized densities, .xi. are stitching parameters, .alpha..sub..tau. are weight coefficients, .rho..sub.P,.xi. (.tau.) is a TES model autocorrelation function, and .rho..sub.Y (.tau.) is an empirical autocorrelation function; a starting point to find the point which results in the smallest local minimum of the objective function for providing a TES (Transform-Expand-Sample) model of said data signals; and analysis of a network.

2. A method of simulation analysis as set forth in claim 1, wherein said local optimization comprises a steepest descent process.

3. A method of simulation analysis as set forth in claim 2, wherein said steepest descent processes comprises Zoutendijk's Feasible Direction Method.

4. A method of simulation analysis as set forth in claim 1, wherein said local optimization comprises an optimal feasible direction algorithm.

5. A method of simulation analysis as set forth in claim 4, wherein said local optimization further comprises an optimal step size algorithm.

6. A method of simulation analysis as set forth in claim 1, wherein said data signal comprises bit rates of compressed video.

7. A method of simulation analysis as set forth in claim 6, wherein said bit rates of compressed video is H.261-Compressed video.

8. A method of simulation analysis as set forth in claim 6, wherein said bit rates of compressed video is MPEG-Compressed variable bit rate video.