Architecture d’un réseau actif à base de services Web

This paper presents a novel active architecture for building and deploying network services:aswa, Web Services based Active network Architecture. At the architectural level,aswa defines an active node whose functionalities are divided into the Node Operating System, the Execution Environment, and the Active Applications. At the implementation level,aswa is a Web Services based platform where new components could be added and deployed, in order to dynamically modify network nodes behavior. Applications can be developed with any language and communicate across heterogeneous environments, and across Internet and Intranet structures. At the deployment levelaswa uses an active node approach, and offers a controlled deployment mode. In terms of security, Authentication of deployed code and protection of the nodes is achieved by the use ofhttps and the header extensions of thesoap envelope. Finally to validate this architecture,aswa defines a Firewall as an Active Application to secure the code deployment.     

Technique de multiplexage pour réseau optique de vidéocommunication

The paper describes the building of the subscriber equipment for a fiber optic local cable network. Three signals are multiplexed on the user access: video, digital audio and anIsdn channel. The multiplexing procedure is matched to a video signal in an analogue format likely to evolve towards the digital format of the future. This procedure is based on the properties of the video signal: the periodicity of a line structure and the availability of a time slot between active sections of the video lines.     

Modèles de télétrafic pour le réseau à intégration de services du satellite TELECOM 1

The author discusses models of multiservice circuit switched communications systems where, in particular, the amount of transmission capacity (e.g. bit rate) depends on the call type. Two modes of call set up are considered: «on demand» with blocked calls cleared and «reservation» where capacity is previously reserved for planned calls. The latter mode is described generally and, for particular cases, we suggest interpretations leading to birth process and multiservice queue models. The models have been studied for evaluating the performance of the telecom 1business communication network but derived exact and approximate results should be useful in other applications.     

Investigation de la gestion de qualité de service dans le réseau UMTS

Bit rate announced for the future standards of telecommunication, as well as the level of integration reached are, as many factors, determining for the establishment of new applications in mobile terminals. Nowadays, mobile video streaming services are possible. Mobile users expect to receive multimedia traffic with some performance guarantees, so we must ensure the necessary quality of service during the video transmission. This paper aims at investigating quality of service issue inUmts network. More specifically, we explore the main challenge of quality of service management to dynamically optimize the distribution of load inUmts networks. Our investigation is organized in the following way. We formalize the optimization problem which is based on the graph theory and modellingUmts network as well as mobile users and applications to be used. The simulation of our optimization model show a clear improvement of the quality of service perceived by anUmts user in terms of bit rate, blocking and connection drop.     

Retour d’expérience sur différentes applications de réseau actif

Active network technologies, started by D. Tennenhouse’s work atmit in 1995 have led a lot of promises on the evolution of data networks. Active networks aim at integrating new application-level functionalities into active nodes within the network, in a flexible and extensible way. The research works on active networks have raised at the same time as the definition of new open network architectures (e.g., Tina model) and the deployment of intelligent networks merging telecom networks with distributed systems fields. This concept of “programmable networks” led to many technology-oriented projects, but has not identified relevant applications highlighting the benefits of the technology. During the three last years, our laboratory has tackled this gap and prototyped some use cases of open programmable networks. The paper gives an overview of each of these use cases and focuses on the integration with existing network elements both at transfer and management planes. Then it presents some assessments and perspectives. We show that programmable networks are optimizing globally resources to be deployed although they impose an overhead at node level, thanks to efficient integration choices. We present two scenarios of deployment of current programmable network platforms within the same network configuration than a realwan network.     

Décodage à sortie souple des réseaux de points

We present a universalmse algorithm for lattice decoding in dimensions up to 1024 for both Gaussian and Rayleigh fading channels. This algorithm can be applied to decode high diversity multidimensional rotations. The decoding is performed by a decision feedback equalizer and provides soft output which allows a concatenation of the lattice codes with other type of error-correcting codes. The problem of selecting a good rotation is also considered, and we show that a high dimensional random rotation exhibits very good performance on a Rayleigh fading channel.     

Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité

A commonly used method for achieving a prescribed security level in a telecommunication network is to manage extra capacities all over the network. This paper describes a number of computational methods, both exact and approximate, for determining a minimum cost network of extra capacities needed to achieve security under any given trunk dimensioning, routing and grouping policy. From a mathematical point of view, it is shown that the problem reduces to the determination of a minimum cost network subject to a number of non simultaneous multicommodity flow requirements. Since real life instances of such problems commonly result in very large linear programs of many thousands of variables and constraints, the techniques of linear programming would be unacceptably time and space-consuming. Instead, it is shown how the use of Lagrangean relaxation in conjunction with sub-gradient optimization schemes can lead to efficient and easy-to-implement solution methods. The various procedures described in this paper form the heart of a general software product for long and medium term planning applications (Supersec program) which has already been used to investigate the economical implications of security requirements in telecommunication networks.     

Antennes en réseau à bas niveau de lobes secondaires par commutation de la loi d’alimentation. Optimisation par l’algorithme génétique

The paper presents an approach of synthesis from a new thinned microstrip antennas array with binary feeding law. The operating principle of this type of antennas array consists in establishing a number of elements supplied at the center of the array as well as the feeding of the extreme elements. The problem of synthesis with constraints is dealt with only by the research of the binary feeding law of the array eccentric elements, thus allowing to reduce to the maximum the sidelobes level. To solve this type of problem, the genetic algorithm is proposed.     

Étude et réalisation de modulateurs et de démodulateurs directs quadriphases pour la régénération à bord des satellites relais

This paper presents the study of a four phase remodulation demodulator which is part of a microwave signal regenerator for communications payload or data relay satellites. At first, 3.87 GHz biphase (bpsk) balanced modulator has been produced, using planar technology with slotlines and microstrip lines engraved on an Epsilam-type substrate, and two beam-lead Schottky diodes. Under modulation, carrier and even harmonic rejection of better than 50 dB is obtained, with insertion losses lower than 2 dB. A fourphase (qpsk) modulator is also produced using two bpsk modulators. Each phase state is achieved at ± 1.3° with 5.2 dB of insertion losses and a residual amplitude modulation of ± 0.14 dB. Carrier and even harmonic rejection of 45 dB is obtained.     

Réflectomètre à haute résolution

Measurement capabilities of a single mode optical time domain reflectometer (Otdr) are given. Fault location accuracy is 1 m (when the group index of refraction is known) and spatial resolution is 3 m.     

Théorie asymptotique de la diffraction en optique physique appliquée aux antennes à réflecteur

In physical optics approximation, the high frequency asymptotic analysis is used to obtain the scattered field from a given reflector. The results for a circular flat reflector are compared with numerical exact solution. The derived physical optics diffraction coefficientsare found to be numerically in good agreement with those of the geometrical theory of diffraction (GID).Transition functions are introduced in those coefficients to remove the singularities at stradow and reflection boundaries. This asymptotic analysis is generalized for reflectors of arbitrary shape. The derived formal expression of diffraction dyadic is shown to be similar to the one of GTD only for axially symmetric reflectors. In this case, the diffracted field has a simple practical formula. Results for a paraboloid reflector fed by a short dipole are compared to physical optics solution.