Research Article
Angry Apps: The Impact of Network Timer Selection on Power Consumption, Signalling Load, and Web QoE
Algorithm 1
Inferring RRC state transitions based on IP timestamps.
| Input: Packet arrival timestamps ts | | DCH to FACH timer | | FACH to Idle timer | | Output: Times of state transition | | New states after state transitions state | | interarrival(i) ← ts( + 1) − ts() | | index← 0 | | for all ts() do | | if state(index) = Idle then | | index← index + 1 | | state(index) ← DCH | | state_time (index) ← ts() | | end if | | if interarrival()> then | | index← index + 1 | | state (index) ← FACH | | state_time (index) ← ts() + | | end if | | if interarrival()> + then | | index← index + 1 | | state(index) ← Idle | | state_time (index) ← ts() + + | | end if | | end for |
|
