A DSA model for data access in self-organizing systems

Authors:
Dhavy Gantsou
Affiliations:
University of Valenciennes, Valenciennes Cedex
Venue:
Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies
Year:
2003

Citing 4
Cited 0

Internetworking with TCP/IP (vol. 2, 2nd ed.): design, implementation, and internals

Internetworking with TCP/IP (vol. 2, 2nd ed.): design, implementation, and internals
GLADE: A Framework for Building Large Object-Oriented Real-Time Distributed Systems

ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
OSPF Complete Implementation

OSPF Complete Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data availability is an important issue for self-organizing systems, which include both Peer-to-Peer (P2P) systems and mobile ad hoc networks (MANETs). In P2P systems, the problem of data availability is solved by replicating data across the network. However, this approach wastes resources, and so is not appropriate for MANETs where resource frugality is essential. Unlike P2P systems, MANETs routing protocols require real-time features to cope with a highly dynamic environment, and efficient synchronization mechanisms to guarantee consistent updates of routing information. Unfortunately, due to the semantics of the languages that are most used in network programming, such mechanisms are extremely hard or even impossible to implement in efficient way. To build an application capable of meeting almost all of these requirements, while providing a framework capable of evolving over time, we propose an approach that is based on DSA.