首页> 外文期刊>Distributed and Parallel Databases >A cross-layer atomic commit protocol implementation for transaction processing in mobile ad-hoc networks
【24h】

A cross-layer atomic commit protocol implementation for transaction processing in mobile ad-hoc networks

机译:用于移动自组织网络中事务处理的跨层原子提交协议实现

获取原文
获取原文并翻译 | 示例

摘要

Transaction processing leads to new challenges in mobile ad-hoc networks, which, in comparison to fixed-wired networks, suffer from problems like node disconnection, message loss, and frequently appearing network partitioning. As the atomic commit protocol is that part of transaction processing in which failures can lead to the most serious data blocking, we have developed a robust and failure-tolerant distributed cross-layer atomic commit protocol called CLCP that uses multiple coordinators. In order to reduce the number of both, failures and messages, our protocol makes use of acknowledgement messages for piggybacking information.rnWe have evaluated our protocol in mobile ad-hoc networks by using several mobility models (i.e. Random Waypoint, Manhattan, and Attraction Point), and compared CLCP with other atomic commit protocols, i.e. 2PC and Paxos Commit, each implemented in 3 versions, i.e. without sending message acknowledgements, with a Relay Routing technique, and with Nearest Forward Progress Routing. Special to our simulation environment is the use of the quasi-unit-disc model, which assumes a non-binary message reception probability that captures real-world behavior much better than the classical unit-disc-model, often used in theory. Using the quasi-unit-disc model, our evaluation shows the following results. CLCP and "2PC without acknowledgement messages" have a significantly lower energy consumption than the other protocols, and CLCP is able to commit significantly more distributed transactions than all the other atomic commit protocols for each of the mobility models.
机译:事务处理在移动自组织网络中带来了新的挑战,与固定有线网络相比,移动自组织网络面临诸如节点断开,消息丢失和频繁出现的网络分区之类的问题。由于原子提交协议是事务处理的一部分,失败可能导致最严重的数据阻塞,因此我们开发了一种健壮且容错的分布式跨层原子提交协议,称为CLCP,它使用多个协调器。为了减少失败和消息的数量,我们的协议利用确认消息来piggy带信息。我们已经通过使用几种移动性模型(即,随机航点,曼哈顿和吸引力点)在移动自组织网络中评估了我们的协议),并将CLCP与其他原子提交协议(即2PC和Paxos Commit)进行了比较,它们分别实现了3个版本,即不发送消息确认,具有中继路由技术以及具有最近转发进程路由。对于我们的仿真环境,特殊之处在于使用了准单位光盘模型,该模型假定非二进制消息接收概率比理论上经常使用的经典单位光盘模型更好地捕获了现实世界的行为。使用准单位光盘模型,我们的评估显示以下结果。与其他协议相比,CLCP和“没有确认消息的2PC”的能耗要低得多,并且对于每个移动性模型,CLCP能够比所有其他原子提交协议提交更多的分布式事务。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号