Analyzing Push Schemes for Social Networking Services in Wireless Networks by using Monte Carlo Simulations

摘要

Social networking services such as Twitter and Facebook have occupied a large portion of our everyday life and it is expected to do so for the time being. SNS systems use both push and pull schemes to deliver contents to users. Regarding the push schemes, there are push N based scheme and timer based scheme. In this paper, we analyze the performance of both schemes by using Monte Carlo simulations and understand their characteristics. We present the simulation results that show the performance under various conditions. Moreover, we find that a weighting factor should be given more emphasis because of its significant impact on the performance. Also, we claim that the former work that analyzed PNS and TPS used wrong assumption that leads to the misconception about PNS.