A Virtualized Target Queuing Balanced Model Using Vmax/M/G-Load(Min)/Cache-P2λM for Reducing Queuing Time Expectation of Customer Delay Tolerance

2020 ◽  
Vol 17 (12) ◽  
pp. 5520-5527
Author(s):  
A. Andrew Michael ◽  
M. Thiagarajan
Keyword(s):  
Resource Sharing ◽  
Queuing Theory ◽  
Service Performance ◽  
Late Response ◽  
Distributed Resources ◽  
Delay Tolerance ◽  
Model Complex ◽  
Balanced Model ◽  
Load Balancer ◽  
Customer Delay

Queuing theory is a formal mathematical model of late response arrival of customer waiting in various access services, accepting processes management as a whole field. Often multiple server sorting can be used to estimate the number of servers and service rates be high due too lacking of time, with an average delay sequence in the analysis. Using these sequence models to read more than one sequence during execution approximates system sorting performance. To resolve this problem we modulated the distributed process into Virtualized Target Queuing Balanced Model (VTQBM) using Vmax/M/G-Load (Min)/Cache-P2λM for reducing queuing time expectation of customer delay tolerance. The Virtual Resource queuing System is optimized with fork-join queue by creating single to multimodal service performance using target request load balancer in a shared distribution mode. Sorting the request buffer cache is created based on Customer Request Arrival Rate (CRAR) and resource output preferred to check with target rule waiting in the Load balancer. To improve the use of model complex virtual resource sharing shared with customer arrival to Cache Target Load Allocator (CTLA) on queuing distributed resources, This fork joiner target the service performance to reduce the customer waiting time in queuing and produce outputs can achieve a different parameter input transformation on queuing theory.

Design and Application of Rapid Manufacturing Domain Ontology to Support Resource Sharing

2013 ◽  
Vol 670 ◽  
pp. 57-64
Author(s):  
D. Wu ◽  
Q.X. Hu ◽  
Y. Yao
Keyword(s):  
Resource Sharing ◽  
Information Access ◽  
Domain Ontology ◽  
Rapid Manufacturing ◽  
Service Description ◽  
Distributed Resources ◽  
Intelligence Services ◽  
Representation Method ◽  
The Many ◽  
Support Resource

Facing the abundant service resources, how to make the heterogeneous distributed resources information system has the meaning that can be understand between man-machine and machines, search conveniently and implement the resources integration, achieve information access and query better as well as the interoperability between systems, it is a challenge it faces which implementing the resources sharing and intelligence services, but also a problem which to improve the service informatization level for RM industries to be solved. To facility services resource sharing in Rapid Manufacturing (RM) industry, mainly discussed demand analysis and establishment principle of RM domain ontology. Based on the many years of experience and enterprise instances, domain ontology was described conceptual and expressed knowledgeable and model structure was established. The knowledge representation method is adopted based on the domain ontology query model and partial examples of service description are given. In order to solve semantic fuzziness and realize integration, interoperability and reusability of enterprise service by building domain ontology which can satisfy shared understanding of interested parties. On this basis, integrated service system architecture was designed to support resource sharing. The methods had been applied preliminarily and would provide the basis for the future work and extended field.

scholarly journals Research on Cloud Computing Resources Provisioning Based on Reinforcement Learning

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Zhiping Peng ◽  
Delong Cui ◽  
Jinglong Zuo ◽  
Weiwei Lin
Keyword(s):  
Cloud Computing ◽  
Reinforcement Learning ◽  
Resource Management ◽  
Queuing Theory ◽  
Service Level Agreement ◽  
Service Level ◽  
Resource Provisioning ◽  
Utilization Rate ◽  
Sequential Decision ◽  
Distributed Resources

As one of the core issues for cloud computing, resource management adopts virtualization technology to shield the underlying resource heterogeneity and complexity which makes the massive distributed resources form a unified giant resource pool. It can achieve efficient resource provisioning by using the rational implementing resource management methods and techniques. Therefore, how to manage cloud computing resources effectively becomes a challenging research topic. By analyzing the executing progress of a user job in the cloud computing environment, we proposed a novel resource provisioning scheme based on the reinforcement learning and queuing theory in this study. With the introduction of the concepts of Segmentation Service Level Agreement (SSLA) and Utilization Unit Time Cost (UUTC), we viewed the resource provisioning problem in cloud computing as a sequential decision issue, and then we designed a novel optimization object function and employed reinforcement learning to solve it. Experiment results not only demonstrated the effectiveness of the proposed scheme, but also proved to outperform the common methods of resource utilization rate in terms of SLA collision avoidance and user costs.

Resource Sharing Campus Grid Platform Based on Load Balancing and Open Grid Service Architecture

2010 ◽  
Vol 143-144 ◽  
pp. 467-471
Author(s):  
Shu Yan
Keyword(s):  
Data Integration ◽  
Resource Sharing ◽  
Campus Network ◽  
Grid Data ◽  
Distributed Resources ◽  
Service Architecture ◽  
Grid Middleware ◽  
Extended Campus ◽  
Middleware Technology ◽  
Open Grid Service Architecture

In order to share distributed resources in the campus network and save relevant cost, This paper presents an extended campus services, data integration middleware grid middleware, grid data integration gives the campus a key middleware technology and architecture, and discusses the integration of grid middleware architecture of the campus's role and how grid services and other interactive components to complete the application request

scholarly journals Lower bound for average delay in unblocked random access algorithm with orthogonal preambles

2020 ◽  
pp. 79-85
Author(s):  
Artem Burkov ◽  
Seva Shneer ◽  
Andrey Turlikov
Keyword(s):  
Lower Bound ◽  
Resource Sharing ◽  
Queuing Theory ◽  
Multiple Access ◽  
System Analysis ◽  
Random Access ◽  
Arrival Rate ◽  
High Energy ◽  
Average Delay ◽  
Closed Expression

Introduction: Currently, the first versions of 5G communication standard networks are being deployed and discussions are underway on the further development of cellular networks and the transition to the 6G standard. The work of the currently popular idea of ​​the Internet of Things (IoT) is supposed to be in the framework of a Massive Machine-Type Communications scenario, which has a number of requirements for operation characteristics: very high energy efficiency, relatively low delay and fairly reliable communication. It is assumed that random multiple access procedures are used, since, due to the nature of the traffic, it is impossible to develop a channel resource sharing policy. To increase the efficiency of random access, a class of unblocked algorithms using orthogonal preambles can be used. Purpose: to calculate the lower bound of the average delay for the class of unblocked random multiple access algorithms using orthogonal preambles. Methods: system analysis, a theory of random processes, queuing theory, and simulation. Results: A model of a system with a potentially unlimited number of users who use random unblocked access to transmit data over a common communication channel using orthogonal preambles is proposed. A closed expression is obtained for calculating the lower bound of the average delay in such a system depending on the intensity of the input arrival rate. The limit value of the intensity of the input arrival rate to which the system operates stably is determined. Shown are the results of simulation with respect to the obtained bound. Practical relevance: the obtained boundary allows us to estimate the lower average delay in the described class of algorithms. Its application allows us to determine the possibility of using the considered class of algorithms from the point of view of limitations on the average delay at the stage of designing random multiple access systems.

A Model of Replication Creation in Distributed Networks

2013 ◽  
Vol 712-715 ◽  
pp. 2556-2559
Author(s):  
Jing Li
Keyword(s):  
Queuing Theory ◽  
Busy Period ◽  
Arrival Rate ◽  
Distributed Networks ◽  
Distributed Data ◽  
Distributed Resources ◽  
Service Period ◽  
Geographically Distributed ◽  
Fast Access ◽  
Statistical Record

Data Grid provides geographically distributed data resources. However, ensuring efficient and fast access to such huge and widely distributed resources is hindered by the high latencies of the Internet. Replication is adopted to address these problems. Aimed to replica creation, a model to decide replica creation opportune moment is introduced, which is based on queuing theory. Through statistical record of the arrival rate of uses, service period, and replicas already created, calculating length of queue, waiting duration time, busy period, service strength and so on, a reasonable creation opportune moment of replica can be obtained.

scholarly journals Resource Bartering in Data Grids

2004 ◽  
Vol 12 (3) ◽  
pp. 155-168 ◽  
Author(s):  
Can Özturan
Keyword(s):  
Integer Programming ◽  
Resource Sharing ◽  
Linear Time ◽  
Time Algorithm ◽  
Mixed Integer ◽  
Distributed Resources ◽  
Multiple Resources ◽  
Directed Hypergraphs ◽  
Computer Centers ◽  
Allocation Decisions

We present models for bartering of resources on grids. Bartering models can be useful for making resource allocation decisions in grids and perhaps even for building a so called barter grid whereby distributed resources such as electronic media can be bartered. Grids allow various resources to be shared among many users. This sharing however definitely does not mean that everyone will have unrestricted use of the resources. Some mechanism such as pricing or quotas can be employed in order to enforce controlled sharing of resources. A barter model for resource sharing can enable people or computer centers to directly get something in return for letting their resources to be used by others. We utilize directed hypergraphs to develop a barter model in which multiple resources can be traded. We prove that the decision version of the multi-resource bartering problem is NP-complete. We present an integer programming formulation for the bartering problem. We also present a linear time algorithm to compute components that may contain feasible bartering solutions. We generalize our multi-resource bartering formulation to the case where multiple instances of resources are present. Finally, we present various computational results from our software that makes use of LP_SOLVE and CPLEX mixed integer programming libraries to solve example bartering problems.

scholarly journals Genetic Hybrid Optimization of a Real Bike Sharing System

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2227
Author(s):  
Gonzalo A. Aranda-Corral ◽  
Miguel A. Rodríguez ◽  
Iñaki Fernández de Viana ◽  
María Isabel G. Arenas
Keyword(s):  
User Satisfaction ◽  
Resource Sharing ◽  
Local Context ◽  
Distributed Resources ◽  
The Past ◽  
Bike Sharing ◽  
System Overhead ◽  
Geographically Distributed ◽  
The Cost ◽  
Determine System

In recent years there has been a growing interest in resource sharing systems as one of the possible ways to support sustainability. The use of resource pools, where people can drop a resource to be used by others in a local context, is highly dependent on the distribution of those resources on a map or graph. The optimization of these systems is an NP-Hard problem given its combinatorial nature and the inherent computational load required to simulate the use of a system. Furthermore, it is difficult to determine system overhead or unused resources without building the real system and test it in real conditions. Nevertheless, algorithms based on a candidate solution allow measuring hypothetical situations without the inconvenience of a physical implementation. In particular, this work focuses on obtaining the past usage of bike loan network infrastructures to optimize the station’s capacity distribution. Bike sharing systems are a good model for resource sharing systems since they contain common characteristics, such as capacity, distance, and temporary restrictions, which are present in most geographically distributed resources systems. To achieve this target, we propose a new approach based on evolutionary algorithms whose evaluation function will consider the cost of non-used bike places as well as the additional kilometers users would have to travel in the new distribution. To estimate its value, we will consider the geographical proximity and the trend in the areas to infer the behavior of users. This approach, which improves user satisfaction considering the past usage of the former infrastructure, as far as we know, has not been applied to this type of problem and can be generalized to other resource sharing problems with usage data.

Light-cured dental composites characterization by Electron Microscopy

1990 ◽  
Vol 48 (4) ◽  
pp. 428-429
Author(s):  
B. M. Culbertson ◽  
M. L. Devinev ◽  
E. C. Kao
Keyword(s):  
Electron Microscopy ◽  
Mechanical Analysis ◽  
Service Performance ◽  
Dental Composite ◽  
Dental Composites ◽  
Neat Resin ◽  
Scanning Calorimetry ◽  
Research Meeting ◽  
Formulation Variables

The service performance of current dental composite materials, such as anterior and posterior restoratives and/or veneer cements, needs to be improved. As part of a comprehensive effort to find ways to improve such materials, we have launched a broad spectrum study of the physicochemical and mechanical properties of photopolymerizable or visible light cured (VLC) dental composites. The commercially available VLC materials being studied are shown in Table 1. A generic or neat resin VLC system is also being characterized by SEM and TEM, to more fully understand formulation variables and their effects on properties.At a recent dental research meeting, we reported on the differential scanning calorimetry (DSC) and dynamic mechanical analysis (DMA) characterization of the materials in Table 1. It was shown by DSC and DMA that the materials are substantially undercured by commonly used VLC techniques. Post curing in an oral cavity or a dry environment at 37 to 50°C for 7 or more hours substantially enhances the cure of the materials.

Sign in / Sign up

Export Citation Format

Share Document