Content-addressable network for distributed simulations

Advances in distributed systems and parallel computation technology enable us to realize distributed interactive world models. Using distributed world models, we can implement worldwide distributed simulations and virtual communities, e. g., city traffic simulation and Massively Multiuser Virtual Environments (MMVE). We proposed Content-Addressable Network for Distributed Simulations(CANS). Each peer may join, leave, or crash at any time. Thus, an appropriate Peer-to-Peer protocol is needed to implement self-organizing peers. Each peer is responsible for partial computation; all peers comprise complete functionality. When a peer crashes, other peers must extend their responsibility to take over the functionality of the crashed peer. We faced two challenges in our work—reorganizing of the zone-assignment to solve the “concave and slim problem” and “efficient routing solutions for low-dimensional CANS”. We presented two novel approaches (“CAN Tree” and “zone code”) to solve “concave and slim problem”. And we also introduced the “CAN tree routing” and “Zone code routing” to efficiently forward messages in low-dimension CAN. The routing performance can easily be boosted from to.