Search

In this paper, we propose a game-theoretic model of the mobile network market. The market is presented by three sides: primary mobile network operators (MNO), mobile virtual network operators (MVNO) and consumers of the services. MVNO are mobile operators without their own infrastructure. They buy resources from MNO and compete with other MVNO for the consumers selling a service in the mobile network market. We construct a two-stage game. In the first stage, MVNO (players) select the MNO, one or several, and then announce the price for their service for the consumers in this MNO. After the profile of prices is determined, the consumers are distributed among MVNOs following the logistic function. The equilibrium in this two-stage game is constructed. For identical consumers, the analytic formulas for the solution are derived., Funding Agencies|Academy of FinlandAcademy of Finland [296572, 316908, 311648]; Center for Industrial Information Technology (CENIIT) [17.01]; Russian Fund for Basic ResearchRussian Foundation for Basic Research (RFBR) [16-51-55006, 16-01-00183]; Shandong Province Double-Hundred Talent Plan [WST2017009]

Information-Centric Networking (ICN) introduces a paradigm shift from a host centric communication model for Future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Emergency network in a disaster scenario or disruptive network presents a significant challenge to the ICN deployment. In this paper, we present a Content dIstribution and retrieval framework in disaster netwOrks for public pRotection (CIDOR) which exploits the design principle of the native CCN architecture in the native Delay Tolerant Networking (DTN) architecture. We prove the feasibility and investigate the performance of our proposed solution using extensive simulation with different classes of the DTN routing strategies in different mobility scenarios. The simulation result shows that CIDOR can reduce the content retrieval time up to 50% while the response ratio is close to 100%., Funding Agencies|EU [643990]; Center for Industrial Information Technology (CENIIT)

Public cloud platforms might start with homogeneous hardware; nevertheless, because of inevitable hardware upgrades, or adding more capacity, the initial homogeneous platform will gradually evolve into heterogeneous as time passes by. The consequent performance heterogeneity is of concern to cloud users. In this paper, we evaluate performance variations from hardware heterogeneity and scheduling mechanisms of public clouds. Amazon Elastic Compute Cloud (Amazon EC2) and Rackspace Cloud are used as the representatives because of their relatively long record and wide usage among small and medium enterprises (SMEs). A comprehensive set of microbenchmarks and application-level macrobenchmarks have been used to investigate performance variation. Several major contributions have been made. First, we find out that heterogeneous hardware is a commonality among the relatively long-lasting cloud platforms, although the level of heterogeneity varies. Second, we observe that heterogeneous hardware is the primary culprit of performance variation of cloud platforms. Third, we discover that varied CPU acquisition percentages and different virtual machine scheduling mechanisms exacerbate the performance variation problem, especially for network related operations. Finally, based on the observations, we propose cost-saving approaches and analyze Nash equilibrium from cloud user perspective. By using a simple

Online advertising of services through the Web has found new fertile ground on the development of social media, thanks to the integration of the latter with traditional websites, and business owners recently began to acknowledge this potential. Our study aims to analyse and explore how to effectively utilize these new opportunities promote online business. To achieve this, we adopted an automated approach which exploits the user-driven evolution of Internet technologies and social networks in particular, targeting specific users, based on content of interest both from the business and customer point of view. Our results show that this method can be profitable in establishing a deeper presence in the users online habits, allowing them to promote further the service within their contact network, thus virtually increase exponentially its visibility. Furthermore, this work offers the basis for ideas and suggestions on how to strengthen the business presence in social media, providing better engagement with the subscribers and possibly attracting new customers.

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving, Tässä väitöskirjassa tutkimme useita Internetin resurssienjako-ongelmia, jotka liittyvät yhteisten resurssien käyttöön ja jakamiseen monen käyttäjän järjestelmissä. Tutkimme rinnakkain käytettäviä resursseja, jotka voidaan antaa käyttäjille omaan tai jaettuun käyttöön. Ratkaisuna ehdotamme joko uutta algoritmia tai muutoksia olemassaoleviin tunnettuihin mainejärjestelmiin. Kaikkia algoritmeja tutkitaan useammasta näkökulmasta: protokollien optimaalisuus, käyttäjien itsekkyys, protokollan reiluus käytäjiä kohtaan. Tämä monikantainen analyysi mahdollistaa sopivimman protokollan valinnan, ottaen huomioon erilaiset optimointikriteerit. Toisaalta, tulevaisuuden verkkoratkaisut määrittelevät uusia optimointisääntöjä, sekä verkkojen uusia ominaisuuksia, jotka molemmat pitää ottaa tulevaisuudessa huomioon.