W. P. Lovegrove, J. L. Hammond, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Journal on Selected Areas in Communications, Vol. 8, No. 9, pp. 1696-1708, December 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Connection Preemption: Issues, Algorithms, and a Simulation .. - Peyravian, Kshemkalyani (1997) (Correct)
....the use of Gaussian statistics to construct confidence intervals on the performance measures. As the number of replications is small, we can assume that the mean is distributed as student t distribution and calculate the 100#1 # ## confidence interval on the mean from the replications using [1]: x # t #=2 : s p r ###x t #=2 : s p r where x is the sample mean, # is the true mean, s is the sample standard deviation, r is the number of replications, and t #=2 0 8186 7780 5 97 10.00 1997 IEEE is the critical value of the student t distribution with #r # 1# degrees of freedom. ....
W. P. Lovegrove, J. L. Hammond, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Journal on Selected Areas in Communications, Vol. 8, No. 9, pp. 1696-1708, December 1990.
Fast Time-Dependent Evaluation of Multi-Service Networks - Matta, Shankar (1 citation) (Correct)
....values t 1 ; t 2 ; Delta Delta Delta ; t k ; Delta Delta Delta. Then, the mean value of this measure at particular time instant t k is estimated as P N i=1 Y (i) t k ) N , where N is the total number of replications. The larger N is, the more accurate the simulation estimates are [39]. In our simulations, the performance measures are computed for t = 1; 2; 3; Delta Delta Delta. The measures considered are precisely defined as they are introduced below. In all experiments, we start with empty systems. For the cases with N = 50, the observed mean of the simulation measures ....
W. Lovegrove, J. Hammond, and D. Tipper. Simulation Methods for Studying Nonstationary Behavior of Computer Networks. IEEE J. Select. Areas Commun., 8(9):1696--1708, December 1990.
Z-Iteration: A Simple Method for Throughput Estimation in.. - Matta, Shankar (1995) (1 citation) (Correct)
....values t1 ; t2 ; Delta Delta Delta ; tk ; Delta Delta Delta. Then, the mean value of this measure at particular time instant tk is estimated as P N i=1 X (i) tk ) N , where N is the total number of replications. The larger N is, the more accurate the simulation estimates are [21]. In our simulations, the performance measures are periodically computed at t = 1; 2; 3; Delta Delta Delta. The measures considered are precisely defined as they are introduced below. In all experiments, we start with empty systems. For the cases with N = 50, the observed mean of the ....
W. Lovegrove, J. Hammond, and D. Tipper. Simulation methods for studying nonstationary behavior of computer networks. IEEE J. Select. Areas Commun., 8(9):1696--1708, December 1990.
Fast Time-Dependent Evaluation of Integrated Services Networks - Matta, Shankar (Correct)
....values t 1 ; t 2 ; Delta Delta Delta ; t k ; Delta Delta Delta. Then, the mean value of this measure at particular time instant t k is estimated as P N i=1 Y (i) t k ) N , where N is the total number of replications. The larger N is, the more accurate the simulation estimates are [36]. In our simulations, the performance measures are computed for t = 1; 2; 3; Delta Delta Delta. The measures considered are precisely defined as they are introduced below. In all experiments, we start with empty systems. For the cases with N = 50, the observed mean of the simulation measures ....
W. Lovegrove, J. Hammond, and D. Tipper. Simulation Methods for Studying Nonstationary Behavior of Computer Networks. IEEE J. Select. Areas Commun., 8(9):1696--1708, December 1990.
Z-Iteration: Efficient Estimation of Instantaneous Measures.. - Matta, Shankar (1994) (Correct)
....values t 1 ; t 2 ; Delta Delta Delta ; t k ; Delta Delta Delta. Then, the mean value of this measure at particular time instant t k is estimated as P N i=1 X (i) t k ) N , where N is the total number of replications. The larger N is, the more accurate the simulation estimates are [22]. In our simulations, the performance measures are computed for t = 1; 2; 3; Delta Delta Delta. The measures considered are precisely defined as they are introduced below. In all experiments, we start with empty systems. For the cases with N = 50, the observed mean of the simulation measures ....
W. Lovegrove, J. Hammond, and D. Tipper. Simulation Methods for Studying Nonstationary Behavior of Computer Networks. IEEE J. Select. Areas Commun., 8(9):1696--1708, December 1990.
Routing Strategies for Fault Recovery in Wide Area Packet .. - Balakrishnan, Tipper.. (1995) (1 citation) Self-citation (Tipper) (Correct)
....links. Table 2 also shows the number of links that were congested using the various schemes. The congestion in the network was studied by determining the number in the queueing system versus time for various links in the network using an ensemble average of 3000 simulation runs as discussed in [7]. A link was considered congested if the number in the queueing system at a link exceeded the steady state grade of service level. The steady state grade of service was determined by the link utilization threshold specified (85 ) which resulted in a steady state grade of service number in system ....
W. Lovegrove, J. Hammond, and D. Tipper, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Jrnl. Sel. Areas Comm., vol. 8:1696-1708, 1990.
Technical Report - Applied Research (1988) (3 citations) Self-citation (Tipper) (Correct)
No context found.
Lovegrove, W. P., J. L. Hammond, and D. Tipper, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks", IEEE Journal on Selected Areas in Communications, vol. 8. no. 9, pp. 16961708
A Simple Approximation for Modeling Nonstationary Queues - Wang, Tipper, Banerjee (1996) (5 citations) Self-citation (Tipper) (Correct)
....depends on the state space of the queue and they are limited to Markovian systems. For more general nonMarkovian queues a few approximations have been proposed namely; diffusion models, fluid flow models, the pointwise stationary approximation [7] and the modified offered load approximation [10, 14]. Here we are interested in identifying techniques that can be used for the design of network controls and the performance evaluation of communication networks. Since many network controls and performance studies are done on the basis of average quantities, we focus on determining the mean ....
W.Lovegrove, J.L.Hammond, and D.Tipper, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Journal on Selected Areas in Communication, 8(9):16961708, Dec. 1990.
Fault Recovery Routing in Wide Area Packet Networks - Wang, Tipper, Jæger, al. (1997) (3 citations) Self-citation (Tipper) (Correct)
....conducted to evaluate the restoration routing schemes defined above in terms of VC call blocking, the amount of congestion created (both length of time and spatial distribution) and the paths selected. In order to study the transient congestion, we adopt the nonstationary simulation methodology of [14] to observe the behavior of the average number in the queueing system versus time for all links in the network. The basic approach is to run the simulation a number of times and average the quantities of interest across the ensemble of independent runs at a particular time instant. Many such ....
W. Lovegrove, J. Hammond, and D. Tipper, "Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Jrnl. Sel. Areas Comm., vol. 8:1696-1708, 1990.
Traffic Restauration in Survivable Wide Area Communication Networks - Jęger (2000) (Correct)
No context found.
W. Lovegrove, J. Hammond, and D. Tipper, \Simulation Methods for Studying Nonstationary Behavior of Computer Networks," IEEE Journal of Selected Areas in Communications,vol. 8, no. 9, December 1990, pp. 1696-1708.
Finite-Horizon Statistical Quality-of-Service Measures.. - Nagarajan, Kurose.. (1994) (10 citations) (Correct)
No context found.
William P. Lovegrove et al. Simulation methods for studying nonstationary behaviour of computer networks. IEEE J.Select.Areas Commun., 8(9):1696--1708, December 1990.
On Defining, Computing and Guaranteeing Statistical.. - Nagarajan, Kurose.. (1990) (Correct)
No context found.
William P. Lovegrove et al. Simulation methods for studying nonstationary behaviour of computer networks. IEEE J.Select.Areas Commun., 8(9):1696--1708, December 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC