Theoretical Computer Science
Generating plans in linear logic I: actions as proofs
Theoretical Computer Science
On Data Management in Pervasive Computing Environments
IEEE Transactions on Knowledge and Data Engineering
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Declarative routing: extensible routing with declarative queries
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
Declarative Network Monitoring with an Underprovisioned Query Processor
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Declarative networking: language, execution and optimization
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
The use of declarative query languages has been proposed recently to express communication protocols. This approach, known as declarative networking, is very promising since it results in very simple programs, which are very easy to use. In this paper, we pursue this approach and show how to express the FISCO protocol using less than 40 simple declarative rules. FISCO was designed for self-configuration and self-organisation of large scale multi-hop wireless networks. The declarative modeling of FISCO has important practical and theoretical consequences. First of all, it results in an implementation much more compact than the initial one which used several thousands code lines, it is easy to use and modify, and enjoys verifiable properties, such as correctness and termination. Second, since FISCO targets large scale networks, its scalability is its first requirement. We show that the good scalability of this protocol follows from the fact that it relies mainly on local distributed processes, which can be expressed using first-order queries. Unlike previous proposals for declarative networking which rely on recursive query languages, we show that first-order queries thus offer a high potential for network protocols.