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 Nov 29 |
Fingerprint
Keywords
- online social networking service
- pull
- Push
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Science Applications
- Modelling and Simulation
Cite this
Timer-based push scheme for online social networking services in wireless networks. / Ko, Haneul; Pack, Sangheon; Lee, Wonjun.
In: IEEE Communications Letters, Vol. 16, No. 12, 6343255, 29.11.2012, p. 2095-2098.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Timer-based push scheme for online social networking services in wireless networks
AU - Ko, Haneul
AU - Pack, Sangheon
AU - Lee, Wonjun
PY - 2012/11/29
Y1 - 2012/11/29
N2 - 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.
AB - 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.
KW - online social networking service
KW - pull
KW - Push
UR - http://www.scopus.com/inward/record.url?scp=84871346934&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871346934&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2012.102612.122056
DO - 10.1109/LCOMM.2012.102612.122056
M3 - Article
AN - SCOPUS:84871346934
VL - 16
SP - 2095
EP - 2098
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 12
M1 - 6343255
ER -