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.

System and method for linking and sharing resources amongst devices

Abstract: A device is enabled to establish a secure and persistent pairing with one another across a communication medium, using credential information that is exchanged out-of-band.

Improving Cloud-Based IoT Services Through Virtual Network Embedding in Elastic Optical Inter-DC Networks

Abstract: With the boom of Internet of Things (IoT), an increasing amount of data from IoT applications is moved to geo-distributed data centers (DCs) for data analysis. Massive compute-demanding applications call for a more flexible and efficient resource allocation for uncertain and heterogeneous traffic in geo-distributed multi-DC systems. Virtual network embedding, a major part of network virtualization, facilitates to provide different kinds of businesses or services by resource sharing. Moreover, due to their elasticity, elastic optical networks are viewed as a very promising solution to support inter-DC networks. This paper focuses on the effectiveness and spectrum fragmentation problem for virtual optical network embedding in elastic optical inter-DC networks by employing multidimensional resources and a topological attribute. In the node mapping, betweenness of a physical node is considered together with multidimensional resource carrying capacity (MRCC) to identify proper matching. Specifically, to reduce the influence of a spectrum fragment, the available spectrum continuity degree is coupled with the computing capacity of a physical node as the MRCC. In the link mapping, a tightest-matching factor is employed for the selection of paths to accommodate virtual links. Compared with baseline algorithms except for the integer linear programming (ILP) solution, analytical and numerous experiments show that our solution reduces the blocking probability by 30% on average, balances the load by 15% on average and improves spectral efficiency significantly. Moreover, our proposal has a slightly lower spectral efficiency but a better blocking performance and a much better link load balance than that of the ILP formulation.

An Architecture for Scalable and Manageable File Services

Abstract: Monolithic file servers are limited by the power of an individual system. Cluster file servers are limited by resource sharing and recovery issues as the number of cluster nodes increases. DiFFS is a file service architecture that allows system resources to be added (or removed) dynamically, e.g., storage and processors. Resources are partitioned in such a way that contention is avoided, while maintaining a single namespace. Resources may be heterogeneous, and geographically dispersed. This architecture has several advantages. A file’s physical location is decoupled from its location in the namespace. This decoupling enables a powerful and flexible mechanism for the placement of file system objects. For example, different types of files, e.g., text or video, may reside anywhere in the namespace while being hosted by servers best suited to handling their content type. DiFFS also provides lightweight protocols for online dynamic reconfiguration (volume reassignment and object migration) to address fluctuating demand and potentially mobile file system entities. A DiFFS prototype has been implemented in Linux. Performance results indicate that the architecture achieves its flexibility and scalability goals without sacrificing performance.

Enforcing cooperative resource sharing in untrusted P2P computing environments

Abstract: Peer-to-Peer (P2P) computing is widely recognized as a promising paradigm for building next generation distributed applications. However, the autonomous, heterogeneous, and decentralized nature of participating peers introduces the following challenge for resource staring: how to make peers profitable in the untrusted P2P environment? To address the problem, we present a self-policing and distributed approach by combining two models: PET, a personalized trust model, and M-CUBE, a multiple-currency based economic model, to lay a foundation for resource sharing in untrusted P2P computing environments. PET is a flexible trust model that can adapt to different requirements, and provides the solid support for the currency management in M-CUBE. M-CUBE provides a novel self-policing and quality-aware framework for the sharing of multiple resources, including both homogeneous and heterogeneous resources. We evaluate the efficacy and performance of this approach in the context of a real application, a peer-to-peer Web server sharing. Our results show that our approach is flexible enough to adapt to different situations and effective to make the system profitable, especially for systems with large scale.

SmartNet: a scheduling framework for heterogeneous computing

Abstract: SmartNet is a scheduling framework for heterogeneous systems. Preliminary conservative simulation results for one of the optimization criteria, show a 1.21 improvement over Load Balancing and a 25.9 improvement over Limited Best Assignment, the two policies that evolved from homogeneous environments. SmartNet achieves these improvements through the implementation of several innovations. It recognizes and capitalizes on the inherent heterogeneity of computers in today's distributed environments; it recognizes and accounts for the underlying non-determinism of the distributed environment; it implements an original partitioning approach, making runtime prediction more accurate and useful; it effectively schedules based on all shared resource usage, including network characteristics; and it uses statistical and filtering techniques, making a greater amount of prediction information available to the scheduling engine. In this paper, the issues associated with automatically managing a heterogeneous environment are reviewed, SmartNet's architecture and implementation are described, and performance data is summarized.