This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring i) wye connections; ii) ungrounded delta connections; iii) a combination of wye-connected and delta-connected sources/loads; and iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for the nonsingularity of the load-flow Jacobian is proposed. Finally, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.
30 June 2017 in IEEE Transactions on Automatic Control
The recent literature discusses the use of the relaxed Second Order Cone Programming for formulating Optimal Power Flow (OPF) for radial grids. However, if the shunt parameters of the lines are considered, the methods do not provide sufficient conditions that can be verified ex ante for the exactness of the optimal solutions. The same formulations also have not correctly accounted for the lines' ampacity constraint. Similar to the inclusion of upper voltage-magnitude limit, the SOCP relaxation faces difficulties when the ampacity constraints of the lines are binding. To overcome these limitations, we propose a convex formulation for the OPF in radial grids, for which the AC-OPF equations, including the transverse parameters, are considered. To limit the lines' current together with the nodal voltage-magnitudes, we augment the formulation with a new set of more conservative constraints. Sufficient conditions are provided to ensure the feasibility and optimality of the proposed OPF solution. The proofs of the exactness of the SOCP relaxation are provided. Using standard grids, we show that these conditions are mild and hold for real distribution networks.
1 November 2018 in IEEE/ACM Transactions on Networking
We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang's max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new exact equivalence between min-plus and max-plus formulations of traffic regulation. We show the existence and a max-plus representation of per-flow minimal regulators, which extends the concepts of packetized greedy shapers and minimal g-regulators. We show that any minimal regulator, placed after any arbitrary system that is FIFO for the flow of interest, does not increase the worst-case delay of the flow. We extend the theory to interleaved regulation and introduce the concept of minimal interleaved regulator. It generalizes the urgency-based shaper that was recently proposed by Specht and Samii as a simpler alternative to per-flow regulators in deterministic networks with aggregate scheduling. With this regulator, packets of multiple flows are processed in one FIFO queue and only the packet at the head of the queue is examined against the regulation constraints of its flow. We show that any minimal interleaved regulator, placed after any arbitrary FIFO system does not increase the worst-case delay of the combination.
23 January 2020 in IEEE Transactions on Instrumentation and Measurement
We present a new approach for estimating the parameters of three-phase untransposed electrically short transmission lines using voltage/current synchrophasor measurements obtained from phasor measurement units (PMUs). The parameters to be estimated are the entries of the longitudinal impedance matrix and the shunt admittance matrix at the rated system frequency. Conventional approaches relying on the admittance matrix of the line cannot accurately estimate these parameters for short lines, due to their high sensitivity to measurement noise. Our approach differs from conventional ones in the following ways. First, we model the line by the three-phase transmittance matrix that is observed to be less sensitive to measurement noise than the admittance matrix. Second, we compute an accurate noise covariance matrix using the realistic specifications of noise introduced by instrument transformers and PMUs. This noise covariance matrix is then used in least-squares-based estimation methods. Third, we derive different least-squares-based estimation methods based on a statistical model of estimation and show that the weighted least-squares and the maximum likelihood methods, which make use of the noise covariance matrix, produce the best estimates of the line parameters. Finally, we apply the proposed methods to a real data set and show that our approach significantly outperforms existing ones.
20 June 2022 in IEEE/ACM Transactions on Networking
Packet replication and elimination functions are used by time-sensitive networks (as in the context of IEEE TSN and IETF DetNet) to increase the reliability of the network. Packets are replicated onto redundant paths by a replication function. Later the paths merge again and an elimination function removes the duplicates. This redundancy scheme has an effect on the timing behavior of time-sensitive networks and many challenges arise from conducting timing analyses. The replication can induce a burstiness increase along the paths of replicates, as well as packet mis-ordering that could increase the delays in the crossed bridges or routers. The induced packet mis-ordering could also negatively affect the interactions between the redundancy and scheduling mechanisms such as traffic regulators (as with per-flow regulator and interleaved regulator, implemented by TSN asynchronous traffic shaping). Using the network calculus framework, we provide a method of worst-case timing analysis for time-sensitive networks that implement redundancy mechanisms in the general use case, i.e., at end-devices and/or intermediate nodes. We first provide a network calculus toolbox for bounding the burstiness increase and the amount of reordering caused by the elimination function of duplicate packets. We then analyze the interactions with traffic regulators and show that their shaping-for-free property does not hold when placed after a packet elimination function. We provide a bound for the delay penalty when using per-flow regulators and prove that the penalty is not bounded with interleaved regulators. Finally, we use an industrial use-case to show the applicability and the benefits of our findings.
13 July 2012 in IEEE Transactions on Information Theory
Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. This decoupling assumption results from mean field convergence and is generally true in transient regime in the asymptotic sense (when the number of wireless nodes tends to infinity), but, contrary to widespread belief, may not necessarily hold in stationary regime. The issue is often related with the existence and uniqueness of a solution to a fixed point equation; however, it was also recently shown that this condition is not sufficient; in contrast, a sufficient condition is a global stability property of the associated ordinary differential equation. In this paper, we give a simple condition that establishes the asymptotic validity of the decoupling assumption for the homogeneous case (all nodes have the same parameters). We also discuss the heterogeneous and the differentiated service cases and formulate a new ordinary differential equation. We show that the uniqueness of a solution to the associated fixed point equation is not sufficient; we exhibit one case where the fixed point equation has a unique solution but the decoupling assumption is not valid in the asymptotic sense in stationary regime.