Efficient parallel simulation of a sliding window protocol

Authors:
A. S. McGough;I. Mitrani
Affiliations:
Department of Computing, Imperial College of Science, Technology and Medicine, Huxley Building, 180 Queen's Gate, London, UK SW7 2BZ;Computing Science Department, University of Newcastle, Newcastle upon Tyne, UK NE1 7RU
Venue:
Performance Evaluation
Year:
2002

Citing 6
Cited 0

Algorithms for unboundedly parallel simulations

ACM Transactions on Computer Systems (TOCS)
Parallel simulation of stochastic Petri nets using recurrence equations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Simulation-based comparisons of Tahoe, Reno and SACK TCP

ACM SIGCOMM Computer Communication Review
Parallel Prefix Computation

Journal of the ACM (JACM)
Modeling TCP Throughpu: A simple model and its empirical validation

Modeling TCP Throughpu: A simple model and its empirical validation
A Stochastic Model of TCP Reno Congestion Avoidence and Control

A Stochastic Model of TCP Reno Congestion Avoidence and Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two parallel algorithms for simulating a sliding window communication protocol are described. The first exploits the parallel generation of interarrival, service and transfer times, whilst the second is based on parallel prefix computations. Both algorithms allow the processors to work largely asynchronously with each other. The efficiency of the two approaches is evaluated experimentally, using an implementation on a cluster of 12 processors connected by fast Ethernet.