Cross-Layer Optimization for State Update in Mobile Gaming

Cross-Layer Optimization for State Update in Mobile GamingYang Yu*, Zhu Li*, Larry Shi*, Yi-Chiun Chen+, Hua Xu+

*Application Research Center, Motorola Labs+Motorola Networks & Enterprise

Oct. 16 2007Wayne State University

Query Privacy in Wireless Sensor Networks April 22, 2023 2/21

Motorola Document Classification, File Name, Rev Number Add additional legal text here if required by your local Legal Counsel. MOTOROLA and the Stylized M Logo are registered in the US Patent & Trademark Office. All other product or service names are the property of their respective owners. © Motorola, Inc. 2007

MotivationApplication trend: Large scale MMOG on mobile devices

Gaming requirements: Efficient state update is crucial for satisfactory gaming experienceNetwork constraints: Limited bandwidth, variable network delay and channel condition



Problem Scenario

• Down-link state update from one WiMAX access point to all clients• Dead-reckoning algorithm for state update• Pre-specified bandwidth limitation• Real-time channel quality and network delay feedback



Goal and Contributions• Goal: Minimize gaming state distortion with an efficient

state update mechanism that adapts to network states:– Limited bandwidth– Network delay

• Contributions:– Characterize the traffic-distortion tradeoffs of gaming behavior– Off-line optimization and a history-based prediction method for

on-line adaptation– Validation and evaluation using real game traces



WiMAX Link Model0 1 2 3 4 5 6 7 8 …. N-1 0 1 …. M-1

012

ACK

CQI

NsTTG Uplink Subframe

OFDM Symbol Number

Downlink Subframe

Sub

-Cha

nnel

Log

ical

Num

ber

DLMAP

ULMAP

FCHBurst#1

Burst#2

Burst#4

Burst#6

Burst #3

Burst#7

Burst #5

Prea

mbl

e



Dead-Reckoning Algorithm

Client A Client B

Client C

time

Predicted move @ B & C

Actual move @ A

Location update

Updates from A to server

timeUpdates from server to B & C

Distance difference >= δ

δ



Traffic-Distortion Tradeoffs – Theoretical Intuition

Location function

Actual location

Estimated locationLocation difference

Update triggered when



Traffic-Distortion Tradeoffs – Real Game Traces



User Diversity

Fixed update threshold large variations in user distortion and update traffic



Off-Line Problem Formulation•Assumption

–Game traces at the t-th second are known a priori•Given

–For all n clients, distortion function, Di(δi), and traffic function, Ri(δi),–The constellation size for each client i, αi, and OFDMA parameters, Q (frame rate) and h (number of sub-carriers per sub-channel)–Bandwidth constraint, B, in terms of total available clusters per frame

•Find –distortion threshold vector δ = {δ1, δ2, …, δn} and –cluster allocation vector b = {b1, b2, …, bn}, so as to minimize

•Subjec to

n

iiiD

1

)(

hbQR

iiii

)(

i

n

ii Bb

1

,...2,1ib



Lagrangian Relaxation

λ: Lagrangian multiplier

})()({min)(11,...,, 21

n

i i

iin

iii

n

RDJ

})()({min)(i

iiiii

RDJi

i

separate

Time complexity: )loglog( nOΛ: domain of λΔ: domain of δ

λ = 0.08λ = 0.16

λ = 0.08λ = 0.16



On-Line Adaptation

• Explore temporal locality of gaming behavior

• Historical data-based prediction

• Our simulation results show one second history performs the best for a driving game



Evaluation Setup

• Baselines:– Off-line optimal allocation– Uniform policy: same bandwidth for all clients – Proportional policy: same δ for all clients bandwidth

allocation proportional to extent of state changes• Real 40 second traces for a driving game with 32

vehicles• Δ: [0.2, 10] meters• Update packet size: 200 bytes



WiMAX Link Quality and Adaptive Coding



Main Results

NABA performed close to Optimal Both NABA and Optimal were able to efficiently utilize the bandwidth constraint

200 total clusters (peak 4.3 Mbps), 10 ms network delay, 200 frames per second, 24 sub-carriers per sub-channel



Impact of Bandwidth Constraint

•Distortion dropped with BW constraint•NABA approaches to Optimal

Both NABA and Optimal were able to efficiently utilize the bandwidth constraint

100 to 500 clusters (peak 2.2 – 10.8 Mbps)



Impact of Network DelayNetwork delay: 10 – 100 ms

•Distortion increased with network delay•NABA performed close to Optimal

Both NABA and Optimal were able to efficiently utilize the bandwidth constraint



Impact of Rounding

On average, <2% increase in distortion



Related Works

• Study of the impact of network delay and packet loss on state consistency– Zhou 2004 (ACM trans. , Yasui 2005 (NetGames)

• Study of dead-reckoning– Suitability, Pantel 2002 (NetGames)– Accuracy, Aggarwal 2005 (NetGames)

Our paper is the first effort to model the traffic-distortion tradeoffs to facilitatebandwidth allocation in a wireless environment



Conclusion• Revealed the traffic-distortion tradeoffs in dead-

reckoning algorithm

• Formulation & off-line optimization of the bandwidth allocation problem

• History-based prediction for on-line adaptation

• Validation and evaluation via real game traces



Q & A

Cross-Layer Optimization for State Update in Mobile Gaming

Documents

Transcript of Cross-Layer Optimization for State Update in Mobile Gaming