Timer-based push scheme for online social networking services in wireless networks

Haneul Ko; Sangheon Pack; Wonjun Lee

doi:10.1109/LCOMM.2012.102612.122056

Timer-based push scheme for online social networking services in wireless networks

Haneul Ko, Sangheon Pack, Wonjun Lee

Research output: Contribution to journal › Article › peer-review

15 Citations (Scopus)

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	https://doi.org/10.1109/LCOMM.2012.102612.122056
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

Access to Document

10.1109/LCOMM.2012.102612.122056

Cite this

@article{2f0cfdb50e604b97a96ca9a1a3ea1331,

title = "Timer-based push scheme for online social networking services in wireless networks",

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.",

keywords = "Push, online social networking service, pull",

author = "Haneul Ko and Sangheon Pack and Wonjun Lee",

note = "Funding Information: Manuscript received September 12, 2012. The associate editor coordinating the review of this letter and approving it for publication was J. Holliday. This work was supported in part by the WCU Project (R33-2008-000-10044-0), in part by the ITRC support program (NIPA-2012-H0301-12-4004), and in part by the KCA R&D program (KCA-10913-05004). H. Ko and S. Pack (corresponding author) are with the School of Electrical Engineering, Korea University, Seoul, Korea (e-mail: {st basket, shpack}@korea.ac.kr). W. Lee is with the Department of Computer Science and Engineering, Korea University, Seoul, Korea (e-mail: wlee@korea.ac.kr). Digital Object Identifier 10.1109/LCOMM.2012.102612.122056",

year = "2012",

doi = "10.1109/LCOMM.2012.102612.122056",

language = "English",

volume = "16",

pages = "2095--2098",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - Timer-based push scheme for online social networking services in wireless networks

AU - Ko, Haneul

AU - Pack, Sangheon

AU - Lee, Wonjun

N1 - Funding Information: Manuscript received September 12, 2012. The associate editor coordinating the review of this letter and approving it for publication was J. Holliday. This work was supported in part by the WCU Project (R33-2008-000-10044-0), in part by the ITRC support program (NIPA-2012-H0301-12-4004), and in part by the KCA R&D program (KCA-10913-05004). H. Ko and S. Pack (corresponding author) are with the School of Electrical Engineering, Korea University, Seoul, Korea (e-mail: {st basket, shpack}@korea.ac.kr). W. Lee is with the Department of Computer Science and Engineering, Korea University, Seoul, Korea (e-mail: wlee@korea.ac.kr). Digital Object Identifier 10.1109/LCOMM.2012.102612.122056

PY - 2012

Y1 - 2012

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 - Push

KW - online social networking service

KW - pull

UR - http://www.scopus.com/inward/record.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 -

Timer-based push scheme for online social networking services in wireless networks

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this