Conditions Of Load Balancing Research Articles

Research on multimedia and interactive teaching model of college English

How to improve the quality of teaching effectively and effectively is a current research hotspot. This paper constructs a 'multi-interactive' English teaching model from the aspects of teaching content and teaching strategies to improve English teaching. The proposed method extracts and retrieves information from multiple teaching resources, optimises and controls the allocation of resources under load balancing conditions, and builds a data mining model technology for college English teaching resources in an information environment. The proposed method can maximise the enthusiasm and creativity of teachers and students, and can develop multimedia network resources, create a 'multiple interactive' teaching environment, and create a learning platform for students in universities.

Implementation of Solar Photovoltaic Grid Interfaced System Using Improved Second Order Generalised Integrator Quadrature (ISOGI-Q) Algorithm

This article deals with a single-stage solar photo voltaic (SPV) array tied toward a three-phase grid by means of an improved second-order generalised integrator quadrature (ISOGI-Q)-based control algorithm to develop the power quality of the grid. The maximum point power tracking (MPPT) is achieved by using a perturb and observe method (P&O). P&O MPPT technique is efficient to extract additional power commencing an SPV array and easy. The SOGI-Q based control serves multi functionalities for example load balancing, power factor correction as well as enhanced solar power penetration addicted to a distribution network. Investigation consequences of the SOGI-Q-based control algorithm are found to be adequate in favour of enhanced power quality in conditions of load balancing, harmonics elimination with very effective power factor correction under different dynamic conditions for instance load unbalancing, variable solar insolation, distorted grid along with imbalanced grid voltage conditions. Distributed static compensator capabilities of a SPV-based system are functional to supply the active power to the load as well as surplus power to the grid.

FLOW-BASED ROUTING MODEL WITH LOAD BALANCING UNDER NETWORK SECURITY PARAMETERS

Background. In modern telecommunication networks, the functioning of network protocols is aimed at achieving a high level of Quality of Service and network security. Therefore, an urgent scientific and applied problem is the adaptation of routing solutions with load balancing to the requirements of network security. The novelty of the proposed model is the modification of the load balancing conditions, in which, in addition to the link bandwidth (Quality of Service indicator), the probability of its compromise (network security indicator) is also taken into account. The routing solutions obtained within the framework of the proposed model are aimed at reducing the overload of network links that have a high probability of compromise by switching traffic to more secure links.Objective. Developing the flow-based routing model with load balancing, which takes into account the parameters of network security.Methods. Analysis of all known publications on load balancing and network security. Synthesis of a load balancing flowbased routing model. Study of the influence of network security parameters of communication links on routing and load balancing processes.Results. A new condition for load balancing is proposed, which is a modification of the existing Traffic Engineering solution based on accounting the network security parameters - the probabilities of compromising communication links.Conclusions. In routing with load balancing, parameters of network security should be considered. Depending on the network state and user requirements, different models of network security parameters for load balancing processes can be used.

Flow-based Routing Model with Load Balancing on the Traffic Engineering Principles Taking into Account the Information Security Risks

A practical approach to load balancing in a telecommunication network (TCN) is implementing Traffic Engineering (TE) technology principles to reduce link utilization and improve QoS level. In order to adapt TE solutions with network security requirements, this paper proposes a mathematical model for secure routing, which belongs to the class of flow-based optimization solutions. The model is based on the conditions of multi-flow routing implementation, flow conservation, and TCN link overload prevention. Due to this, the problem of secure routing is formulated in an optimization form. The model’s novelty is the modified conditions of load balancing in TCN. Along with the indicators of link capacity with the help of weighting coefficients, the network security (NS) indicators of TCN elements are also taken into account. The network security (NS) indicators in the TCN modeling process include information security risks of routers and communication links, losses from breach of confidentiality and integrity of information, probability of existing vulnerabilities exploitation, etc. The study confirmed the effectiveness of the proposed solution. On the test TCN topology, it is demonstrated that the use of a secure routing model allows to calculate the routes and provide such an order of load balancing, which compromises meeting the requirements of both QoS and NS. In the routing process, information security risk reduction in packet transmission by about 11.3% was accompanied by an increase (on average by 26%) in the upper bound of the network link utilization

Network-Coded Cooperative Systems With Generalized User-Relay Selection

We consider a network-coded cooperative (NCC) system that consists of N ≥ 2 sources, M ≥ 1 decode- and-forward (DF) relays, and a single destination. The relays perform network coding (NC) on the received sources' symbols using maximum distance separable (MDS) codes. For this system, we propose the most generalized user-relay selection (GURS) scheme in the literature that selects any arbitrary subsets of K users and any arbitrary subsets of L relays subject to practical constraints such as load balancing conditions and scheduling policy. Our analytical results and design guidelines generalize and subsume all existing results as special cases. To this end, we derive a new closed-form outage probability (OP) expression, assuming non-identically and independently distributed (n.i.i.d.) Rayleigh fading channels. The asymptotic outage expression at high signal-to-noise ratio (SNR) regime is further derived, based on which, the achievable diversity order and coding gain are quantified. The theoretical derivations are also validated through Monte-Carlo simulation.

Deploying Data-intensive Applications with Multiple Services Components on Edge

In the information age, the amount of data is huge which shows an exponential growth. In addition, most services of application need to be interdependent with data, cause that they can be executed under the driven data. In fact, such a data-intensive service deployment requires a good coordination among different edge servers. It is not easy to handle such issues while data transmission and load balancing conditions change constantly between edge servers and data-intensive services. Based on the above description, this paper proposes a Data-intensive Service Edge deployment scheme based on Genetic Algorithm (DSEGA). Firstly, a data-intensive edge service composition and an edge server model will be generated based on a graph theory algorithm, then five algorithms of Genetic Algorithm (GA), Simulated Annealing Algorithm (SA), Ant Colony Algorithm (ACO), Optimized Ant Colony Algorithm (ACO_v) and Hill Climbing will be respectively used to obtain an optimal deployment scheme, so that the response time of the data-intensive edge service deployment reaches a minimum under storage constraints and load balancing conditions. The experimental results show that the DSEGA algorithm can get the shortest response time among the service, data components and edge servers.

Advanced Pre-fetching Based Dynamic Data Replication under Small World Network Model

The database replication keeps up contents of database such as tables, in various geographical locations that fabricate an arrangement of distributed database. The necessities of database replication are expanding with the time as the use of internet is also increasing. With the purpose of meeting these prerequisites, priorities among requests can be included. In this work two types of priorities i.e., low and high priority is considered in this research article. It is noticeable that the high priority requests are more vital in comparison to low priority requests and therefore low priority requests can be delayed or dropped. The rate of request loss can be lessened utilizing the conditions of load balancing where a portion of the contending requests are transferred to other nodes. In this paper, internet is modelled as small world network, and performance assessment of A-PDDRA (Advanced Pre-bringing Based Dynamic Data Replication Algorithm) is carried out on small world network while considering both priorities and load balancing using computer simulation.

Flexibility-enabled lead-time reduction in flexible systems

This paper presents the results of a conceptual study and simulation experimentation aimed at understanding the underlying mechanisms of sequencing flexibility-enabled manufacturing lead-time reduction. In spite of a large body of literature on flexibility, the exact mechanism that enables flexibility to reduce the lead time is not fully understood. As a part of our research efforts on the proactive application of flexibility for the performance enhancement of manufacturing systems, we are motivated to study how flexibility can be employed in a proactive manner to reduce the manufacturing lead time and to develop an understanding of the underlying mechanisms. Towards this end, we have developed simulation models of simple flexible manufacturing systems and studied the effect of sequencing flexibility on the lead-time performance under different conditions of part load and machine load balancing. The studies indicated that sequencing flexibility has a significant effect on the lead-time performance of the manufacturing system, and the effect of flexibility varies under different conditions of load balancing. Further studies indicate the existence of complex interactions between the sequencing flexibility, process concurrency, processor load balancing, and manufacturing lead time. This paper intends to discuss some of the interesting results of these studies with a focus on the inherent mechanisms of sequencing flexibility-enabled lead-time reduction.