{"title":"A self-adaptive query service for pervasive environments","authors":"H. Grine, T. Delot, S. Lecomte","doi":"10.1145/1416729.1416773","DOIUrl":"https://doi.org/10.1145/1416729.1416773","url":null,"abstract":"The query service is the key element enabling users to identify and access data or services. If the growth of mobility in recent years makes it necessary to support different types of queries (continuous, location dependent, spatio-temporal, etc.,), it has also resulted in the emergence of new and specifique evaluation and optimization techniques. These different types of queries or techniques are useful and efficient depending on the usage conditions in which the user is located. Today, it is necessary to have, in pervasive environments, a query service that adapts to context changes (application constraints, user preferences, connectivity profile mobility, etc.). In this paper we propose an architecture of a query service dynamically adaptable to the context. This adaptability is managed and controled by an adaptation manager by use of rules. Our solution not only allows the addition and removal of new features dynamically, it also allows the change of used evaluation techniques in order to use the adapted one to the environment.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DOC: a new multi-agent approach for DCSP resolution","authors":"Kais Ben Salah, K. Ghédira","doi":"10.1145/1416729.1416767","DOIUrl":"https://doi.org/10.1145/1416729.1416767","url":null,"abstract":"In this paper, we present a new complete method to solve Distributed Constraint Satisfaction Problems (DCSP). DOC-SAT is a Multi-Agent model based on two classes of agents; Decision-Maker agent and Advisor agent that interact to solve inter and intra-agent constraints. The Architecture, dynamic, experimentations and comparison with the Asynchronous Backtracking algorithm are discussed.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127969673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Collective intelligence for demand-responsive transportation systems: a self organization model","authors":"B. Zeddini, A. Yassine, M. Temani, K. Ghédira","doi":"10.1145/1416729.1416778","DOIUrl":"https://doi.org/10.1145/1416729.1416778","url":null,"abstract":"Today's public transportation systems are subject to many requirements that are difficult to reconcile. They are deterministic and based on frequencies and routes that are set in advance. In this paper, we propose a self-organization model in order to carry out a global adaptability that is able to maintain a good dispatching of the fleet of vehicles in a purely dynamic Demand-Responsive Transportation Systems. Our proposal consists on a decentralized approach and a multi-agent system to model the environment. The behaviour of the proposed system is derived from a collective arrangement of the various individual activities, enabling vehicles agents, with respect to a given demand, to calculate the overcosts via an offer protocol and following an insertion heuristic.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127981864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Ben Hamida, Frédéric Le Mouël, S. Frénot, M. Ben ahmed
{"title":"Contextual service loading by dependency graph colouring","authors":"A. Ben Hamida, Frédéric Le Mouël, S. Frénot, M. Ben ahmed","doi":"10.1145/1416729.1416758","DOIUrl":"https://doi.org/10.1145/1416729.1416758","url":null,"abstract":"While installing applications on mobiles devices, we may face issues due to the limit of the device resources. In this paper, we propose AxSeL: A conteXtual Service Loader that considers services-oriented applications and loads them from a distant repository. Services dependencies are represented in a graph that is coloured considering the devices and services constraints. The graph colouring aims to take services loading decisions.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131376228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling collaborative workflows using recursive ECATNets","authors":"A. Hicheur, Kamel Barkaoui","doi":"10.1145/1416729.1416775","DOIUrl":"https://doi.org/10.1145/1416729.1416775","url":null,"abstract":"In this paper, we present our modelling formalism namely the Recursive ECATNets, defined on the basis of a sound combination of the ordinary ECATNets (Extended Concurrent Algebraic Term Nets) and the recursive Petri nets. Then, we show their interest for specification and rapid prototyping of cooperative applications particularly in the field of collaborative workflow processes having a dynamic structure.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132573470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yann Gripay, F. Laforest, Jean-Marc Petit, Liya Zeng
{"title":"Management of data sources and services in pervasive environments","authors":"Yann Gripay, F. Laforest, Jean-Marc Petit, Liya Zeng","doi":"10.1145/1416729.1416738","DOIUrl":"https://doi.org/10.1145/1416729.1416738","url":null,"abstract":"Our daily environment contains more and more computerized devices, and tends to become a pervasive environment. Pervasive applications allow the end user to use a large number of heterogeneous devices, potentially invisible to him/her. To manage such kinds of applications, a distributed and modular architecture is required to handle the devices heterogeneity and their dynamicity, concerning their availability as well as the nature of data and services they can provide. In this article, we propose an architecture integrated in our SoCQ project [16] that builds an abstraction of the environment and thus simplifies the development of pervasive applications based on this abstraction. We also detail the current implementation of our architecture that includes the use of the UPnP technology.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130036198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A meta-level architecture for QoS awareness in a mobile environment","authors":"Zahi Jarir, M. Erradi","doi":"10.1145/1416729.1416742","DOIUrl":"https://doi.org/10.1145/1416729.1416742","url":null,"abstract":"According to their requirements, mobile clients interact with their environments to discover local services offered by different service providers. The underlying software, either within the mobile clients or the servers, consists in different discovery protocols and a variety of heterogeneous middleware platforms such as CORBA, RMI, SOAP, etc. The diversity of discovery protocols can also be a barrier to discover the available services in the context of a mobile client. Therefore, service invocation may require a dynamic adaptation to the specific features of the middleware and those of the available discovery protocols in use. In addition, when a given service is provided by two or more providers, within the same area of the mobile clients, a decision should be made to select the most appropriate service with the best quality of service. The objective of this work is to suggest an adaptive reflective middleware named MAQAME: a Meta-level Architecture for Qos Adaptation in a Mobile Environment that provides a QoS management level to select the service having the better quality of service among the other provided local services. Firstly, we present an overview of a previous work related to an adaptable Middleware, developed for a fixed environment. Then we discuss the MAQAME components that allow a dynamic adaptation of both discovery and interaction protocols to the mobile client environment while providing the better QoS","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114702928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"LH*RSP2P: a scalable distributed data structure for P2P environment","authors":"W. Litwin, Hanafi Yakouben, Thomas J. E. Schwarz","doi":"10.1145/1416729.1416731","DOIUrl":"https://doi.org/10.1145/1416729.1416731","url":null,"abstract":"LH*<sub>RS</sub><sup>P2P</sup> is a Scalable Distributed Data Structure (SDDS) designed for P2P applications. It stores and processes data on SDDS peer nodes. Each node is both an SDDS client and, actually or potentially, an SDDS server with application or parity data. The scheme improves on LH*<sub>RS</sub>. The basic difference is that now key-based queries require at most one forwarding message, instead of possibly two for LH*<sub>RS</sub>. This property makes LH*<sub>RS</sub><sup>P2P</sup> the fastest P2P or SDDS addressing scheme. The scan operation now also takes at most two rounds. LH*<sub>RS</sub><sup>P2P</sup> parity management reuses the LH*<sub>RS</sub> Reed Salomon erasure correction scheme to deal efficiently with churn. The file supports unavailability or withdrawal of up to any <i>k</i> ≥ 1 peers, where <i>k</i> is a parameter that can scale dynamically. We discuss the LH*<sub>RS</sub><sup>P2P</sup> design, implementation issues and variants, as well as related work.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124819311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TTool for DIPLODOCUS: an environment for design space exploration","authors":"L. Apvrille","doi":"10.1145/1416729.1416764","DOIUrl":"https://doi.org/10.1145/1416729.1416764","url":null,"abstract":"TTool for DIPLODOCUS is an open-source UML-based toolkit for the design space exploration of system-on-chip. DIPLODOCUS is the name of the underlying UML profile. This profile includes a three-step methodology: a description of application tasks, a description of candidate distributed architectures, and the mapping of application tasks onto those candidate architectures. Our contribution not only offers SystemC-based automatic simulation but also automatic formal verification, in both cases directly from UML diagrams.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preserving the consistency of distributed objects with real-time transactions","authors":"L. George, P. Minet","doi":"10.1145/1416729.1416793","DOIUrl":"https://doi.org/10.1145/1416729.1416793","url":null,"abstract":"In this paper, we study the problem of maintaining the consistency of distributed objects in real-time. Sporadic transactions sent by a set of clients must be processed by a set servers with a bounded end-to-end response time. We propose in this article a solution, following the state machine approach, based on a particular non-preemptive scheduling denoted EDF* (Earliest Deadline First *). The scheduling on the servers is based on timestamps set by the clients and on an end-to-end deadline to respect. The clock of clients and servers are ε synchronized. We establish in this article the feasibility conditions of the distributed real-time system that permits to grant the consistency of distributed objects and the respect of end-to-end deadlines associated to transactions in charge of read/write access to the objects.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}