Topic
Dynamic Extension
About: Dynamic Extension is a research topic. Over the lifetime, 213 publications have been published within this topic receiving 2873 citations.
Papers published on a yearly basis
Papers
TL;DR: It is proved that under the site model, dynamic-linear has greater availability than any static algorithm, including weighted voting, if there are four or more sites in the network.
Abstract: There are several replica control algorithms for managing replicated files in the face of network partitioning due to site or communication link failures. Pessimistic algorithms ensure consistency at the price of reduced availability; they permit at most one (distinguished) partition to process updates at any given time. The best known pessimistic algorithm, voting, is a “static” algorithm, meaning that all potential distinguished partitions can be listed in advance. We present a dynamic extension of voting called dynamic voting. This algorithm permits updates in a partition provided it contains more than half of the up-to-date copies of the replicated file. We also present an extension of dynamic voting called dynamic voting with linearly ordered copies (abbreviated as dynamic-linear). These algorithms are dynamic because the order in which past distinguished partitions were created plays a role in the selection of the next distinguished partition. Our algorithms have all the virtues of ordinary voting, including its simplicity, and provide improved availability as well. We provide two stochastic models to support the latter claim. In the first (site) model, sites may fail but communication links are infallible; in the second (link) model the reverse is true. We prove that under the site model, dynamic-linear has greater availability than any static algorithm, including weighted voting, if there are four or more sites in the network. In the link model, we consider all biconnected five-site networks and a wide variety of failure and repair rates. In all cases considered, dynamic-linear had greater availability than any static algorithm.
249 citations
TL;DR: An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium.
Abstract: An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium. Optimality conditions are derived using the Pontryagin minimum principle and given economic interpretations, which are generalizations of similar results previously reported for single-destination networks. Analyses of sufficient conditions for optimality and of singular controls are also given. Under the steady-state assumptions, the model is shown to be a proper dynamic extension of Beckmann's mathematical programming problem for a static user equilibrium traffic assignment.
110 citations
TL;DR: In this article, a nonlinear dynamic extension for the plant is introduced, which renders the closed-loop system semi-globally asymptotically stable, hence, it is possible to enlarge the domain of attraction and to maintain the control inputs bounded.
105 citations
Patent•
2 Mar 2005
TL;DR: In this article, a mobile device having a framework comprising a logical device management tree (903), a device management engine (905), and a plurality of application specific logical devices management sub-trees (907, 909) is logically connected to the logical device tree.
Abstract: A mobile device having a framework (901) comprising a logical device management tree (903), a device management engine (905), and a plurality of application specific logical device management sub-trees (907, 909) logically connected to the logical device management tree.
100 citations
1 Jan 1999
TL;DR: This study transforms CTM in its entirety to a set of mixed-integer constraints, which opens up CTM to a wide range of dynamic traffic optimization problems, such as the DUO formulation and dynamic signal control.
Abstract: An analytical dynamic traffic assignment (DTA) formulation is developed based on a dynamic extension of Wardrop's Principle. It is referred to as dynamic user optimal (DUO). A gap function for the corresponding nonlinear complementarity problem is developed and it is proven that minimizing the gap function produces a solution that fulfills the ideal DUO conditions. Existing analytical DTA formulations mostly use macroscopic link travel time functions to model traffic. In general, it is difficult for such functions to capture traffic interactions across multiple links such as queue spill-backs and dynamic traffic phenomena such as shock waves. Instead, traffic in this formulation is modeled after the Cell Transmission Model (CTM), which provides a convergent approximation to the Lighthill and Whitham and Richards (LWR) model and covers the full range of the fundamental diagram. This study transforms CTM in its entirety to a set of mixed-integer constraints. The significance of this is that it opens up CTM to a wide range of dynamic traffic optimization problems, such as the DUO formulation and dynamic signal control.
90 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2022 | 1 |
| 2021 | 5 |
| 2020 | 9 |
| 2019 | 6 |
| 2018 | 12 |
| 2017 | 7 |