Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Applying parallel discrete event simulation to network emulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Addressing blocking and scalability in critical channel traversing
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Analysis of composite synchronization
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Composite Synchronization in Parallel Discrete-Event Simulation
IEEE Transactions on Parallel and Distributed Systems
A case study of web server benchmarking using parallel WAN emulation
Performance Evaluation
Hybrid Packet/Fluid Flow Network Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
Optimization aspects in network simulation
Proceedings of the 5th international conference on Aspect-oriented software development
| Hi-index | 0.00 |
This paper explains how DiffServ has been implemented in an IP network simulator using an asynchronous conservative parallel discrete event simulation (PDES) kernel. DiffServ provides Quality of Service (QoS) functionality for IP networks and is designed to provide greater scalability and lower overhead than previous IP based QoS schemes. The paper explains the DiffServ components that have been implemented, focusing on the implementation of the preemptive network buffers required to provide DiffServ functionality. Certain optimisations possible for non-preemptive network buffers are not possible here. The paper explores which will work in the preemptive case. In particular, exploiting lookahead is more difficult leading to reduced performance in some cases. Optimisation schemes are described for two different preemptive buffering strategies and performance results demonstrating the costs of using these buffers are presented.