Abstract
Nowadays, online social networking services in wireless networks are very popular. In this paper, we propose a timer-based push scheme (TPS) where a number of articles posted during a pre-defined time interval are pushed to users and thus the number of push operations and articles to be pulled can be reduced. We develop an analytical model for TPS and derive the optimal timer minimizing the total cost. Simulation results are given to show the effectiveness of TPS over the existing push N scheme and to validate the analytical results.
| Original language | English |
|---|---|
| Article number | 6343255 |
| Pages (from-to) | 2095-2098 |
| Number of pages | 4 |
| Journal | IEEE Communications Letters |
| Volume | 16 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2012 |
Keywords
- Push
- online social networking service
- pull
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Timer-based push scheme for online social networking services in wireless networks'. Together they form a unique fingerprint.
Cite this
Ko, H., Pack, S., & Lee, W. (2012). Timer-based push scheme for online social networking services in wireless networks. IEEE Communications Letters, 16(12), 2095-2098. [6343255]. https://doi.org/10.1109/LCOMM.2012.102612.122056