QuickSearch:   Number of matching entries: 0.

Search Settings

Heffner, R. (), "What is SOA?".
BibTeX:
@misc{Heffner,
  author = {Randy Heffner},
  title = {What is SOA?}
}
Blay-Fornarino, M. (2009), "Interpreation de la composition d'activites". School: Nice.
BibTeX:
@phdthesis{Blay-Fornarino2009,
  author = {Mireille Blay-Fornarino},
  title = {Interpreation de la composition d'activites},
  school = {Nice},
  year = {2009}
}
Briot, J.-P. (2009), "Composants logiciels et systèmes multi-agents", In Technologies des systèmes multi-agents et applications industrielles. Paris, France , pp. 147-187. Hermès Lavoisier.
BibTeX:
@inbook{Briot2009,
  author = {Briot, Jean-Pierre},
  title = {Composants logiciels et systèmes multi-agents},
  booktitle = {Technologies des systèmes multi-agents et applications industrielles},
  publisher = {Hermès Lavoisier},
  year = {2009},
  pages = {147--187},
  note = {isbn: 978-2-7462-1785-0}
}
Clavel, R. & Legrand, P. (2009), "Le covoiturage dynamique". Certu, 2009.
Review: Pour vulog
BibTeX:
@techreport{Clavel2009,
  author = {Robert Clavel and Philippe Legrand},
  title = {Le covoiturage dynamique},
  year = {2009}
}
ERCIM (2009), "Future Internet Technology". ERCIM, April, 2009.
BibTeX:
@techreport{ERCIM2009,
  author = {ERCIM},
  title = {Future Internet Technology},
  year = {2009}
}
Han, F. & Zhu, S.C. (2009), "Bottom-Up/Top-Down Image Parsing with Attribute Grammar", IEEE Trans. Pattern Analysis and Machine Intelligence., January, 2009. Vol. 31(1), pp. 59-73.
BibTeX:
@article{Han2009,
  author = {F. Han and S. C. Zhu},
  title = {Bottom-Up/Top-Down Image Parsing with Attribute Grammar},
  journal = {IEEE Trans. Pattern Analysis and Machine Intelligence},
  year = {2009},
  volume = {31},
  number = {1},
  pages = {59--73},
  url = {http://dx.doi.org/10.1109/TPAMI.2008.65}
}
Luthria, H. & Rabhi, F. (2009), "Service Oriented Computing in Practice - An Agenda for Research into the Factors Influencing the Organizational Adoption of Service Oriented Architectures", JTAER. Vol. 4(1), pp. 39-56.
Abstract: The paradigm of service-oriented computing (SOC) has emerged as an approach to provide flexibility and

agility, not just in systems development but also in business process management. This modular approach to

defining business flows as technology independent services has gained unanimous popularity among end-users

and technology vendors alike. Although there is a significant amount of ongoing research on the potential of

service oriented architectures (SOAs), there is a paucity of research literature on the factors affecting the

adoption of service-oriented computing in practice. This paper reviews the current state of the technology,

identifies the factors influencing the decision to adopt service-oriented computing as an enterprise strategy and

discusses the associated research literature, and concludes with a suggested research agenda and conceptual

framework for investigating the use of service-oriented computing in practice.

BibTeX:
@article{Luthria2009,
  author = {Haresh Luthria and Fethi Rabhi},
  title = {Service Oriented Computing in Practice - An Agenda for Research into the Factors Influencing the Organizational Adoption of Service Oriented Architectures},
  journal = {JTAER},
  year = {2009},
  volume = {4},
  number = {1},
  pages = {39--56},
  url = {http://www.jtaer.com/apr2009/luthria_rabhi_p4.pdf}
}
Programme, S.F. (2009), "Future Networks & Services". European Commission, 2009.
BibTeX:
@techreport{Programme2009,
  author = {Seventh Framework Programme},
  title = {Future Networks & Services},
  year = {2009}
}
Ślusarczyk, G. (2008), "A grammar-based multiagent system in dynamic design", Artif. Intell. Eng. Des. Anal. Manuf.. New York, NY, USA Vol. 22(2), pp. 129-145. Cambridge University Press.
Abstract: This paper deals with the system of agents treated as a concurrent modular system, which is able to support the designer in solving complex design tasks. The behavior of design agents is modeled by sets of grammar rules. Each agent manages a graph grammar and a database of facts concerning the subtask for which it is responsible. The course of designing is determined by the interaction between cooperating specialized agents. The design context is expressed by the environment in which agents act and predicates describing design criteria. The organization, design methodology, and a semantic model of a grammar-based multiagent design system are presented. The notions of a valid design solution and a design solution consistent with the design criteria are also introduced. The proposed approach is illustrated by the example of designing a house estate.
BibTeX:
@article{'Slusarczyk2008,
  author = {Ślusarczyk,, Grazyna},
  title = {A grammar-based multiagent system in dynamic design},
  journal = {Artif. Intell. Eng. Des. Anal. Manuf.},
  publisher = {Cambridge University Press},
  year = {2008},
  volume = {22},
  number = {2},
  pages = {129--145},
  doi = {http://dx.doi.org/10.1017/S0890060408000097}
}
Agostino Forestiero, Carlo Mastroianni, H.P.P.F. (2008), "A Scalable Architecture for Discovery and Planning in P2P Service Networks". CoreGRID, 2008.
BibTeX:
@techreport{AgostinoForestiero,
  author = {Agostino Forestiero, Carlo Mastroianni, Harris Papadakis, Paraskevi Fragopoulou},
  title = {A Scalable Architecture for Discovery and Planning in P2P Service Networks},
  year = {2008}
}
Amir R. Khakpour, I.D. (2008), "Designing and prototyping an event-based communication system on mobile ad hoc networks". Institut TELECOM - TELECOM ParisTech, 2008.
BibTeX:
@techreport{AmirR.Khakpour2008,
  author = {Amir R. Khakpour, Isabelle Demeure},
  title = {Designing and prototyping an event-based communication system on mobile ad hoc networks},
  year = {2008}
}
Batory, D. (2008), "Using modern mathematics as an FOSD modeling language", In GPCE '08: Proceedings of the 7th international conference on Generative programming and component engineering. New York, NY, USA., pp. 35-44. ACM.
Abstract: Modeling languages are a fundamental part of automated software development. MDD, for example, uses UML class diagrams and state machines as languages to define applications. In this paper, we explore how Feature Oriented Software Development (FOSD) uses modern mathematics as a modeling language to express the design and synthesis of programs in software product lines, but demands little mathematical sophistication from its users. Doing so has three practical benefits: (1) it offers a simple and principled mathematical description of how FOSD transforms, derives, and relates program artifacts, (2) it exposes previously unrecognized commuting relationships among tool chains, thereby providing new ways to debug tools, and (3) it reveals new ways to optimize software synthesis.
BibTeX:
@inproceedings{Batory2008,
  author = {Batory,, Don},
  title = {Using modern mathematics as an FOSD modeling language},
  booktitle = {GPCE '08: Proceedings of the 7th international conference on Generative programming and component engineering},
  publisher = {ACM},
  year = {2008},
  pages = {35--44},
  doi = {http://doi.acm.org/10.1145/1449913.1449921}
}
Bencomo, N., Grace, P., Flores-Cortés, C.A., Hughes, D. & Blair, G.S. (2008), "Genie: supporting the model driven development of reflective, component-based adaptive systems", In ICSE. , pp. 811-814. ACM.
BibTeX:
@article{Bencomo2008,
  author = {Nelly Bencomo and Paul Grace and Carlos A. Flores-Cortés and Danny Hughes and Gordon S. Blair},
  title = {Genie: supporting the model driven development of reflective, component-based adaptive systems},
  booktitle = {ICSE},
  publisher = {ACM},
  year = {2008},
  pages = {811--814},
  url = {http://doi.acm.org/10.1145/1368088.1368207}
}
Bocquet, A. (2008), "Infrastructure logicielle multi-modèles pour l’accès à des services en mobilité". School: Université des Sciences et Technologies de Lille.
BibTeX:
@phdthesis{Bocquet2008,
  author = {Aurélien Bocquet},
  title = {Infrastructure logicielle multi-modèles pour l’accès à des services en mobilité},
  school = {Université des Sciences et Technologies de Lille},
  year = {2008}
}
Dahan, S., Dobrila, A., Nicod, J.-M. & Philippe, L. (2008), "Etude des performances du Distributed Spanning Tree~: un Overlay Network pour la Recherche de Services". LIFC, 2008.
BibTeX:
@techreport{Dahan2008,
  author = {Dahan, Sylvain and Dobrila, Alexandru and Nicod, Jean-Marc and Philippe, Laurent},
  title = {Etude des performances du Distributed Spanning Tree~: un Overlay Network pour la Recherche de Services},
  booktitle = {Proceedings of CFSE'6, 6th Conférence Francaise en Systèmes d'Exploitation},
  year = {2008}
}
Demetris G. Galatopoullos, Dimitris N. Kalofonos, E.S.M. (2008), "A P2P SOA Enabling Group Collaboration through Service Composition", In ICPS 08, Sorrento, Italy., pp. 6-10.
Abstract: The Service-Oriented Architecture (SOA) paradigm was introduced for exposing business processes as services and enabling their interaction and composition over the Internet. The same computing model can potentially be extended to services of personal devices. As personal devices become network-aware their services can be made available (by their owners) to members of trusted peer groups, thus allowing them to compose new distributed collaborative applications. However, dealing with firewall traversals, NATs, mobility and issues of service-level naming and addressing stand in the way of this vision. In this paper we introduce a P2P SOA middleware architecture that addresses such problems of pervasive connectivity without requiring any intermediaries or changes to the service implementations. We present the basic elements of the architecture and the design of a specific instance of it, which enables the P2P service discovery and execution of composite personal services in distributed OSGi containers over JXTA.
BibTeX:
@inproceedings{DemetrisG.Galatopoullos2008,
  author = {Demetris G. Galatopoullos, Dimitris N. Kalofonos, Elias S. Manolakos},
  title = {A P2P SOA Enabling Group Collaboration through Service Composition},
  booktitle = {ICPS 08, Sorrento, Italy},
  year = {2008},
  pages = {6--10},
  doi = {http://doi.acm.org/10.1145/1387269.1387289}
}
Dimitrov, V. (2008), "Development of Applications with Service-Oriented Architecture for Grid", In International Conference on Computer Systems and Technologies.
BibTeX:
@inproceedings{Dimitrov2008,
  author = {Vladimir Dimitrov},
  title = {Development of Applications with Service-Oriented Architecture for Grid},
  booktitle = {International Conference on Computer Systems and Technologies},
  year = {2008}
}
Fabresse, L., Dony, C. & Huchard, M. (2008), "Foundations of a simple and unified component-oriented language", Comput. Lang. Syst. Struct.. Amsterdam, The Netherlands, The Netherlands Vol. 34(2-3), pp. 130-149. Elsevier Science Publishers B. V..
Abstract: Component-oriented programming (COP) is actually a key research track in software engineering. A variety of component-oriented languages (COLs) have been proposed with new or adapted abstractions and mechanisms to support this new paradigm. However, the proposed features vary quite widely from one proposal to another. There is a need for a closer analysis and synthesis of these features to really discover the new possibilities of COP. In this article we present SCL, our proposition of simple language dedicated to COP. Through the presentation of SCL, we discuss and compare the main features of COLs such as component class, component, interface, port, service or connector. But these features are not enough to build a COL. Indeed, unanticipated connection of independently developed components is one of the key issues of COP. Most approaches use language primitives or connectors and shared interfaces to connect components. But shared interfaces are in contradiction with the philosophy of independently developed components. The approach of SCL is to provide a uniform component connection mechanism based on special components called connectors. SCL also integrates component properties which enable connections based on component state changes with no requirements of specific code in components.
BibTeX:
@article{Fabresse2008,
  author = {Fabresse, Luc and Dony, Christophe and Huchard, Marianne},
  title = {Foundations of a simple and unified component-oriented language},
  journal = {Comput. Lang. Syst. Struct.},
  publisher = {Elsevier Science Publishers B. V.},
  year = {2008},
  volume = {34},
  number = {2-3},
  pages = {130--149},
  doi = {http://dx.doi.org/10.1016/j.cl.2007.05.002}
}
Garavel, H. (2008), "Compilation et vérification de programme LOTOS". School: HAL - CCSD., November~04, 2008.
Abstract: LOTOS (Language Of Temporal Ordering Specification) est un langage de description de systemes paralleles communicants, normalise par l'ISO et le CCITT afin de permettre la definition formelle des protocoles et des services de telecommunications. Le langage utilise des types abstraits algebriques pour specifier les donnees et un calcul de processus proche de CSP et CCS pour exprimer le controle. Cette these propose une technique de compilation permettant de traduire un sous-ensemble significatif de LOTOS vers un modele reseau de Petri interprete (pouvant servir a produire du code executable) puis vers un modele automate d'etats finis (permettant la verification formelle de programmes LOTOS soit par reduction ou comparaison modulo des relations d'equivalence, soit par evaluation de formules de logiques temporelles). La methode employee differe des approches usuelles basees sur la reecriture de termes, qui construisent directement le graphe d'etats correspondant a un programme LOTOS. Ici au contraire la traduction est effectuee en trois etapes successives (expansion, generation et simulation) s'appuyant sur des modeles semantiques intermediaires (le langage SUBLOTOS et le modele reseau). Elle met en oeuvre une analyse statique globale du comportement des programmes. Elle prend en compte les donnees, celles-ci devant etre compilees au moyen dalgorithmes deja existants. Ces principes de compilation ont ete entierement implementes dans le logiciel CAESAR. Les performances obtenues confirment l'interet de la methode.
BibTeX:
@phdthesis{Garavel2008,
  author = {Hubert Garavel},
  title = {Compilation et vérification de programme LOTOS},
  school = {HAL - CCSD},
  year = {2008},
  url = {http://tel.archives-ouvertes.fr/tel-00004339/en/; http://hal.archives-ouvertes.fr/docs/00/04/60/00/PDF/tel-00004339.pdf; http://hal.archives-ouvertes.fr/docs/00/04/60/00/ANNEX/tel-00004339.pdf}
}
Garavel, H. (2008), "Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular", Electr. Notes Theor. Comput. Sci. Vol. 209, pp. 149-164.
Abstract: In this article we review the current state of concurrency theory with respect to its industrial impact. This review is both retrospective and prospective, and naturally encompasses process calculi, which are a major vector for spreading concurrency theory concepts. Considering the achievements, but also the failures, we try to identify the causes that, so far, prevented a larger dissemination of process calculi. This suggests a new generation of formal specification languages that would combine the concurrent features of process calculi with the standard concepts present in algorithmic languages. Finally, we underline two major evolutions in the software and hardware industries that open new application domains for the concurrency theory community.
BibTeX:
@article{Garavel2008a,
  author = {Hubert Garavel},
  title = {Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular},
  journal = {Electr. Notes Theor. Comput. Sci},
  year = {2008},
  volume = {209},
  pages = {149--164},
  url = {http://dx.doi.org/10.1016/j.entcs.2008.04.009}
}
Grondin, G., Bouraqadi, N. & Vercouter, L. (2008), "Assemblage automatique et adaptation d'applications à base de composants", In Actes de la 2ème Conférence francophone sur les Architectures Logicielles (CAL 2008). Montréal, Québec, Canada. Mars 2008., pp. 121. RNTI, Cépaduès Editions.
BibTeX:
@inproceedings{Grondin2008,
  author = {G. Grondin and N. Bouraqadi and L. Vercouter},
  title = {Assemblage automatique et adaptation d'applications à base de composants},
  booktitle = {Actes de la 2ème Conférence francophone sur les Architectures Logicielles (CAL 2008)},
  publisher = {RNTI, Cépaduès Editions},
  year = {2008},
  pages = {121}
}
Hofer, C., Ostermann, K., Rendel, T. & Moors, A. (2008), "Polymorphic embedding of dsls", In GPCE '08: Proceedings of the 7th international conference on Generative programming and component engineering. New York, NY, USA., pp. 137-148. ACM.
Abstract: The influential pure embedding methodology of embedding domain-specific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a single semantics. This precludes the subsequent addition of compilation, optimization or domain-specific analyses. We propose polymorphic embedding of DSLs, where many different interpretations of a DSL can be provided as reusable components, and show how polymorphic embedding can be realized in the programming language Scala. With polymorphic embedding, the static type-safety, modularity, composability and rapid prototyping of pure embedding are reconciled with the flexibility attainable by external toolchains.
BibTeX:
@inproceedings{Hofer2008,
  author = {Hofer,, Christian and Ostermann,, Klaus and Rendel,, Tillmann and Moors,, Adriaan},
  title = {Polymorphic embedding of dsls},
  booktitle = {GPCE '08: Proceedings of the 7th international conference on Generative programming and component engineering},
  publisher = {ACM},
  year = {2008},
  pages = {137--148},
  doi = {http://doi.acm.org/10.1145/1449913.1449935}
}
Hughes, G. & Bultan, T. (2008), "Interface Grammars for Modular Software Model Checking", IEEE Trans. Software Eng. Vol. 34(5), pp. 614-632.
Abstract: Verification techniques relying on state enumeration (e.g., model checking) face two important challenges: the state-space explosion, an exponential increase in the state space as the number of components increases; and environment generation, modeling components that are either not available for analysis, or that cannot be handled by the verification tool in use. We propose a semi-automated approach for attacking these problems. In our approach, interfaces for the components not under analysis are specified using a specification language based on grammars. Specifically, an interface grammar for a component specifies the sequences of method invocations that are allowed by that component. We have built an compiler that takes the interface grammar for a component as input and generates a stub for that component. The stub thus generated can be used to replace that component during state space exploration, either to moderate state space explosion, or to provide an executable environment for the component under verification. We conducted a case study by writing an interface grammar for the Enterprise JavaBeans (EJB) persistence interface, and using the resulting stub to check EJB clients using the JPF model checker. Our results show that EJB clients can be verified efficiently with JPF using our approach.
Review: Utilise les grammaires attribue pour le comportement d'un composant.
BibTeX:
@article{Hughes2008,
  author = {Graham Hughes and Tevfik Bultan},
  title = {Interface Grammars for Modular Software Model Checking},
  journal = {IEEE Trans. Software Eng},
  year = {2008},
  volume = {34},
  number = {5},
  pages = {614--632},
  url = {http://dx.doi.org/10.1109/TSE.2008.72}
}
INRIA (2008), "Critères d’évaluation pour la promotion des chercheurs". INRIA, 2008.
BibTeX:
@techreport{INRIA2008,
  author = {INRIA},
  title = {Critères d’évaluation pour la promotion des chercheurs},
  year = {2008}
}
Klint, P. (2008), "Tribute to a Great Meta-Technologist —from Centaur to The Meta-Environment—". Centrum voor Wiskunde en Informatica, 2008.
BibTeX:
@techreport{Klint2008,
  author = {Paul Klint},
  title = {Tribute to a Great Meta-Technologist —from Centaur to The Meta-Environment—},
  year = {2008}
}
(2008), "The Kompics component framework"
BibTeX:
@unpublished{kompics,,
  title = {The Kompics component framework},
  year = {2008},
  note = {Swedish Institute of Computer Science},
  url = {http://kompics.sics.se}
}
Morin, B., Fleurey, F., Bencomo, N., Jézéquel, J.-M., Solberg, A., Dehlen, V. & Blair, G.S. (2008), "An Aspect-Oriented and Model-Driven Approach for Managing Dynamic Variability", In MoDELS. Vol. 5301, pp. 782-796. Springer.
Abstract: Constructing and executing distributed systems that can adapt to their operating context in order to sustain provided services and the service qualities are complex tasks. Managing adaptation of multiple, interacting services is particularly difficult since these services tend to be distributed across the system, interdependent and sometimes tangled with other services. Furthermore, the exponential growth of the number of potential system configurations derived from the variabilities of each service need to be handled. Current practices of writing low-level reconfiguration scripts as part of the system code to handle run time adaptation are both error prone and time consuming and make adaptive systems difficult to validate and evolve. In this paper, we propose to combine model driven and aspect oriented techniques to better cope with the complexities of adaptive systems construction and execution, and to handle the problem of exponential growth of the number of possible configurations. Combining these techniques allows us to use high level domain abstractions, simplify the representation of variants and limit the problem pertaining to the combinatorial explosion of possible configurations. In our approach we also use models at runtime to generate the adaptation logic by comparing the current configuration of the system to a composed model representing the configuration we want to reach.
BibTeX:
@article{Morin2008,
  author = {Brice Morin and Franck Fleurey and Nelly Bencomo and Jean-Marc Jézéquel and Arnor Solberg and Vegard Dehlen and Gordon S. Blair},
  title = {An Aspect-Oriented and Model-Driven Approach for Managing Dynamic Variability},
  booktitle = {MoDELS},
  publisher = {Springer},
  year = {2008},
  volume = {5301},
  pages = {782--796},
  url = {http://dx.doi.org/10.1007/978-3-540-87875-9_54}
}
Parigot, D. & Boussemart, B. (2008), "Architecture Orienté Service Dynamique : D-SOA". INRIA, 2008.
Abstract: Depuis quelques années, la notion d'Architecture Orientée Services (SOA) s'est rapidement répandue et a été largement acceptée par l'industrie du logiciel. L'aspect dynamique d'une SOA nous semble être l'un des points fondamentaux et cruciaux de cette approche. Le concept d'une Architecture Orientée Services Dynamique D-SOA, se propose de fournir des moyens pour rendre l'architecture adaptable dynamiquement, en cours d'exécution, aux besoins des applications. Les entités qui collaborent pour une application donnée, ne sont pas forcément, connue ou prévisible statiquement. Une D-SOA doit pouvoir s'adapter dynamiquement à son environnement. Elle doit pouvoir supporter aisément des évolutions et des changements dans l'utilisation même de l'application. Elle doit permettre de connecter des entités sans qu'il soit nécessaire qu'elles se connaissent au préalable, qu'elles partagent une même interface de services. A travers l'implémentation de D-SOA au-dessus de la plate-forme OSGi on montre d'une part, sa complémentarité par rapport à OSGi, puis d'autre part, sa simplicité de mise en oeuvre. Cette immersion de D-SOA au-dessus OSGi permet d'envisager des utilisations pour un large public sur des petits supports matériels tels que des PDAs et Smartphones. Finalement, cette notion de SOA dynamique, nous semble être un élément important pour les architectures des applications pour l'Internet du Futur, surtout dans le contexte dynamique des réseaux sociaux et de l'Internet des Objets.
BibTeX:
@techreport{Parigot2008,
  author = {Parigot, Didier and Boussemart, Baptiste},
  title = {Architecture Orienté Service Dynamique : D-SOA},
  year = {2008},
  pages = {13 },
  url = {http://hal.inria.fr/inria-00342310/en/}
}
(2008), "The Common Component Modeling Example: Comparing Software Component Models", In CoCoME. Vol. 5153 Springer.
BibTeX:
@proceedings{Rausch2008,,
  title = {The Common Component Modeling Example: Comparing Software Component Models},
  booktitle = {CoCoME},
  publisher = {Springer},
  year = {2008},
  volume = {5153},
  note = {[result from the Dagstuhl research seminar for CoCoME, August 1-3, 2007]},
  url = {http://springerlink.com/content/l8t37r41612l/}
}
Riad, A.R. & Hassan, Q.F. (2008), "Service-Oriented Architecture - A New Alternative to Traditional Integration Methods in B2B Applications", JCIT. Vol. 3(1), pp. 31-41.
BibTeX:
@article{Riad2008,
  author = {A. R. Riad and Q. F. Hassan},
  title = {Service-Oriented Architecture - A New Alternative to Traditional Integration Methods in B2B Applications},
  journal = {JCIT},
  year = {2008},
  volume = {3},
  number = {1},
  pages = {31--41},
  url = {http://www.aicit.org/jcit/papers/jcit3-1/4-jcit3-1.pdf}
}
Roussel, G. (2008), "Grammaires et automates comme outils pour le développement logiciels". School: Paris-Est.
Review: HDR de gilles roussel
BibTeX:
@phdthesis{Roussel2008,
  author = {Gilles Roussel},
  title = {Grammaires et automates comme outils pour le développement logiciels},
  school = {Paris-Est},
  year = {2008}
}
Savio, D. & Karnouskos, S. (2008), "Web-service enabledwireless sensors in SOA environments", In ETFA., pp. 952-958. IEEE.
Abstract: Enterprise applications support business activities in companies, so that they can manage complexity and be more effective. The service oriented architecture (SOA) concepts empower modern enterprises and provide them with flexibility and agility. These concepts nowadays expand towards the shop-floor activities, down to the device level. By implementing web services on the devices natively, we are able to push down at item level SOA concepts. In this work we focus on implementing web services on the SunSPOT wireless sensor nodes and coupling it with enterprise level services. The presented methods could be used as experimental platform to evaluate new SOA-based paradigm for factory automation and enterprise computing. The goal is to seamlessly integrate heterogeneous hardware on the shop floor and the business intelligence via the SOA approach.
BibTeX:
@inproceedings{Savio2008,
  author = {Domnic Savio and Stamatis Karnouskos},
  title = {Web-service enabledwireless sensors in SOA environments},
  booktitle = {ETFA},
  publisher = {IEEE},
  year = {2008},
  pages = {952--958},
  url = {http://dx.doi.org/10.1109/ETFA.2008.4638509}
}
Schütt, T., Schintke, F. & Reinefeld, A. (2008), "Range queries on structured overlay networks", Computer Communications. Vol. 31(2), pp. 280 - 291.
Abstract: The efficient handling of range queries in peer-to-peer systems is still an open issue. Several approaches exist, but their lookup schemes are either too expensive (space-filling curves) or their queries lack expressiveness (topology-driven data distribution).

We present two structured overlay networks that support arbitrary range queries. The first one, named Chord#, has been derived from Chord by substituting Chord’s hashing function by a key-order preserving function. It has a logarithmic routing performance and it supports range queries, which is not possible with Chord. Its O(1) pointer update algorithm can be applied to any peer-to-peer routing protocol with exponentially increasing pointers. We present a formal proof of the logarithmic routing performance and show empirical results that demonstrate the superiority of Chord# over Chord in systems with high churn rates.

We then extend our routing scheme to multiple dimensions, resulting in SONAR, a Structured Overlay Network with Arbitrary Range queries. SONAR covers multi-dimensional data spaces and, in contrast to other approaches, SONAR’s range queries are not restricted to rectangular shapes but may have arbitrary shapes. Empirical results with a data set of two million objects show the logarithmic routing performance in a geospatial domain.

BibTeX:
@article{Schuett2008,
  author = {Thorsten Schütt and Florian Schintke and Alexander Reinefeld},
  title = {Range queries on structured overlay networks},
  journal = {Computer Communications},
  year = {2008},
  volume = {31},
  number = {2},
  pages = {280 - 291},
  note = {Special Issue: Foundation of Peer-to-Peer Computing},
  url = {http://www.sciencedirect.com/science/article/B6TYP-4PJCYCY-4/2/08cd4b5f30f61d90dc43d3e46f2d9d54},
  doi = {DOI: 10.1016/j.comcom.2007.08.027}
}
Shudo, K., Tanaka, Y. & Sekiguchi, S. (2008), "Overlay Weaver: An overlay construction toolkit", Comput. Commun.. Newton, MA, USA Vol. 31(2), pp. 402-412. Butterworth-Heinemann.
Abstract: A layered model of structured overlays has been proposed and it enabled development of a routing layer independently of higher-level services such as DHT and multicast. The routing layer has to include other part than a routing algorithm, which is essential for routing. It is routing process, which is common to various routing algorithms and can be decoupled from a routing algorithm.

We demonstrated the decomposition by implementing an overlay construction toolkit Overlay Weaver. It facilitates implementation of routing algorithms and we could multiple well-known algorithms just in hundreds of lines of code with the toolkit. The decomposition also enables multiple implementations of the common routing process. Two implementations the toolkit provides perform iterative and recursive routing, respectively. Additionally, to our knowledge, the toolkit is the first feasibility proof of the layered model by supporting multiple algorithms and the higher-level services.

Such modular design contributes to our goal, which is facilitation of rapid development of realistic routing algorithms and their application. We demonstrates that Overlay Weaver supports the goal by conducting large-scale tests and comparisons of algorithms on a single computer. The resulting algorithm implementations work on a real TCP/IP network as it is.

BibTeX:
@article{Shudo2008,
  author = {Shudo,, Kazuyuki and Tanaka,, Yoshio and Sekiguchi,, Satoshi},
  title = {Overlay Weaver: An overlay construction toolkit},
  journal = {Comput. Commun.},
  publisher = {Butterworth-Heinemann},
  year = {2008},
  volume = {31},
  number = {2},
  pages = {402--412},
  doi = {http://dx.doi.org/10.1016/j.comcom.2007.08.002}
}
Vadivelou, G. (2008), "Multi-Agent Systems Integration in Enterprise Environments Using Web Services", In Mobile and Pervasive Computing.
BibTeX:
@inproceedings{Vadivelou2008,
  author = {G. Vadivelou},
  title = {Multi-Agent Systems Integration in Enterprise Environments Using Web Services},
  booktitle = {Mobile and Pervasive Computing},
  year = {2008}
}
Aburukba, R., Ghenniwa, H. & Shen, W. (2007), "Agent-Based Dynamic Scheduling Approach for Collaborative Manufacturing", In Proc. 11th International Conference on Computer Supported Cooperative Work in Design CSCWD 2007. 26--28 April 2007., pp. 445-451.
Abstract: The rapidly changing market requires integrating information and collaborating among organizations to schedule jobs to machines that satisfy the objectives of service providers, and requesters. Moreover, delivering dynamic scheduling remains a major challenge especially when a diverse number of service providers and service requesters are geographically distributed. In this dynamic environment, scheduling usually involves complex and non-deterministic interactions between different participants. In this work, we propose a distributed multi-agent approach to model dynamic scheduling solution in manufacturing. We believe that agent-based model is appropriate due to its characteristics to support both dynamic behavior and distributed structure. The proposed approach is validated through a prototype implementation using the Coordinated Intelligent Rational Agent (CIR-Agent) model.
BibTeX:
@inproceedings{Aburukba2007a,
  author = {Aburukba, R. and Ghenniwa, H. and Weiming Shen},
  title = {Agent-Based Dynamic Scheduling Approach for Collaborative Manufacturing},
  booktitle = {Proc. 11th International Conference on Computer Supported Cooperative Work in Design CSCWD 2007},
  year = {2007},
  pages = {445--451},
  doi = {http://dx.doi.org/10.1109/CSCWD.2007.4281477}
}
Bai, Y.-W. & Hsu, J.-P. (2007), "Design and implementation of an embedded home-gateway for remote monitoring based on OSGI technology", In IMSA'07: IASTED European Conference on Proceedings of the IASTED European Conference. Anaheim, CA, USA., pp. 63-68. ACTA Press.
BibTeX:
@inproceedings{Bai2007,
  author = {Bai,, Ying-Wen and Hsu,, Jui-Po},
  title = {Design and implementation of an embedded home-gateway for remote monitoring based on OSGI technology},
  booktitle = {IMSA'07: IASTED European Conference on Proceedings of the IASTED European Conference},
  publisher = {ACTA Press},
  year = {2007},
  pages = {63--68}
}
Baldoni, R., Beraldi, R., Quema, V., Querzoni, L. & Tucci-Piergiovanni, S. (2007), "TERA: topic-based event routing for peer-to-peer architectures", In DEBS '07: Proceedings of the 2007 inaugural international conference on Distributed event-based systems. New York, NY, USA., pp. 2-13. ACM.
Abstract: The completely decoupled interaction model offered by the publish/subscribe communication paradigm perfectly suits the interoperability needs of todays large-scale, dynamic, peer-to-peer applications. The unmanaged environments, where these applications are expected to work, pose a series of problems (potentially wide number of partipants, low-reliability of nodes, absence of a centralized authority, etc.) that severely limit the scalability of existing approaches which were originally thought for supporting distributed applications built on the top of static and managed environments. In this paper we propose an architecture for implementing the topic-based publish/subscribe paradigm in large scale peer-to-peer systems. The architecture is based on clustering peers subscribed to the same topic. The major novelty of this architecture lies in the mechanism employed to bring events from the publisher to the cluster (namely outer-cluster routing). The evaluation shows that this mechanism for outer-cluster routing has a probability to bring events to the destination cluster very close to 1 while keeping small the involved number of out-of-cluster peers. Finally, the overall architecture is shown to be scalable along several fundamental dimensions like number of participants, subscriptions, and to exhibit a fair load distribution (load distribution closely follows the distribution of subscriptions on nodes).
BibTeX:
@inproceedings{Baldoni2007,
  author = {Baldoni,, Roberto and Beraldi,, Roberto and Quema,, Vivien and Querzoni,, Leonardo and Tucci-Piergiovanni,, Sara},
  title = {TERA: topic-based event routing for peer-to-peer architectures},
  booktitle = {DEBS '07: Proceedings of the 2007 inaugural international conference on Distributed event-based systems},
  publisher = {ACM},
  year = {2007},
  pages = {2--13},
  doi = {http://doi.acm.org/10.1145/1266894.1266898}
}
Bottaro, A. & Marié, S. (2007), "Combining OSGi™Technology and Web Services to realize the Plug-n-Play Dream in the Home Networks", In OSGi Alliance Community Event.
BibTeX:
@inproceedings{Bottaro2007,
  author = {André Bottaro and Sylvain Marié},
  title = {Combining OSGi™Technology and Web Services to realize the Plug-n-Play Dream in the Home Networks},
  booktitle = {OSGi Alliance Community Event},
  year = {2007}
}
Chan, L., Karunasekera, S., Harwood, A. & Tanin, E. (2007), "CAESAR: middleware for complex service-oriented peer-to-peer applications", In MW4SOC., pp. 12-17. ACM.
Abstract: Recent research advances in Peer-to-Peer (P2P) computing have enabled the P2P paradigm to be used for developing complex applications beyond file sharing and data storage. These applications have drawn significant benefits, specifically scalability and low cost, from the P2P paradigm. However, the current approach for designing P2P applications introduce issues that prevent the development of high quality complex P2P applications. These issues, namely tight coupling to P2P protocols, limited logic sharing between peers and complicated recovery processes, motivate us to introduce a service-oriented architecture for P2P applications. We have developed a middleware called CAESAR to support the development of service-oriented P2P applications applying the principles of abstraction, dynamic binding, loose coupling and information hiding. In this paper, we discuss the design principles and the components of CAESAR middleware, as well as our experiences in using CAESAR to develop several service-oriented P2P applications.
BibTeX:
@inproceedings{Chan2007,
  author = {Lipo Chan and Shanika Karunasekera and Aaron Harwood and Egemen Tanin},
  title = {CAESAR: middleware for complex service-oriented peer-to-peer applications},
  booktitle = {MW4SOC},
  publisher = {ACM},
  year = {2007},
  pages = {12--17},
  url = {http://doi.acm.org/10.1145/1388336.1388338}
}
Chen, S. & Lukkien, J.J. (2007), "A service-oriented virtual community overlay network for secure external service orchestration", In MPAC., pp. 13-18. ACM.
Abstract: The Service Oriented Architecture (SOA) is used extensively in ubiquitous computing environments. Using external service orchestration, services can be composed into applications. Since cooperation takes place between services that are scattered over the Internet and belong to different parties, there is a growing need to protect the ownership of service providers and keep the security of communication messages in service composition. This paper shows the details of a service-oriented virtual community overlay network designed for secure external service orchestration. It can also provide contracted QoS guarantees that will definitely affect the overall performance of ubiquitous applications. Further, it highlights the working principle of access control policies as well as a service behavior monitoring mechanism using an example scenario.
BibTeX:
@inproceedings{Chen2007,
  author = {Shudong Chen and Johan J. Lukkien},
  title = {A service-oriented virtual community overlay network for secure external service orchestration},
  booktitle = {MPAC},
  publisher = {ACM},
  year = {2007},
  pages = {13--18},
  url = {http://doi.acm.org/10.1145/1376866.1376869}
}
Cho, H., Lee, S.-H., Choi, Y., Yu, F. & Kim, S.-H. (2007), "Efficient Overlay Multicast Protocol in Mobile Ad hoc Networks", In VTC Spring., pp. 51-55. IEEE.
BibTeX:
@inproceedings{Cho2007,
  author = {Hochoong Cho and Sang-Ho Lee and Younghwan Choi and Fucai Yu and Sang-Ha Kim},
  title = {Efficient Overlay Multicast Protocol in Mobile Ad hoc Networks},
  booktitle = {VTC Spring},
  publisher = {IEEE},
  year = {2007},
  pages = {51--55},
  url = {http://dx.doi.org/10.1109/VETECS.2007.23}
}
Demchak, B., Farcas, C., Farcas, E. & Krüger, I.H. (2007), "The Treasure Map for Rich Services", In IRI., pp. 400-405. IEEE Systems, Man, and Cybernetics Society.
Abstract: Large systems-of-systems often service large numbers of stakeholders - more stakeholders often means more concerns, many of which are crosscutting. The rich services architecture is a type of service-oriented architecture (SOA) that allows hierarchical decomposition of a system architecture into separate concerns, thereby capturing different system aspects and their interactions, and accounting for crosscutting concerns concisely and sensibly. By leveraging emerging enterprise service bus technology, rich services enable a simple and direct deployment mapping to a system-of-systems network. This paper describes a development process that leverages rich services and is compatible with agile development methodologies. It encompasses use cases, requirements decomposition, role identification, and service definition to produce a rich services logical architecture that can then be mapped to a virtual network topology, and finally a physical network topology. The process decouples development stages to improve flexibility and productivity of complex projects, promising reduced cost and risk.
BibTeX:
@inproceedings{Demchak2007,
  author = {Barry Demchak and Claudiu Farcas and Emilia Farcas and Ingolf H. Krüger},
  title = {The Treasure Map for Rich Services},
  booktitle = {IRI},
  publisher = {IEEE Systems, Man, and Cybernetics Society},
  year = {2007},
  pages = {400--405},
  url = {http://dx.doi.org/10.1109/IRI.2007.4296653}
}
Donsez, D. (2007), "La plate-forme dynamique de services OSGi" Licence Creative Commons.
BibTeX:
@book{Donsez2007,
  author = {Didier Donsez},
  title = {La plate-forme dynamique de services OSGi},
  publisher = {Licence Creative Commons},
  year = {2007}
}
Guillaume GRONDIN, N.B. & VERCOUTER, L. (2007), "Modèle de transfert d’état pour l’adaptation d’applications à base de composants". École des Mines de Douai, 2007.
BibTeX:
@techreport{GuillaumeGRONDIN2007,
  author = {Guillaume GRONDIN, Noury BOURAQADI and Laurent VERCOUTER},
  title = {Modèle de transfert d’état pour l’adaptation d’applications à base de composants},
  year = {2007}
}
Hall, S. & Kotonya, G. (2007), "An Adaptable Fault-Tolerance for SOA using a Peer-to-Peer Framework", In ICEBE., pp. 520-527. IEEE Computer Society.
Abstract: The onset of Service Oriented Architectures (SOA) in domains like trading and banking has considerably heightened the need for dependable system operation. Late binding to services in business-to-business operations pose a serious problem for dependable system operation as it delegates the decision to trust a service to an external agent. However, it is impossible to guarantee that any service is 100% fault-free due to failings in hardware, software and human error. This means that fault tolerance remains the most practical way to address the problem. Unfortunately, there is currently no standard way to achieve this in SOA. This paper describes a novel adaptable fault tolerance framework that overlays a peer network formed by JXTA technology protocols to address this problem. We have adopted a layered approach by incrementally adding protocols and supporting the code infrastructure. The framework is implemented exclusively in Java and XML to ensure cross platform compatibility.
BibTeX:
@inproceedings{Hall2007,
  author = {Stephen Hall and Gerald Kotonya},
  title = {An Adaptable Fault-Tolerance for SOA using a Peer-to-Peer Framework},
  booktitle = {ICEBE},
  publisher = {IEEE Computer Society},
  year = {2007},
  pages = {520--527},
  url = {http://dx.doi.org/10.1109/ICEBE.2007.78}
}
Leclercq, M., Ozcan, A.E., Quema, V. & Stefani, J.-B. (2007), "Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset", Software Engineering, International Conference on. Los Alamitos, CA, USA Vol. 0, pp. 209-219. IEEE Computer Society.
Abstract: Many architecture description languages (ADLs) have been proposed to model, analyze, configure, and deploy complex software systems. To face this diversity, extensible ADLs (or ADL interchange formats) have been proposed. These ADLs provide linguistic support for integrating various architectural aspects within the same description. Nevertheless, they do not support extensibility at the tool level, i.e. they do not provide an extensible toolset for processing ADL descriptions.

In this paper, we present an extensible toolset for easing the development of architecture-based software systems. This toolset is not bound to a specific ADL, but rather uses a grammar description mechanism to accept various input languages, e.g. ADLs, Interface Definition Languages (IDLs), Domain Specific Languages (DSLs). Moreover, it can easily be extended to implement many different features, such as behavioral analysis, code generation, deployment, etc. Its extensibility is obtained by designing its core functionalities using fine-grained components that implement flexible design patterns.

Experiments are presented to illustrate both the functionalities implemented by the toolset and the way it can be extended.

BibTeX:
@article{Leclercq2007,
  author = {Matthieu Leclercq and Ali Erdem Ozcan and Vivien Quema and Jean-Bernard Stefani},
  title = {Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset},
  journal = {Software Engineering, International Conference on},
  publisher = {IEEE Computer Society},
  year = {2007},
  volume = {0},
  pages = {209-219},
  doi = {http://doi.ieeecomputersociety.org/10.1109/ICSE.2007.82}
}
Lee, C., Yi, J. & Lee, W. (2007), "Bridging OSGi Islands Through SLP Protocol", In UIC., pp. 787-797.
BibTeX:
@inproceedings{Lee2007,
  author = {Choonhwa Lee and Jongkyu Yi and Wonjun Lee},
  title = {Bridging OSGi Islands Through SLP Protocol},
  booktitle = {UIC},
  year = {2007},
  pages = {787-797}
}
Li, Y., Yang, F., Shuang, K. & Su, S. (2007), "A Semantic Peer-to-Peer Overlay for Web Services Discovery", In SOFSEM (1). Volume 4362, pp. 750-760. Springer.
Abstract: With the growing of semantic web services, distributed and dynamic discovering service becomes a key requirement for service requestors. However, current service discovery mainly focuses on centralized methods, which don’t contain enough capability to support dynamic and automatic service discovery. In this paper, we propose a structured peer-to-peer semantic routing system. The peer-to-peer network and semantic matching can be used to support the completely decentralized semantic service discovery. In the presented system, with the semantic service characteristic vector, the semantic service description is distributed on structured P2P network to allow requesters routing and locating services according to semantic similarity and relationship. Finally, experimental result shows that the presented system is efficient and scalable.
BibTeX:
@inproceedings{Li2007,
  author = {Yong Li and Fangchun Yang and Kai Shuang and Sen Su},
  title = {A Semantic Peer-to-Peer Overlay for Web Services Discovery},
  booktitle = {SOFSEM (1)},
  publisher = {Springer},
  year = {2007},
  volume = {4362},
  pages = {750--760},
  url = {http://dx.doi.org/10.1007/978-3-540-69507-3_65}
}
Lienhardt, M., Schmitt, A. & Stefani, J.-B. (2007), "Oz/K: a kernel language for component-based open programming", In Proceedings of the 6th international conference on Generative programming and component engineering. Salzburg, Austria., pp. 43-52. ACM.
Abstract: Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an approach to open distributed programming that exploits the notion of locality, which has been used in the past decade as a basis for several distributed process calculi such as Mobile Ambients, Dπ, and Seal. We use the locality concept as a form of component that serves as a unit of modularity, of isolation, and of passivation. Specifically, we introduce in this paper Oz/K, a kernel programming language, that adds to the Oz computation model a notion of locality borrowed from the Kell calculus. We present an operational semantics for the language and several examples to illustrate how Oz/K supports open distributed programming.
BibTeX:
@inproceedings{Lienhardt2007,
  author = {Lienhardt, Michael and Schmitt, Alan and Stefani, Jean-Bernard},
  title = {Oz/K: a kernel language for component-based open programming},
  booktitle = {Proceedings of the 6th international conference on Generative programming and component engineering},
  publisher = {ACM},
  year = {2007},
  pages = {43--52},
  url = {http://portal.acm.org/citation.cfm?id=1289971.1289980},
  doi = {http://dx.doi.org/10.1145/1289971.1289980}
}
Liu, X. (2007), "A Multi-Agent-Based Service-Oriented Architecture for Inter-Enterprise Cooperation System", In ICDT '07: Proceedings of the Second International Conference on Digital Telecommunications. Washington, DC, USA., pp. 22. IEEE Computer Society.
BibTeX:
@inproceedings{Liu2007,
  author = {Xiang Liu},
  title = {A Multi-Agent-Based Service-Oriented Architecture for Inter-Enterprise Cooperation System},
  booktitle = {ICDT '07: Proceedings of the Second International Conference on Digital Telecommunications},
  publisher = {IEEE Computer Society},
  year = {2007},
  pages = {22},
  doi = {http://dx.doi.org/10.1109/ICDT.2007.4}
}
López, P.G., Artigas, M. Sá. & Ahulló, J.P. (2007), "The p2pWeb Model: A Glue for the Web", In WETICE., pp. 153-158. IEEE Computer Society.
Abstract: We foresee promising cross-fertilizations of peer- to-peer and Web models in the next years. Although both models are already influencing each other, there is still a lack of seamless integration between them in order to achieve constructive synergies. In this paper, we present a p2pWeb infrastructure which interconnects a network of Web servers through a novel hierarchical Distributed Hash Table called H- Symphony. We show why the hierarchical approach outperforms the traditional flat designs in terms of content and path locality. Furthermore, our approach offers a seamless integration with Web technologies and creates a novel infrastructure for information distribution, data dissemination and query systems. Our proposed proof of concept application is framed in a known open source project called Moodle: A virtual campus web application used in thousands of Universities and Learning Institutions around the world. We have developed an extension of Moodle that aims to interconnect all the Moodle sites in the Internet using our p2pWeb infrastructure.
BibTeX:
@inproceedings{Lopez2007,
  author = {Pedro García López and Marc Sánchez Artigas and Jordi Pujol Ahulló},
  title = {The p2pWeb Model: A Glue for the Web},
  booktitle = {WETICE},
  publisher = {IEEE Computer Society},
  year = {2007},
  pages = {153--158},
  url = {http://doi.ieeecomputersociety.org/10.1109/WETICE.2007.177}
}
Michiardi, P., Marrow, P., Tateson, R. & Saffre, F. (2007), "Aggregation Dynamics in Service Overlay Networks", Self-Adaptive and Self-Organizing Systems, International Conference on. Los Alamitos, CA, USA Vol. 0, pp. 129-140. IEEE Computer Society.
Abstract: In this work we analyze the characteristics of service overlay networks generated by uncoordinated service providers that deploy different service replicas on overlay nodes across the Internet. Our approach differs from previous works, that generally rely on application-level routing, in that we allow nodes to autonomously re-wire the service overlay to make it capable of absorbing a heterogeneously distributed workload that would otherwise result in some nodes with a specific service being overloaded and others remaining idle. We provide a game theoretic model of the overlay creation process and propose several optimization methods to achieve Nash equilibrium topologies. Equilibrium overlays are characterized by interconnected clusters of nodes that instantiate the same service replicas. Hindered by the computational complexity of finding stable wirings, we propose a simple distributed heuristic that allows the study of overlay networks with a realistic size and with several service instances. We show the ability of our re-wiring strategy to promote the emergence of a clustered global topology whilst running locally. We also argue that the lack of incentives for nodes to participate in the overlay creation might lead to several types of misbehavior, of which some representative cases are analyzed. Finally, both scalability and diversity (in terms of service instances) issues that might affect our distributed heuristic are evaluated in detail.
BibTeX:
@article{Michiardi2007,
  author = {Pietro Michiardi and Paul Marrow and Richard Tateson and Fabrice Saffre},
  title = {Aggregation Dynamics in Service Overlay Networks},
  journal = {Self-Adaptive and Self-Organizing Systems, International Conference on},
  publisher = {IEEE Computer Society},
  year = {2007},
  volume = {0},
  pages = {129-140},
  doi = {http://doi.ieeecomputersociety.org/10.1109/SASO.2007.7}
}
Mondéjar, R., López, P.G., Pairot, C. & Gómez-Skarmeta, A.F. (2007), "Adaptive Peer-to-Peer Web Clustering using Distributed Aspect Middleware (Damon)", In AEWSE. Volume 267 CEUR-WS.org.
Abstract: In this paper, we introduce the concept of adaptive peer-to-peer clus-

ter and present our contributions on SNAP, a decentralized web deployment

platform. In addition, we focus on the design and implementation of a load bal-

ancing facility by using the functionalities provided by our distributed AOP

middleware (Damon). Using this approach, we are able to implement new

mechanisms like decentralized session tracking and dynamic policies in a de-

coupled architecture. We believe that our model offers a novel approximation

for modularizing decentralized crosscutting concerns in web environments.

BibTeX:
@inproceedings{Mondejar2007,
  author = {Rubén Mondéjar and Pedro García López and Carles Pairot and Antonio F. Gómez-Skarmeta},
  title = {Adaptive Peer-to-Peer Web Clustering using Distributed Aspect Middleware (Damon)},
  booktitle = {AEWSE},
  publisher = {CEUR-WS.org},
  year = {2007},
  volume = {267},
  url = {http://ceur-ws.org/Vol-267/paper5.pdf}
}
Paller, G. & Kokkinen, H. (2007), "Modular, service-oriented API for peer-to-peer middleware", In MOBILWARE '08: Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications. ICST, Brussels, Belgium, Belgium., pp. 1-6. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
Abstract: This paper presents a general-purpose API to P2P network middleware. The design proposes modular, service oriented solution to this problem. The paper demonstrates that while the proposed P2P API is fairly complex because it tries to support every known P2P technology, the footprint of the middleware can be quite small because of the modular, incremental nature of the API middleware. The paper also demonstrates that although service-oriented API differs significantly from the traditional, monolithic APIs, it can be implemented in small footprint on top of a non service-oriented, commercial platform, the Series60.
BibTeX:
@inproceedings{Paller2008,
  author = {Paller,, Gábor and Kokkinen,, Heikki},
  title = {Modular, service-oriented API for peer-to-peer middleware},
  booktitle = {MOBILWARE '08: Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications},
  publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
  year = {2007},
  pages = {1--6},
  url = {http://doi.acm.org/10.1145/1361492.1361545}
}
Papazoglou, M.P., Traverso, P., Dustdar, S. & Leymann, F. (2007), "Service-Oriented Computing: State of the Art and Research Challenges", Computer. Los Alamitos, CA, USA Vol. 40(11), pp. 38-45. IEEE Computer Society.
BibTeX:
@article{Papazoglou2007,
  author = {Michael P. Papazoglou and Paolo Traverso and Schahram Dustdar and Frank Leymann},
  title = {Service-Oriented Computing: State of the Art and Research Challenges},
  journal = {Computer},
  publisher = {IEEE Computer Society},
  year = {2007},
  volume = {40},
  number = {11},
  pages = {38-45},
  doi = {http://doi.ieeecomputersociety.org/10.1109/MC.2007.400}
}
Papazoglou, M.P. & van den Heuvel, W.-J. (2007), "Service oriented architectures: approaches, technologies and research issues", VLDB J. Vol. 16(3), pp. 389-415.
Abstract: Service-oriented architectures (SOA) is an emerging approach that addresses the requirements of loosely coupled, standards-based, and protocol- independent distributed computing. Typically business operations running in an SOA comprise a number of invocations of these different components, often in an event-driven or asynchronous fashion that reflects the underlying business process needs. To build an SOA a highly distributable communications and integration backbone is required. This functionality is provided by the Enterprise Service Bus (ESB) that is an integration platform that utilizes Web services standards to support a wide variety of communications patterns over multiple transport protocols and deliver value-added capabilities for SOA applications. This paper reviews technologies and approaches that unify the principles and concepts of SOA with those of event-based programing. The paper also focuses on the ESB and describes a range of functions that are designed to offer a manageable, standards-based SOA backbone that extends middleware functionality throughout by connecting heterogeneous components and systems and offers integration services. Finally, the paper proposes an approach to extend the conventional SOA to cater for essential ESB requirements that include capabilities such as service orchestration, “intelligent” routing, provisioning, integrity and security of message as well as service management. The layers in this extended SOA, in short xSOA, are used to classify research issues and current research activities.
BibTeX:
@article{Papazoglou2007a,
  author = {Mike P. Papazoglou and Willem-Jan van den Heuvel},
  title = {Service oriented architectures: approaches, technologies and research issues},
  journal = {VLDB J},
  year = {2007},
  volume = {16},
  number = {3},
  pages = {389--415},
  url = {http://dx.doi.org/10.1007/s00778-007-0044-3}
}
Rivière, Baldoni, R., Li, H. & Pereira, J. (2007), "Compositional gossip: a conceptual architecture for designing gossip-based applications", SIGOPS Oper. Syst. Rev.. New York, NY, USA Vol. 41(5), pp. 43-50. ACM.
Abstract: Most proposed gossip-based systems use an ad-hoc design. We observe a low degree of reutilization among this proposals. We present how this limits both the systematic development of gossip-based applications and the number of applications that can benefit from gossip-based construction. We posit that these reinvent-the-wheel approaches poses a significant barrier to the spread and usability of gossip protocols.

This paper advocates a conceptual design framework based upon aggregating basic and predefined building blocks (B2). We show how to compose building blocks within our framework to construct more complex blocks to be used in gossip-based applications. The concept is further depicted with two gossip-based applications described using our building blocks.

BibTeX:
@article{Rivi`ere2007,
  author = {Rivière,, Étienne and Baldoni,, Roberto and Li,, Harry and Pereira,, José},
  title = {Compositional gossip: a conceptual architecture for designing gossip-based applications},
  journal = {SIGOPS Oper. Syst. Rev.},
  publisher = {ACM},
  year = {2007},
  volume = {41},
  number = {5},
  pages = {43--50},
  doi = {http://doi.acm.org/10.1145/1317379.1317387}
}
Roy, P.V., Haridi, S., Reinefeld, A., Stefani, J.-B., Yap, R.H.C. & Coupaye, T. (2007), "Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project", In FMCO., pp. 153-178.
BibTeX:
@inproceedings{Roy2007,
  author = {Peter Van Roy and Seif Haridi and Alexander Reinefeld and Jean-Bernard Stefani and Roland H. C. Yap and Thierry Coupaye},
  title = {Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project},
  booktitle = {FMCO},
  year = {2007},
  pages = {153-178}
}
Roy, P.V. (2007), "Self Management and the Future of Software Design", Electronic Notes in Theoretical Computer Science. Vol. 182, pp. 201 - 217.
Abstract: Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace to manage this fragility. But today there is a new challenge. Complexity is increasing rapidly as a result of two factors: the increasing use of distributed systems as a result of the sufficient reliability and bandwidth of the Internet, and the increasing scale of these systems as a result of the addition of many new computers to the Internet (e.g., mobile phones and other devices). To manage this new complexity, we propose an approach based on self-managing systems: systems that can maintain useful functionality despite changes in their environment. The paper motivates this approach and gives some ideas on how to build general self-managing software systems. An important part of the approach is to build systems as hierarchies of interacting feedback loops. We give examples of these systems and we deduce some of their design rules. The SELFMAN project is elaborating these ideas into a programming methodology and an implementation.
BibTeX:
@article{Roy2007a,
  author = {Peter Van Roy},
  title = {Self Management and the Future of Software Design},
  journal = {Electronic Notes in Theoretical Computer Science},
  year = {2007},
  volume = {182},
  pages = {201 - 217},
  note = {Proceedings of the Third International Workshop on Formal Aspects of Component Software (FACS 2006)},
  url = {http://www.sciencedirect.com/science/article/B75H1-4P1PR1N-H/2/47612b6696158a1bb235ace665727737},
  doi = {DOI: 10.1016/j.entcs.2006.12.043}
}
Sacha, J., Biskupski, B., Dahlem, D., Cunningham, R., Dowling, J. & Meier, R. (2007), "A Service-Oriented Peer-to-Peer Architecture for a Digital Ecosystem", In Proceedings of the Inaugural IEEE International Conference on Digital Ecosystems and Technologies (DEST'07). February 2007., pp. 205-210. IEEE.
Abstract: Service-oriented computing is becoming an increasingly popular paradigm for modelling and building distributed systems in heterogeneous, decentralised, and open environments. However, proposed service-oriented architectures are usually based on centralised components, such as service registries or service brokers, that introduce reliability, management, and performance issues. In this paper, we present a fully decentralised service-oriented architecture built on top of a self-organising peer-to-peer infrastructure. This architecture is especially designed to support digital ecosystems due to its low deployment and maintenance cost and inherently decentralised nature.
BibTeX:
@inproceedings{Sacha2007,
  author = {Jan Sacha and Bartosz Biskupski and Dominik Dahlem and Raymond Cunningham and Jim Dowling and René Meier},
  title = {A Service-Oriented Peer-to-Peer Architecture for a Digital Ecosystem},
  booktitle = {Proceedings of the Inaugural IEEE International Conference on Digital Ecosystems and Technologies (DEST'07)},
  publisher = {IEEE},
  year = {2007},
  pages = {205--210},
  url = {https://www.cs.tcd.ie/publications/tech-reports/reports.07/TCD-CS-2007-30.pdf}
}
da Silva, V.T. & de Lucena, C.J. (2007), "Modeling multi-agent systems", Commun. ACM. New York, NY, USA Vol. 50(5), pp. 103-108. ACM.
BibTeX:
@article{Silva2007,
  author = {da Silva,, Viviane Torres and de Lucena,, Carlos J.P.},
  title = {Modeling multi-agent systems},
  journal = {Commun. ACM},
  publisher = {ACM},
  year = {2007},
  volume = {50},
  number = {5},
  pages = {103--108},
  doi = {http://doi.acm.org/10.1145/1230819.1241671}
}
Stepney, S., Clarke, T. & Young, P. (2007), "PLAZZMID: An Evolutionary Agent-Based Architecture Inspired by Bacteria and Bees", In ECAL. Volume 4648, pp. 1151-1160. Springer.
Abstract: Classical evolutionary algorithms have been extremely successful at solving certain problems. But they implement a very simple model of evolutionary biology that misses out several aspects that might be exploited by more sophisticated algorithms. We have previously critiqued the traditional naïve approach to bio-inspired algorithm design, that moves straight from a simplistic description of the biology into some algorithm. Here we present a process for developing richer evolutionary algorithms abstracted from various processes of biological evolution, with a corresponding richer analogical computational structure, and indicate how that might be further abstracted.
BibTeX:
@inproceedings{Stepney2007,
  author = {Susan Stepney and Tim Clarke and Peter Young},
  title = {PLAZZMID: An Evolutionary Agent-Based Architecture Inspired by Bacteria and Bees},
  booktitle = {ECAL},
  publisher = {Springer},
  year = {2007},
  volume = {4648},
  pages = {1151--1160},
  url = {http://dx.doi.org/10.1007/978-3-540-74913-4_115}
}
Tivoli, M., Fradet, P., Girault, A. & Gößler, G. (2007), "Adaptor Synthesis for Real-Time Components", In TACAS. Volume 4424, pp. 185-200. Springer.
Abstract: Building a real-time system from reusable or COTS components introduces several problems, mainly related to compatibility, communication, and QoS issues. We propose an approach to automatically derive adaptors in order to solve black-box integration anomalies, when possible. We consider black-box components equipped with an expressive interface that specifies the interaction behavior with the expected environment, the component clock, as well as latency, duration, and controllability of the component’s actions. The principle of adaptor synthesis is to coordinate the interaction behavior of the components in order to avoid possible mismatches, such as deadlocks. Each adaptor models the correct assembly code for a set of components. Our approach is based on labeled transition systems and Petri nets, and is implemented in a tool called SynthesisRT. We illustrate it through a case study concerning a remote medical care system.
BibTeX:
@inproceedings{Tivoli2007,
  author = {Massimo Tivoli and Pascal Fradet and Alain Girault and Gregor Gößler},
  title = {Adaptor Synthesis for Real-Time Components},
  booktitle = {TACAS},
  publisher = {Springer},
  year = {2007},
  volume = {4424},
  pages = {185--200},
  url = {http://dx.doi.org/10.1007/978-3-540-71209-1_16}
}
Toma, I., Iqbal, K., Roman, D., Strang, T., Fensel, D., Sapkota, B., Moran, M. & Gomez, J.M. (2007), "Discovery in grid and web services environments: A survey and evaluation", Multiagent Grid Syst.. Amsterdam, The Netherlands, The Netherlands Vol. 3(3), pp. 341-352. IOS Press.
BibTeX:
@article{Toma2007,
  author = {Toma,, Ioan and Iqbal,, Kashif and Roman,, Dumitru and Strang,, Thomas and Fensel,, Dieter and Sapkota,, Brahmananda and Moran,, Matthew and Gomez,, Juan Miguel},
  title = {Discovery in grid and web services environments: A survey and evaluation},
  journal = {Multiagent Grid Syst.},
  publisher = {IOS Press},
  year = {2007},
  volume = {3},
  number = {3},
  pages = {341--352}
}
Uustalu, T. & Vene, V. (2007), "Comonadic functional attribute evaluation", Trends in Functional Programming 6. , pp. 145-162. Intellect.
Abstract: We have previously demonstrated that dataflow computation is comonadic. Here we argue that attribute evaluation has a lot in common with dataflow computation and admits a similar analysis. We claim that this yields a new, modular way to organize both attribute evaluation programs written directly in a functional language as well as attribute grammar processors. This is analogous to the monadic approach to effects. In particular, we advocate it as a technology of executable specification, not as one of efficient implementation.
BibTeX:
@article{Uustalu2007,
  author = {Uustalu, Tarmo and Vene, Varmo },
  title = {Comonadic functional attribute evaluation},
  journal = {Trends in Functional Programming 6},
  publisher = {Intellect},
  year = {2007},
  pages = {145--162},
  url = {http://www.cs.ioc.ee/tarmo/papers/tfp05.pdf}
}
Wu, C.-L., Liao, C.-F. & Fu, L.-C. (2007), "Service-Oriented Smart-Home Architecture Based on OSGi and Mobile-Agent Technology", Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on., March , 2007. Vol. 37(2), pp. 193-205.
Abstract: The architecture of a conventional smart home is usually server-centric and thus causes many problems. Mobile devices and dynamic services affect a dynamically changing environment, which can result in very difficult interaction. In addition, how to provide services efficiently and appropriately is always an important issue for a smart home. To solve the problems caused by traditional architectures, to deal with the dynamic environment, and to provide appropriate services, we propose a service-oriented architecture (SOA) for smart-home environments, based on Open Services Gateway Initiative (OSGi) and mobile-agent (MA) technology. This architecture is a peer-to-peer (P2P) model based on multiple OSGi platforms, in which service-oriented mechanisms are used for system components to interact with one another, and MA technology is applied to augment the interaction mechanisms
BibTeX:
@article{Wu2007,
  author = {Chao-Lin Wu and Chun-Feng Liao and Li-Chen Fu},
  title = {Service-Oriented Smart-Home Architecture Based on OSGi and Mobile-Agent Technology},
  journal = {Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on},
  year = {2007},
  volume = {37},
  number = {2},
  pages = {193-205},
  doi = {http://dx.doi.org/10.1109/TSMCC.2006.886997}
}
Alexandru Cicortas, V.I. (2006), "A Multi-Agent Framework for Execution of Complex Applications", Acta Polytechnica Hungarica. Vol. 3, pp. 97-119.
BibTeX:
@article{AlexandruCicortas2006,
  author = {Alexandru Cicortas, Victoria Iordan},
  title = {A Multi-Agent Framework for Execution of Complex Applications},
  journal = {Acta Polytechnica Hungarica},
  year = {2006},
  volume = {3},
  pages = {97-119}
}
Bocchi, L. & Ciancarini, P. (2006), "On the Impact of Formal Methods in the SOA", Electronic Notes in Theoretical Computer Science. Vol. 160, pp. 113 - 126.
Review: focus project
BibTeX:
@article{Bocchi2006,
  author = {Laura Bocchi and Paolo Ciancarini},
  title = {On the Impact of Formal Methods in the SOA},
  journal = {Electronic Notes in Theoretical Computer Science},
  year = {2006},
  volume = {160},
  pages = {113 - 126},
  note = {Proceedings of the International Workshop on Formal Aspects of Component Software (FACS 2005)},
  url = {http://www.sciencedirect.com/science/article/B75H1-4KKPCPF-8/2/952b606aa8c1d6862e87f8005a0f7bf5},
  doi = {DOI: 10.1016/j.entcs.2006.05.018}
}
Bosca, A., Corno, F., Valetto, G. & Maglione, R. (2006), "On-the-fly Construction of Web Services Compositions from Natural Language Requests", JSW. Vol. 1(1), pp. 40-50.
Abstract: The introduction of Semantic Web techniques in Service-oriented Architectures enables explicit

representation and reasoning about semantically rich descriptions of service operations. Those

techniques hold promise for the automated discovery, selection, composition and binding of

services. This paper describes an approach to derive formal specifications of Web Service

compositions on the basis of the interpretation of informal user requests expressed in restricted

Natural Language. Our approach leverages the semantic and ontological description of a

portfolio of known service operations (called the Semantic Service Catalog). Each user request is

processed against a Natural Language vocabulary that includes lexical constructs designed to

convey the operations' semantics, in order to recognize and extract fundamental functional

requirements implied by the request, and associate them to entries in the Catalog. In addition, the

request interpreter extracts from the request the overall service logic, expressed in terms of a set of

modular templates describing control and data flow among the selected operations. The result is a

composition specification that associates on demand each user request to a new composed

service. That specification is formal and can thus be transformed in an executable flow document

for a target service composition engine.

BibTeX:
@article{Bosca2006,
  author = {Alessio Bosca and Fulvio Corno and Giuseppe Valetto and Roberta Maglione},
  title = {On-the-fly Construction of Web Services Compositions from Natural Language Requests},
  journal = {JSW},
  year = {2006},
  volume = {1},
  number = {1},
  pages = {40--50},
  url = {http://www.academypublisher.com/jsw/vol01/no01/jsw01014050.html}
}
Bruneton, E., Coupaye, T., Leclercq, M., Quéma, V. & Stefani, J.-B. (2006), "The FRACTAL component model and its support in Java", Softw., Pract. Exper.. Vol. 36(11-12), pp. 1257-1284.
BibTeX:
@article{Bruneton2006,
  author = {Eric Bruneton and Thierry Coupaye and Matthieu Leclercq and Vivien Quéma and Jean-Bernard Stefani},
  title = {The FRACTAL component model and its support in Java},
  journal = {Softw., Pract. Exper.},
  year = {2006},
  volume = {36},
  number = {11-12},
  pages = {1257-1284}
}
Clark, D., Lehr, B., Bauer, S., Faratin, P., Sami, R. & Wroclawski, J. (2006), "Overlay Networks and Future of the Internet", In In Journal of Communications and Strategies., pp. 1-21.
BibTeX:
@inproceedings{Clark2006,
  author = {Dave Clark and Bill Lehr and Steve Bauer and Peyman Faratin and Rahul Sami and John Wroclawski},
  title = {Overlay Networks and Future of the Internet},
  booktitle = {In Journal of Communications and Strategies},
  year = {2006},
  pages = {1--21}
}
David, P.-C. & Ledoux, T. (2006), "An Aspect-Oriented Approach for Developing Self-Adaptive Fractal Components", In Software Composition. Volume 4089, pp. 82-97. Springer.
Abstract: Nowadays, application developers have to deal with increasingly variable execution contexts, requiring the creation of applications able to adapt themselves autonomously to the evolutions of this context. In this paper, we show how an aspect-oriented approach enables the development of self-adaptive applications where the adaptation code is well modularized, both spatially and temporally. Concretely, we propose SAFRAN, an extension of the Fractal component model for the development of the adaptation aspect as reactive adaptation policies. These policies detect the evolutions of the execution context and adapt the base program by reconfiguring it. This way, SAFRAN allows the modular development of adaptation policies and their dynamic weaving into running applications.
BibTeX:
@inproceedings{David2006,
  author = {Pierre-Charles David and Thomas Ledoux},
  title = {An Aspect-Oriented Approach for Developing Self-Adaptive Fractal Components},
  booktitle = {Software Composition},
  publisher = {Springer},
  year = {2006},
  volume = {4089},
  pages = {82--97},
  url = {http://dx.doi.org/10.1007/11821946_6}
}
Delmastro, F., Conti, M. & Gregori, E. (2006), "P2P Common API for Structured Overlay Networks: A Cross-Layer Extension", In WOWMOM., pp. 593-597. IEEE Computer Society.
Abstract: Several structured p2p systems exist in literature and many applications have been developed on top of them. To use these applications on top of different overlays without changing their implementations, a common API was proposed in [7]. However, since that specification is meagre, current implementations of structured p2p systems have customized it reducing the portability of applications. In addition, in mobile environments, the possibility to exploit cross-layer interactions considerably improves overall performace. In fact, a crosslayer p2p system, called CrossROAD, has been recently designed to optimize structured overlays on MANETs. It directly interacts with a proactive routing protocol, and it can provide cross-layer information to upperlayer applications to further optimize their behavior. In this paper we propose a cross-layer extension of the commonAPI pointing out advantages of the cross-layer approach even at the application layer.
BibTeX:
@inproceedings{Delmastro2006,
  author = {Franca Delmastro and Marco Conti and Enrico Gregori},
  title = {P2P Common API for Structured Overlay Networks: A Cross-Layer Extension},
  booktitle = {WOWMOM},
  publisher = {IEEE Computer Society},
  year = {2006},
  pages = {593--597},
  url = {http://doi.ieeecomputersociety.org/10.1109/WOWMOM.2006.84}
}
Donsez, D. (2006), "Courtage et déploiement dynamiques de composants pour l'infrastructure d'équipements UPnP", In Ubimob'06, 3e Journées Francophones Mobilité et Ubiquité, 5 - 8 septembre 2006, Paris, pp 115-118.
BibTeX:
@inproceedings{Donsez2006,
  author = {Didier Donsez},
  title = {Courtage et déploiement dynamiques de composants pour l'infrastructure d'équipements UPnP},
  booktitle = {Ubimob'06, 3e Journées Francophones Mobilité et Ubiquité, 5 - 8 septembre 2006, Paris, pp 115-118},
  year = {2006},
  url = {http://www-adele.imag.fr/users/Didier.Donsez/pub/publi/ubimob06-donsez.pdf}
}
Faros (2006), "Composition de contrats pour la Fiabilité d’ARchitectures Orientées Services". RNTL Faros, 2006.
BibTeX:
@techreport{Faros2006,
  author = {Faros},
  title = {Composition de contrats pour la Fiabilité d’ARchitectures Orientées Services},
  year = {2006}
}
Gérodolle, A. & Bottaro, A. (2006), "OSGi et le projet IST Amigo", In Atelier de travail OSGi 2006 . Paris France .
Abstract: Le projet IST Amigo (Ambient Intelligence for the networked home environment) a pour ambition la promotion des réseaux IP domestiques, d'une part par la construction de scénarios exploitant ces réseaux, d'autre part par le travail sur une architecture logicielle. Cette architecture vise à faciliter la mise en relation spontanée d'objets communicants pour offrir des services de haut niveau aux utilisateurs en prenant en compte le contexte d'utilisation. Le travail présenté ici se situe dans ce deuxième axe, et décrit l'infrastructure basée sur OSGi utilisée dans ce projet pour le développement et le déploiement de composants Java, et les moyens mis en oeuvre pour permettre la découverte et l'interaction entre des équipements ou logiciels connectés à un réseau domestique.
BibTeX:
@inproceedings{Gerodolle2006,
  author = {Gérodolle, Anne and Bottaro, André},
  title = {OSGi et le projet IST Amigo},
  booktitle = {Atelier de travail OSGi 2006 },
  year = {2006},
  note = {projet IST },
  url = {http://hal.archives-ouvertes.fr/hal-00096187/en/}
}
Götze, J., Hillenbrand, M. & Müller, P. (2006), "Web Services Directory Based on Peer-to-Peer Technology", In EUROMICRO-SEAA., pp. 364-371. IEEE.
Abstract: Service-oriented architectures foster the interaction of a multitude of different services. In order to ensure flawless service interaction, a directory service is needed that can be used to find suitable services for a desired task. A centralized solution for local services might be suitable for small systems, but on a larger scale - when systems start to interact via federations of trust - the need for a highly available and easily maintainable directory service arises
BibTeX:
@inproceedings{Gotze2006,
  author = {Joachim Götze and Markus Hillenbrand and Paul Müller},
  title = {Web Services Directory Based on Peer-to-Peer Technology},
  booktitle = {EUROMICRO-SEAA},
  publisher = {IEEE},
  year = {2006},
  pages = {364--371},
  url = {http://dx.doi.org/10.1109/EUROMICRO.2006.66}
}
Grondin, G., Bouraqadi, N. & Vercouter, L. (2006), "MaDcAr: An Abstract Model for Dynamic and Automatic (Re-)Assembling of Component-Based Applications", In CBSE. Volume 4063, pp. 360-367. Springer.
BibTeX:
@inproceedings{Grondin2006,
  author = {Guillaume Grondin and Noury Bouraqadi and Laurent Vercouter},
  title = {MaDcAr: An Abstract Model for Dynamic and Automatic (Re-)Assembling of Component-Based Applications},
  booktitle = {CBSE},
  publisher = {Springer},
  year = {2006},
  volume = {4063},
  pages = {360--367},
  url = {http://dx.doi.org/10.1007/11783565_28}
}
Guitton, J. (2006), "Planification multi-agent pour la composition dynamique de services Web". School: Universit´e Joseph Fourier – Grenoble 1 – Informatique et Math´ematique Appliqu´ee.
BibTeX:
@mastersthesis{Guitton2006,
  author = {Julien Guitton},
  title = {Planification multi-agent pour la composition dynamique de services Web},
  school = {Universit´e Joseph Fourier – Grenoble 1 – Informatique et Math´ematique Appliqu´ee},
  year = {2006}
}
Isomura, M., Riedel, T., Decker, C., Beigl, M. & Horiuchi, H. (2006), "Sharing sensor networks", In ICDCS Workshops., pp. 61. IEEE Computer Society.
BibTeX:
@inproceedings{Isomura2006,
  author = {Manabu Isomura and Till Riedel and Christian Decker and Michael Beigl and Hiroki Horiuchi},
  title = {Sharing sensor networks},
  booktitle = {ICDCS Workshops},
  publisher = {IEEE Computer Society},
  year = {2006},
  pages = {61},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2006.98}
}
Isomura, M., Riedel, T., Decker, C., Beigl, M. & Horiuchi, H. (2006), "Sharing sensor networks", In Proc. 26th IEEE International Conference on Distributed Computing Systems Workshops ICDCS Workshops 2006. 04--07 July 2006., pp. 61-61.
BibTeX:
@inproceedings{Isomura2006a,
  author = {Isomura, M. and Riedel, T. and Decker, C. and Beigl, M. and Horiuchi, H. },
  title = {Sharing sensor networks},
  booktitle = {Proc. 26th IEEE International Conference on Distributed Computing Systems Workshops ICDCS Workshops 2006},
  year = {2006},
  pages = {61--61},
  doi = {http://dx.doi.org/10.1109/ICDCSW.2006.98}
}
Kaafar, M. A., Turletti, T. & Dabbous, W. (2006), "LCC : Un réseau de recouvrement multipoint passant à l'échelle", In Colloque Francophone sur l'Ingénierie des Protocoles - CFIP 2006 Session 3 : communication multipoints . Tozeur/Tunisia . 10 2006. Hermès .
Abstract: Les propositions récentes de construction de réseaux de recouvrement (overlay) pour la transmission multipoint ont démontré l'importance d'exploiter les informations de la topologie du réseau sous-jacent. Toutefois, ces propositions reposent souvent sur des processus de raffinement incrémentaux pour améliorer les performances du système. Ces approches ne passent pas de ce fait à l'échelle, induisant un surcoût de communication élevé, et nécessitent un temps de convergence important avant d'atteindre une structure stable. Dans cet article, nous proposons un algorithme de localisation qui dirige graduellement les nouveaux venus vers les noeuds les plus proches sans pour cela induire un surcoût élevé. En nous basant sur cette localisation, nous proposons un réseau overlay, nommé "LCC", à la fois robuste, passant à l'échelle et prenant en compte la topologie physique. Nous avons mené des expérimentations réelles sur PlanetLab ainsi que des simulations afin d'évaluer les performances de LCC. Les résultats prouvent d'une part que le processus de localisation nécessite des ressources modestes en termes de délais et de bande passante, et d'autre part que LCC est un overlay efficace pour supporter des applications multipoints à très grande échelle.
BibTeX:
@inproceedings{Kaafar2006,
  author = {Kaafar, Mohamed Ali and Turletti, Thierry and Dabbous, Walid},
  title = {LCC : Un réseau de recouvrement multipoint passant à l'échelle},
  booktitle = {Colloque Francophone sur l'Ingénierie des Protocoles - CFIP 2006 Session 3 : communication multipoints },
  publisher = {Hermès },
  year = {2006},
  note = {C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.2: Network Protocols },
  url = {http://hal.inria.fr/inria-00110295/en/}
}
Marco Conti, Jon Crowcroft, F.D.A.P. (2006), "P2P support for Group-Communication Applications: a Cross-Layer Approach for MANET Environments". CNR, IIT Institute, 2006.
BibTeX:
@techreport{MarcoConti2006,
  author = {Marco Conti, Jon Crowcroft, Franca Delmastro, Andrea Passarella},
  title = {P2P support for Group-Communication Applications: a Cross-Layer Approach for MANET Environments},
  year = {2006}
}
Michael P. Papazoglou, Paolo Traverso, S.D. & Leymann, F. (2006), "Service-Oriented Computing Research Roadmap".
Abstract: Service-Oriented Computing (SOC) is a new computing paradigm that utilizes services as the basic constructs to support the development of rapid, low-cost and easy composition of distributed applications even in heterogeneous environments. The promise of Service-Oriented Computing is a world of cooperating services where application components are assembled with little effort into a network of services that can be loosely coupled to create flexible dynamic business processes and agile applications that may span organizations and computing platforms. The subject of Service-Oriented Computing is vast and enormously complex, spanning many concepts and technologies that find their origins in diverse disciplines that are woven together in an intricate manner. In addition, there is a need to merge technology with an understanding of business processes and organizational structures, a combination of recognizing an enterprise's pain points and the potential solutions that can be applied to correct them. The material in research spans an immense and diverse spectrum of literature, in origin and in character. As a result research activities are very fragmented. This necessitates that a broader vision and perspective be established — one that permeates and transforms the fundamental requirements of complex applications that require the use of the Service-Oriented Computing paradigm.

This paper provides a Service Oriented Computing Roadmap and places on-going research activities and projects in the broader context of this roadmap. This research roadmap launches four pivotal, inherently related, research themes to Service-Oriented Computing: service foundations, service composition, service management and monitoring and service-oriented engineering.

BibTeX:
@misc{MichaelP.Papazoglou2006,
  author = {Michael P. Papazoglou, Paolo Traverso, Schahram Dustdar and Frank Leymann},
  title = {Service-Oriented Computing Research Roadmap},
  year = {2006}
}
Michal Jakob, N.K. & Ghanea-Hercock, R. (2006), "Nexus – Middleware for Decentralized Service-Oriented Information Fusion". BT Pervasive ICT Research Centre, 2006.
BibTeX:
@techreport{MichalJakob2006,
  author = {Michal Jakob, Nima Kaveh and Robert Ghanea-Hercock},
  title = {Nexus – Middleware for Decentralized Service-Oriented Information Fusion},
  year = {2006}
}
Michal Jakob, A.H. & Saffre, F. (2006), "Mercury: Multi-Agent Adaptive Service Selection Based on Non-Functional Attributes". BT Research, 2006.
BibTeX:
@techreport{MichalJakob2006a,
  author = {Michal Jakob,Alex Healing and Fabrice Saffre},
  title = {Mercury: Multi-Agent Adaptive Service Selection Based on Non-Functional Attributes},
  year = {2006}
}
Parigot, D. (2006), "Fabrique Logicielle SmartTools". février, 2006.
BibTeX:
@misc{Parigot2006,
  author = {Didier Parigot},
  title = {Fabrique Logicielle SmartTools},
  year = {2006},
  note = {Lauréat de la 2 édition de "Tremplin Recherche" organisé par le Sénat}
}
Poulhiès, M., Pulou, J., Rippert, C. & Sifakis, J. (2006), "A Methodology and Supporting Tools for the Development of Component-Based Embedded Systems.", In Composition of Embedded Systems. Scientific and Industrial Issues 13th Monterey Workshop : Compositions of Embedded Systems, Scientific and Industrial Issues . Paris France . Volume 4888 , pp. {L}ecture {N}otes in {C}omputer {S}cience .
Abstract: The paper presents a methodology and supporting tools for developing component-based embedded systems running on resource- limited hardware platforms. The methodology combines two complementary component frameworks in an integrated tool chain: BIP and Think. BIP is a framework for model-based development including a language for the description of heterogeneous systems, as well as associated simulation and veri&64257;cation tools. Think is a software component framework for the generation of small-footprint embedded systems. The tool chain allows generation, from system models described in BIP, of a set of func tionally equivalent Think components. From these and libraries including OS services for a given hardware platform, a minimal system can be generated. We illustrate the results by modeling and implementing a software MPEG encoder on an iPod.
BibTeX:
@inproceedings{Poulhies2006,
  author = {Poulhiès, Marc and Pulou, Jacques and Rippert, Christophe and Sifakis, Joseph},
  title = {A Methodology and Supporting Tools for the Development of Component-Based Embedded Systems.},
  booktitle = {Composition of Embedded Systems. Scientific and Industrial Issues 13th Monterey Workshop : Compositions of Embedded Systems, Scientific and Industrial Issues },
  year = {2006},
  volume = {4888 },
  pages = {Lecture Notes in Computer Science },
  url = {http://hal.archives-ouvertes.fr/hal-00309689/en/}
}
Reignier, P., Zaidenberg, S., Emonet, R., Vaufreydaz, D. & Letesssier, J. (2006), "jOMiSCID, un intergiciel sous OSGi pour l'informatique ubiquitaire". laboratoire gravir, 2006.
Abstract: Cet article présente un intergiciel multi-plateforme (Windows, Linux, MacOSX) et multi-langage (C++, Java) pour l'informatique ubiquitaire. Cet intergiciel permet de faire abstraction de la communication réseau. Il permet l'inspection de services distants et s'appuie sur DNS-SD1 pour permettre leur découverte. La version Java est disponible sous deux formes : un fichier jar "classique" et un bundle pour la mise en oeuvre sous OSGi. La version OSGi permet de tirer parti des avantages de cet environnement en répondant aux contraintes imposées par l'informatique ubiquitaire : facilité de déploiement à partir d'un serveur de composants, possibilité d'ajouté de suppression et de mise à jour "à chaud" des composants.
BibTeX:
@techreport{Reignier2006,
  author = {Reignier, Patrick and Zaidenberg, Sofia and Emonet, Rémi and Vaufreydaz, Dominique and Letesssier, Julien},
  title = {jOMiSCID, un intergiciel sous OSGi pour l'informatique ubiquitaire},
  booktitle = {Atelier de travail OSGi 2006 },
  year = {2006},
  url = {http://hal.archives-ouvertes.fr/hal-00097090/en/}
}
Skvorc, D., Srbljic, S. & Podravec, M. (2006), "Virtual Network for Development and Execution of Service-Oriented Applications", In ICNS '06: Proceedings of the International conference on Networking and Services. Washington, DC, USA., pp. 96. IEEE Computer Society.
Abstract: Service-oriented computing represents an emerging paradigm where software functionalities are delivered to consumers as services rather than products. Service-oriented applications consist of services available on the Internet and the coordination logic that binds independent services into the application-specific workflow. Execution of distributed applications in shared and dynamic Internet environments faces two open issues: security of service invocation and dependence of coordination logic on physical distribution of services. In this paper, we propose a model for development and execution of service-oriented applications based on a virtual network. Virtual network provides the environment for secure execution of service-oriented applications independent of the physical network configuration. Virtual network is based on service-oriented architecture, which enables run-time management of virtual network by users and distributed applications
BibTeX:
@inproceedings{Skvorc2006,
  author = {Dejan Skvorc and Sinisa Srbljic and Matija Podravec},
  title = {Virtual Network for Development and Execution of Service-Oriented Applications},
  booktitle = {ICNS '06: Proceedings of the International conference on Networking and Services},
  publisher = {IEEE Computer Society},
  year = {2006},
  pages = {96},
  doi = {http://dx.doi.org/10.1109/ICNS.2006.118}
}
de Souza, V.A.S.M. & Cardozo, E. (2006), "SOANet - A Service Oriented Architecture for Building Compositional Network Services", JSW. Vol. 1(2), pp. 1-11.
BibTeX:
@article{Souza2006,
  author = {Victor A. S. M. de Souza and Eleri Cardozo},
  title = {SOANet - A Service Oriented Architecture for Building Compositional Network Services},
  journal = {JSW},
  year = {2006},
  volume = {1},
  number = {2},
  pages = {1--11},
  url = {http://www.academypublisher.com/jsw/vol01/no02/jsw01020111.html}
}
Tang, J. & Zhang, M. (2006), "An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing", In ACSW Frontiers '06: Proceedings of the 2006 Australasian workshops on Grid computing and e-research. Darlinghurst, Australia, Australia., pp. 33-39. Australian Computer Society, Inc..
Abstract: The conventional computing Grid has developed a service oriented computing architecture with a super-localresource management and scheduling strategy. This architecture is limited in modeling computer systems with highly dynamic and autonomous computing resources due to its server-based computing model. The super-local resource management and scheduling strategy also limits the utilization of the computing resources. In this paper, we propose a multi-agent based Peer-to-Peer Grid computing architecture.This novel architecture solves the above issues, while provides reasonable compatibility and interoperability with the conventional Grid systems and clients. The main characteristics of this architecture are highlighted by its promising performance and scalability, and its adaptive resource management and scheduling mechanisms. With this architecture, is promising to build large scale high performance commodity computing Grids at low cost.
BibTeX:
@inproceedings{Tang2006,
  author = {Tang,, Jia and Zhang,, Minjie},
  title = {An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing},
  booktitle = {ACSW Frontiers '06: Proceedings of the 2006 Australasian workshops on Grid computing and e-research},
  publisher = {Australian Computer Society, Inc.},
  year = {2006},
  pages = {33--39},
  url = {http://doi.acm.org/10.1145/1151828.1151833}
}
Waldispühl, Jé., Berger, B., Clote, P. & Steyaert, J.-M. (2006), "transFold: a web server for predicting the structure and residue contacts of transmembrane beta-barrels", Nucleic Acids Research. Vol. 34(Web-Server-Issue), pp. 189-193.
Abstract: Transmembrane ß-barrel (TMB) proteins are embedded in the outer membrane of Gram-negative bacteria, mitochondria and chloroplasts. The cellular location and functional diversity of ß-barrel outer membrane proteins makes them an important protein class. At the present time, very few non-homologous TMB structures have been determined by X-ray diffraction because of the experimental difficulty encountered in crystallizing transmembrane (TM) proteins. The transFold web server uses pairwise inter-strand residue statistical potentials derived from globular (non-outer-membrane) proteins to predict the supersecondary structure of TMB. Unlike all previous approaches, transFold does not use machine learning methods such as hidden Markov models or neural networks; instead, transFold employs multi-tape S-attribute grammars to describe all potential conformations, and then applies dynamic programming to determine the global minimum energy supersecondary structure. The transFold web server not only predicts secondary structure and TMB topology, but is the only method which additionally predicts the side-chain orientation of transmembrane ß-strand residues, inter-strand residue contacts and TM ß-strand inclination with respect to the membrane. The program transFold currently outperforms all other methods for accuracy of ß-barrel structure prediction. Available at http://bioinformatics.bc.edu/clotelab/transFold.
BibTeX:
@article{Waldispuhl2006,
  author = {Jérôme Waldispühl and Bonnie Berger and Peter Clote and Jean-Marc Steyaert},
  title = {transFold: a web server for predicting the structure and residue contacts of transmembrane beta-barrels},
  journal = {Nucleic Acids Research},
  year = {2006},
  volume = {34},
  number = {Web-Server-Issue},
  pages = {189--193},
  url = {http://dx.doi.org/10.1093/nar/gkl205}
}
Wu, W., Fox, G., Bulut, H., Uyar, A. & Huang, T. (2006), "Service Oriented Architecture for VoIP Conferencing, to be published 2006", In in Special Issue on Voice over IP - Theory and Practice of the International Journal of Communication Systems.
Abstract: Most current Voice/Video over IP (VoIP) systems are either highly centralized or dependent on IP multicast. We propose the Global Multimedia Collaboration System as a scalable, integrated and service-oriented VoIP conferencing system, based on a SOAP-based collaboration framework and advanced messaging oriented middleware. This system can provide media and session services to heterogeneous endpoints including H.323, SIP, Access Grid, and RealPlayer as well as accommodating diverse clients such as cellular phones. We suggest that our approach opens up new opportunities for extending classic VoIP systems by using these new technologies designed for scalable Internet based service-oriented computing. Copyright © 2006 John Wiley & Sons, Ltd.
BibTeX:
@inproceedings{Wu2006,
  author = {Wenjun Wu and Geoffrey Fox and Hasan Bulut and Ahmet Uyar and Tao Huang},
  title = {Service Oriented Architecture for VoIP Conferencing, to be published 2006},
  booktitle = {in Special Issue on Voice over IP - Theory and Practice of the International Journal of Communication Systems},
  year = {2006},
  url = {http://dx.doi.org/10.1002/dac.803}
}
Yu, J., Chen, R., Su, H. & Guo, S. (2006), "Web Services Publishing and Discovery on Peer-to-Peer Overlay", In Proc. IEEE Asia-Pacific Conference on Services Computing APSCC '06. Dec. 2006., pp. 329-334.
Abstract: Centralized UDDI currently becomes harder to catch up with the need of Internet-scale service publishing and discovery. Peer-to-peer technology with its advantages of scalability, fault-tolerance and dynamics is suitable for loose-coupled Web services' distribution in nature and prevailing nowadays. In this paper, we present a distributed, collaborative peer-to-peer service overlay suitable for service publishing and discovery based on skip graph which could be organized by planar model or tree model according to the scale of services. We propose a prefix-ordered clustering mechanism that congregates the keys within a fixed prefix into the same bucket and make the smallest one appeared as the key in the service overlay which would support prefix, range query and semantic matching on Web services. We then analyze the performance of our proposed with simulation that validates the effectiveness of the service overlay
BibTeX:
@inproceedings{Yu2006,
  author = {JianJun Yu and Rui Chen and Hao Su and Shengmin Guo},
  title = {Web Services Publishing and Discovery on Peer-to-Peer Overlay},
  booktitle = {Proc. IEEE Asia-Pacific Conference on Services Computing APSCC '06},
  year = {2006},
  pages = {329--334},
  doi = {http://dx.doi.org/10.1109/APSCC.2006.115}
}
Alda, S. (2005), "Peer Group-Based Dependency Management in Service-Oriented Peer-to-Peer Architectures", In DBISP2P. Volume 4125, pp. 195-202. Springer.
Abstract: Dependency management in service-Oriented peer-to-Peer architectures aims at handling functional dependencies between a public service hosted by a service providing peer and all consumer peers that rely on that service. The analysis of dependencies on consumer peers is important for supporting the adaptation of a public service. The uncoordinated adaptation of public services potentially leads to malfunctions in the environment of depending peers. In this paper, a novel way for handling service dependencies in peer-to-peer architectures is proposed. This approach suggests that peers of a peer group agree on a common adaptation policy that prescribes how service providing peers have to deal with potential dependencies before an adaptation can be pursued.
BibTeX:
@inproceedings{Alda2005,
  author = {Sascha Alda},
  title = {Peer Group-Based Dependency Management in Service-Oriented Peer-to-Peer Architectures},
  booktitle = {DBISP2P},
  publisher = {Springer},
  year = {2005},
  volume = {4125},
  pages = {195--202},
  url = {http://dx.doi.org/10.1007/978-3-540-71661-7_19}
}
Amoretti, M., Reggiani, M., Zanichelli, F. & Conte, G. (2005), "SP2A: Enabling Service-Oriented Grids using a Peer-to-Peer Approach", In WETICE., pp. 301-304. IEEE Computer Society.
Abstract: With the Service-oriented Peer-to-Peer Architecture (SP^2A), we propose a peer-to-peer based solution for service sharing, discovery and provision in Grid environments. This paper presents an overview of SP^2A, along with the structure of the current prototype and some performance results.
BibTeX:
@inproceedings{Amoretti2005,
  author = {Michele Amoretti and Monica Reggiani and Francesco Zanichelli and Gianni Conte},
  title = {SP2A: Enabling Service-Oriented Grids using a Peer-to-Peer Approach},
  booktitle = {WETICE},
  publisher = {IEEE Computer Society},
  year = {2005},
  pages = {301--304},
  url = {http://doi.ieeecomputersociety.org/10.1109/WETICE.2005.54}
}
Apel, S. & Böhm, K. (2005), "Self-Organization in Overlay Networks", In CAiSE Workshops (2)., pp. 139-153. FEUP Edicões, Porto.
BibTeX:
@inproceedings{Apel2005,
  author = {Sven Apel and Klemens Böhm},
  title = {Self-Organization in Overlay Networks},
  booktitle = {CAiSE Workshops (2)},
  publisher = {FEUP Edicões, Porto},
  year = {2005},
  pages = {139--153}
}
Auguston, M., Michael, J., Shing, M.-T. & Floodeen, D. (2005), "Using attributed event grammar environment models for automated test generation and software risk assessment of system-of-systems", Systems, Man and Cybernetics, 2005 IEEE International Conference on., Oct., 2005. Vol. 2, pp. 1870-1875 Vol. 2.
Abstract: This paper presents some concepts, principles, and techniques for automated testing of system-of-systems based on attributed event grammar (AEG) modeling of the system's operational environment. AEG provides a uniform approach for automatically generating, executing, and analyzing tests. Quantitative and qualitative software risk assessment can be performed based on statistics gathered during automatic test execution within the specified environment model.
BibTeX:
@article{Auguston2005,
  author = {Auguston, M. and Michael, J.B. and Shing, M.-T. and Floodeen, D.L.},
  title = {Using attributed event grammar environment models for automated test generation and software risk assessment of system-of-systems},
  journal = {Systems, Man and Cybernetics, 2005 IEEE International Conference on},
  year = {2005},
  volume = {2},
  pages = { 1870-1875 Vol. 2},
  doi = {http://dx.doi.org/10.1109/ICSMC.2005.1571419}
}
Barais, O. (2005), "Construire et Maıtriser l’ Evolution d’une Architecture Logicielle a base de Composants". School: USTL.
BibTeX:
@phdthesis{Barais2005,
  author = {Olivier Barais},
  title = {Construire et Maıtriser l’ Evolution d’une Architecture Logicielle a base de Composants},
  school = {USTL},
  year = {2005}
}
Bauvois, M. (2005), "Composition comportementale de composants". School: INPG grenoble.
BibTeX:
@phdthesis{Bauvois2005,
  author = {Mikael Bauvois},
  title = {Composition comportementale de composants},
  school = {INPG grenoble},
  year = {2005}
}
Caromel, D., Costanzo, A. d., Gannon, D. & Slominski, A. (2005), "Asynchronous Peer-to-PeerWeb Services and Firewalls", In IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5. Washington, DC, USA., pp. 183.1. IEEE Computer Society.
Abstract: In this paper we test the suitability of Java to implement a scalable Web Service that solves a set of problems related to peer-to-peer interactions between Web Services that are behind firewalls or not generally accessible. In particular we describe how to enable reliable and long running conversations through firewalls betweenWeb Service peers that have no accessible network endpoints. Our solution is to implement in Java a Web Services Dispatcher (WSD) that is an intermediary service that forwards messages and can facilitate message exchanges by supporting SOAP RPC over HTTP and WS-Addressing for asynchronous messaging. We describe how Web Service clients that have no network endpoints, such as applets, can become Web Service peers by using an additional message store-and-forward service ("mailbox"). Then we conduct a set of experiments to evaluate performance of Java implementation in realistic Web Service scenarios, involving intercontinental tests between France and the US.
BibTeX:
@inproceedings{Caromel2005,
  author = {Caromel,, Denis and Costanzo,, Alexandre di and Gannon,, Dennis and Slominski,, Aleksander},
  title = {Asynchronous Peer-to-PeerWeb Services and Firewalls},
  booktitle = {IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5},
  publisher = {IEEE Computer Society},
  year = {2005},
  pages = {183.1},
  doi = {http://dx.doi.org/10.1109/IPDPS.2005.114}
}
Cleary, R. (2005), "Extending Grammatical Evolution with Attribute Grammars: An Application to Knapsack Problems". School: University of Limerick.
BibTeX:
@mastersthesis{Cleary2005,
  author = {Robert Cleary},
  title = {Extending Grammatical Evolution with Attribute Grammars: An Application to Knapsack Problems},
  school = {University of Limerick},
  year = {2005}
}
Courbis, C. & Finkelstein, A. (2005), "Toward Aspect Weaving Applications", In ICSE'05.
Abstract: Software must be adapted to accommodate new features in the context of changing requirements. In this paper, we illustrate how applications with aspect weaving capabilities can be easily and dynamically adapted with unforseen features. Aspects were used at three levels: in the context of semantic analysers, within a BPEL engine that orchestrates Web Services, and finally within BPEL processes themselves. Each level uses its own tailored domain-specific aspect language that is easier to manipulate than a general-purpose one (close to the programming language) and the pointcuts are independent from the implementation.
BibTeX:
@inproceedings{Courbis2005,
  author = {Carine Courbis and Anthony Finkelstein},
  title = {Toward Aspect Weaving Applications},
  booktitle = {ICSE'05},
  year = {2005},
  url = {http://portal.acm.org/citation.cfm?doid=1062455.1062484}
}
Dahlem, D., McKitterick, D., Nickel, L., Dowling, J., Biskupski, B. & Meier, R. (2005), "Binding- and Port-Agnostic Service Composition using a P2P SOA", In International Workshop on Dynamic Web Processes DWP 2005, at ICSOC 2005. P.O. Box 218, Yorktown Heights, NY 10598 USA. December 2005., pp. 61-72. IBM T.J. Watson Research Center.
Abstract: The assumption of the availability of port information at design time of service compositions in Service-Oriented Architectures (SOAs) is not valid for an increasing number of hosts on the Internet that do not have a public, static IP address. Existing workflow engines do not support services deployed on such hosts, as service invocations require the availability of port information defined either in concrete WSDL definitions or within a deployment descriptor of the BPEL workflow engine. This paper presents a workflow engine that supports runtime look-up of service endpoints based on a P2P middleware. Using a service identifier based on a DHT identifier, Service Proxy objects that encapsulate port information are downloaded over the structured P2P network from the host where the service is deployed. A Service Proxy delegates service invocations to an abstract protocol adaptor framework that uses dynamic invocation mechanisms to provide a protocol-independent execution of remote services, e.g., over GIOP/IIOP or SOAP. This allows us to specify binding- and port-agnostic service compositions in BPEL using abstract WSDL and our service identifiers. To validate our approach, we extended the ActiveBPEL workflow engine to support the discovery and consumption of services using our P2P middleware and the abstract protocol adaptor.
Review: publication des proxy dans la DHT
BibTeX:
@inproceedings{Dahlem2005,
  author = {Dominik Dahlem and David McKitterick and Lotte Nickel and Jim Dowling and Bartek Biskupski and René Meier},
  title = {Binding- and Port-Agnostic Service Composition using a P2P SOA},
  booktitle = {International Workshop on Dynamic Web Processes DWP 2005, at ICSOC 2005},
  publisher = {IBM T.J. Watson Research Center},
  year = {2005},
  pages = {61--72},
  url = {https://www.cs.tcd.ie/publications/tech-reports/reports.06/TCD-CS-2006-13.pdf}
}
DAVID, P.-C. (2005), "Développement de composants Fractal adaptatifs : un langage dédié à l'aspect d'adaptation". School: Ecole des Mines de Nantes.
BibTeX:
@phdthesis{DAVID2005,
  author = {Pierre-Charles DAVID},
  title = {Développement de composants Fractal adaptatifs : un langage dédié à l'aspect d'adaptation},
  school = {Ecole des Mines de Nantes},
  year = {2005}
}
El-Ansary, S. & Haridi, S. (2005), "An Overview of Structured Overlay Networks", In Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks.
BibTeX:
@inbook{El-Ansary2005,
  author = {El-Ansary, Sameh and Haridi, Seif},
  title = {An Overview of Structured Overlay Networks},
  booktitle = {Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks},
  year = {2005},
  url = {http://eprints.sics.se/237/01/elansary-singlespaced.pdf}
}
Frénot, S. & Royon, Y. (2005), "Component deployment using a peer-to-peer overlay", In Working Conference on Component Deployment. Grenoble France. November 2005.
BibTeX:
@inproceedings{Fr'enot2005,
  author = {S. Frénot and Y. Royon},
  title = {Component deployment using a peer-to-peer overlay},
  booktitle = {Working Conference on Component Deployment},
  year = {2005}
}
Gaeta, A., Gaeta, M. & Ritrovato, P. (2005), "Towards a Domain Specific Application Development Environment for the ELeGI architecture: the Software Factories approach", In ELeGI Conference. BCS.
BibTeX:
@inproceedings{Gaeta2005,
  author = {Angelo Gaeta and Matteo Gaeta and Pierluigi Ritrovato},
  title = {Towards a Domain Specific Application Development Environment for the ELeGI architecture: the Software Factories approach},
  booktitle = {ELeGI Conference},
  publisher = {BCS},
  year = {2005},
  url = {http://ewic.bcs.org/conferences/2005/1stelegi/session2/paper6.htm}
}
Gehlen, G. & Pham, L. (2005), "Mobile Web Services for Peer-to-Peer Applications", In Proceedings of the Consumer Communications and Networking Conference 2005. Las Vegas, USA. January 2005., pp. 7.
BibTeX:
@inproceedings{Gehlen2005,
  author = {Guido Gehlen and Linh Pham},
  title = {Mobile Web Services for Peer-to-Peer Applications},
  booktitle = {Proceedings of the Consumer Communications and Networking Conference 2005},
  year = {2005},
  pages = {7},
  url = {http://www.comnets.rwth-aachen.de/guge-pub.html}
}
Hérault, C. (2005), "Adaptabilité des Services Techniques dans le Modèle à Composants", June~23, 2005. HAL - CCSd - CNRS.
Abstract: Le développement des applications distribuées, amenées de plus en plus à s'exécuter sur des machines aux caractéristiques hétérogènes, tend à se complexifier. Le modèle à composants apporte une réponse à ce problème en favorisant la réutilisabilité du code. Par ailleurs, les services techniques, offerts par les plates-formes à composants, allègent le code source et améliorent la qualité de service. Cependant, ces services techniques, concus pour une exécution statique sur des machines serveurs, ne s'adaptent pas à d'autres contextes d'exécution. Leur développement sous forme d'objet notoire empêche leur adaptation. De plus, l'ensemble des services techniques fournis par la plate-forme à composants est figé. La première contribution de cette thèse consiste à définir un modèle de conception et de développement des services techniques basé sur le modèle à composants Fractal. Ce processus aboutit à la définition de personnalités d'un service (P1S) répondant chacune à un contexte d'utilisation, ainsi qu'à une redéfinition de l'assemblage formé par l'application et ses services techniques. Notre seconde contribution est un service de gestion de l'adaptation des services techniques qui permet de détecter les changements d'environnement d'exécution grâce à un moniteur, de localiser les services techniques et d'identifier la personnalité la plus adaptée au nouvel environnement grâce à un annuaire dédié aux services techniques. La faisabilité de nos propositions a été validée à travers la conception et l'implantation d'un service transactionnel multi-personnalités ainsi que l'implantation du système de gestion de l'adaptation.
BibTeX:
@phdthesis{H'erault2005,
  author = {Colombe Hérault},
  title = {Adaptabilité des Services Techniques dans le Modèle à Composants},
  publisher = {HAL - CCSd - CNRS},
  year = {2005},
  url = {http://tel.ccsd.cnrs.fr/tel-00011680/en/; http://hal.ccsd.cnrs.fr/docs/00/05/98/05/PDF/C_Herault_These.pdf}
}
Klint, P., Lämmel, R. & Verhoef, C. (2005), "Toward an engineering discipline for grammarware", ACM Trans. Softw. Eng. Methodol.. New York, NY, USA Vol. 14(3), pp. 331-380. ACM.
Abstract: Grammarware comprises grammars and all grammar-dependent software. The term grammar is meant here in the sense of all established grammar formalisms and grammar notations including context-free grammars, class dictionaries, and XML schemas as well as some forms of tree and graph grammars. The term grammar-dependent software refers to all software that involves grammar knowledge in an essential manner. Archetypal examples of grammar-dependent software are parsers, program converters, and XML document processors. Despite the pervasive role of grammars in software systems, the engineering aspects of grammarware are insufficiently understood. We lay out an agenda that is meant to promote research on increasing the productivity of grammarware development and on improving the quality of grammarware. To this end, we identify the problems with the current grammarware practices, the barriers that currently hamper research, and the promises of an engineering discipline for grammarware, its principles, and the research challenges that have to be addressed.
BibTeX:
@article{Klint2005,
  author = {Klint,, Paul and Lämmel,, Ralf and Verhoef,, Chris},
  title = {Toward an engineering discipline for grammarware},
  journal = {ACM Trans. Softw. Eng. Methodol.},
  publisher = {ACM},
  year = {2005},
  volume = {14},
  number = {3},
  pages = {331--380},
  doi = {http://doi.acm.org/10.1145/1072997.1073000}
}
Loo, B.T., Condie, T., Hellerstein, J.M., Maniatis, P., Roscoe, T. & Stoica, I. (2005), "Implementing declarative overlays", In SOSP., pp. 75-90. ACM.
Abstract: Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building and adapting these overlays to the intended application and the target environment is a difficult and time consuming process.To ease the development and the deployment of such overlay networks we have implemented P2, a system that uses a declarative logic language to express overlay networks in a highly compact and reusable form. P2 can express a Narada-style mesh network in 16 rules, and the Chord structured overlay in only 47 rules. P2 directly parses and executes such specifications using a dataflow architecture to construct and maintain overlay networks. We describe the P2 approach, how our implementation works, and show by experiment its promising trade-off point between specification complexity and performance.
Review: Utlise un langage logique pour decrire les protocoles. (datalog)

Fait reference a MACEDON et RTAG

Attribute grammar

BibTeX:
@inproceedings{Loo2005,
  author = {Boon Thau Loo and Tyson Condie and Joseph M. Hellerstein and Petros Maniatis and Timothy Roscoe and Ion Stoica},
  title = {Implementing declarative overlays},
  booktitle = {SOSP},
  publisher = {ACM},
  year = {2005},
  pages = {75--90},
  url = {http://doi.acm.org/10.1145/1095810.1095818}
}
Massoulié, L., Kermarrec, A.-M. & Ganesh, A.J. (2005), "Efficient application-level multicast on a network-aware self-organizing overlay". INRIA, February, 2005.
Abstract: The growth of peer-to-peer applications on the Internet motivates interest in general purpose overlay networks. The construction of overlays connecting a large population of transient nodes poses several challenges. First, connections in the overlay should reflect the underlying network topology, in order to avoid overloading the network and to allow good application performance. Second, connectivity among active nodes of the overlay should be maintained, even in the presence of high failure rates or when a large proportion of nodes is not active. Finally, the cost of using the overlay should be spread evenly among peer nodes for fairness reasons as well as for the sake of application performance. To preserve scalability, we seek solutions to these issues that can be implemented in a fully decentralized manner and rely only on local knowledge from each node. In this paper, we propose an algorithm called the Localiser
BibTeX:
@techreport{Massoulie2005,
  author = {Laurent Massoulié and Anne-Marie Kermarrec and Ayalvadi J. Ganesh},
  title = {Efficient application-level multicast on a network-aware self-organizing overlay},
  publisher = {HAL - CCSd - CNRS},
  year = {2005},
  url = {http://hal.inria.fr/inria-00070505/en/; http://hal.ccsd.cnrs.fr/docs/00/07/05/05/PDF/RR-5502.pdf}
}
Maximilien, E.M. & Singh, M.P. (2005), "Toward Web Services Interaction Styles", Services Computing, IEEE International Conference on. Los Alamitos, CA, USA Vol. 1, pp. 147-154. IEEE Computer Society.
Abstract: Service-Oriented Architectures (SOAs) are fundamentally changing the way in which we conceptualize and design business applications. An SOA-based application typically composes various distributed functions, including some possibly provided by external parties such as independent businesses. The key advantage of SOAs is the resulting dynamism, since the composed parts can be readily swapped out in favor of others of like functionality. SOA environments thus reflect the dynamism of human socioeconomic environments where businesses interact, collaborate, and expose services to each other in order to jointly create value. This paper presents a multiagent model for Web services and catalogs architectural styles that are key for SOA applications. It conceptually evaluates the styles by showing the kinds of service usages and the resulting dynamic interactions that they enable.
Review: patron de concept pour les web-services
BibTeX:
@article{Maximilien2005,
  author = {E. Michael Maximilien and Munindar P. Singh},
  title = {Toward Web Services Interaction Styles},
  journal = {Services Computing, IEEE International Conference on},
  publisher = {IEEE Computer Society},
  year = {2005},
  volume = {1},
  pages = {147-154},
  doi = {http://doi.ieeecomputersociety.org/10.1109/SCC.2005.101}
}
MENGA, D. & D'HOOGE, M. (2005), "OSGi et UPnP Des technologies complémentaires", Creative Commons « BY-SA ».
BibTeX:
@misc{MENGA2005,
  author = {David MENGA and Michel D'HOOGE},
  title = {OSGi et UPnP Des technologies complémentaires},
  howpublished = {Creative Commons « BY-SA »},
  year = {2005}
}
Merideth, M.G., Iyengar, A., Mikalsen, T., Tai, S., Rouvellou, I. & Narasimhan, P. (2005), "Thema: Byzantine-Fault-Tolerant Middleware for Web-Service Applications", Reliable Distributed Systems, IEEE Symposium on. Los Alamitos, CA, USA Vol. 0, pp. 131-142. IEEE Computer Society.
Abstract: Distributed applications composed of collections of Web Services may call for diverse levels of reliability in different parts of the system. Byzantine fault tolerance (BFT) is a general strategy that has recently been shown to be practical for the development of certain classes of survivable, client-server, distributed applications; however, little research has been done on incorporating it into selective parts of multi-tier, distributed applications like Web Services that have heterogeneous reliability requirements. To understand the impacts of combining BFT and Web Services, we have created Thema, a new BFT middleware system that extends the BFT and Web Services technologies to provide a structured way to build Byzantine-fault-tolerant, survivable Web Services that application developers can use like other Web Services. From a reliability perspective, our enhancements are also novel in that they allow Byzantine-fault-tolerant services: (1) to support the multi-tiered requirements of Web Services, and (2) to provide standardized Web Services support for their own clients (through WSDL interfaces and SOAP communication). In this paper we study key architectural implications of combining BFT with Web services and provide a performance evaluation of Thema using the TPC-W benchmark.
BibTeX:
@article{Merideth2005,
  author = {Michael G. Merideth and Arun Iyengar and Thomas Mikalsen and Stefan Tai and Isabelle Rouvellou and Priya Narasimhan},
  title = {Thema: Byzantine-Fault-Tolerant Middleware for Web-Service Applications},
  journal = {Reliable Distributed Systems, IEEE Symposium on},
  publisher = {IEEE Computer Society},
  year = {2005},
  volume = {0},
  pages = {131-142},
  doi = {http://doi.ieeecomputersociety.org/10.1109/RELDIS.2005.28}
}
Nicoara, A. & Alonso, G. (2005), "Dynamic AOP with PROSE", In CAiSE Workshops (2)., pp. 125-138. FEUP Edicões, Porto.
BibTeX:
@inproceedings{Nicoara2005,
  author = {Angela Nicoara and Gustavo Alonso},
  title = {Dynamic AOP with PROSE},
  booktitle = {CAiSE Workshops (2)},
  publisher = {FEUP Edicões, Porto},
  year = {2005},
  pages = {125--138}
}
Parigot, D. & Courbis, C. (2005), "Domain-Driven Development: the SmartTools Software Factory ". INRIA, Technical Report RR-5588, July, 2005.
BibTeX:
@techreport{Parigot2005,
  author = {Didier Parigot and Carine Courbis},
  title = {Domain-Driven Development: the SmartTools Software Factory },
  year = {2005},
  number = {RR-5588},
  url = {http://www.inria.fr/rrrt/rr-5588.html}
}
Pavel, S., Noyé, J., Poizat, P. & Royer, J.-C. (2005), "A Java Implementation of a Component Model with Explicit Symbolic Protocols". Ecole des Mines de Nantes-INRIA,LINA, 2005.
BibTeX:
@techreport{Pavel2005,
  author = {Sebastian Pavel and Jacques Noyé and Pascal Poizat and Jean-Claude Royer},
  title = {A Java Implementation of a Component Model with Explicit Symbolic Protocols},
  booktitle = {Software Composition},
  year = {2005},
  pages = {115-124}
}
Rubén Mondéjar, Pedro García, C.P. & Skármeta, A.F.G. (2005), "Towards a Decentralized p2pWeb Service Oriented Architecture". Universitat Rovira i Virgili Tarragona, 2005.
BibTeX:
@techreport{RubenMondejar2005,
  author = {Rubén Mondéjar, Pedro García, Carles Pairot and Antonio F. Gómez Skármeta},
  title = {Towards a Decentralized p2pWeb Service Oriented Architecture},
  year = {2005}
}
Singh, M.P. & Vouk, M.A. (2005), "Service-Oriented Computing", In Semantics, Processes, Agents. Wiley.
BibTeX:
@article{Singh2005,
  author = {Munindar P. Singh and Mladen A. Vouk},
  title = {Service-Oriented Computing},
  booktitle = {Semantics, Processes, Agents},
  publisher = {Wiley},
  year = {2005}
}
Stéphane Frénot, Y.R. (2005), "Component deployment using a peer-to-peer overlay", Component Deployment 05.
BibTeX:
@misc{StephaneFrenot2005,
  author = {Stéphane Frénot, Yvan Royon},
  title = {Component deployment using a peer-to-peer overlay},
  howpublished = {Component Deployment 05},
  year = {2005},
  note = {CITI Lab INRIA Ares}
}
Sterritt, R., Parashar, M., Tianfield, H. & Unland, R. (2005), "A concise introduction to autonomic computing", Advanced Engineering Informatics. Vol. 19(3), pp. 181-187.
BibTeX:
@article{Sterritt2005,
  author = {Roy Sterritt and Manish Parashar and Huaglory Tianfield and Rainer Unland},
  title = {A concise introduction to autonomic computing},
  journal = {Advanced Engineering Informatics},
  year = {2005},
  volume = {19},
  number = {3},
  pages = {181--187},
  url = {http://dx.doi.org/10.1016/j.aei.2005.05.012}
}
Tharam S. Dillon, C.W. & Chang, E. (2005), "Reference Architectural Styles for Service-Oriented Computing". Curtin University of Technology, 2005.
BibTeX:
@techreport{TharamS.Dillon2005,
  author = {Tharam S. Dillon, Chen Wu, and Elizabeth Chang},
  title = {Reference Architectural Styles for Service-Oriented Computing},
  year = {2005}
}
Vallée, M., Ramparany, F. & Vercouter, L. (2005), "Flexible Composition of Smart Device Services", In PSC., pp. 165-171. CSREA Press.
BibTeX:
@inproceedings{Vall'ee2005,
  author = {Mathieu Vallée and Fano Ramparany and Laurent Vercouter},
  title = {Flexible Composition of Smart Device Services},
  booktitle = {PSC},
  publisher = {CSREA Press},
  year = {2005},
  pages = {165--171}
}
Winter, E., Reinefeld, A., Coupaye, T., Haridi, S., Stefani, J.-B., Ghodsi, A., Roy, P.V. & Yap, R.H. (2005), "Self Management of Large-Scale Distributed Systems by Combining Structured Overlay Networks and Components", In Proceedings of CoreGRID Integration Workshop. Pisa, Italy., pp. 10.
BibTeX:
@inproceedings{Winter2005,
  author = {Ehrhard Winter and Alexander Reinefeld and Thierry Coupaye and Seif Haridi and Jean-Bernard Stefani and Ali Ghodsi and Peter Van Roy and Roland H.C. Yap},
  title = {Self Management of Large-Scale Distributed Systems by Combining Structured Overlay Networks and Components},
  booktitle = {Proceedings of CoreGRID Integration Workshop},
  year = {2005},
  pages = {10},
  url = {http://eprints.sics.se/248/01/selfman.pdf}
}
Woong, J. (2005), "Ubiquitous Computing and Service Oriented Architecture: Concepts , Paradigm and Future".
BibTeX:
@misc{Woong2005,
  author = {Ji Woong},
  title = {Ubiquitous Computing and Service Oriented Architecture: Concepts , Paradigm and Future},
  year = {2005}
}
Xiao-lin, J., Zheng, Q., Jian, H. & Fan, Y. (2005), "A distributed software architecture design framework based on attributed grammar", Journal of Zhejiang University - Science A., 06, 2005. Vol. 6(6), pp. 513-518.
Abstract: Abstract~~Software architectures shift the focus of developers from lines-of-code to coarser-grained architectural elements and their overall interconnection structure. There are, however, many features of the distributed software that make the developing methods of distributed software quite different from the traditional ways. Furthermore, the traditional centralized ways with fixed interfaces cannot adapt to the flexible requirements of distributed software. In this paper, the attributed grammar (AG) is extended to refine the characters of distributed software, and a distributed software architecture description language (DSADL) based on attributed grammar is introduced, and then a model of integrated environment for software architecture design is proposed. It can be demonstrated by the practice that DSADL can help the programmers to analyze and design distributed software effectively, so the efficiency of the development can be improved greatly.
BibTeX:
@article{Xiao-lin2005,
  author = {Xiao-lin, Jia and Zheng, Qin and Jian, He and Fan, Yu},
  title = {A distributed software architecture design framework based on attributed grammar},
  journal = {Journal of Zhejiang University - Science A},
  year = {2005},
  volume = {6},
  number = {6},
  pages = {513--518},
  url = {http://dx.doi.org/10.1007/BF02841758}
}
Bruneton, E., Coupaye, T., Leclercq, M., Quéma, V. & Stefani, J.-B. (2004), "An Open Component Model and Its Support in Java", In CBSE. Volume 3054, pp. 7-22. Springer.
Review: present leur slution pour les mixins.
BibTeX:
@inproceedings{Bruneton2004,
  author = {Eric Bruneton and Thierry Coupaye and Matthieu Leclercq and Vivien Quéma and Jean-Bernard Stefani},
  title = {An Open Component Model and Its Support in Java},
  booktitle = {CBSE},
  publisher = {Springer},
  year = {2004},
  volume = {3054},
  pages = {7--22},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3054&spage=7}
}
Courbis, C., Degenne, P., Fau, A. & Parigot, D. (2004), "Un modèle abstrait de composants adaptables", revue TSI, Composants et adaptabilité. Vol. 23(2) Hermès Sciences.
Abstract: Since a few years, the component approach for the design of complex software has appeared to help to solve problems of code repartition, deployment and reusability. This approach turns out to match the best result which ensures application evolution, interoperability and maintenance. This article introduces the component model used to implement an Integrated Development Environment. The salient feature of this model is that it is extensible and transposable into well-known models such as Web-Services, CORBA Component Model or EJB. The validity of this model has been assessed as it was used to implement our tool. This pragmatic approach was helpful for us to design an simple and realistic component model.
BibTeX:
@article{Courbis2004,
  author = {Carine Courbis and Pascal Degenne and Alexandre Fau and Didier Parigot},
  title = {Un modèle abstrait de composants adaptables},
  journal = {revue TSI, Composants et adaptabilité},
  publisher = {Hermès Sciences},
  year = {2004},
  volume = {23},
  number = {2},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/smartcompo02.ps}
}
Courbis, C. & Finkelstein, A. (2004), "Towards an Aspect Weaving BPEL engine", In ACP4IS: Aspects, Components, and Patterns for Infrastructure Software. March 2004.
BibTeX:
@inproceedings{Courbis2004a,
  author = {Carine Courbis and Anthony Finkelstein},
  title = {Towards an Aspect Weaving BPEL engine},
  booktitle = {ACP4IS: Aspects, Components, and Patterns for Infrastructure Software},
  year = {2004},
  url = {http://www.cs.uvic.ca/~ycoady/acp4is04/papers0-1036597838.pdf}
}
Crespo, A. & Garcia-Molina, H. (2004), "Semantic Overlay Networks for P2P Systems", In AP2PC. Volume 3601, pp. 1-13. Springer.
Abstract: In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding tends to be very expensive. We propose that node connections be influenced by content, so that for example, nodes having many “Jazz” files will connect to other similar nodes. Thus, semantically related nodes form a Semantic Overlay Network (SON). Queries are routed to the appropriate SONs, increasing the chances that matching files will be found quickly, and reducing the search load on nodes that have unrelated content. We have evaluated SONs by using an actual snapshot of music-sharing clients. Our results show that SONs can significantly improve query performance while at the same time allowing users to decide what content to put in their computers and to whom to connect.
BibTeX:
@inproceedings{Crespo2004,
  author = {Arturo Crespo and Hector Garcia-Molina},
  title = {Semantic Overlay Networks for P2P Systems},
  booktitle = {AP2PC},
  publisher = {Springer},
  year = {2004},
  volume = {3601},
  pages = {1--13},
  url = {http://dx.doi.org/10.1007/11574781_1}
}
Defude, B. (2004), "Gestion de données dans les systèmes pair-à-pair".
BibTeX:
@misc{Defude2004,
  author = {Bruno Defude},
  title = {Gestion de données dans les systèmes pair-à-pair},
  year = {2004},
  note = {cours}
}
Donsez, D., Cervantes, H. & Désertot, M. (2004), "FROGi : Déploiement de composants Fractal sur OSGi". July, 2004.
Abstract: Cet article présente FROGi, une proposition visant à introduire le modèle à composants Fractal à l'intérieur de la plateforme de services OSGi. La motivation derrière ce travail est double. D'un côté, FROGi offre aux développeurs de services OSGi un modèle à composants extensibles qui facilite le développement des bundles ; ces derniers restent toutefois compatibles avec les bundles "patrimoniaux". D'un autre côté, FROGi bénéficie de l'infrastructure de déploiement que représente OSGi et qui facilite la réalisation du conditionnement et du déploiement de composants Fractal. Dans FROGi, une application Fractal est conditionnée sous la forme d'un ou plusieurs bundles et elle peut être déployée de facon partielle et les activités de déploiement peuvent avoir lieu de facon continue. ----------This paper presents FROGi, a proposal to introduce the Fractal component model into the OSGi services platform. There are two motivations for this work. The first one is to offer a flexible component model to the OSGi developers to simplify bundle development. Bundles developed with FROGi are nevertheless compatible with standard bundles. The second motivation is to leverage OSGi's deployment capabilities to package and deploy Fractal components. In FROGi, a Fractal application is packaged and delivered as a set of OSGi bundles; such an application supports partial deployment and additionally, deployment activities can occur continuously.
BibTeX:
@misc{Donsez2004,
  author = {Didier Donsez and Humberto Cervantes and Mikael Désertot},
  title = {FROGi : Déploiement de composants Fractal sur OSGi},
  publisher = {HAL - CCSd - CNRS},
  year = {2004},
  url = {http://hal.ccsd.cnrs.fr/docs/00/02/75/54/PDF/13.pdf; http://hal.ccsd.cnrs.fr/docs/00/02/75/54/ANNEX/Slide%3AMikael_Desertot.pdf; http://hal.ccsd.cnrs.fr/docs/00/02/75/54/ANNEX/Video%3AMikael_Desertot.avi}
}
Frénot, S. (2004), "Gestion du déploiement de composants sur réseau P2P". , 2004.
Abstract: The deployment of component-based applications relies on a centralized directory to store the components. This paper describes an approach to distribute software components to be deployed on a set of peers of a peer to peer network in order to exploit some associated characteristics (load balancing, fault-tolerance, self-organisation). The proposed architecture is situated in the context of OSGI application deployment management. The software components (bundles) are distributed among a set of nodes participating in the execution of services. When a node wants to install a component which is not deployed locally, the component is looked for and installed using a p2p network. Le déploiement d'applications à composants repose sur une approche d'annuaire centralisé de stockage des composants. Cet article décrit une approche pour distribuer les composants logiciels à déployer sur un ensemble de noeuds d'un réseau pair-à-pair afin de pouvoir exploiter certaines caractéristiques associées (équilibrage de charge, tolérance de panne, auto-organisation). L'architecture proposée entre dans le cadre de la gestion du déploiement d'applications sur le modèle OSGi. Les composants logiciels (ou bundles) sont répartis à travers un ensemble de noeuds participant à l'exécution de services. Lorsqu'un noeud veut installer un composant et si celui-ci n'est pas encore déployé localement, il est recherché et installé en utilisant un réseau p2p
BibTeX:
@techreport{Frenot2004,
  author = {Frénot, Stéphane},
  title = {Gestion du déploiement de composants sur réseau P2P},
  booktitle = {DECOR04 },
  year = {2004},
  pages = {113-124 },
  url = {http://hal.archives-ouvertes.fr/hal-00003288/en/}
}
Galatopoullos, D.G., Funk, A.P. & Manolakos, E.S. (2004), "Integrating Java and Matlab Components into the Same Parallel and Distributed Application Using JavaPorts", In CD-ROM / Abstracts Proceedings 18th International Parallel and Distributed Processing Symposium (18th IPDPS'04). Santa Fe, New Mexico, USA. April 2004. IEEE Computer Society (Los Alamitos, CA).
BibTeX:
@inproceedings{Galatopoullos2004,
  author = {Demetris G. Galatopoullos and Andrew P. Funk and Elias S. Manolakos},
  title = {Integrating Java and Matlab Components into the Same Parallel and Distributed Application Using JavaPorts},
  booktitle = {CD-ROM / Abstracts Proceedings 18th International Parallel and Distributed Processing Symposium (18th IPDPS'04)},
  publisher = {IEEE Computer Society (Los Alamitos, CA)},
  year = {2004},
  url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1302918&isnumber=28950}
}
Gioldasis, N., Pappas, N., Kazasis, F.G., Anestis, G. & Christodoulakis, S. (2004), "A P2P and SOA Infrastructure for Distributed Ontology-Based Knowledge Management", In DELOS Workshop: Digital Library Architectures., pp. 93-104. Edizioni Libreria Progetto, Padova.
BibTeX:
@inproceedings{Gioldasis2004,
  author = {Nektarios Gioldasis and Nikos Pappas and Fotis G. Kazasis and George Anestis and Stavros Christodoulakis},
  title = {A P2P and SOA Infrastructure for Distributed Ontology-Based Knowledge Management},
  booktitle = {DELOS Workshop: Digital Library Architectures},
  publisher = {Edizioni Libreria Progetto, Padova},
  year = {2004},
  pages = {93--104}
}
López, P.G., Pairot, C., Mondéjar, R., Ahulló, J.P., Tejedor, H. & Rallo, R. (2004), "PlanetSim: A New Overlay Network Simulation Framework", In SEM. Volume 3437, pp. 123-136. Springer.
BibTeX:
@inproceedings{Lopez2004,
  author = {Pedro García López and Carles Pairot and Rubén Mondéjar and Jordi Pujol Ahulló and Helio Tejedor and Robert Rallo},
  title = {PlanetSim: A New Overlay Network Simulation Framework},
  booktitle = {SEM},
  publisher = {Springer},
  year = {2004},
  volume = {3437},
  pages = {123--136},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3437&spage=123}
}
Mathieu Vallee, F.R. & Vercouter, L. (2004), "Dynamic Service Composition in Ambient Intelligence Environments: a Multi-Agent Approach". France Telecom R&D, 2004.
BibTeX:
@techreport{MathieuVallee2004,
  author = {Mathieu Vallee, Fano Ramparany and Laurent Vercouter},
  title = {Dynamic Service Composition in Ambient Intelligence Environments: a Multi-Agent Approach},
  year = {2004}
}
Mathieu Vallee, F.R. & Vercouter, L. (2004), "Composition Flexible de Services d'Objets Communicants". France Telecom R&D,, 2004.
BibTeX:
@techreport{MathieuVallee2004a,
  author = {Mathieu Vallee, Fano Ramparany and Laurent Vercouter},
  title = {Composition Flexible de Services d'Objets Communicants},
  year = {2004}
}
Parigot, D. (2004), "Towards domain-driven development: the SmartTools software factory", In OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications., pp. 37-38. ACM Press.
BibTeX:
@inproceedings{Parigot2004,
  author = {Didier Parigot},
  title = {Towards domain-driven development: the SmartTools software factory},
  booktitle = {OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications},
  publisher = {ACM Press},
  year = {2004},
  pages = {37--38},
  doi = {http://doi.acm.org/10.1145/1028664.1028685}
}
Parigot, D., Lahire, P. & Courbis, C. (2004), "Towards Domain-Driven Development: Approach and Implementation". INRIA, 2004.
Abstract: With the Internet and the proliferation of new component

and distributive technologies, the design and implementation of complex

applications must take into account standards, code distribution, deploy-

ment of components and reuse of business know-hows. To cope with these

changes, applications need to be more open, adaptable and capable of

evolving.

To accommodate to these new challenges, this paper presents a new de-

velopment approach based on transformations of different business mod-

els, each of them related to one possible concern of the application.

This approach is MDA compliant. It relies on Generative and Compo-

nent Programming and on approaches by separation of concerns (ASoC)

which are adapted for business-model descriptions. It contributes to the

research works on Domain Driven Development and have a fully opera-

tional implementation (SmartTools). It may be compared to a software

factory dedicated to applications which rely on a data model.

The main expected results are i) to build software of better quality thanks

to business models and technology separation, ii) to generate simpler

code, iii) to enable rapid developments and insertions of new facets and

iv) to facilitate the portability of applications towards new technologies

or platforms.

In order to describe our approach, we discuss the SmartTools fea-

tures and provide an example of application which is implemented with

SmartTools.

BibTeX:
@techreport{Parigot2004b,
  author = {Didier Parigot and Philippe Lahire and Carine Courbis},
  title = {Towards Domain-Driven Development: Approach and Implementation},
  year = {2004},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/smartgpce04.ps}
}
Portmann, M., Ardon, S., Sénac, P. & Seneviratne, A. (2004), "PROST: A Programmable Structured Peer-to-Peer Overlay Network", In Peer-to-Peer Computing., pp. 280-281. IEEE Computer Society.
Abstract: In this paper, we present the idea of a programmable structured P2P architecture. Our proposed system allows the key-based routing infrastructure, which is common to all structured P2P overlays, to be shared by multiple applications. Furthermore, our architecture allows the dynamic and on-demand deployment of new applications and services on top of the shared routing layer.
BibTeX:
@inproceedings{Portmann2004,
  author = {Marius Portmann and Sebastien Ardon and Patrick Sénac and Aruna Seneviratne},
  title = {PROST: A Programmable Structured Peer-to-Peer Overlay Network},
  booktitle = {Peer-to-Peer Computing},
  publisher = {IEEE Computer Society},
  year = {2004},
  pages = {280--281},
  url = {http://csdl.computer.org/comp/proceedings/p2p/2004/2156/00/21560280abs.htm}
}
Quéma, V., Balter, R., Bellissard, L., Féliot, D., Freyssinet, A. & Lacourte, S. (2004), "Asynchronous, Hierarchical, and Scalable Deployment of Component-Based Applications", In Component Deployment. Volume 3083, pp. 50-64. Springer.
BibTeX:
@inproceedings{Qu'ema2004,
  author = {Vivien Quéma and Roland Balter and Luc Bellissard and David Féliot and André Freyssinet and Serge Lacourte},
  title = {Asynchronous, Hierarchical, and Scalable Deployment of Component-Based Applications},
  booktitle = {Component Deployment},
  publisher = {Springer},
  year = {2004},
  volume = {3083},
  pages = {50--64},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3083&spage=50}
}
Remi Badonnel, Laurent Andrey, O.F. (2004), "Architecture pour la gestion de la qualit´e de service dans les services Web, reposant sur une extensionm d’un langage de composition". LORIA-INRIA Lorraine, 2004.
BibTeX:
@techreport{RemiBadonnel2004,
  author = {Remi Badonnel, Laurent Andrey, Olivier Festor},
  title = {Architecture pour la gestion de la qualit´e de service dans les services Web, reposant sur une extensionm d’un langage de composition},
  year = {2004}
}
Rodriguez, A., Killian, C.E., Bhat, S., Kostic, D. & Vahdat, A. (2004), "MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks", In NSDI., pp. 267-280. USENIX.
Abstract: Currently, researchers designing and implementing large-scale overlay services employ disparate techniques at each stage in the production cycle: design, implementation, experimentation, and evaluation. As a result, complex and tedious tasks are often duplicated leading to ineffective resource use and difficulty in fairly comparing competing algorithms. In this paper, we present MACEDON, an infrastructure that provides facilities to: i) specify distributed algorithms in a concise domain-specific language; ii) generate code that executes in popular evaluation infrastructures and in live networks; iii) leverage an overlay-generic API to simplify the interoperability of algorithm implementations and applications; and iv) enable consistent experimental evaluation. We have used MACEDON to implement and evaluate a number of algorithms, including AMMO, Bullet, Chord, NICE, Overcast, Pastry, Scribe, and SplitStream, typically with only a few hundred lines of MACEDON code. Using our infrastructure, we are able to accurately reproduce or exceed published results and behavior demonstrated by current publicly available implementations.
BibTeX:
@inproceedings{Rodriguez2004,
  author = {Adolfo Rodriguez and Charles Edwin Killian and Sooraj Bhat and Dejan Kostic and Amin Vahdat},
  title = {MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks},
  booktitle = {NSDI},
  publisher = {USENIX},
  year = {2004},
  pages = {267--280},
  url = {http://www.usenix.org/events/nsdi04/tech/rodriguez.html}
}
Royon, Y., Frénot, S. & Fraboulet, A. (2004), "Approche orientée composant d'une pile réseau". INRIA Rhône-Alpes, Technical Report 0298, 07, 2004.
Abstract: Most of the current application softwares have the ability to communicate via a network,

usually the internet. Such communications are based upon a service provided by the Operating Sys-

tem’s Network Stack.

Our proposition, called Mynus, is a Network Stack based on a component model. Its goals are to

provide reconfigurability, adaptability and fault-tolerance at two levels: the suite of protocols that

define the Network Stack, and the protocols’ inwards.

Besides, although the communications between the Network Stack’s components do have a cost, we

believe it can be compensated. By design, Mynus allows to regroup services that are often provided

at more than one layers - protocol or middleware.

BibTeX:
@techreport{Royon2004,
  author = {Yvan Royon and Stéphane Frénot and Antoine Fraboulet},
  title = {Approche orientée composant d'une pile réseau},
  year = {2004},
  number = {0298},
  url = {http://hal.ccsd.cnrs.fr/docs/00/06/98/82/PDF/RT-0298.pdf}
}
Schmidt, C. & Parashar, M. (2004), "A peer-to-peer approach to web service discovery", World Wide Web. Vol. 7, pp. 211-229.
Abstract: Web Services are emerging as a dominant paradigm for constructing and composing distributed business applications and enabling enterprise-wide interoperability. A critical factor to the overall utility of Web Services is a scalable, flexible and robust discovery mechanism. This paper presents a Peer-to-Peer (P2P) indexing system and associated P2P storage that supports large-scale, decentralized, real-time search capabilities. The presented system supports complex queries containing partial keywords and wildcards. Furthermore, it guarantees that all existing data elements matching a query will be found with bounded costs in terms of number of messages and number of nodes involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design and an experimental evaluation of the system are presented.
BibTeX:
@article{Schmidt2004,
  author = {Cristina Schmidt and Manish Parashar},
  title = {A peer-to-peer approach to web service discovery},
  journal = {World Wide Web},
  year = {2004},
  volume = {7},
  pages = {211--229},
  url = {http://dx.doi.org/10.1023/B:WWWJ.0000017210.55153.3d}
}
Schuschel, H. & Weske, M. (2004), "Automated planning in a service-oriented architecture", In In: 13th International IEEE Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE. Society Press.
Abstract: Service-oriented computing is a new paradigm to improve the performance of information systems in environments demanding for flexibility and interconnectivity. Additionally, the support of intra- and inter-organizational processes has become crucial for the competitiveness of companies. Recent research approaches propagate to plan processes automatically to improve quality and flexibility. This paper discusses the application of AI planning for service composition in a service-oriented architecture. Three alternative levels of abstraction for service descriptions are defined and their impact on automated planning is investigated in regard to the provider and requestor role of service composers. It is shown that different abstraction levels of service descriptions are necessary to take full advantage of AI planning in a service-oriented architecture.
BibTeX:
@inproceedings{Schuschel2004,
  author = {Hilmar Schuschel and Mathias Weske},
  title = {Automated planning in a service-oriented architecture},
  booktitle = {In: 13th International IEEE Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE},
  publisher = {Society Press},
  year = {2004},
  url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1376813&isnumber=30049}
}
Souchon, F., Vauttier, S., Urtado, C. & Dony, C. (2004), "Fiabilité des applications multi-agents : le système de gestion d'exceptions SaGE". , 2004.
Abstract: Les paradigmes de développement à base de composants et d'agents répondent aux tendances actuelles du développement d'applications par intégration d'élèments logiciels distribués sur de nombreux systèmes. Les systèmes multi-agents (SMA) proposent des mécanismes qui permettent de gérer des systèmes ouverts et dynamiques, les agents étant des entités actives, dotées de capacités de communication évoluées, capables d'établir seules des collaborations avec d'autres agents. Malheureusement, les SMAs n'offrent pas le même support que les systèmes à base de composants pour assurer la rigueur du développement et la fiabilité de l'exécution. Ainsi, peu de SMAs intègrent un système de gestion d'exceptions (SGE) dédié et aucun de ces SGE, à notre connaissance, ne respecte toutes les caractéristiques du paradigme agent (autonomie des agents, concurrence coopérative). Cet article présente SaGE, une proposition de système de gestion d'exceptions dédiée aux systèmes multi-agents, que nous avons imptémentée et testée dans la plateforme MADKit.
BibTeX:
@techreport{Souchon2004,
  author = {Frédéric Souchon and Sylvain Vauttier and Christelle Urtado and Christophe Dony},
  title = {Fiabilité des applications multi-agents : le système de gestion d'exceptions SaGE},
  publisher = {HAL - CCSd - CNRS},
  year = {2004},
  url = {http://hal.ccsd.cnrs.fr/docs/00/03/82/27/PDF/Souchon-JFSMA04.pdf}
}
Torsten Braun, Vijay Arya, T.T. (2004), "Explicit Routing in Multicast Overlay Networks". INRIA, Technical Report 5397, Novembre, 2004.
BibTeX:
@techreport{TorstenBraun2004,
  author = {Torsten Braun, Vijay Arya, Thierry Turletti},
  title = {Explicit Routing in Multicast Overlay Networks},
  year = {2004},
  number = {5397}
}
Valetto, G. & Saffre, F. (2004), "Panel Report: "Grand Challenges of Network and Service Composition"", In WAC. Volume 3457, pp. 271-274. Springer.
Abstract: This brief report intends to summarize some of the things we learned during WAC2004 sessions “Network Composition” and “Negotiation and Deployment”, and that were highlighted during the subsequent panel discussion. We try to focus especially on the following aspects: traits and trends of convergence emerging from the rather diverse findings presented in those sessions; controversial or divergent opinions on some of those findings; open issues that should be addressed by the autonomic communication community and how to tackle them; and major research directions that seem likely to emerge and shape a significant part of the autonomic communication landscape.
BibTeX:
@inproceedings{Valetto2004,
  author = {Giuseppe Valetto and Fabrice Saffre},
  title = {Panel Report: "Grand Challenges of Network and Service Composition"},
  booktitle = {WAC},
  publisher = {Springer},
  year = {2004},
  volume = {3457},
  pages = {271--274},
  url = {http://dx.doi.org/10.1007/11520184_22}
}
Alexis Drogoul, Diane Vanbergue, T.M. (2003), "Simulation Orientée Agent: où sont les agents ?". LIP6 Université Paris 6, 2003.
BibTeX:
@techreport{AlexisDrogoul2003,
  author = {Alexis Drogoul, Diane Vanbergue, Thomas Meurisse},
  title = {Simulation Orientée Agent: où sont les agents ?},
  year = {2003}
}
Courbis, C. & Parigot, D. (2003), "La programmation générative pour le développement d'applications : les apports pour l'architecture", In ICSSEA'03. Decembre 2003.
BibTeX:
@inproceedings{Courbis2003,
  author = {Carine Courbis and Didier Parigot},
  title = {La programmation générative pour le développement d'applications : les apports pour l'architecture},
  booktitle = {ICSSEA'03},
  year = {2003},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/ICSSEA03.doc}
}
Courbis, C., Degenne, P., Fau, A. & Parigot, D. (2003), "L'apport des technologies XML et Objets pour un générateur d'environnements~:~SmartTools", revue L'Objet, numéro spécial XML et les objets. Vol. 9(3) Hermès Sciences.
Abstract: SmartTools est un générateur d'environnements de développement fortement fondé sur les technologies objets et XML. Grâce à une technique de génération automatique à partir de spécifications, SmartTools permet de développer très rapidement des environnements spécialisés pour des langages de programmation ou des langages métiers. En particulier, certaines de ces spécifications sont directement issues des technologies W3C, ce qui ouvre, des perspectives innombrables et variées de langages métiers. D'autre part, SmartTools s'appuie sur les technologies objets: utilisation des ``visitor patterns'', programmation par aspects, distribution des objets et composants, et implantation en Java. Les avantages de ces technologies permettent de proposer, à moindre coût, une plate-forme de développement ouverte, interactive, uniforme, et évolutive.
BibTeX:
@article{Courbis2003a,
  author = {Carine Courbis and Pascal Degenne and Alexandre Fau and Didier Parigot},
  title = {L'apport des technologies XML et Objets pour un générateur d'environnements~:~SmartTools},
  journal = {revue L'Objet, numéro spécial XML et les objets},
  publisher = {Hermès Sciences},
  year = {2003},
  volume = {9},
  number = {3},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/smartobjet02.ps}
}
Courbis, C., Lahire, P. & Parigot, D. (2003), "To Build Open and Evolutive Applications: an Approach based on MDA and Generative Programming". INRIA, 2003.
BibTeX:
@techreport{Courbis2003b,
  author = {Carine Courbis and Philippe Lahire and Didier Parigot},
  title = {To Build Open and Evolutive Applications: an Approach based on MDA and Generative Programming},
  year = {2003},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/smarticse04.ps}
}
Courbis, C. & Parigot, D. (2003), "XML technologies in the SmartTools Software Factory". INRIA, 2003.
BibTeX:
@techreport{Courbis2003c,
  author = {Carine Courbis and Didier Parigot},
  title = {XML technologies in the SmartTools Software Factory},
  year = {2003},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/smartwww04.ps}
}
Courbis, C. & Parigot, D. (2003), "Different ways of using Generative Programming to develop an application". INRIA, 2003.
BibTeX:
@techreport{Courbis2003d,
  author = {Carine Courbis and Didier Parigot},
  title = {Different ways of using Generative Programming to develop an application},
  year = {2003},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/smart3d03.ps}
}
Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J. & Stoica, I. (2003), "Towards a common API for structured peer-to-peer overlays".
Abstract: In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate independent innovation in overlay protocols, services, and applications, to allow direct experimental comparisons, and to encourage application development by third parties. We provide a snapshot of our efforts and discuss open problems in an effort to solicit feedback from the research community.
BibTeX:
@inproceedings{Dabek2003,
  author = {Frank Dabek and Ben Zhao and Peter Druschel and John Kubiatowicz and Ion Stoica},
  title = {Towards a common API for structured peer-to-peer overlays},
  year = {2003},
  url = {http://www.springerlink.com/content/r9p1gmyek16kfklq/}
}
Georgé, J.-P. (2003), "The AMAS Theory for Complex Problem Solving based on Self-Organizing Cooperative Agents", In First European Workshop on Multi-Agent Systems (EUMAS�03), Oxford, UK, 18/12/2003-19/12/2003.
Abstract: In this paper, we present an approach for the design of complex adaptive systems, based on adaptive multi-agent systems and emergence. We expound the AMAS theory (Adaptive Multi-Agent Systems) and its technical working. This theory gives local agent design criteria so as to enable the emergence of an organisation within the system and thus, of the global function of the system. We also present the theorem of functional adequacy witch ensures that a cooperative self-organising system performs a suitable work. Applications of this theory in the multi-agent system framework led us to define the architecture and a general algorithm for cooperative agents. The originality of our approach lies in the very generic manner our re-organisation rules work and that they are completely independent from the function the system has to compute.
BibTeX:
@unpublished{Georg'e2003,
  author = {Jean-Pierre Georgé},
  title = {The AMAS Theory for Complex Problem Solving based on Self-Organizing Cooperative Agents},
  booktitle = {First European Workshop on Multi-Agent Systems (EUMAS�03), Oxford, UK, 18/12/2003-19/12/2003},
  year = {2003},
  url = {ftp://ftp.irit.fr/pub/IRIT/SMAC/DOCUMENTS/PUBLIS/AMASEumas2003.pdf}
}
Glässer, U., Gotzhein, R. & Prinz, A. (2003), "The formal semantics of SDL-2000: Status and perspectives", Computer Networks. Vol. 42(3), pp. 343 - 358.
BibTeX:
@article{Glaesser2003,
  author = {U. Glässer and R. Gotzhein and A. Prinz},
  title = {The formal semantics of SDL-2000: Status and perspectives},
  journal = {Computer Networks},
  year = {2003},
  volume = {42},
  number = {3},
  pages = {343 - 358},
  note = {ITU-T System Design Languages (SDL)},
  url = {http://www.sciencedirect.com/science/article/B6VRG-48FKC55-2/2/fe09d04099c7fcfa0aea1aedabf6d6fa},
  doi = {DOI: 10.1016/S1389-1286(03)00247-0}
}
Hausheer, D. (2003), "An Architecture for a Service Oriented Peer-To-Peer System (SOPPS)". December~13, 2003.
Abstract: Peer-to-peer (p2p) systems have regained much attention during recent years. While this is mostly due to their two main applications filesharing and instant messaging, this paper proposes to create a p2p system with generic support for services of any kind, called SOPPS. Furthermore, it proposes to use market mechanisms to manage these services. In order to provide this functionality and to make full use of key advantages of p2p, SOPPS must fulfill more detailed requirements, which have been investigated in this paper. Three major models found the SOPPS architecture and describe in particular the use of SOPPS, its underlying network, and the architecture of a SOPPS peer. Finally, the application of this architecture as well as of its interfaces are described for a content sharing scenario.
BibTeX:
@misc{Hausheer2003,
  author = {David Hausheer},
  title = {An Architecture for a Service Oriented Peer-To-Peer System (SOPPS)},
  year = {2003},
  url = {http://citeseer.ist.psu.edu/663849.html; http://www.tik.ee.ethz.ch/~gerke/sopps.pdf}
}
Hedin, Gö. & Magnusson, E. (2003), "JastAdd----an aspect-oriented compiler construction system", Science of Computer Programming., April, 2003. Vol. 47(1), pp. 37-58.
Abstract: We describe JastAdd, a Java-based system for compiler construction. JastAdd is centered around an object-oriented representation of the abstract syntax tree where reference variables can be used to link together different parts of the tree. JastAdd supports the combination of declarative techniques (using Reference Attributed Grammars) and imperative techniques (using ordinary Java code) in implementing the compiler. The behavior can be modularized into different aspects, e.g. name analysis, type checking, code generation, etc., that are woven together into classes using aspect-oriented programming techniques, providing a safer and more powerful alternative to the Visitor pattern. The JastAdd system is independent of the underlying parsing technology and supports any noncircular dependencies between computations, thereby allowing general multi-pass compilation. The attribute evaluator (optimal recursive evaluation) is implemented very conveniently using Java classes, interfaces, and virtual methods.
BibTeX:
@article{Hedin2003,
  author = {Görel Hedin and Eva Magnusson},
  title = {JastAdd----an aspect-oriented compiler construction system},
  journal = {Science of Computer Programming},
  year = {2003},
  volume = {47},
  number = {1},
  pages = {37--58},
  url = {http://dx.doi.org/10.1016/S0167-6423(02)00109-0}
}
Kephart, J.O. & Chess, D.M. (2003), "The Vision of Autonomic Computing", IEEE Computer. Vol. 36(1), pp. 41-50.
BibTeX:
@article{Kephart2003,
  author = {Jeffrey O. Kephart and David M. Chess},
  title = {The Vision of Autonomic Computing},
  journal = {IEEE Computer},
  year = {2003},
  volume = {36},
  number = {1},
  pages = {41--50},
  url = {http://computer.org/computer/co2003/r1041abs.htm}
}
Lee, C., Nordstedt, D. & Helal, S. (2003), "Enabling Smart Spaces with OSGi", IEEE Pervasive Computing. Los Alamitos, CA, USA Vol. 2(3), pp. 89-94. IEEE Computer Society.
BibTeX:
@article{Lee2003,
  author = {Choonhwa Lee and David Nordstedt and Sumi Helal},
  title = {Enabling Smart Spaces with OSGi},
  journal = {IEEE Pervasive Computing},
  publisher = {IEEE Computer Society},
  year = {2003},
  volume = {2},
  number = {3},
  pages = {89-94},
  doi = {http://doi.ieeecomputersociety.org/10.1109/MPRV.2003.1228530}
}
Liebeherr, J., Wang, J. & Zhang, G. (2003), "Programming Overlay Networks with Overlay Sockets", In In Proc. 5th COST 264 Workshop on Networked Group Communications (NGC 2003), LNCS 2816., pp. 242-253.
Abstract: The emergence of application-layer overlay networks has inspired the development of new network services and applications. Research on overlay networks has focused on the design of protocols to maintain and forward data in an overlay network, however, less attention has been given to the software development process of building application programs in such an environment. Clearly, the complexity of overlay network protocols calls for suitable application programming interfaces (APIs) and abstractions that do not require detailed knowledge of the overlay protocol, and, thereby, simplify the task of the application programmer. In this paper, we present the concept of an overlay socket as a new programming abstraction that serves as the end point of communication in an overlay network. The overlay socket provides a socket-based API that is independent of the chosen overlay topology, and can be configured to work for different overlay topologies. The overlay socket can support application data transfer over TCP, UDP, or other transport protocols. This paper describes the design of the overlay socket and discusses API and configuration options. The overlay socket has been used to develop a variety of applications, from multicast-file transfer programs, to multicast video streaming systems.
BibTeX:
@inproceedings{Liebeherr2003,
  author = {Jörg Liebeherr and Jianping Wang and Guimin Zhang},
  title = {Programming Overlay Networks with Overlay Sockets},
  booktitle = {In Proc. 5th COST 264 Workshop on Networked Group Communications (NGC 2003), LNCS 2816},
  year = {2003},
  pages = {242--253},
  url = {http://www.cs.virginia.edu/~jorg/archive/papers/ngc2003.pdf}
}
Parigot, D. (2003), "Contribution à la programmation générative". School: HDR, Université de Nice Sophia Antipolis., November, 2003.
BibTeX:
@phdthesis{Parigot2003,
  author = {Didier Parigot},
  title = {Contribution à la programmation générative},
  school = {HDR, Université de Nice Sophia Antipolis},
  year = {2003},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/habilitation.ps.gz}
}
Peschanski, F., Briot, J.-P. & Yonezawa, A. (2003), "Fine-Grained Dynamic Adaptation of Distributed Components", In Middleware. Volume 2672, pp. 123-142. Springer.
BibTeX:
@inproceedings{Peschanski2003,
  author = {Frédéric Peschanski and Jean-Pierre Briot and Akinori Yonezawa},
  title = {Fine-Grained Dynamic Adaptation of Distributed Components},
  booktitle = {Middleware},
  publisher = {Springer},
  year = {2003},
  volume = {2672},
  pages = {123--142},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2672&spage=123}
}
Peterson, L., Anderson, T., Culler, D. & Roscoe, T. (2003), "A blueprint for introducing disruptive technology into the Internet". Princeton University, Technical Report 1, 2003.
Abstract: This paper argues that a new class of geographically distributed network services is emerging, and that the most effective way to design, evaluate, and deploy these services is by using an overlay-based testbed. Unlike conventional network testbeds, however, we advocate an approach that supports both researchers that want to develop new services, and clients that want to use them. This dual use, in turn, suggests four design principles that are not widely supported in existing testbeds: services should be able to run continuously and access a slice of the overlay's resources, control over resources should be distributed, overlay management services should be unbundled and run in their own slices, and APIs should be designed to promote application development. We believe a testbed that supports these design principles will facilitate the emergence of a new service-oriented network architecture. Towards this end, the paper also briefly describes PlanetLab, an overlay network being designed with these four principles in mind.
BibTeX:
@techreport{Peterson2003,
  author = {Peterson,, Larry and Anderson,, Tom and Culler,, David and Roscoe,, Timothy},
  title = {A blueprint for introducing disruptive technology into the Internet},
  journal = {SIGCOMM Comput. Commun. Rev.},
  publisher = {ACM},
  year = {2003},
  volume = {33},
  number = {1},
  pages = {59--64},
  doi = {http://doi.acm.org/10.1145/774763.774772}
}
Pietzuch, P.R., Shand, B. & Bacon, J. (2003), "A Framework for Event Composition in Distributed Systems", In Middleware. Volume 2672, pp. 62-82. Springer.
BibTeX:
@inproceedings{Pietzuch2003,
  author = {Peter R. Pietzuch and Brian Shand and Jean Bacon},
  title = {A Framework for Event Composition in Distributed Systems},
  booktitle = {Middleware},
  publisher = {Springer},
  year = {2003},
  volume = {2672},
  pages = {62--82},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2672&spage=62}
}
Van Belle, W., Mens, T. & D'Hondt, T. (2003), "Using Genetic Programming to Generate Protocol Adaptors for Interprocess Communication.", In Evolvable Systems: From Biology to Hardware, Fifth International Conference, ICES 2003. Trondheim, Norway. 17-20 March 2003. Volume 2606, pp. 422-433. Springer-Verlag.
BibTeX:
@inproceedings{VanBelle2003,
  author = {Werner Van Belle and Tom Mens and Theo D'Hondt},
  title = {Using Genetic Programming to Generate Protocol Adaptors for Interprocess Communication.},
  booktitle = {Evolvable Systems: From Biology to Hardware, Fifth International Conference, ICES 2003},
  publisher = {Springer-Verlag},
  year = {2003},
  volume = {2606},
  pages = {422--433},
  url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-00730-X}
}
Wonka, P., Wimmer, M., Sillion, F. & Ribarsky, W. (2003), "Instant architecture", ACM Trans. Graph.. New York, NY, USA Vol. 22(3), pp. 669-677. ACM.
Review: shape grammar, grammaire attribuee pour l'architecture image virtuelle
BibTeX:
@article{Wonka2003,
  author = {Wonka,, Peter and Wimmer,, Michael and Sillion,, François and Ribarsky,, William},
  title = {Instant architecture},
  journal = {ACM Trans. Graph.},
  publisher = {ACM},
  year = {2003},
  volume = {22},
  number = {3},
  pages = {669--677},
  doi = {http://doi.acm.org/10.1145/882262.882324}
}
Attali, I., Courbis, C., Degenne, P., Fau, A., Fillon, J., Held, C., Parigot, D. & Pasquier, C. (2002), "Aspect and XML-oriented Semantic Framework Generator SmartTools", In Second Workshop on Language Descriptions, Tools and Applications, LDTA'02. Electronic Notes in Theoretical Computer Science (ENTCS).
Abstract: SmartTools is a semantic framework generator, based on XML and object technologies. Thanks to a process of automatic generation from specifications, SmartTools makes it possible to quickly develop environments dedicated to domain-specific and programming languages. Some of these specifications (XML, DTD, Schemas, XSLT) are issued from the W3C which is an important source of varied emerging domain-specific languages. SmartTools uses object technologies such as visitor patterns and aspect-oriented programming. It provides code generation adapted to the usage of those technologies to support the development of semantic analyses. In this way, we obtain at minimal cost the design and implementation of a modular development platform which is open, interactive, uniform, and most important prone to evolution.
BibTeX:
@inproceedings{Attali2002,
  author = {Isabelle Attali and Carine Courbis and Pascal Degenne and Alexandre Fau and Joel Fillon and Christophe Held and Didier Parigot and Claude Pasquier},
  title = {Aspect and XML-oriented Semantic Framework Generator SmartTools},
  booktitle = {Second Workshop on Language Descriptions, Tools and Applications, LDTA'02},
  publisher = {Electronic Notes in Theoretical Computer Science (ENTCS)},
  year = {2002},
  note = {Satellite event of ETAPS'2002},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Parigot02.ps.gz}
}
Courbis, C., Degenne, P., Fau, A., Parigot, D. & Variamparambil, J. (2002), "Un modèle de composants pour l'atelier de développement SmartTools", In Systèmes à composants adaptables et extensibles. Octobre 2002.
Abstract: Depuis quelques années, l'approche par composants dans la conception de logiciels complexes est apparue pour résoudre les problèmes de répartition, de déploiement et de réutilisation de code. Cette approche s'avère la mieux adaptée pour assurer la pérennité, l'évolution, l'interopérabilité et la maintenance d'applications. Cet article présente le modèle de composants adopté pour la réalisation d'un atelier de développement. L'originalité de ce modèle est d'être extensible et exportable vers d'autres modèles plus connus tels que les Web Services, CCM (CORBA Component Model) ou EJB (Entreprise Java Bean) tout en respectant nos besoins. La validité de ce modèle est aussi éprouvée puisqu'il a été utilisé pour l'implantation de notre outil. Cette approche pragmatique nous a permis de concevoir un modèle de composants simple et réaliste.
BibTeX:
@inproceedings{Courbis2002,
  author = {Carine Courbis and Pascal Degenne and Alexandre Fau and Didier Parigot and Joseph Variamparambil},
  title = {Un modèle de composants pour l'atelier de développement SmartTools},
  booktitle = {Systèmes à composants adaptables et extensibles},
  year = {2002},
  note = {scriptsize ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot02g.pdf},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot02g.ps}
}
Courbis, C. (2002), "Contribution à la programmation générative. Application dans le générateur SmartTools~: technologies XML, programmation par aspects et composants". School: Université de Nice Sophia Antipolis., December, 2002.
Abstract: With the emergence of the Internet and proliferation of new technologies, the design and programming of complex applications need to take into account standards and notions of code distribution, deployment and reuse. There is a need to change the programming methodologies to take into account these different facets. This thesis lays the foundations for a new way of programming based on generative programming that automatically integrates specific technologies and user specifications (abstract models). This idea was successfully used, at different levels - data representation, interactive environments, semantic Atreatments and the architecture, in the design and realisation of SmartTools, a software framework for domain-specific languages. In this way, the generated source code makes use of XML technologies for the data representation, object and bean technologies for the views and GUI, aspect-oriented programming and visitor design pattern for semantic treatments and components to obtain an open architecture and a distributed and deployable application. This idea is very close to the MDA (Model-Driven Architecture) proposal of the OMG consortium that advocates a platform-independent model that can be transformed into one or more platform-specific models. The main results of this thesis is better software quality due to business logic and technology separation, more straightforward code, a rapid addition of new facets and a means that facilitates the portability of applications towards new technologies or platforms.
BibTeX:
@phdthesis{Courbis2002a,
  author = {Carine Courbis},
  title = {Contribution à la programmation générative. Application dans le générateur SmartTools~: technologies XML, programmation par aspects et composants},
  school = {Université de Nice Sophia Antipolis},
  year = {2002},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/theses/Courbis2002.ps.gz}
}
Dobrev, P., Famolari, D., Kurzke, C. & Miller, B. (2002), "Device and service discovery in home networks with OSGi", Communications Magazine, IEEE., Aug, 2002. Vol. 40(8), pp. 86-92.
BibTeX:
@article{Dobrev2002,
  author = {Dobrev, P. and Famolari, D. and Kurzke, C. and Miller, B.A.},
  title = {Device and service discovery in home networks with OSGi},
  journal = {Communications Magazine, IEEE},
  year = {2002},
  volume = {40},
  number = {8},
  pages = { 86-92},
  doi = {http://dx.doi.org/10.1109/MCOM.2002.1024420}
}
Farrugia, P. (2002), "Etude d'un langage de transformation, Cosynt". School: Marseille., June, 2002.
BibTeX:
@mastersthesis{Farrugia2002,
  author = {Patrice Farrugia},
  title = {Etude d'un langage de transformation, Cosynt},
  school = {Marseille},
  year = {2002}
}
Garavel, H., Lang, F. & Mateescu, R. (2002), "Compiler Construction Using LOTOS NT", Lecture Notes in Computer Science. Vol. 2304, pp. 9-??.
BibTeX:
@article{Garavel2002,
  author = {Hubert Garavel and Frédéric Lang and Radu Mateescu},
  title = {Compiler Construction Using LOTOS NT},
  journal = {Lecture Notes in Computer Science},
  year = {2002},
  volume = {2304},
  pages = {9--??},
  url = {http://link.springer-ny.com/link/service/series/0558/bibs/2304/23040009.htm; http://link.springer-ny.com/link/service/series/0558/papers/2304/23040009.pdf}
}
der Hoeven, S.V. & Parigot, D. (2002), "A Generic Language for Abstract Execution:Reversi"
BibTeX:
@unpublished{Hoeven2002,
  author = {Steve Van der Hoeven and Didier Parigot},
  title = {A Generic Language for Abstract Execution:Reversi},
  year = {2002},
  note = {en soumission}
}
Izadi, S., Coutinho, P., Rodden, T. & Smith, G. (2002), "The FUSE Platform: Supporting Ubiquitous Collaboration Within Diverse Mobile Environments", Automated Software Engg.. Hingham, MA, USA Vol. 9(2), pp. 167-186. Kluwer Academic Publishers.
Abstract: The recent proliferation of heterogeneous computing devices and wireless network technology presents new opportunities for Computer Supported Cooperative Work (CSCW). One emergent paradigm is that of ubiquitous collaboration, which provides widespread access to shared services through a variety of interactive devices, irrespective of whether individuals are mobile or deskbound. However, developing groupware that is interoperable across diverse, often mobile, environments can be difficult and costly. The fundamental issue is that current support infrastructures, which will meet the requirements for multi-user application development, are not operable within emerging ubiquitous settings. This paper explores this problem and presents a generic platform that promotes new forms of collaboration through mobility and ever-present computing services. The developed platform seeks to provide a wide range of collaborative services to a very diverse set of devices by adapting and extending existing middleware technologies.
BibTeX:
@article{Izadi2002,
  author = {Izadi,, Shahram and Coutinho,, Pedro and Rodden,, Tom and Smith,, Gareth},
  title = {The FUSE Platform: Supporting Ubiquitous Collaboration Within Diverse Mobile Environments},
  journal = {Automated Software Engg.},
  publisher = {Kluwer Academic Publishers},
  year = {2002},
  volume = {9},
  number = {2},
  pages = {167--186},
  doi = {http://dx.doi.org/10.1023/A:1014534414062}
}
Jessie Dedeckreand, W. d.M. a.W.V.B. (2002), "Actors for Pervasive Computing". Vrije Universiteit Brussel PROG Department of Informatics, 2002.
BibTeX:
@techreport{JessieDedeckreand2002,
  author = {Jessie Dedeckreand, Wolfgang de Meuter amd Wener Van Belle},
  title = {Actors for Pervasive Computing},
  year = {2002}
}
Papazoglou, M.P., Yang, J. & Kramer, B.J. (2002), "Leveraging Web-Services and Peer-to-Peer Networks". University of Oulu, October~01, 2002.
Abstract: Two of the most recent and popular topics in computing are service-oriented computing (exemplified by web-services) and peer-to-peer computing. Peer-oriented computing is an attempt to weave inter-connected machines into the fabric of the Internet. Web-services, on the other hand, are a more formal technological challenge, an attempt to apply a service-oriented computing model to web resources to provide a loosely coupled paradigm for distributed processing. Despite the fact that these two concepts have some significant amount of overlap, e.g., each seeks to become a common means for publishing and discovery across networks, their current manifestations still remain quite diverse. In this paper we highlight key intersect points that enable possibilities for using these two technologies together. Moreover, we present an architectural approach and formal framework towards unifying them to provide essential functions required for automating e-business applications such as e-marketplaces and service exchanges.
BibTeX:
@techreport{Papazoglou2002,
  author = {Mike P. Papazoglou and Jian Yang and Bend J. Kramer},
  title = {Leveraging Web-Services and Peer-to-Peer Networks},
  year = {2002},
  url = {http://eprints.biblio.unitn.it/archive/00000317/; http://eprints.biblio.unitn.it/archive/00000317/01/88.pdf}
}
Shi, S. & Turner, J.S. (2002), "Multicast Routing and Bandwidth Dimensioning in Overlay Networks", IEEE Journal on Selected Areas in Communications. Vol. 20, pp. 1444-1455.
BibTeX:
@article{Shi2002,
  author = {Sherlia Shi and Jonathan S. Turner},
  title = {Multicast Routing and Bandwidth Dimensioning in Overlay Networks},
  journal = {IEEE Journal on Selected Areas in Communications},
  year = {2002},
  volume = {20},
  pages = {1444--1455},
  url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1254461&isnumber=28063}
}
Simeonov, P. (2002), "WARAAN: a higher-order adaptive routing algorithm for wireless multimedia in wandering networks". Oct. 2002. Volume 3, pp. 1385-1389 vol.3.
Abstract: The wandering network (WN) (see Simeonov, P.L., Proc. IEEE Int. Symp. on Parallel & Distributed Processing - IPDPS'02, 2002) is a new type of communications architecture defined by: (1) flexible, multi-modal specialization of network nodes as virtual subnetworks; (2) mobility and virtualization of the net functions in hardware and software; (3) self-organization as multi-feedback-based topology-on-demand. Network elements can contain several exchangeable modules capable of executing diverse network functions in parallel. These functions can be invoked, transported to or generated in the nodes upon delivery of mobile code containing programs about the node's behaviour. An essential characteristic of the WN approach is the inherent ability to spread out instantly information about architectural changes among the nodes by encoding executable re-construction (genetic) instructions within the transported active packets - as "network" genes, N-genes.
BibTeX:
@inproceedings{Simeonov2002,
  author = {Simeonov, P.L.},
  title = {WARAAN: a higher-order adaptive routing algorithm for wireless multimedia in wandering networks},
  journal = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
  year = {2002},
  volume = {3},
  pages = { 1385-1389 vol.3},
  doi = {http://dx.doi.org/10.1109/WPMC.2002.1088407}
}
Sousa, J.P. & Garlan, D. (2002), "Aura: an Architectural Framework for User Mobility in Ubiquitous Computing Environments", In WICSA. Volume 224, pp. 29-43. Kluwer.
BibTeX:
@inproceedings{Sousa2002,
  author = {João Pedro Sousa and David Garlan},
  title = {Aura: an Architectural Framework for User Mobility in Ubiquitous Computing Environments},
  booktitle = {WICSA},
  publisher = {Kluwer},
  year = {2002},
  volume = {224},
  pages = {29--43},
  url = {http://www-2.cs.cmu.edu/~jpsousa/research/wicsa02sousa.pdf}
}
Variamparambil, J.G. (2002), "Enabling SmartTools components with component technologies:WebServices, CORBA and EJBs". INRIA, 2002.
BibTeX:
@techreport{Variamparambil2002,
  author = {Joseph George Variamparambil},
  title = {Enabling SmartTools components with component technologies:WebServices, CORBA and EJBs},
  year = {2002},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Variamparambil02.doc}
}
Vercouter, L. (2002), "A fault-tolerant open MAS", In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'02). July 2002., pp. 670-671. ACM Press.
Abstract: The management of the openness of a multi-agent system (MAS) is often done by a specific agent, called a middle-agent. The middle-agent knows representations of the agents and uses them to facilitate cooperations between them. But the centralization of these tasks has some drawbacks: there is a risk of overloading the middle-agent by several queries and the MAS can not support a middle-agent failure. In this paper, we propose an alternative approach to openness management which is completely distributed among the agents of the MAS.
BibTeX:
@inproceedings{Vercouter2002,
  author = {Laurent Vercouter},
  title = {A fault-tolerant open MAS},
  booktitle = {Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'02)},
  publisher = {ACM Press},
  year = {2002},
  pages = {670--671},
  doi = {http://doi.acm.org/10.1145/544862.544902}
}
Wickenberg, T. & Davidsson, P. (2002), "On Multi Agent Based Simulation of Software Development Processes". Blekinge Institute of Technology, 2002.
BibTeX:
@techreport{Wickenberg2002,
  author = {Tham Wickenberg and Paul Davidsson},
  title = {On Multi Agent Based Simulation of Software Development Processes},
  booktitle = {In Sichman},
  year = {2002},
  pages = {104--113}
}
Wojciechowski, P.T., Mena, S. & Schiper, A. (2002), "Semantics of Protocol Modules Composition and Interaction", In 5th Conference on Coordination Models and Languages (COORDINATION '02). Volume 2315
Abstract: This paper studies the semantics of protocol modules composition and interaction in configurable communication systems. We present a semantic model describingCactus and Appia — two frameworks that are used for implementingmo dular systems. The model covers protocol graph, session and channel creation, and inter-module communication of events and messages. To build the model, we defined a source-code-validated specification of a large fragment of the programmingin terface provided by the frameworks; we developed an operational semantics describingthe behaviour of the operations through state transitions, makingexplicit interactions between modules. Developingthe model and a small example implementinga configurable multicast helped us to better understand the design choices in these frameworks. The work reported in this paper is our first step towards reasoningab out systems composed from collections of modules.
Review: REVIEWED
BibTeX:
@inproceedings{Wojciechowski2002,
  author = {Wojciechowski, Pawel T. and Mena, Sergio and Schiper, André},
  title = {Semantics of Protocol Modules Composition and Interaction},
  booktitle = {5th Conference on Coordination Models and Languages (COORDINATION '02)},
  year = {2002},
  volume = {2315},
  url = {http://www.springerlink.com/link.asp?id=13wy9glv223l9nk8}
}
Ziane, S. (2002), "Passerelle entre les formalismes (Schema) du W3C et la programmation par Objets". School: Versailles., June, 2002.
BibTeX:
@mastersthesis{Ziane2002,
  author = {Saïda Ziane},
  title = {Passerelle entre les formalismes (Schema) du W3C et la programmation par Objets},
  school = {Versailles},
  year = {2002}
}
All (2001), "Apport des technologies Objets et XML aux applications des cartes à puce et du commerce électronique".
BibTeX:
@misc{All2001,
  author = {All},
  title = {Apport des technologies Objets et XML aux applications des cartes à puce et du commerce électronique},
  year = {2001},
  note = {label de la Recherche, association Telecom Valley },
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Parigot01g.ps.gz}
}
Attali, I., Courbis, C., Degenne, P., Fau, A., Fillon, J., Parigot, D., Pasquier, C. & Coen, C.S. (2001), "SmartTools: a Development Environment Generator based on XML Technologies", In XML Technologies and Software Engineering. Toronto, Canada. ICSE workshop proceedings.
Abstract: SmartTools is a development environment generator that provides a structure editor and semantic tools as main features. SmartTools is easy to use, thanks to its graphical user interface. Being based on Java and XML technologies offers all the features of SmartTools to any defined language. The main goal of this tool is to provide help and support for designing software development environments for programming languages as well as domain-specific languages defined with XML technologies.
BibTeX:
@inproceedings{Attali2001,
  author = {Isabelle Attali and Carine Courbis and Pascal Degenne and Alexandre Fau and Joël Fillon and Didier Parigot and Claude Pasquier and Claudio Sacerdoti Coen},
  title = {SmartTools: a Development Environment Generator based on XML Technologies},
  booktitle = {XML Technologies and Software Engineering},
  publisher = {ICSE workshop proceedings},
  year = {2001},
  note = {scriptsize ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot01b.pdf},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot01b.ps.gz}
}
Attali, I., Courbis, C., Degenne, P., Fau, A., Parigot, D. & Pasquier, C. (2001), "SmartTools: a Generator of Interactive Environments Tools", In International Conference on Compiler Construction CC'01. Genova, Italy. April 2001. Volume 2027 Electronic Notes in Theoretical Computer Science (ENTCS).
Abstract: SmartTools is a development environment generator that provides a structure editor and semantic tools as main features. The well-known visitor pattern technique is commonly used for designing semantic analysis, it has been automated and extended. SmartTools is easy to use thanks to its graphical user interface designed with the Java Swing APIs. It is built with an open architecture convinient for a partial or total integration of SmartTools in other environments. It makes the addition of new software components in SmartTools easy. As a result of the modular architecture, we built a distributed instance of SmartTools which required minimal effort. Being open to the XML technologies offers all the features of SmartTools to any language defined with those technologies. But most of all, with its open architecture, SmartTools takes advantage of all the developments made around those technologies, like DOM, through the XML APIs. The fast development of SmartTools (which is a young project, one year old) validates our choices of being open and generic.The main goal of this tool is to provide help and support for designing software development environments for programming languages as well as application languages defined with XML technologies.
BibTeX:
@inproceedings{Attali2001a,
  author = {Isabelle Attali and Carine Courbis and Pascal Degenne and Alexandre Fau and Didier Parigot and Claude Pasquier},
  title = {SmartTools: a Generator of Interactive Environments Tools},
  booktitle = {International Conference on Compiler Construction CC'01},
  publisher = {Electronic Notes in Theoretical Computer Science (ENTCS)},
  year = {2001},
  volume = {2027},
  note = {Tools Demonstrations at CC'01 scriptsize ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot01a.pdf},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot01a.ps.gz}
}
Belle, W.V. & D'Hondt, T. (2001), "Agent Mobility and Reification of Computational State: An Experiment in Migration", Lecture Notes in Computer Science. Vol. 1887, pp. 166-??.
Abstract: This paper describes an experiment with mobility in multi-agent systems. The setting is a virtual machine that supports reification of the computational state of a running process. The objective is to investigate how this feature facilitates telescripting and to speculate on how languages like Java should evolve to include the resulting notion of strong migration
BibTeX:
@article{Belle2001,
  author = {Werner Van Belle and Theo D'Hondt},
  title = {Agent Mobility and Reification of Computational State: An Experiment in Migration},
  journal = {Lecture Notes in Computer Science},
  year = {2001},
  volume = {1887},
  pages = {166--??},
  url = {http://link.springer-ny.com/link/service/series/0558/bibs/1887/18870166.htm; http://link.springer-ny.com/link/service/series/0558/papers/1887/18870166.pdf}
}
Courbis, C., Fau, A. & Parigot, D. (2001), "Programmation par visiteurs et par aspects dynamiques". INRIA, 2001.
BibTeX:
@techreport{Courbis2001,
  author = {Carine Courbis and Alexandre Fau and Didier Parigot},
  title = {Programmation par visiteurs et par aspects dynamiques},
  year = {2001},
  note = {en soummision},
  url = {ftp://ftp-sop.inria.fr/members/Didier.Parigot/publications/Parigot01d.ps.gz}
}
Ratnasamy, S., Francis, P., Shenker, S. & Handley, M. (2001), "A Scalable Content-Addressable Network", In In Proceedings of ACM SIGCOMM., pp. 161-172.
Abstract: Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.
BibTeX:
@inproceedings{Ratnasamy2001,
  author = {Sylvia Ratnasamy and Paul Francis and Scott Shenker and Mark Handley},
  title = {A Scalable Content-Addressable Network},
  booktitle = {In Proceedings of ACM SIGCOMM},
  year = {2001},
  pages = {161--172},
  url = {http://doi.acm.org/10.1145/383059.383072}
}
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F. & Balakrishnan, H. (2001), "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications" , pp. 149-160.
Abstract: A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
BibTeX:
@article{Stoica2001,
  author = {Ion Stoica and Robert Morris and David Karger and M. Frans Kaashoek and Hari Balakrishnan},
  title = {Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications},
  year = {2001},
  pages = {149--160},
  url = {http://doi.acm.org/10.1145/383059.383071}
}
Variamparambil, J.G. (2001), "Getting SmartTools and VisualStudio.NET to talk to each other using SOAP and WebServices". INRIA, 2001.
BibTeX:
@techreport{Variamparambil2001,
  author = {Joseph George Variamparambil},
  title = {Getting SmartTools and VisualStudio.NET to talk to each other using SOAP and WebServices},
  year = {2001},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Variamparambil.doc}
}
hua Chu, Y., Rao, S.G., Seshan, S. & Zhang, H. (2000), "A Case for End System Multicast". Carnegie Mellon University, 2000.
BibTeX:
@techreport{Chu2000,
  author = {Yang-hua Chu and Sanjay G. Rao and Srinivasan Seshan and Hui Zhang},
  title = {A Case for End System Multicast},
  booktitle = {in Proceedings of ACM Sigmetrics},
  year = {2000},
  pages = {1--12}
}
Group, O.S.S. & Soley, R. (2000), "Model-Driven Architecture". OMG, November, 2000.
BibTeX:
@techreport{Group2000,
  author = {OMG Staff Strategy Group and Richard Soley},
  title = {Model-Driven Architecture},
  year = {2000}
}
Cheung, G. & McCanne, S. (1999), "An attribute grammar based framework for machine-dependent computational optimization of media processing algorithms". Volume 2, pp. 797-801 vol.2.
Abstract: Media processing algorithms are typically computationally intensive, and in complexity constrained environments, finding the most computationally efficient algorithm is critical. In this paper, we present an attribute grammar based framework which captures the computational complexity of an algorithm in a machine-dependent manner. Using this formalism, a media processing algorithm can be optimally and automatically tuned to a particular machine by a problem specific optimizer. Moreover, the tradeoff between performance and execution time on a specific machine can be controlled and thus exploited to optimize overall performance. To illustrate the viability of our approach, we applied it to the variable-length code (VLC) decoding problem and show that the optimal VLC decoding algorithm can be found using the framework. Tradeoff between coding efficiency and decoding speed of Huffman code can be exploited by employing length-limited code
BibTeX:
@inproceedings{Cheung1999,
  author = {Cheung, G. and McCanne, S.},
  title = {An attribute grammar based framework for machine-dependent computational optimization of media processing algorithms},
  journal = {Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on},
  year = {1999},
  volume = {2},
  pages = {797-801 vol.2},
  doi = {http://dx.doi.org/10.1109/ICIP.1999.823006}
}
Hussain, T.S. & Browse, R.A. (1999), "Genetic Operators with Dynamic Biases that Operate on Attribute Grammar Representations of Neural Networks", In Advanced Grammar Techniques Within Genetic Programming and Evolutionary Computation., pp. 83-86.
BibTeX:
@inproceedings{Hussain1999,
  author = {Talib S. Hussain and Roger A. Browse},
  title = {Genetic Operators with Dynamic Biases that Operate on Attribute Grammar Representations of Neural Networks},
  booktitle = {Advanced Grammar Techniques Within Genetic Programming and Evolutionary Computation},
  year = {1999},
  pages = {83--86},
  url = {http://www.cs.queensu.ca/home/hussain/web/1999_gecco99bofworkshop.ps.gz}
}
de Moor, O., Jones, S.L.P. & Wyk, E.V. (1999), "Aspect-Oriented Compilers", In GCSE. Volume 1799, pp. 121-133. Springer.
Abstract: Aspect-oriented programming provides the programmer with means to cross-cut conventional program structures, in particular the class hierarchies of object-oriented programming. This paper studies the use of aspect orientation in structuring syntax directed compilers implemented as attribute grammars. Specifically, it describes a method for specifying definitions of related attributes as ‘aspects’ and treating them as first-class objects, that can be stored, manipulated and combined. It is hoped that this embedding of an aspect-oriented programming style in Haskell provides a stepping stone towards a more general study of the semantics of aspect-oriented programming.
Review: Premier papier qui montre le lien entre grammaire attibue et aspect
BibTeX:
@inproceedings{Moor1999,
  author = {Oege de Moor and Simon L. Peyton Jones and Eric Van Wyk},
  title = {Aspect-Oriented Compilers},
  booktitle = {GCSE},
  publisher = {Springer},
  year = {1999},
  volume = {1799},
  pages = {121--133},
  url = {http://link.springer.de/link/service/series/0558/bibs/1799/17990121.htm}
}
Cherif, A. (1998), "Replication for Fault Tolerant Software Using a Functional and Attribute Grammar Based Computation Model", In PhD thesis, School of Information Science, Japan Advanced Institute of Science and Technology.. School: School of Information Science,; Japan Advanced Institute of Science and Technology.
BibTeX:
@phdthesis{Cherif1998,
  author = {Adel Cherif},
  title = {Replication for Fault Tolerant Software Using a Functional and Attribute Grammar Based Computation Model},
  booktitle = {PhD thesis, School of Information Science, Japan Advanced Institute of Science and Technology},
  school = {School of Information Science,; Japan Advanced Institute of Science and Technology},
  year = {1998},
  url = {http://kt-www.jaist.ac.jp:8000/students/adel/papers/PhD-Thesis.ps.gz}
}
Hussain, T.S. & Browse, R.A. (1998), "Including Control Architecture in Attribute Grammar Specifications of Feedforward Neural Networks", In 1998 Joint Conference on Information Sciences: Second International Workshop on Frontiers in Evolutionary Algorithms., pp. 432-436.
BibTeX:
@inproceedings{Hussain1998,
  author = {Talib S. Hussain and Roger A. Browse},
  title = {Including Control Architecture in Attribute Grammar Specifications of Feedforward Neural Networks},
  booktitle = {1998 Joint Conference on Information Sciences: Second International Workshop on Frontiers in Evolutionary Algorithms},
  year = {1998},
  pages = {432--436},
  url = {http://www.qucis.queensu.ca/~hussain/web/1998_jcis98paper.ps.gz}
}
Hussain, T. & Browse, R. (1998), "Network Generating Attribute Grammar Encoding", In IEEE International Conference on Neural Networks (IJCNN'98). Anchorage, AK. July 1998. Volume I, pp. I-431-I-436. IEEE.
BibTeX:
@inproceedings{Hussain1998a,
  author = {T. Hussain and R. Browse},
  title = {Network Generating Attribute Grammar Encoding},
  booktitle = {IEEE International Conference on Neural Networks (IJCNN'98)},
  publisher = {IEEE},
  year = {1998},
  volume = {I},
  pages = {I-431--I-436},
  note = {Queen's University, CANADA},
  url = {http://www.qucis.queensu.ca/home/hussain/web/1998_ijcnn98paper.ps.gz}
}
Sveda, M. (1996), "A Prototyping Technique with an Asychronous Specification Language", EUROMICRO Conference. Los Alamitos, CA, USA Vol. 0, pp. 0151. IEEE Computer Society.
BibTeX:
@article{Sveda1996,
  author = {M. Sveda},
  title = {A Prototyping Technique with an Asychronous Specification Language},
  journal = {EUROMICRO Conference},
  publisher = {IEEE Computer Society},
  year = {1996},
  volume = {0},
  pages = {0151},
  doi = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1996.546377}
}
Paakki, J. (1995), "Attribute grammar paradigms---a high-level methodology in language implementation", ACM Comput. Surv.. New York, NY, USA Vol. 27(2), pp. 196-255. ACM.
Abstract: Attribute grammars are a formalism for specifying programming languages. They have been applied to a great number of systems automatically producing language implementations from their specifications. The systems and their specification languages can be evaluated and classified according to their level of application support, linguistic characteristics, and degree of automation.A survey of attribute grammar-based specification languages is given. The modern advanced specification languages extend the core attribute grammar model with concepts and primitives from established programming paradigms. The main ideas behind the developed attribute grammar paradigms are discussed, and representative specification languages are presented with a common example grammar. The presentation is founded on mapping elements of attribute grammars to their counterparts in programming languages. This methodology of integrating two problem-solving disciplines together is explored with a classification of the paradigms into structured, modular, object-oriented, logic, and functional attribute grammars. The taxonomy is complemented by introducing approaches based on an implicit parallel or incremental attribute evaluation paradigm.
BibTeX:
@article{Paakki1995,
  author = {Paakki,, Jukka},
  title = {Attribute grammar paradigms---a high-level methodology in language implementation},
  journal = {ACM Comput. Surv.},
  publisher = {ACM},
  year = {1995},
  volume = {27},
  number = {2},
  pages = {196--255},
  doi = {http://doi.acm.org/10.1145/210376.197409}
}
Chapman, N.P. (1990), "Defining, analysing and implementing communication protocols using attribute grammars", Formal Aspects of Computing., 03, 1990. Vol. 2(1), pp. 359-392.
Abstract: A new approach to describing communication protocols is introduced. In the style of a formal language, the protocol is considered as the set of all legal sequences of symbols that can be exchanged by the communicating processes. Although context free grammars cannot adequately describe such sequences, it is shown that attribute grammars may be used. Examples are given which show that common protocol features such as interleaving, windowing and flow control can be described by attribute grammars.
BibTeX:
@article{Chapman1990,
  author = {Chapman, N. P. },
  title = {Defining, analysing and implementing communication protocols using attribute grammars},
  journal = {Formal Aspects of Computing},
  year = {1990},
  volume = {2},
  number = {1},
  pages = {359--392},
  url = {http://dx.doi.org/10.1007/BF01888235}
}
Anderson, D.P. (1988), "Automated Protocol Implementation with RTAG", IEEE Transactions on Software Engineering., March, 1988. Vol. 14(3), pp. 291-300.
Abstract: RTAG is a language based on an attribute grammar notation for specifying protocols. Its main design goals are: 1) to support concise and easily understood expression of complex real-world protocols, and 2) to serve as the basis of a portable software system for automated protocol implementation. This paper summarizes the RTAG language, gives examples of its use, sketches the algorithms used in generating implementation from these specifications, and describes a UNIX-based automated implementation system for RTAG.
BibTeX:
@article{Anderson88,
  author = {D. P. Anderson},
  title = {Automated Protocol Implementation with RTAG},
  journal = {IEEE Transactions on Software Engineering},
  year = {1988},
  volume = {14},
  number = {3},
  pages = {291--300},
  url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4650&isnumber=260}
}
Anderson, D.P. & Landweber, L.H. (1985), "A grammar-based methodology for protocol specification and implementation", SIGCOMM Comput. Commun. Rev.. New York, NY, USA Vol. 15(4), pp. 63-70. ACM.
Abstract: A new methodology for specifying and implementing communication protocols is presented. This methodology is based on a formalism called “Real-Time Asynchronous Grammars” (RTAG), which uses a syntax similar to that of attribute grammars to specify allowable message sequences. In addition RTAG provides mechanisms for specifying data-dependent protocol activities, real-time constraints, and concurrent activities within a protocol entity. RTAG encourages a top-down approach to protocol design that can be of significant benefit in expressing and reasoning about highly complex protocols. As an example, an RTAG specification is given for part of the Class 4 ISO Transport Protocol (TP-4). Because RTAG allows protocols to be specified at a highly detailed level, major parts of an implementation can be automatically generated from a specification. An RTAG parser can be written which, when combined with an RTAG specification of a protocol and a set of interface and utility routines, constitutes an implementation of the protocol. To demonstrate the viability of RTAG for implementation generation, an RTAG parser has been integrated into the kernel of the 4.2 BSD UNIX operating system, and has been used in conjunction with the RTAG TP-4 specification to obtain an RTAG-based TP-4 implementation in the DoD Internet domain.
BibTeX:
@article{Anderson1985,
  author = {David P. Anderson and Lawrence H. Landweber},
  title = {A grammar-based methodology for protocol specification and implementation},
  journal = {SIGCOMM Comput. Commun. Rev.},
  publisher = {ACM},
  year = {1985},
  volume = {15},
  number = {4},
  pages = {63--70},
  doi = {http://doi.acm.org/10.1145/318951.319006}
}

Created by JabRef on 18/05/2009.