HORST -Home Router Sharing based on Trust

Abstract-Today's Internet services are increasingly accessed from mobile devices, thus being responsible for growing load in mobile networks. At the same time, more and more WiFi routers are deployed such that a dense coverage of WiFi is available. Results from different related works suggest that there is a high potential of reducing load on the mobile networks by offloading data to WiFi networks, thereby improving mobile users' quality of experience (QoE) with Internet services. Additionally, the storage of the router could be used for content caching and delivery close to the end user, which is more energy efficient compared to classical content servers, and saves costs for network operators by reducing traffic between autonomous systems. Going one step beyond, we foresee that merging these approaches and augmenting them with social information from online social networks (OSNs) will result both in even less costs for network operators and increased QoE of end users. Therefore, we propose home router sharing based on trust (HORST) -a socially-aware traffic management solution which targets three popular use cases: data offloading to WiFi, content caching/prefetching, and content delivery

Journal of Telecommunications and Information Technology, 2018, nr 1

We consider a two-link system that accommodates Poisson arriving calls from different service-classes and propose a multirate teletraffic loss model for its analysis. Each link has two thresholds, which refer to the number of in-service calls in the link. The lowest threshold, named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. The adopted bandwidth sharing policy is the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units. The model does not have a product form solution for the steady state probabilities. However, we propose approximate formulas, based on a convolution algorithm, for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory

Journal of Telecommunications and Information Technology, 2018, nr 1

kwartalni

Incentives and Algorithms for Broadband Access Sharing

The unprecedented growth of the mobile (Smart)phone industry that comes together with the corresponding application development market has made apparent that mobile networking through 3G links is just about to reach an unbreakable limit, in terms of network capacity. The networking research community has recently started considering alternative connectivity approaches to support and boost the performanceofmobilenetworking. Inparticular, researchers have identified a big amount of ”power”, hidden at the edges of the network, which remains there unexploited and is no other than the WiFi technology deployed in home-networks. We explore incentives and algorithms for Broadband Access Sharing to support nomadic users and show that ubiquitous connectivity in densely populated areas is already possible, since the infrastructure is already there, waiting to be used