MobiStore: A system for efficient mobile P2P data sharing

Khan, Mohammad Arifin Rahman; Yeh, Laurent; Zeitouni, Karine; Borcea, Cristian

doi:10.1007/s12083-016-0450-7

Cited by 9 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this state, users do not need to further transmit data ω k for task k, thereby reducing some of the time overhead. To simplify the model, consistent with other studies [3,29,30], we assume that the computational capacity of MEC servers is much greater than that of MUs, i.e., η d ≫ o d,n . Therefore, the latency caused by MEC servers performing computations can be eliminated.…”

Section: Cache-based Offloading Modementioning

confidence: 99%

Computation Offloading Based on a Distributed Overlay Network Cache-Sharing Mechanism in Multi-Access Edge Computing

Liu,

Zhong,

Yang

et al. 2024

Future Internet

View full text Add to dashboard Cite

Multi-access edge computing (MEC) enhances service quality for users and reduces computational overhead by migrating workloads and application data to the network edge. However, current solutions for task offloading and cache replacement in edge scenarios are constrained by factors such as communication bandwidth, wireless network coverage, and limited storage capacity of edge devices, making it challenging to achieve high cache reuse and lower system energy consumption. To address these issues, a framework leveraging cooperative edge servers deployed in wireless access networks across different geographical regions is designed. Specifically, we propose the Distributed Edge Service Caching and Offloading (DESCO) network architecture and design a decentralized resource-sharing algorithm based on consistent hashing, named Cache Chord. Subsequently, based on DESCO and aiming to minimize overall user energy consumption while maintaining user latency constraints, we introduce the real-time computation offloading (RCO) problem and transform RCO into a multi-player static game, prove the existence of Nash equilibrium solutions, and solve it using a multi-dimensional particle swarm optimization algorithm. Finally, simulation results demonstrate that the proposed solution reduces the average energy consumption by over 27% in the DESCO network compared to existing algorithms.

show abstract

Section: Cache-based Offloading Modementioning

confidence: 99%

Computation Offloading Based on a Distributed Overlay Network Cache-Sharing Mechanism in Multi-Access Edge Computing

Liu,

Zhong,

Yang

et al. 2024

Future Internet

View full text Add to dashboard Cite

show abstract

“…The rBot entries can be injected into the cellular mobile P2P networks (such as MobiStore [1], V-Chord [2]). MobiStore divides the participating cellular or Internet peers into virtual peers (VPs).…”

Section: (28)mentioning

confidence: 99%

“…The members of a VP are connected to each other and update their connection links with the help of the gossip-based protocol periodically. Alternatively, all VPs are connected and maintained as a Chord-based DHT mechanism [31] [1]. Here, v is the total number of local peers and c is a constant.…”

Section: (28)mentioning

confidence: 99%

“…With the growing demand for 3G, 4G or LTE-A cellular technologies, the importance of cost-effective P2P connection with less network traffic over cellular networks is realized [1], [2]. However, due to the inherent network architecture and infrastructure, there exist significant vulnerabilities in P2P techniques exposing the network to various types of attacks to disrupt the communication.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Routing Table Poisoning Model for Peer-to-Peer (P2P) Botnets

et al. 2019

View full text Add to dashboard Cite

Due to the global increase in mobile devices and cellular networks such as 3G, 4G, or LTE-A networks, the concept of the interpenetration of peer-to-peer (P2P) overlay networks in cellular environments has gained immense popularity among mobile users. P2P networks allow users to share their computing resources efficiently with the advantages of fault tolerance, robust connectivity, load balancing, and easy maintenance. The ability of a peer to connect to another peer depends on the distinguishing features of the overlay networks. For connection, network routing tables are maintained by each peer in the network to construct the P2P overlay on the Internet. This construction renders the P2P networks vulnerable to the existing attacks using the Internet. Some of these attack models have been proposed in the past using botnets. However, models using botnets do not accommodate the advanced attacks that can infect the majority of the entries in the routing table. In this paper, we propose a model to analyze the impacts of routing table poisoning attacks on the P2P botnet (rBot) architecture. We present the security analysis of the proposed epidemic model for state-of-the-art rBots. The obtained results were effective for attacks on the unstructured P2P static and mobile environments. INDEX TERMS Decentralized botnet, epidemic model, P2P overlay, routing table poisoning, mobility.

show abstract

Efficient Traffic Information Dissemination and Vehicle Navigation for Lower Travel Time in Urban Scenario Using Vehicular Networks

Balouchzahi

Rajaei

2019

Wireless Pers Commun

View full text Add to dashboard Cite

MobiStore: A system for efficient mobile P2P data sharing

Cited by 9 publications

References 28 publications

Computation Offloading Based on a Distributed Overlay Network Cache-Sharing Mechanism in Multi-Access Edge Computing

Computation Offloading Based on a Distributed Overlay Network Cache-Sharing Mechanism in Multi-Access Edge Computing

A Routing Table Poisoning Model for Peer-to-Peer (P2P) Botnets

Efficient Traffic Information Dissemination and Vehicle Navigation for Lower Travel Time in Urban Scenario Using Vehicular Networks

Contact Info

Product

Resources

About