3,188 research outputs found
Offloading Content with Self-organizing Mobile Fogs
Mobile users in an urban environment access content on the internet from
different locations. It is challenging for the current service providers to
cope with the increasing content demand from a large number of collocated
mobile users. In-network caching to offload content at nodes closer to users
alleviate the issue, though efficient cache management is required to find out
who should cache what, when and where in an urban environment, given nodes
limited computing, communication and caching resources. To address this, we
first define a novel relation between content popularity and availability in
the network and investigate a node's eligibility to cache content based on its
urban reachability. We then allow nodes to self-organize into mobile fogs to
increase the distributed cache and maximize content availability in a
cost-effective manner. However, to cater rational nodes, we propose a coalition
game for the nodes to offer a maximum "virtual cache" assuming a monetary
reward is paid to them by the service/content provider. Nodes are allowed to
merge into different spatio-temporal coalitions in order to increase the
distributed cache size at the network edge. Results obtained through
simulations using realistic urban mobility trace validate the performance of
our caching system showing a ratio of 60-85% of cache hits compared to the
30-40% obtained by the existing schemes and 10% in case of no coalition
Profitable Task Allocation in Mobile Cloud Computing
We propose a game theoretic framework for task allocation in mobile cloud
computing that corresponds to offloading of compute tasks to a group of nearby
mobile devices. Specifically, in our framework, a distributor node holds a
multidimensional auction for allocating the tasks of a job among nearby mobile
nodes based on their computational capabilities and also the cost of
computation at these nodes, with the goal of reducing the overall job
completion time. Our proposed auction also has the desired incentive
compatibility property that ensures that mobile devices truthfully reveal their
capabilities and costs and that those devices benefit from the task allocation.
To deal with node mobility, we perform multiple auctions over adaptive time
intervals. We develop a heuristic approach to dynamically find the best time
intervals between auctions to minimize unnecessary auctions and the
accompanying overheads. We evaluate our framework and methods using both real
world and synthetic mobility traces. Our evaluation results show that our game
theoretic framework improves the job completion time by a factor of 2-5 in
comparison to the time taken for executing the job locally, while minimizing
the number of auctions and the accompanying overheads. Our approach is also
profitable for the nearby nodes that execute the distributor's tasks with these
nodes receiving a compensation higher than their actual costs
Remote peering: More peering without internet flattening
The trend toward more peering between networks is commonly conflated with the trend of Internet flattening, i.e., reduction in the number of intermediary organizations on Internet paths. Indeed, direct peering interconnections bypass layer-3 transit providers and make the Internet flatter. This paper studies an emerging phenomenon that separates the two trends: we present the first systematic study of remote peering, an interconnection where remote networks peer via a layer-2 provider. Our measurements reveal significant presence of remote peering at IXPs (Internet eXchange Points) worldwide. Based on ground truth traffic, we also show that remote peering has a substantial potential to offload transit traffic. Generalizing the empirical results, we analytically derive conditions for economic viability of remote peering versus transit and direct peering. Because remote-peering services are provided on layer 2, our results challenge the traditional reliance on layer-3 topologies in modeling the Internet economic structure. We also discuss broader implications of remote peering for reliability, security, accountability, and other aspects of Internet research
The TSN Building Blocks in Linux
Various application areas e.g. industrial automation, professional
audio-video, automotive in-vehicle, aerospace on-board, and mobile fronthaul
networks require deterministic communication: loss-less forwarding with bounded
maximum latency. There is a lot of ongoing standardization activity in
different organizations to provide vendor-agnostic building blocks for
Time-Sensitive Networking (TSN), what is aimed as the universal solution for
deterministic forwarding in OSI Layer-2 networks. Furthermore, the
implementation of those standards is also happening in Linux. Some of them
require software changes only, but others have hardware support requirements.
In this paper, we give an overview of the implementation of the main TSN
standards in the mainline Linux kernel. Furthermore, we provide measurement
results on key functionality in support of TSN, e.g., scheduled transmission
and Linux bridging characteristics.Comment: Draft of the paper submitted to Netdev 0x16 conference. Link to the
submission:
https://netdevconf.info/0x16/session.html?The-TSN-building-blocks-in-Linu
- …