Distributed Load Control in Multiphase Radial Networks

The current power grid is on the cusp of modernization due to the emergence of distributed generation and controllable loads, as well as renewable energy. On one hand, distributed and renewable generation is volatile and difficult to dispatch. On the other hand, controllable loads provide significant potential for compensating for the uncertainties. In a future grid where there are thousands or millions of controllable loads and a large portion of the generation comes from volatile sources like wind and solar, distributed control that shifts or reduces the power consumption of electric loads in a reliable and economic way would be highly valuable.

Load control needs to be conducted with network awareness. Otherwise, voltage violations and overloading of circuit devices are likely. To model these effects, network power flows and voltages have to be considered explicitly. However, the physical laws that determine power flows and voltages are nonlinear. Furthermore, while distributed generation and controllable loads are mostly located in distribution networks that are multiphase and radial, most of the power flow studies focus on single-phase networks.

This thesis focuses on distributed load control in multiphase radial distribution networks. In particular, we first study distributed load control without considering network constraints, and then consider network-aware distributed load control.

Distributed implementation of load control is the main challenge if network constraints can be ignored. In this case, we first ignore the uncertainties in renewable generation and load arrivals, and propose a distributed load control algorithm, Algorithm 1, that optimally schedules the deferrable loads to shape the net electricity demand. Deferrable loads refer to loads whose total energy consumption is fixed, but energy usage can be shifted over time in response to network conditions. Algorithm 1 is a distributed gradient decent algorithm, and empirically converges to optimal deferrable load schedules within 15 iterations.

We then extend Algorithm 1 to a real-time setup where deferrable loads arrive over time, and only imprecise predictions about future renewable generation and load are available at the time of decision making. The real-time algorithm Algorithm 2 is based on model-predictive control: Algorithm 2 uses updated predictions on renewable generation as the true values, and computes a pseudo load to simulate future deferrable load. The pseudo load consumes 0 power at the current time step, and its total energy consumption equals the expectation of future deferrable load total energy request.

Network constraints, e.g., transformer loading constraints and voltage regulation constraints, bring significant challenge to the load control problem since power flows and voltages are governed by nonlinear physical laws. Remarkably, distribution networks are usually multiphase and radial. Two approaches are explored to overcome this challenge: one based on convex relaxation and the other that seeks a locally optimal load schedule.

To explore the convex relaxation approach, a novel but equivalent power flow model, the branch flow model, is developed, and a semidefinite programming relaxation, called BFM-SDP, is obtained using the branch flow model. BFM-SDP is mathematically equivalent to a standard convex relaxation proposed in the literature, but numerically is much more stable. Empirical studies show that BFM-SDP is numerically exact for the IEEE 13-, 34-, 37-, 123-bus networks and a real-world 2065-bus network, while the standard convex relaxation is numerically exact for only two of these networks.

Theoretical guarantees on the exactness of convex relaxations are provided for two types of networks: single-phase radial alternative-current (AC) networks, and single-phase mesh direct-current (DC) networks. In particular, for single-phase radial AC networks, we prove that a second-order cone program (SOCP) relaxation is exact if voltage upper bounds are not binding; we also modify the optimal load control problem so that its SOCP relaxation is always exact. For single-phase mesh DC networks, we prove that an SOCP relaxation is exact if 1) voltage upper bounds are not binding, or 2) voltage upper bounds are uniform and power injection lower bounds are strictly negative; we also modify the optimal load control problem so that its SOCP relaxation is always exact.

To seek a locally optimal load schedule, a distributed gradient-decent algorithm, Algorithm 9, is proposed. The suboptimality gap of the algorithm is rigorously characterized and close to 0 for practical networks. Furthermore, unlike the convex relaxation approach, Algorithm 9 ensures a feasible solution. The gradients used in Algorithm 9 are estimated based on a linear approximation of the power flow, which is derived with the following assumptions: 1) line losses are negligible; and 2) voltages are reasonably balanced. Both assumptions are satisfied in practical distribution networks. Empirical results show that Algorithm 9 obtains 70+ times speed up over the convex relaxation approach, at the cost of a suboptimality within numerical precision.

Distribution and swarming of mysids in the nearshore waters off Bombay

Distribution and abundance of mysids were studied in the nearshore waters off Bombay along 3 transects located off Versova, off Mahim and Thana creek covering eleven stations during November 1979 to December 1980. Maximum population of mysids was recorded during the premonsoon period. Density of mysids was more in Versova than at Mahim and Thana transects. Tidal variation and pollution load influenced the distribution of mysids. Swarming of Mesopodopsis zeylanica was observed in Versova creek during April 1980.

Fracture Properties of LPCVD Silicon Nitride and Thermally Grown Silicon Oxide Thin Films From the Load-Deflection of Long Si3N4 and SiO2/Si3N4 Diaphragms

The bulge test is successfully extended to the determination of the fracture properties of silicon nitride and oxide thin films. This is achieved by using long diaphragms made of silicon nitride single layers and oxide/nitride bilayers, and applying comprehensive mechanical model that describes the mechanical response of the diaphragms under uniform differential pressure. The model is valid for thin films with arbitrary z-dependent plane-strain modulus and prestress, where z denotes the coordinate perpendicular to the diaphragm. It takes into account the bending rigidity and stretching stiffness of the layered materials and the compliance of the supporting edges. This enables the accurate computation of the load-deflection response and stress distribution throughout the composite diaphragm as a function of the load, in particular at the critical pressure leading to the fracture of the diaphragms. The method is applied to diaphragms made of single layers of 300-nm-thick silicon nitride deposited by low-pressure chemical vapor deposition and composite diaphragms of silicon nitride grown on top of thermal silicon oxide films produced by wet thermal oxidation at 950 degrees C and 1050 degrees C with target thicknesses of 500, 750, and 1000 mn. All films characterized have an amorphous structure. Plane-strain moduli E-ps and prestress levels sigma(0) of 304.8 +/- 12.2 GPa and 1132.3 +/- 34.4 MPa, respectively, are extracted for Si3N4, whereas E-ps = 49.1 +/- 7.4 GPa and sigma(0) = -258.6 +/- 23.1 MPa are obtained for SiO2 films. The fracture data are analyzed using the standardized form of the Weibull distribution. The Si3N4 films present relatively high values of maximum stress at fracture and Weibull moduli, i.e., sigma(max) = 7.89 +/- 0.23 GPa and m = 50.0 +/- 3.6, respectively, when compared to the thermal oxides (sigma(max) = 0.89 +/- 0.07 GPa and m = 12.1 +/- 0.5 for 507-nm-thick 950 degrees C layers). A marginal decrease of sigma(max) with thickness is observed for SiO2, with no significant differences between the films grown at 950 degrees C and 1050 degrees C. Weibull moduli of oxide thin films are found to lie between 4.5 +/- 1.2 and 19.8 +/- 4.2, depending on the oxidation temperature and film thickness.

Relationship between load/unload response ratio and damage variable and its application

The physics-based parameter: load/unload response ratio (LURR) was proposed to measure the proximity of a strong earthquake, which achieved good results in earthquake prediction. As LURR can be used to describe the damage degree of the focal media qualitatively, there must be a relationship between LURR and damage variable (D) which describes damaged materials quantitatively in damage mechanics. Hence, based on damage mechanics and LURR theory, taking Weibull distribution as the probability distribution function, the relationship between LURR and D is set up and analyzed. This relationship directs LURR applied in damage analysis of materials quantitatively from being qualitative earlier, which not only provides the LURR method with a more solid basis in physics, but may also give a new approach to the damage evaluation of big scale structures and prediction of engineering catastrophic failure. Copyright (c) 2009 John Wiley & Sons, Ltd.

Relationship between load/unload response ratio and damage variable and its application

The physics-based parameter: load/unload response ratio (LURR) was proposed to measure the proximity of a strong earthquake, which achieved good results in earthquake prediction. As LURR can be used to describe the damage degree of the focal media qualitatively, there must be a relationship between LURR and damage variable (D) which describes damaged materials quantitatively in damage mechanics. Hence, based on damage mechanics and LURR theory, taking Weibull distribution as the probability distribution function, the relationship between LURR and D is set up and analyzed. This relationship directs LURR applied in damage analysis of materials quantitatively from being qualitative earlier, which not only provides the LURR method with a more solid basis in physics, but may also give a new approach to the damage evaluation of big scale structures and prediction of engineering catastrophic failure. Copyright (c) 2009 John Wiley & Sons, Ltd.

Preliminary study of the dynamic origin of the distribution pattern of bottom sediments on the continental shelves of the Bohai Sea, Yellow Sea and East China Sea

The bottom sediment types in the Bohai Sea, Yellow Sea and East China Sea (BYECS) are diversified, and their distribution pattern is very complicated. However, the bottom sediment types can be simplified to be sandy sediment, clayey sediment and mixed sediment, which comprise the complicated distribution pattern of bottom sediment in the BYECS. The continental shelves of the BYECS are broad, with shallow water depths and tidal currents which are permanent and dominate the marine dynamics in the BYECS. Based on numerical simulation of tidal elevations and currents in the BYECS, the rates of suspended load transport and bed load transport during a single tidal cycle for sediments of eight different grain size ranges are calculated. The results show that any sediment, whose threshold velocity is less than that of tidal current, has the same transport trend. Suspended load transport rare, bed load transport rate, and the ratio of the former to the latter decrease with grain size becoming coarser and coarser. The erosion/accretion patterns of sediments with different grain sizes are determined by the sediment transport rate divergences, and the results show that the patterns are the same for sediments with different grain sizes. Three main bottom sediment types, i.e. sandy sediment mainly composed of fine sand, clayey sediment mainly composed of silty clay, and mixed sediment mainly composed of fine sand, silt, and clay, are obtained by computation. The three bottom sediment types and their distribution pattern are consistent not only with sediment transport field and the sea bed erosion/accretion pattern obtained by simulation, but also with field data of bottom sediment types and divisions. In the BYECS, sand ridges form mainly in the areas with strong rectilinear tidal currents, sand sheets form mainly in the areas dominated by strong rotatory tidal currents, and clayey sediments, i.e. mud patches, form mainly in the areas with weak tidal currents. Hence, not only the sandy sediments but also the clayey sediments in the BYECS are formed under the control of the whole tidal current field of the BYECS. The three main bottom sediment types are not isolated respectively-in fact, they constitute a whole tidal depositional system. Under the condition with no cyclonic cold eddy, the clayey sediments in the BYECS can form in weak tidal current environments. Therefore, a cold eddy is not necessary for the deposition of clayey sediments in the BYECS. (C) 2000 Academic Press.

Load Profiling for Efficient Route Selection in Multi-Class Networks

High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow applications to reserve the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these bandwidth-reservation algorithms assign VCs to routes using the least-loaded concept, and thus result in balancing the load over the set of all candidate routes. In this paper, we show that for such reservation-based protocols|which allow for the exclusive use of a preset fraction of a resource's bandwidth for an extended period of time-load balancing is not desirable as it results in resource fragmentation, which adversely affects the likelihood of accepting new reservations. In particular, we show that load-balancing VC routing algorithms are not appropriate when the main objective of the routing protocol is to increase the probability of finding routes that satisfy incoming VC requests, as opposed to equalizing the bandwidth utilization along the various routes. We present an on-line VC routing scheme that is based on the concept of "load profiling", which allows a distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. We show the effectiveness of our load-profiling approach when compared to traditional load-balancing and load-packing VC routing schemes.

Evaluation of a Load Profiling Approach to Routing Guaranteed Bandwidth Flows

To support the diverse Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) established on one of several candidate routes have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus results in balancing the load across the set of candidate routes. In a recent study, we have established the inadequacy of this load balancing practice and proposed the use of load profiling as an alternative. Load profiling techniques allow the distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. In this paper we thoroughly characterize the performance of VC routing using load profiling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations of multi-class traffic routing in Virtual Path (VP) based networks. Our findings confirm that for routing guaranteed bandwidth flows in VP networks, load balancing is not desirable as it results in VP bandwidth fragmentation, which adversely affects the likelihood of accepting new VC requests. This fragmentation is more pronounced when the granularity of VC requests is large. Typically, this occurs when a common VC is established to carry the aggregate traffic flow of many high-bandwidth real-time sources. For VP-based networks, our simulation results show that our load-profiling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewed and uniform workloads. Furthermore, load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth connections.

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

An Infrastructure for the Dynamic Distribution of Web Applications and Services

This paper presents the design and implementation of an infrastructure that enables any Web application, regardless of its current state, to be stopped and uninstalled from a particular server, transferred to a new server, then installed, loaded, and resumed, with all these events occurring "on the fly" and totally transparent to clients. Such functionalities allow entire applications to fluidly move from server to server, reducing the overhead required to administer the system, and increasing its performance in a number of ways: (1) Dynamic replication of new instances of applications to several servers to raise throughput for scalability purposes, (2) Moving applications to servers to achieve load balancing or other resource management goals, (3) Caching entire applications on servers located closer to clients.

Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM

We present a dynamic distributed load balancing algorithm for parallel, adaptive Finite Element simulations in which we use preconditioned Conjugate Gradient solvers based on domain-decomposition. The load balancing is designed to maintain good partition aspect ratio and we show that cut size is not always the appropriate measure in load balancing. Furthermore, we attempt to answer the question why the aspect ratio of partitions plays an important role for certain solvers. We define and rate different kinds of aspect ratio and present a new center-based partitioning method of calculating the initial distribution which implicitly optimizes this measure. During the adaptive simulation, the load balancer calculates a balancing flow using different versions of the diffusion algorithm and a variant of breadth first search. Elements to be migrated are chosen according to a cost function aiming at the optimization of subdomain shapes. Experimental results for Bramble's preconditioner and comparisons to state-of-the-art load balancers show the benefits of the construction.

Load sharing in cluster service provision

The factors that are driving the development and use of grids and grid computing, such as size, dynamic features, distribution and heterogeneity, are also pushing to the forefront service quality issues. These include performance, reliability and security. Although grid middleware can address some of these issues on a wider scale, it has also become imperative to ensure adequate service provision at local level. Load sharing in clusters can contribute to the provision of a high quality service, by exploiting both static and dynamic information. This paper is concerned with the presentation of a load sharing scheme, that can satisfy grid computing requirements. It follows a proactive, non preemptive and distributed approach. Load information is gathered continuously before it is needed, and a task is allocated to the most appropriate node for execution. Performance and reliability are enhanced by the decentralised nature of the scheme and the symmetric roles of the nodes. In addition, the scheme exhibits transparency characteristics that facilitate integration with the grid.

Efficient computation algorithm for calculating load contributions to line flows and losses

In a deregulated power system, it is usually required to determine the shares of each load and generation in line flows, to permit fair allocation of transmission costs between the interested parties. The paper presents a new method of determining the contributions of each load to line flows and losses. The method is based on power-flow topology and has the advantage of being the least computationally demanding of similar methods.

Short, medium and long term load forecasting model and virtual load forecaster based on radial basis neural networks

Artificial neural networks (ANNs) can be easily applied to short-term load forecasting (STLF) models for electric power distribution applications. However, they are not typically used in medium and long term load forecasting (MLTLF) electric power models because of the difficulties associated with collecting and processing the necessary data. Virtual instrument (VI) techniques can be applied to electric power load forecasting but this is rarely reported in the literature. In this paper, we investigate the modelling and design of a VI for short, medium and long term load forecasting using ANNs. Three ANN models were built for STLF of electric power. These networks were trained using historical load data and also considering weather data which is known to have a significant affect of the use of electric power (such as wind speed, precipitation, atmospheric pressure, temperature and humidity). In order to do this a V-shape temperature processing model is proposed. With regards MLTLF, a model was developed using radial basis function neural networks (RBFNN). Results indicate that the forecasting model based on the RBFNN has a high accuracy and stability. Finally, a virtual load forecaster which integrates the VI and the RBFNN is presented.

Scaling in the time-dependent failure of a fiber bundle with local load sharing

We study the scaling behaviors of a time-dependent fiber-bundle model with local load sharing. Upon approaching the complete failure of the bundle, the breaking rate of fibers diverges according to r(t)proportional to(T-f-t)(-xi) where T-f is the lifetime of the bundle and xi approximate to 1.0 is a universal scaling exponent. The average lifetime of the bundle [T-f] scales with the system size as N-delta, where delta depends on the distribution of individual fiber as well as the breakdown rule. [S1063-651X(99)13902-3].