liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Disconnected Discoveries: Availability Studies in Partitioned Networks
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1916-3398
2011 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

This thesis is concerned with exploring methods for making computing systems more resilient to problems in the network communication, both in the setting of existing infrastructure but also in the case where no infrastructure is available. Specifically, we target a situation called network partitions which means that a computer or device network is split in two or more parts that cannot communicate with each other.

The first of the two tracks in the thesis is concerned with upholding system availability during a network partition even when there are integrity constraints on data. This means that the system will optimistically accept requests since it is impossible to coordinate nodes that have no means of communicating during finite intervals; thus requiring a reconciliation process to take place once the network is healed.

We provide several different algorithms for reconciling divergent states of the nodes, one of which is able to allow the system to continue accepting operations during the reconciliation phase as opposed to having to stop all invocations.  The algorithms are evaluated analytically, proving correctness and the conditions for termination.  The performance of the algorithms has been analysed using simulations and as a middleware plugin in an emulated setting.

The second track considers more extreme conditions where the network is partitioned by its nature. The nodes move around in an area and opportunistically exchange messages with nodes that they meet. This as a model of the situation in a disaster area where the telecommunication networks are disabled. This scenario poses a number of challenges where protocols need to be both partition-tolerant and energy-efficient to handle node mobility, while still providing good delivery and latency properties.

We analyse worst-case latency for message dissemination in such intermittently connected networks. Since the analysis is highly dependent on the mobility of the nodes, we provide a model for characterising connectivity of dynamic networks. This model captures in an abstract way how fast a protocol can spread a message in such a setting. We show how this model can be derived analytically as well as from actual trace files.

Finally, we introduce a manycast protocol suited for disaster area networks. This protocol has been evaluated using simulations which shows that it provides very good performance under the circumstances, and it has been implemented as a proof-of-concept on real hardware.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2011. , 227 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1354
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-60553ISBN: 978-91-7393-278-3 (print)OAI: oai:DiVA.org:liu-60553DiVA: diva2:372707
Public defence
2011-01-14, Visionen, Hus B, Campus Valla, Linköping University, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2010-12-02 Created: 2010-10-19 Last updated: 2017-03-28Bibliographically approved

Open Access in DiVA

Disconnected Discoveries: Availability Studies in Partitioned Networks(1954 kB)1561 downloads
File information
File name FULLTEXT01.pdfFile size 1954 kBChecksum SHA-512
24e87529190b0fd707e5459902dab214e12af327c073bf9dfc7e090bea6a33c5f5998d5f5d85e4f3cb5226b68c0143803aa6bf5c210d30708ed307243b55db34
Type fulltextMimetype application/pdf
Cover(41 kB)123 downloads
File information
File name COVER01.pdfFile size 41 kBChecksum SHA-512
e18da4ebcf5de038e75913be8d96c61161c57236b35f93f6a92c2a72441fa340ad55341ca589ee0ad5eac833b4b45c20c7403ea15b69ace4a747c971199af7dd
Type coverMimetype application/pdf

Authority records BETA

Asplund, Mikael

Search in DiVA

By author/editor
Asplund, Mikael
By organisation
RTSLAB - Real-Time Systems LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 1561 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 3713 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf