Examining registration delays in mobile based social networks

摘要

The popularity of web based social networks is rapidly increasing nowadays. These solutions allow managing relationships online. There are also several mobile solutions to these networks but they are mainly limited to reaching the services of the social network from the mobile device. The fact, that the phonebook of the mobile phones also represents social relationships, can be used for detecting additional relationships in the social network automatically, which has several benefits. For this a similarity detecting algorithm is required, which runs in the background on demand, on the server. When a member registers and synchronizes her or his entire phonebook the system should detect similarities as fast as possible. In this paper we introduce our mobile based social network. We discuss about similarity detecting based on phonebook sizes and we show a queuing theory based model regarding to registration delays.