Seventeenth Workshop on Parallel and Distributed Simulation, 2003. (PADS 2003). Proceedings. (2003)
San Diego, California
June 10, 2003 to June 13, 2003
Donghua Xu , College of Computing
George F. Riley , College of Engineering
Mostafa H. Ammar , College of Computing
Richard Fujimoto , College of Computing
The simulation of large?scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inherently large amount of state necessary to simulate message routing and because of design oversights in the multicast portion of existing simulators. In this paper we describe three approaches to substantially reduce the memory required by multicast simulations: 1) We introduce a novel technique called "negative forwarding table" to compress mutlicast routing state. 2) We aggregate the routing state objects from one replicator per router per group per source to one replicator per router. 3) We employ the NIx- Vector technique to replace the original unicast IP routing table. We implemented these techniques in the ns2 simulator to demonstrate their effectiveness. Our experiments show that these techniques enable packet level multicast simulations on a scale that was previously unachievable on modern workstations using ns2.
R. Fujimoto, M. H. Ammar, D. Xu and G. F. Riley, "Enabling Large-Scale Multicast Simulation by Reducing Memory Requirements," Seventeenth Workshop on Parallel and Distributed Simulation, 2003. (PADS 2003). Proceedings.(PADS), San Diego, California, 2003, pp. 69.