Blocking reduction for distributed transaction processing within MANETs

  • Authors:

  • Sebastian Obermeier;Stefan Böttcher;Martin Hett;Panos K. Chrysanthis;George Samaras

  • Affiliations:

  • University of Paderborn, Paderborn, Germany 33102;University of Paderborn, Paderborn, Germany 33102;University of Paderborn, Paderborn, Germany 33102;University of Pittsburgh, Pittsburgh, USA 15260;University of Cyprus, Nicosia, Cyprus 1678

  • Venue:
  • Distributed and Parallel Databases
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Atomic commit protocols for distributed transactions in mobile ad-hoc networks have to consider message delays and network failures. We consider ad-hoc network scenarios, in which participants hold embedded databases and offer services to other participants. Services that are composed of several other services can access and manipulate data of physically different databases. In such a scenario, distributed transaction processing can be used to guarantee atomicity and serializability throughout all databases. However, with problems like message loss, node failure, and network partitioning, mobile environments make it hard to get estimations on the duration of a simple message exchange.In this article, we focus on the problem of setting up reasonable time-outs when guaranteeing atomicity for transaction processing within mobile ad-hoc networks, and we show the effect of setting up "wrong" time-outs on the transaction throughput and blocking time. Our solution, which does not depend on time-outs, shows a better performance in unreliable networks and remarkably reduces the amount of blocking.