Log-based receiver-reliable multicast for distributed interactive simulation

Holbrook, Hugh; Singhal, Sandeep K.; Cheriton, David R.

doi:10.1145/217382.217468

Cited by 240 publications

(140 citation statements)

References 11 publications

Supporting

Mentioning

136

Contrasting

Unclassified

Order By: Relevance

“…This topic has been covered by other work and is not discussed here although its potential supportive role in improving reliable multicasting is recognized [11]. A variety of reliable multicast transport protocols and protocol frameworks have been proposed in recent years which can provide end to end reliability over best effort datagram service [1,2,13,14,15,17,18,19,21,22]. Most reliable multicast file or bulk transfer applications are presently designed around the basic concept of selective repeat ARQ without the addition of any FEC coding.…”

Section: Introductionmentioning

confidence: 99%

Reliable Multicast Transport and Integrated Erasure-Based Forward Error Correction

Macker¹

1997

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Reliable Multicast Transport and Integrated Erasure-Based Forward Error Correction

Macker¹

1997

View full text Add to dashboard Cite

show abstract

“…We use best effort multicast to disseminate position updates. Although additional reliability can be added by implementing receiver-reliable multicast [19], it is usually unnecessary. The loss and delay of messages can be masked by application level mechanisms such as dead reckoning [5], that interpolates or extrapolates player positions.…”

Section: ) Player Statementioning

confidence: 99%

Peer-to-peer support for massively multiplayer games

et al.

View full text Add to dashboard Cite

Abstract-We present an approach to support massively multi-player games on peer-to-peer overlays. Our approach exploits the fact that players in MMGs display locality of interest, and therefore can form self-organizing groups based on their locations in the virtual world. To this end, we have designed scalable mechanisms to distribute the game state to the participating players and to maintain consistency in the face of node failures. The resulting system dynamically scales with the number of online players. It is more flexible and has a lower deployment cost than centralized games servers. We have implemented a simple game we call SimMud, and experimented with up to 4000 players to demonstrate the applicability of this approach.

show abstract

“…In this scheme [8], a source maintains an inter-heartbeat timer IHB_TMR which times the interval between the most recent packet (ODATA, RDATA, or SPM) transmission and the next heartbeat transmission. IHB_TMR is initialized to a minimum interval IHB_MIN after the transmission of any data packet.…”

Section: Heartbeat Spmsmentioning

confidence: 99%