berabera べらべら blahblah

[1]

Yaping Gong, Wladimir Bocquet, Patrice Coupé, and Romain Lenglet.
Implementation of an integration of rerouting-based micro-mobility
and traffic engineering in wireless access networks.
IEICE Technical Report, 108(1):31-36, May 2008.
[ bib |
http ]

In this paper, we propose a functional integration of rerouting-based micro-mobility and traffic engineering in wireless access networks. The combination of micro-mobility and traffic engineering is a promising solution for the development of the new 4G mobile wireless networks. The measures to handle micro-mobility in wireless access networks are of importance because they are critical for continued communications. In addition, traffic engineering is able to provide strong quality of service (QoS) and to optimally make use of network resources. Based on the description of the cellular IP, the rerouting based micro-mobility protocol, and RSVP -TE, we develop a systematic simulator integrating micro-mobility and traffic engineering using NS-2 and conduct simulation of mobile host handover. The simulation results show that by combing cellular IP and RSVP-TE, fast handover is accomplished with optimal network resource usages. The developed simulator will be essential for performance comparisons, bench marking, and as a base for further development.

[2]

Romain Lenglet and Shigeru Chiba.
Dryverl: a flexible Erlang/C binding compiler.
In Proceedings of the 5th ACM SIGPLAN Erlang Workshop,
pages 21-31, September 2006.
[ bib |
DOI |
.pdf ]

This article introduces Dryverl, an Erlang/C binding code generator. Dryverl aims at becoming the most abstract, open and efficient tool for implementing any Erlang/C bindings, as either C port drivers, C port programs, or C nodes. The most original feature of Dryverl is to provide users with open Erlang/C bindings, similar to distributed bindings in open distributed processing systems, to allow specifying programmatically the data transformations that must often be performed in Erlang/C bindings. Implementation details are hidden to developers, and implementation differences between port drivers, port programs, and nodes are abstracted by Dryverl, and Dryverl aims at generating the most efficient implementations possible for every target mechanism.

[3]

Romain Lenglet.
Application of multiple-criteria decision analysis in open
distributed systems management.
In 4th JSST Summer Workshop on Systems for Programming and
Applications (SPA-SUMMER 2005), August 2005.
Unreviewed position paper for poster session.
[ bib |
.pdf ]

I propose a method for the design of ODP management systems, which helps assessing that a management systems makes an ODP managed system meet conformance requirements (either policies or QoS requirements). My method is based on the use of real-world decision analysis methods for the selection of management strategies, in order for a management system to make a managed system the "most" conformant possible.

[4]

Romain Lenglet.
Composition flexible et adaptable de transformations de
programmes.
PhD thesis, Institut National Polytechnique de Grenoble, Grenoble,
France, November 2004.
[ bib |
.pdf ]

Cette thèse propose de généraliser l'utilisation de la transformation de programmes, pour la construction d'un lien efficace entre les parties fonctionnelle et non-fonctionnelle (ou technique) d'un système logiciel. Dans ce cadre, nous avons développé un système de transformation (Jabyce), avec pour objectifs la possibilité d'implanter tous les transformateurs de programmes possibles, leur encapsulation pour systématiser leur réutilisation, et la possibilieé de les composer arbitrairement et efficacement. Pour cela, Jabyce a deux caractéristiques : les transformateurs sont concus sous la forme de composants logiciels dans un modèle de composant général (Fractal), et les programmes transformés sont représentés par des séquences d'interactions au lieu de graphes d'objets (représentation classique). Une extension de la catégorisation classique des systèmes de transformation de programme nous permet une comparaison exhaustive de Jabyce aux autres systèmes existants, qui montre que, grâce à ses caractéristiques, Jabyce facilite significativement la conception de transformateurs complexes, et offre les mécanismes de composition de transformateurs les plus efficaces et les plus flexibles. Jabyce a été validé expérimentalement dans le cadre de la construction d'un environnement de persistance transparente d'objets Java, et celle d'une Machine Virtuelle Java modulaire basée sur la compilation statique. Un autre apport original de ce travail est l'introduction de la problématique du traitement des erreurs dans les systèmes de transformation de programmes, et la conception d'un système de traitement d'erreur adapté à Jabyce.

In this work we propose to generalize the use of program transformation, in order to efficiently link the functional and non-functional (or technical) parts of a software system. In this context, we have developed a transformation system (Jabyce), which allows the implementation of any possible program transformers, their encapsulation in order to make them reusable systematically, and their efficient and flexible composition. In order to reach those goals, Jabyce has two characteristics: transformers are designed as software components in a general component model (Fractal), and transformed programs are represented as sequences of interactions between such components, instead of object graphs (classical representation). An extension of the classical categorization of transformation systems allows us an extensive comparison of Jabyce to the other existing transformation systems, which demonstrates that Jabyce makes it significantly easier to develop complex transformers, and offers the most efficient and flexible transformer composition mechanisms. Jabyce has been experimentally used in the context of the development of a transparent Java object persistence service, and that of a modular Java Virtual Machine relying on static compilation. Another original contribution of this work is the introduction of the problematics of fault tolerance in program transformation systems, and the design of an error handling system adapted to Jabyce.

[5]

Romain Lenglet, Thierry Coupaye, and Éric Bruneton.
Composing transformations of compiled Java programs with Jabyce.
Computer Science and Information Systems (ComSIS),
1(2):83-125, November 2004.
[ bib |
.pdf ]

This article introduces Jabyce, a software framework for the implementation and composition of transformations of compiled Java programs. Most distinguishing features of Jabyce are 1) its interaction orientation, i.e. it represents elements of transformed programs as interactions (method calls), which generally consumes less memory and CPU time than representing programs as graphs of objects; and 2) its component orientation, i.e. it allows for the design and composition of transformers as software components based on the Fractal component model. This latter point is strongly connected to infra-structural and architectural issues, and software engineering aspects such as composing, scaling, maintaining and evolving transformers. Jabyce is compared with other existing compiled Java programs transformation systems, using an extension of a previous well-known categorization of program transformation systems.

[6]

Mourad Alia, Romain Lenglet, Thierry Coupaye, and Alexandre Lefebvre.
Querying reflexive component-based architectures.
In Proceedings of the 30th EUROMICRO Conference
(EUROMICRO'04), track on Component-Based Software Engineering, pages
127-134. IEEE Computer Society Press, September 2004.
[ bib |
.pdf ]

In the context of large-scale distributed component-based systems, this article motivates the need for and defines a general open query service. This query service allows for retrieving and selecting components from both repositories and deployed running systems. The problem of retrieving components from repositories has already been tackled by many research works whose purpose is to construct systems by assembling reusable components, typically in the context of COTS components. However, the proposed query services allows for an uniform efficient associative access to both repositories and running systems, while beeing based on distributed database techniques, which is the main contribution in this paper.

[7]

Éric Bruneton, Romain Lenglet, and Thierry Coupaye.
ASM: a code manipulation tool to implement adaptable systems.
In Proceedings of the ASF (ACM SIGOPS France)
Journées Composants 2002 : Systèmes à composants adaptables et
extensibles (Adaptable and extensible component systems), November 2002.
[ bib |
.pdf ]

ASM is a Java class manipulation tool designed to dynamically generate and manipulate Java classes, which are useful techniques to implement adaptable systems. ASM is based on a new approach, compared to equivalent existing tools, which consists in using the "visitor" design pattern without explicitly representing the visited tree with objects. This new approach gives much better performances than those of existing tools, for most of practical needs.

[8]

Thierry Coupaye, Romain Lenglet, Mikael Beauvois, Éric Bruneton, and Pascal
Déchamboux.
Composants et composition dans l'architecture des systèmes
répartis.
In Proceedings of the ASF (ACM SIGOPS France)
Journées Composants 2001 : flexibilité du système au langage
(flexibility from systems to languages), October 2001.
[ bib |
.ps ]

Cet article défend l'idée que l'architecture des systèmes répartis nécessite des modèles de composants plus généraux que les modèles industriels, et des frameworks permettant de configurer les composants de manière programmatique - et ce de manière statique et dynamique. Ces frameworks doivent au minimum offrir des capacités de composition structurelle mais peuvent également offrir d'autres types de composition, définis dans cet article : opératoire, fonctionnelle, comportementale, et contractuelle.

This file was generated by
bibtex2html 1.91.

Generated 2008-05-19.