Modular Software Upgrades for Distributed Systems

Ajmani, Sameer; Liskov, Barbara; Shrira, Liuba

doi:10.1007/11785477_26

Cited by 83 publications

(80 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem of upgrading software in a general distributed system is addressed in [22]. The scope of that work differs in that the nodes being updated are general purpose computers, not switches, running general software.…”

Section: Related Workmentioning

confidence: 99%

Abstractions for network update

ReitblattMark

FosterNate

RexfordJennifer

et al. 2012

SIGCOMM Comput. Commun. Rev.

182

230

View full text Add to dashboard Cite

Configuration changes are a common source of instability in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrect behaviors. This paper introduces the notion of consistent network updates-updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations. We identify two distinct consistency levels, per-packet and per-flow, and we present general mechanisms for implementing them in Software-Defined Networks using switch APIs like OpenFlow. We develop a formal model of OpenFlow networks, and prove that consistent updates preserve a large class of properties. We describe our prototype implementation, including several optimizations that reduce the overhead required to perform consistent updates. We present a verification tool that leverages consistent updates to significantly reduce the complexity of checking the correctness of network control software. Finally, we describe the results of some simple experiments demonstrating the effectiveness of these optimizations on example applications.

show abstract

Section: Related Workmentioning

confidence: 99%

Abstractions for network update

ReitblattMark

FosterNate

RexfordJennifer

et al. 2012

SIGCOMM Comput. Commun. Rev.

182

230

View full text Add to dashboard Cite

show abstract

“…Let δ 1 ↑ Su×Su denote the set of transitions in S u × S u that is the image of the set of transitions δ 1 . The set of transitions of the union program (i.e., [4], we rewrite a property as the intersection of a safety property and a liveness property.…”

Section: Preliminariesmentioning

confidence: 99%

“…Moreover, the update program must not violate the closure of I o ↑ S u or I n ↑ S u ; i.e., the update program must not include the set of transitions {(s 0 , s 1 …”

Section: Fault-tolerancementioning

confidence: 99%

“…Stoyle et al [26] introduce a safe transformer for dynamic update of imperative programs. Ajmani et al [1,2] present a middleware to support dynamic updates in distributed systems. All aforementioned approaches focus on updating programs and their components with less emphasis on automated design and dependability of such dynamic updates in the presence of faults.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Designing Run-Time Fault-Tolerance Using Dynamic Updates

Ebnenasir

2007

International Workshop on Software Engineering for Adaptive and Self-Managing Systems (SEAMS '07)

View full text Add to dashboard Cite

show abstract

“…A challenge for software upgrade systems is to balance flexibility, robustness, and user-friendliness. An appropriate upgrade system should propagate upgrades automatically, provide means to control when components are upgraded, and ensure the availability of system services during the upgrade [1,20]. In order to ensure that upgrades are correct and result in foreseen changes, formal models and analysis methods for runtime software evolution are needed.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects

Johnsen

Kyas

2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

Abstract. Many long-lived and distributed systems must remain available yet evolve over time, due to, e.g., bugfixes, feature extensions, or changing user requirements. To facilitate such changes, formal methods can help in modeling and analyzing runtime software evolution. This paper presents an executable object-oriented modeling language which supports runtime software evolution. The language, based on Creol, targets distributed systems by active objects, asynchronous method calls, and futures. A dynamic class construct is proposed in this setting, providing an asynchronous and modular upgrade mechanism. At runtime, class redefinitions gradually upgrade existing instances of a class and of its subclasses. An upgrade may depend on previous upgrades of other classes. For asynchronous runtime upgrades, the static picture may differ from the actual runtime system. An operational semantics and a type and effect system are given for the language. The type analysis of an upgrade infers and collects dependencies on previous upgrades. These dependencies are exploited as runtime constraints to ensure type safety.

show abstract

Modular Software Upgrades for Distributed Systems

Cited by 83 publications

References 17 publications

Abstractions for network update

Abstractions for network update

Designing Run-Time Fault-Tolerance Using Dynamic Updates

Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects

Contact Info

Product

Resources

About