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.

TrustStream: A Secure and Scalable Architecture for Large-Scale Internet Media Streaming

Abstract: To effectively address the explosive growth of multimedia applications over the Internet, a large-scale media streaming system has to fully take into account the issues of security, quality of service (QoS), scalability, and heterogeneity. However, current streaming solutions do not address all these challenges simultaneously. To address this limitation, this paper proposes a secure and high-performance streaming system called TrustStream, which combines the best features of scalable coding, content distribution network (CDN) and peer-to-peer (P2P) networks to achieve unprecedented security, scalability, heterogeneity, and certain QoS simultaneously under a unified architecture. In this architecture, raw video is encoded into two layers, namely, the base layer, which contains the most critical media content and is transmitted through a CDN-featured single-source multi-receiver (S-M) P2P network to guarantee a minimal level of quality, and the enhancement layer, which is transmitted in a pure multisource multi-receiver (M-M) P2P framework to achieve maximum scalability and bandwidth utilization. Heterogeneity is therefore addressed by delivering only the layers that a receiver is able to manage. Security is provided by combining our key distribution mechanism and key-embedding scheme under our proposed S-M P2P topology. We have implemented TrustStream system over the Internet. Deployed by ChinaCache, the largest CDN provider in China, TrustStream has broadcasted several popular live video programs over the Internet. The experimental results demonstrate the advantages and effectiveness of our architecture and system.

Joint Resource Allocation and Online Virtual Network Embedding for 5G Networks

Abstract: Next generation (5G) wireless networks are expected to accommodate proliferation of connected devices and multimedia services. To support multimedia services in an agile, cost-effective, and flexible way, network virtualization is a potential solution. This paper investigates service- oriented network virtualization for 5G wireless networks, to efficiently allocate heterogeneous resources to accommodate multimedia services. Specifically, we study joint resource allocation for virtual network requests (VNRs) and online embedding the resultant VNRs in core networks (CNs). With the deployment of multiple traffic aggregation points (TAPs) in radio access networks (RANs), the end-to- end traffic from heterogeneous access technologies can be aggregated and then grouped based on their destinations. Queueing models are developed in determining the minimal capacity required at each core network element. Virtual network embedding (VNE) in the core network is further proposed to achieve efficient physical resource sharing in CNs. Simulation results validate the VNE process in core networks based on the optimized capacities.

Using semantics for automatic enforcement of access control policies among dynamic coalitions

Abstract: In a dynamic coalition environment, organizations should be able to exercise their own local fine-grained access control policies while sharing resources with external entities. In this paper, we propose an approach that exploits the semantics associated with subject and object attributes to facilitate automatic enforcement of organizational access control policies while resource sharing occurs among coalition members. Our approach relies on identifying the necessary attributes required by external users to gain access to a specific organizational object (or service). Specifically, it consists of extracting user attribute sets that semantically match with the attributes of the objects for which a role has permissions. This relies on a closer examination of why a user is assigned a specific role. These attribute sets are first pruned based on their significance in characterizing a role, which are then checked against those submitted by an external user to decide whether to allow or deny access to the specific object. While our goal in this paper is to support coalition based access control, the proposed approach can also aid in automating the process of role engineering.

Virtual machine trading in a federation of clouds: individual profit and social welfare maximization

Abstract: By sharing resources among different cloud providers, the paradigm of federated clouds exploits temporal availability of resources and geographical diversity of operational costs for efficient job service. While interoperability issues across different cloud platforms in a cloud federation have been extensively studied, fundamental questions on cloud economics remain: When and how should a cloud trade resources (e.g., virtual machines) with others, such that its net profit is maximized over the long run, while a close-to-optimal social welfare in the entire federation can also be guaranteed? To answer this question, a number of important, interrelated decisions, including job scheduling, server provisioning, and resource pricing, should be dynamically and jointly made, while the long-term profit optimality is pursued. In this work, we design efficient algorithms for intercloud virtual machine (VM) trading and scheduling in a cloud federation. For VM transactions among clouds, we design a double-auction-based mechanism that is strategy-proof, individual-rational, ex-post budget-balanced, and efficient to execute over time. Closely combined with the auction mechanism is a dynamic VM trading and scheduling algorithm, which carefully decides the true valuations of VMs in the auction, optimally schedules stochastic job arrivals with different service level agreements (SLAs) onto the VMs, and judiciously turns on and off servers based on the current electricity prices. Through rigorous analysis, we show that each individual cloud, by carrying out the dynamic algorithm in the online double auction, can achieve a time-averaged profit arbitrarily close to the offline optimum. Asymptotic optimality in social welfare is also achieved under homogeneous cloud settings. We carry out simulations to verify the effectiveness of our algorithms, and examine the achievable social welfare under heterogeneous cloud settings, as driven by the real-world Google cluster usage traces.

Blockchain-Empowered Fair Computational Resource Sharing System in the D2D Network

Abstract: Device-to-device (D2D) communication is becoming an increasingly important technology in future networks with the climbing demand for local services. For instance, resource sharing in the D2D network features ubiquitous availability, flexibility, low latency and low cost. However, these features also bring along challenges when building a satisfactory resource sharing system in the D2D network. Specifically, user mobility is one of the top concerns for designing a cooperative D2D computational resource sharing system since mutual communication may not be stably available due to user mobility. A previous endeavour has demonstrated and proven how connectivity can be incorporated into cooperative task scheduling among users in the D2D network to effectively lower average task execution time. There are doubts about whether this type of task scheduling scheme, though effective, presents fairness among users. In other words, it can be unfair for users who contribute many computational resources while receiving little when in need. In this paper, we propose a novel blockchain-based credit system that can be incorporated into the connectivity-aware task scheduling scheme to enforce fairness among users in the D2D network. Users’ computational task cooperation will be recorded on the public blockchain ledger in the system as transactions, and each user’s credit balance can be easily accessible from the ledger. A supernode at the base station is responsible for scheduling cooperative computational tasks based on user mobility and user credit balance. We investigated the performance of the credit system, and simulation results showed that with a minor sacrifice of average task execution time, the level of fairness can obtain a major enhancement.