A dynamic and resource sharing virtual network mapping algorithm

Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.

Analysis and Optimization of Validation Procedure in Blockchain-Enhanced Wireless Resource Sharing and Transactions

To ensure the security of resource and intelligence sharing in 6G,blockchain has been widely adopted in wireless communications and applications.Although blockchain can ensure the traceability and non-tamperability of data in the concatenated blocks,it cannot guarantee the honest behaviors of users in the application before the generation of transactions.Thus,additional technologies are required to ensure that the source of blockchain data is reliable.In this paper,the detailed procedure is designed for the application-oriented task validation in the blockchainenhanced computing resource sharing and transactions in ultra dense networks(UDN).The corresponding queuing model is built and analyzed with the consideration of the wireless re-transmission and the probability of malicious deception by users.Based on the analysis results,the UDN deployment is optimized to save network cost while ensuring latency performance.Numerical results verify our analysis,and the optimized system deployment including the number and service capacities of both base stations and mobile edge computing(MEC)servers are also given with various system settings.

Intraclonal Resource Sharing and Functional Specialization of Ramets in Response to Resource Heterogeneity in Three Stoloniferous Herbs

Environments with reciprocal patchiness of resources, in which the availability of two resources such as light and soil nutrients are patchily distributed in horizontal space and negatively correlated in each patch, are common in many ecosystems. The strategies by which clonal plants adapt to this type of heterogeneous environment were examined in three stoloniferous herbs,Potentilla reptans L. var. sericophylla Franch., P. anserina L. and Halerpestes ruthenica (Jacq.) Qvcz., commonly inhabiting forest understories, grasslands and low saline meadows, respectively. As pairs of connected ramets were subjected to reciprocal patchiness of light and nutrients, stolon connection between the two ramets significantly enhanced biomass of both ramet growing in low light intensity but high soil nutrient condition (LH ramet) and ramet growing in high light intensity but low soil nutrient condition (HL ramet) as well as whole ramet pairs (consisting of LH ramets and HL ramets). Additionally, stolon connection greatly increased root/shoot ratio of LH ramet while significantly decreased that of HL ramet. The results indicate that a reciprocal transportation of resources between interconnected ramets and a functional specialization of ramets in uptake of abundant resources occurred. By resource sharing and functional specialization, clonal plants can efficiently acquire locally abundant resources and buffer the stress caused by reciprocal patchiness of resources.

Dilemma and Exploration of Resource Sharing in University Museums of Natural History——using Natural History Museum of Zhengzhou Normal University as an example

A natural history museum is a museum for collection, researching and presenting natural environment and natural heritages about natural history. In the research, based on the analysis on necessity of university museums’ services to society in resources sharing, the difficulties and dilemmas were summarized in sharing resources of museums and the approaches for resources sharing were explored with the case of Natural History Museum of Zhengzhou Normal University in order to investigate the way for better services of university museum to the public.

A Scalable Resource Management Architecture for Wide-Area Industrial Measurement Collaboration on Grids

Research on Web measurement and industrial collaboration in measurement fields in a wide-area and across-organizationally is accepted globally. This paper proposes a novel, scalable management architecture of measurement resources for the resource organization and resource access of the current wide-area collaborative measurement applications in the context of a grid. The complexity of the measurement management on a grid arises from the scale, dynamism, autonomy, heterogeneity, and distribution of the measurement systems and the relative data systems. This paper mainly discusses the interconnection, collaboration, and transparent access of the multi-measurement resources based on the proposed management architecture in the context of complexity. We first discuss the logical architecture used in the measurement fields, and then the resource management system is put at a high premium with layered architecture. Finally, the problems such as resource interconnection, sharing and collaboration are studied in the context of the proposed management environment. The typical applying instance is given to show the advancement of the proposed approach.

A Peer-to-Peer Resource Sharing Scheme Using Trusted Computing Technology

Facing the increasing security issues in P2P networks, a scheme for resource sharing using trusted computing technologies is proposed in this paper. We advance a RS-UCON model with decision continuity and attribute mutability to control the usage process and an architecture to illustrate how TC technologies support policy enforcement with bidirectional attestation. The properties required for attestation should include not only integrity measurement value of platform and related application, but also reputation of users and access history, in order to avoid the limitation of the existing approaches. To make a permission, it is required to evaluate both the authorization and conditions of the subject and the object in resource usage to ensure trustable resources to be transferred to trusted users and platform.

CRESS: A Platform of Infrastructure Resource Sharing for Educational Cloud Computing

Cloud computing is very attractive for schools, research institutions and enterpri- ses which need reducing IT costs, improving computing platform sharing and meeting lice- nse constraints. Sharing, management and on- demand allocation of network resources are particularly important in Cloud computing. Ho- wever, nearly all-current available cloud com- puting platforms are either proprietary or their software infrastructure is invisible to the rese- arch community except for a few open-source platforms. For universities and research insti- tutes, more open and testable experimental plat- forms are needed in a lab-level with PCs. In this paper, a platform of infrastructure resou- rce sharing system （Platform as a Service （PaaS）） is developed in virtual Cloud comput- hug environment. Its architecture, core modules, main functions, design and operational envir- onment and applications are introduced in de- tail. It has good expandability and can impr- ove resource sharing and utilization and is app- lied to regular computer science teaching and research process.

Research and Simulation of Parking Resource Sharing Mode in Old Community—Taking Yingmenkou Community as an Example

In recent years, the number of permanent residents in Chengdu, Sichuan Province, China has continued to grow, and the number of private cars keeps rising. A series of problems caused by difficult parking and random parking in old communities are common. This paper will take the parking problem of the old community in Yingmenkou community, Chengdu, China as an example to summarize the current situation and parking problems of the private car parking facilities in these old communities. Based on Chengdu’s current old community parking management policy, parking facility renovation and expansion policy, this paper researches and establishes a parking resource sharing model suitable for old communities. The simulation results show that this model has a small footprint and is easy to install and disassemble. It can be freely spliced and combined units according to the size of the old community and the needs of residents. It is suitable for old communities with no centralized parking lot and high parking demand by residents.

CWoT-Share: Context-Based Web of Things Resource Sharing in Blockchain Environment

Web of Things(WoT)resources are not only numerous,but also have a wide range of applications and deployments.The centralized WoT resource sharing mechanism lacks flexibility and scalability,and hence cannot satisfy requirement of distributed resource sharing in large-scale environment.In response to this problem,a trusted and secure mechanism for WoT resources sharing based on context and blockchain(CWoT-Share)was proposed.Firstly,the mechanism can respond quickly to the changes of the application environment by dynamically determining resource access control rules according to the context.Then,the flexible resource charging strategies,which reduced the fees paid by the users who shared more resources and increased the fees paid by users who frequently used resources maliciously,were used to fulfill efficient sharing of WoT resources.Meanwhile,the charging strategies also achieve load balancing by dynamic selection of WoT resources.Finally,the open source blockchain platform Ethereum was used for the simulation and the simulation results show that CWoT-Share can flexibly adapt to the application environment and dynamically adjust strategies of resource access control and resource charging.

Architecture of Intelligent Grouping and Resource Sharing Standard

The Intelligent Grouping and Resource Sharing (IGRS) standard is set to enable intelligent grouping, resource sharing and services collaboration among information devices. An IGRS system adopts open architecture, that is, the devices abide by the IGRS standard are interoperable with devices following other standards such as Universal Plug and Play (UPnP). The IGRS supports multiple application frameworks and special applications. Developers can use an IGRS media application framework with various media format standards, such as AVS and MPEG-2, to develop multimedia applications. Applied among computers, consumer electronics, and communication devices, the IGRS standard can realize resource sharing and services collaboration in a certain range of wired or wireless network domain.

Standardization Promotes the Construction of Shandong E-government Resource Sharing

Standardization is the basis of e-government construction which aims to link organically government affair systems of different departments through standardized method and provide technical guidelines and specifications for collaborative work in all affair aspects. Standardized coordination and optimization can help to guarantee the safety and reliability of e-government construction and promote efficiency. This article discusses the achievements, existing problems and experience of Shandong e-government standardization.

A comparative study on users' satisfaction of library resource sharing under the circumstance of network in Nanjing

From the perspective of information resource sharing, the authors investigated the ratio and degree of users' satisfaction with resource sharing among college libraries, public libraries and research libraries in Nanjing city. Based on the analysis and discussion about the findings, the authors summarized the library resource sharing system in satisfying users' information requirements, including its pros and cons. At last, further considerations have been provided on how to improve library resource sharing system in the region.

A Game Theoretic Approach for Hierarchical Caching Resource Sharing in 5G Networks with Virtualization

Caching and virtualization have been considered as the promising techniques in 5G Networks. In 5G networks with virtualization, the caching resources deployed by infrastructure providers (InPs) can be abstracted into isolated slices and transparently shared by mobile virtual network operators (MVNOs). In this case, one of the most important issues is how the MVNOs to share the caching resource. To solve this issue, different from previous works, a hierarchical caching architecture that core network and radio access network (RAN) have the caching capability in 5G networks with virtualization is first considered in this paper. Then, we study the problem of hierarchical caching resource sharing for MVNOs, and a competitive game to maximize their expectation revenue based on the oligopoly market model is formulated. As it is a hard problem to find the optimal solution in the hierarchical caching resource sharing problem, we decompose the optimization problem into two independent caching resource sharing problems in RAN and core network, respectively. Then the local optimal solutions are solved and the global Nash equilibrium solution is achieved. Finally, simulation results are illustrated to demonstrate the performance of the proposed scheme.

Resource Sharing by the Different Clonal White Clover Plant(Trifolium repens L.)

Resource sharing in the different parts of the clonal white clover plant (Trifolium repens L.) was investigated in this study. The results showed that the integration of water and nitrogen metabolism occured among parental, young and old branches of a plant when water passed through its stolons. Under the sufficient supply of light, water and nutrients from soil the newly developed branches showed similar capacity in taking in sufficient water and nitrogen to that of old branches. The development of the new branches did not affect the growth of the old and parental branches attached. The results also indicated that energy values in roots was significantly related with plant age, however, the energy values were various in the different parts of a plant.

Inter-Network Resource Sharing in IEEE 802.22 Networks

IEEE 802.22 is the first worldwide standard for Cognitive Networks (CNs) that exploits unused spectrum of the television broadcast service. An IEEE 802.22 network is also called Wireless Regional Area Network (WRAN). An open issue in cognitive 802.22 networks is represented by the resource distribution among WRANs. In this paper a protocol for radio resource management for CNs in a multichannel environment is presented and analysed. In particular, the contribution of this work is a resource sharing method to schedule the WRAN access to the available channels in a community made by two o more coexisting WRANs. The method adapts to the continuous changes of the spectrum availability due to necessity of vacating a channel in case of the incumbent primary users. Moreover, the introduced allocation scheme allows to divide the available band in a proportional way to the cognitive user spectrum demands, taking into account the issue of spatial diversity, i.e. the case where the channel coverage area is not uniform. The effectiveness of the proposed multichannel scheme is proved through simulations. The results compared favorably with other methods already known in literature and show that the proposed algorithm optimize the spectral efficiency, keeping high fairness as demonstrated computing the Jain’s index.

Research on the Strategy of Information Resource Sharing between Governments in the Perspective of Game Theory

In order to improve the operational efficiency, the government can realize the streamlining policy through the mode of government information resource sharing. By building government information resources sharing, the government breaks the inter-departmental data island. The government realizes the development direction and trend of “Internet government”. This paper also takes the information resource sharing as the game process between the government management department and the information resource sharing body, and analyzes the policy and suggestion of the information resource sharing in the perspective of game theory by constructing the sharing model of the government information resource in the perspective of game theory.

Design and Implementation of the Platform for Multimedia Resource Sharing based on Cloud Technology

This paper first reviews the current state of multimedia teaching resource sharing in China as well as the problems encountered. It then proceeds to the focus that a good way out for the dilemma is to design a platform of multimedia teaching resource sharing based on cloud service concept.

Optimization and Design of Cloud-Edge-End Collaboration Computing for Autonomous Robot Control Using 5G and Beyond

Robots have important applications in industrial production, transportation, environmental monitoring and other fields, and multi-robot collaboration is a research hotspot in recent years. Multi-robot autonomous collaborative tasks are limited by communication, and there are problems such as poor resource allocation balance, slow response of the system to dynamic changes in the environment, and limited collaborative operation capabilities. The combination of 5G and beyond communication and edge computing can effectively reduce the transmission delay of task offloading and improve task processing efficiency. First, this paper designs a robot autonomous collaborative computing architecture based on 5G and beyond and mobile edge computing(MEC).Then, the robot cooperative computing optimization problem is studied according to the task characteristics of the robot swarm. Then, a reinforcement learning task offloading scheme based on Qlearning is further proposed, so that the overall energy consumption and delay of the robot cluster can be minimized. Finally, simulation experiments demonstrate that the method has significant performance advantages.

Two Agent Paths Planning Collaboration Based on the State Feedback Stackelberg Dynamic Game

Autonomous Navigation Modules are capable of driving a robotic platform without human direct participation. It is usual to have more than one Autonomous Navigation Modules in the same work space. When an emergency situation occurs, these modules should achieve a desired formation in order to efficiently escape and avoid motion deadlock. We address the collaboration problem between two agents such as Autonomous Navigation Modules. A new approach for team collaborative control based on the incentive Stackelberg game theory is presented. The procedure to find incentive matrices is provided for the case of geometric trajectory planning and following. A collaborative robotic architecture based on this approach is proposed. Simulation results performed with two virtual robotic platforms show the efficiency of this approach.

A Reverse Auction Mechanism for Time-Varying Multidimensional Resource Allocation in Vehicular Fog Computing with Cloud and Edge Collaboration

It is a hot issue to allocate resources using auction mechanisms in vehicular fog computing(VFC)with cloud and edge collaboration.However,most current research faces the limitation of only considering single type resource allocation,which cannot satisfy the resource requirements of users.In addition,the resource requirements of users are satisfied with a fixed amount of resources during the usage time,which may result in high cost of users and even cause a waste of resources.In fact,the actual resource requirements of users may change with time.Besides,existing allocation algorithms in the VFC of cloud and edge collaboration cannot be directly applied to time-varying multidimensional resource allocation.Therefore,in order to minimize the cost of users,we propose a reverse auction mechanism for the time-varying multidimensional resource allocation problem(TMRAP)in VFC with cloud and edge collaboration based on VFC parking assistance and transform the resource allocation problem into an integer programming(IP)model.And we also design a heuristic resource allocation algorithm to approximate the solution of the model.We apply a dominant-resource-based strategy for resource allocation to improve resource utilization and obtain the lowest cost of users for resource pricing.Furthermore,we prove that the algorithm satisfies individual rationality and truthfulness,and can minimize the cost of users and improve resource utilization through comparison with other similar methods.Above all,we combine VFC smart parking assistance with reverse auction mechanisms to encourage resource providers to offer resources,so that more vehicle users can obtain services at lower prices and relieve traffic pressure.