Abstract
Article synchronization is one of the most fundamental issues in online social networking services (SNSs). In particular, when deploying multiple access networks with different transmission costs, an efficient synchronization scheme should be devised for users to enjoy SNSs in heterogeneous wireless networks. In this paper, we propose an opportunistic push scheme (OPS) that aggregates published articles, opportunistically pushing them through low-cost access networks (e.g., open Wi-Fi networks). To balance the reduced transmission costs and the increased page loading time, we formulate a Markov decision process problem that considers a mobility model based on the users' social contact pattern. Evaluation results demonstrate that OPS with the optimal policy can reduce the number of transmissions in high-cost access networks, while satisfying users' quality of experience in terms of the page loading time.
| Original language | English |
|---|---|
| Article number | 7857091 |
| Pages (from-to) | 416-428 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Network and Service Management |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2017 Jun 1 |
Fingerprint
Keywords
- heterogeneous networks
- Markov decision process (MDP)
- optimization
- pull
- push
- social correlation
- Social networking service (SNS)
- sociality
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
An Opportunistic Push Scheme for Online Social Networking Services in Heterogeneous Wireless Networks. / Ko, Haneul; Lee, Jaewook; Pack, Sangheon.
In: IEEE Transactions on Network and Service Management, Vol. 14, No. 2, 7857091, 01.06.2017, p. 416-428.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - An Opportunistic Push Scheme for Online Social Networking Services in Heterogeneous Wireless Networks
AU - Ko, Haneul
AU - Lee, Jaewook
AU - Pack, Sangheon
PY - 2017/6/1
Y1 - 2017/6/1
N2 - Article synchronization is one of the most fundamental issues in online social networking services (SNSs). In particular, when deploying multiple access networks with different transmission costs, an efficient synchronization scheme should be devised for users to enjoy SNSs in heterogeneous wireless networks. In this paper, we propose an opportunistic push scheme (OPS) that aggregates published articles, opportunistically pushing them through low-cost access networks (e.g., open Wi-Fi networks). To balance the reduced transmission costs and the increased page loading time, we formulate a Markov decision process problem that considers a mobility model based on the users' social contact pattern. Evaluation results demonstrate that OPS with the optimal policy can reduce the number of transmissions in high-cost access networks, while satisfying users' quality of experience in terms of the page loading time.
AB - Article synchronization is one of the most fundamental issues in online social networking services (SNSs). In particular, when deploying multiple access networks with different transmission costs, an efficient synchronization scheme should be devised for users to enjoy SNSs in heterogeneous wireless networks. In this paper, we propose an opportunistic push scheme (OPS) that aggregates published articles, opportunistically pushing them through low-cost access networks (e.g., open Wi-Fi networks). To balance the reduced transmission costs and the increased page loading time, we formulate a Markov decision process problem that considers a mobility model based on the users' social contact pattern. Evaluation results demonstrate that OPS with the optimal policy can reduce the number of transmissions in high-cost access networks, while satisfying users' quality of experience in terms of the page loading time.
KW - heterogeneous networks
KW - Markov decision process (MDP)
KW - optimization
KW - pull
KW - push
KW - social correlation
KW - Social networking service (SNS)
KW - sociality
UR - http://www.scopus.com/inward/record.url?scp=85020922706&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85020922706&partnerID=8YFLogxK
U2 - 10.1109/TNSM.2017.2669524
DO - 10.1109/TNSM.2017.2669524
M3 - Article
AN - SCOPUS:85020922706
VL - 14
SP - 416
EP - 428
JO - IEEE Transactions on Network and Service Management
JF - IEEE Transactions on Network and Service Management
SN - 1932-4537
IS - 2
M1 - 7857091
ER -