Efficient parallel simulation of a sliding window protocol

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 async...

Full description

Saved in:
Bibliographic Details
Published inPerformance evaluation Vol. 48; no. 1; pp. 237 - 246
Main Authors McGough, A.S., Mitrani, I.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2002
Subjects
Parallel prefix
Parallel simulation
Sliding window
TCP
TCP
Parallel simulation
Parallel prefix
Sliding window
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-5316
1872-745X
DOI:10.1016/S0166-5316(02)00039-1