SALIENT: Stochastic, adaptive latency improvement for event notification trees

Jason Alonzo Long, Jeremy Joseph Blum

Research output: Contribution to journalConference article

Abstract

A challenge in massively multiplayer online games is the need for game event information to be quickly disseminated to all participants. Because of the cost and scalability limitations of centralized servers, peer-to-peer technologies have been adopted in which peers serve both to reconcile conflicting actions and to relay the events to other peers. This manuscript introduces Stochastic, Adaptive Latency Improvement for Event Notification Trees (SALIENT), which provides a method for constructing and maintaining a peer-to-peer event notification tree. SALIENT is a distributed algorithm that uses a number of independent mechanisms that work over time to incrementally make improvements to the event notification tree. In random networks of various sizes, SALIENT was found to greatly reduce experienced latency, typically as much as 40-60% reduction in event delays. In addition, SALIENT has bandwidth management strategies that help avoid situations of bandwidth overload, allowing many more participants to participate despite limited participant bandwidth.

Original languageEnglish (US)
Pages (from-to)48-55
Number of pages8
JournalSimulation Series
Volume47
Issue number3
StatePublished - Jan 1 2015
Event18th Communications and Networking Symposium, CNS 2015, Part of the 2015 Spring Simulation Multi-Conference, SpringSim 2015 - Alexandria, United States
Duration: Apr 12 2015Apr 15 2015

Fingerprint

Bandwidth
Parallel algorithms
Scalability
Servers
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{c0b3183acf124f53ad326ede62a72af3,
title = "SALIENT: Stochastic, adaptive latency improvement for event notification trees",
abstract = "A challenge in massively multiplayer online games is the need for game event information to be quickly disseminated to all participants. Because of the cost and scalability limitations of centralized servers, peer-to-peer technologies have been adopted in which peers serve both to reconcile conflicting actions and to relay the events to other peers. This manuscript introduces Stochastic, Adaptive Latency Improvement for Event Notification Trees (SALIENT), which provides a method for constructing and maintaining a peer-to-peer event notification tree. SALIENT is a distributed algorithm that uses a number of independent mechanisms that work over time to incrementally make improvements to the event notification tree. In random networks of various sizes, SALIENT was found to greatly reduce experienced latency, typically as much as 40-60{\%} reduction in event delays. In addition, SALIENT has bandwidth management strategies that help avoid situations of bandwidth overload, allowing many more participants to participate despite limited participant bandwidth.",
author = "Long, {Jason Alonzo} and Blum, {Jeremy Joseph}",
year = "2015",
month = "1",
day = "1",
language = "English (US)",
volume = "47",
pages = "48--55",
journal = "Simulation Series",
issn = "0735-9276",
number = "3",

}

SALIENT : Stochastic, adaptive latency improvement for event notification trees. / Long, Jason Alonzo; Blum, Jeremy Joseph.

In: Simulation Series, Vol. 47, No. 3, 01.01.2015, p. 48-55.

Research output: Contribution to journalConference article

TY - JOUR

T1 - SALIENT

T2 - Stochastic, adaptive latency improvement for event notification trees

AU - Long, Jason Alonzo

AU - Blum, Jeremy Joseph

PY - 2015/1/1

Y1 - 2015/1/1

N2 - A challenge in massively multiplayer online games is the need for game event information to be quickly disseminated to all participants. Because of the cost and scalability limitations of centralized servers, peer-to-peer technologies have been adopted in which peers serve both to reconcile conflicting actions and to relay the events to other peers. This manuscript introduces Stochastic, Adaptive Latency Improvement for Event Notification Trees (SALIENT), which provides a method for constructing and maintaining a peer-to-peer event notification tree. SALIENT is a distributed algorithm that uses a number of independent mechanisms that work over time to incrementally make improvements to the event notification tree. In random networks of various sizes, SALIENT was found to greatly reduce experienced latency, typically as much as 40-60% reduction in event delays. In addition, SALIENT has bandwidth management strategies that help avoid situations of bandwidth overload, allowing many more participants to participate despite limited participant bandwidth.

AB - A challenge in massively multiplayer online games is the need for game event information to be quickly disseminated to all participants. Because of the cost and scalability limitations of centralized servers, peer-to-peer technologies have been adopted in which peers serve both to reconcile conflicting actions and to relay the events to other peers. This manuscript introduces Stochastic, Adaptive Latency Improvement for Event Notification Trees (SALIENT), which provides a method for constructing and maintaining a peer-to-peer event notification tree. SALIENT is a distributed algorithm that uses a number of independent mechanisms that work over time to incrementally make improvements to the event notification tree. In random networks of various sizes, SALIENT was found to greatly reduce experienced latency, typically as much as 40-60% reduction in event delays. In addition, SALIENT has bandwidth management strategies that help avoid situations of bandwidth overload, allowing many more participants to participate despite limited participant bandwidth.

UR - http://www.scopus.com/inward/record.url?scp=84937792031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937792031&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:84937792031

VL - 47

SP - 48

EP - 55

JO - Simulation Series

JF - Simulation Series

SN - 0735-9276

IS - 3

ER -