Loading...
conference paper
On Correctness of Dynamic Protocol Update
Wojciechowski, Pawel T.
•
Rütti, Olivier
2005
Lecture Notes in Computer Science
Replacing or adding network protocols at runtime is problematic – it must involve synchronization of the protocol switch with ongoing local and network communication. We define a formal mathematical model of dynamic protocol update (DPU) and use it to define two DPU algorithms. The algorithms are based on fully-synchronized and lazy strategies. The two strategies implement updates with respectively, strong and weak safety properties. Our model allowed us to express the properties and the DPU algorithms clearly and abstractly, aiding algorithm design and correctness proofs.
Type
conference paper
Web of Science ID
WOS:000230459200018
Authors
Wojciechowski, Pawel T.
•
Rütti, Olivier
Publication date
2005
Published in
Lecture Notes in Computer Science
Volume
3535
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Athens, Greece | June 15-17, 2005 | |
Available on Infoscience
August 9, 2005
Use this identifier to reference this record