scispace - formally typeset
Search or ask a question
Topic

Shared resource

About: Shared resource is a research topic. Over the lifetime, 7536 publications have been published within this topic receiving 123491 citations. The topic is also known as: network share.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper addresses some key factors in VANET time synchronization such as requirements analysis, precision, accuracy, availability, scalability and compatibility, and highlights the advantages of Global Navigation Satellite System (GNSS) in VANSet time synchronization.

38 citations

Journal ArticleDOI
TL;DR: This work designs a contract-based incentive mechanism to motivate vehicles to share their computation resources with service requesters and designs multi-step smart contracts to achieve secure resource sharing and defend against the malicious behaviours of service requester and vehicles with selfish purposes.
Abstract: Vehicular edge computing (VEC) extends edge computing to vehicular networks by exploiting computation resources of vehicles to offload tasks from other vehicles and pedestrians However, VEC faces several critical challenges such as the potential security issues caused by untrusted and opaque environment and the lack of incentive mechanism under asymmetric information scenario To solve the above challenges, we propose a consortium blockchain for secure resource sharing in VEC We first design multi-step smart contracts to achieve secure resource sharing and defend against the malicious behaviours of service requesters and vehicles with selfish purposes Then, a byzantine fault tolerance-based proof-of-stake (BFT-based PoS) consensus protocol is applied in consortium blockchain to reach consensus efficiently Furthermore, we design a contract-based incentive mechanism to motivate vehicles to share their computation resources with service requesters The optimal contracts are derived to maximize the service requesters’ expected utility as well as social welfare Finally, simulation results demonstrate that the proposed incentive mechanism is more effective and efficient than the traditional schemes

38 citations

Book
01 Jan 2005
TL;DR: This thesis categorizes and evaluates the components and mechanisms necessary to build robust, effective reputation systems for use in decentralized autonomous networks, and closely examines the effects of limited reputation sharing through simulations based on large-scale measurements from actual, operating P2P networks.
Abstract: The increasing availability of high bandwidth Internet connections and low-cost, commodity computers in people's homes has stimulated the use of resource sharing peer-to-peer networks. These systems employ scalable mechanisms that allow anyone to offer content and services to other system users. However, the open accessibility of these systems make them vulnerable to malicious users wishing to poison the system with corrupted data or harmful services and worms. Because of this danger, users must be wary of the quality or validity of the resources they access. To mitigate the adverse behavior of unreliable or malicious peers in a network, researchers have suggested using reputation systems. Yet our understanding of how to incorporate an effective reputation system into an autonomous network is limited. This thesis categorizes and evaluates the components and mechanisms necessary to build robust, effective reputation systems for use in decentralized autonomous networks. Borrowing techniques from game theory and economic analysis, we begin with high-level models in order to understand general trends and properties of reputation systems and their effect on a user's behavior and experience. We then closely examine the effects of limited reputation sharing through simulations based on large-scale measurements from actual, operating P2P networks. Finally, we propose new mechanisms for improving message routing throughput in decentralized networks of untrusted peers: one geared towards structured DHTs (SPROUT) and two other complementary mechanisms for mobile ad hoc networks (Watchdog and Pathrater).

38 citations

Book ChapterDOI
08 Jul 2013
TL;DR: An extended version of an existing and widely accepted application benchmark added support for multi-tenant platform features is presented, focused on evaluating the maximum throughput and the amount of tenants that can be served by a platform.
Abstract: Cloud environments reduce data center operating costs through resource sharing and economies of scale. Infrastructure-as-a-Service is one example that leverages virtualization to share infrastructure resources. However, virtualization is often insufficient to provide Software-as-a-Service applications due to the need to replicate the operating system, middleware and application components for each customer. To overcome this problem, multi-tenancy has emerged as an architectural style that allows to share a single Web application instance among multiple independent customers, thereby significantly improving the efficiency of Software-as-a-Service offerings. A number of platforms are available today that support the development and hosting of multi-tenant applications by encapsulating multi-tenancy specific functionality. Although a lack of performance guarantees is one of the major obstacles to the adoption of cloud computing, in general, and multi-tenant applications, in particular, these kinds of applications and platforms have so far not been in the focus of the performance and benchmarking community. In this paper, we present an extended version of an existing and widely accepted application benchmark adding support for multi-tenant platform features. The benchmark is focused on evaluating the maximum throughput and the amount of tenants that can be served by a platform. We present a case study comparing virtualization and multi-tenancy. The results demonstrate the practical usability of the proposed benchmark in evaluating multi-tenant platforms and gives insights that help to decide for one sharing approach.

38 citations

Patent
31 Mar 2000
TL;DR: In this article, a host system is provided with a shared resource (such as work queues and completion queues); multiple processors arranged to access the shared resource; and an operating system arranged to allow multiple processors to perform work on the shared resources concurrently while supporting updates.
Abstract: A host system is provided with a shared resource (such as work queues and completion queues); multiple processors arranged to access the shared resource; and an operating system arranged to allow multiple processors to perform work on the shared resource concurrently while supporting updates of the shared resource. Such an operating system may comprise a synchronization algorithm for synchronizing multiple threads of operation with a single thread so as to achieve mutual exclusion between multiple threads performing work on the shared resource and a single thread updating or changing the state of the shared resource without requiring serialization of all threads.

38 citations


Network Information
Related Topics (5)
The Internet
213.2K papers, 3.8M citations
84% related
Information system
107.5K papers, 1.8M citations
83% related
Software
130.5K papers, 2M citations
80% related
Network packet
159.7K papers, 2.2M citations
78% related
Wireless network
122.5K papers, 2.1M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022194
2021223
2020298
2019381
2018373