Efficient parallel simulation of a sliding window protocol

  • McGough A
  • Mitrani I
  • 1


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


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. © 2002 Elsevier Science B.V. All rights reserved.

Author-supplied keywords

  • Parallel prefix
  • Parallel simulation
  • Sliding window
  • TCP

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • A. S. McGough

  • I. Mitrani

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free