Network-controlled mobility within radio access networks based onWLAN technologies

This article presents a network-controlled approach of user terminal mobility within anIP based WirelessLAN Access Network. In a first part, this article makes a review of the mobility support, on the subject of emergingWLAN technologies asHIPERLAN/2 andIEEE 802.11, on the one hand, and, regardingIP networks as currently studied withinIETF, on the other hand. Both types ofIP mobility protocols are presented, either global mobility protocols such as MobileIP, or local mobility management protocols (micro mobility). In the next part, the overall principles of our mobility management approach are explained; this approach is based on the implementation of a new network entity dedicated to the control of user terminal mobility. The last part details a practical implementation of this approach. The implementation is carried out on the basis of Hierarchical MobileIPv6 (HMIPv6). The experimental results confirm the importance to carefully plan and control the user terminal mobility within largeIP based Access Networks, as this brings benefit to the user as well as to the operator.     

Multimedia communication in wireless sensor networks

The technological advances in Micro ElectroMechanical Systems (Mems) and wireless communications have enabled the realization of wireless sensor networks (Wsn) comprised of large number of low-cost, low-power, multifunctional sensor nodes. These tiny sensor nodes communicate in short distances and collaboratively work toward fulfilling the application specific objectives ofWsn. However, realization of wide range of envisionedWsn applications necessitates effective communication protocols which can address the unique challenges posed by theWsn paradigm. Since many of these envisioned applications may also involve in collecting information in the form of multimedia such as audio, image, and video; additional challenges due to the unique requirements of multimedia delivery overWsn, e.g., diverse reliability requirements, time constraints, high bandwidth demands, must be addressed as well. Thus far, vast majority of the research efforts has been focused on addressing the problems of conventional data communication inWsn. Therefore, there exists an urgent need for research on the problems of multimedia communication inWsn. In this paper, a survey of the research challenges and the current status of the literature on the multimedia communication inWsn is presented. More specifically, the multimediaWsn applications, factors influencing multimedia delivery overWsn, currently proposed solutions in application, transport, and network layers, are pointed out along with their shortcomings and open research issues.     

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.     

Application level active network (alan) server management architecture

This paper presents the details of the policy-based security and resource management architecture for Application Level Active Network (alan) servers.alan is an active network architecture which enables deployment of user-customised processes (proxylets), which enhance the existing services or introduce new services to the end-user, on the select group of servers in anip network. The issues of security and resource management in this scenario are of crucial importance so as to efficiently facilitate and control the resource consumption of user-specified processes on the active servers, as well as to protect the server platforms from unauthorised proxylet deployment or malevolent behaviour. The architecture allowing efficient resource and security control is presented in this paper, including detaileduml diagrams capturing the management functionality, as well as a set of concrete management policies for thealan scenario. The examplexml policies are also given, and the deployment of this architecture in real-life trials is described. This development forms a part of a larger management architecture foralan-enabled networks developed in the context of theist projectandroid (Active Network DistRibuted Open Infrastructure Development).     

Strong and privacy-friendly management of federated identities for service provision over UMTS

Mobile subscribers who wish to mutually authenticate to service providers on the Internet utilize existing identity management mechanisms, such as Microsoft .net passport, overlooking the existing trust relationship between the subscriber and the 3G mobile operator and increasing network resources consumption, in an environment that requires security mechanisms that are as lightweight as possible. Furthermore, knowledge as well as the possession of an item, does not distinguish a person uniquely, revealing an inherent security weakness of pin authentication mechanisms. This paper proposes a protocol (3GbioId) for implementing strong identity management for Internet applications over 3G mobile networks. 3GBioId introduces biometrics, as well as the principles of the Liberty Alliance, into the 3G mobile security architecture, targeting to a more effective, secure and lightweight identity management alternative to the existing protocols. The results of a security, privacy, performance, usability and complexity evaluation indicate 3GbioId’s benefits and limits.     

Performance evaluation of DCCP: A focus on smoothness and TCP-friendliness

Recent years have seen dramatic increases of the use of multimedia applications on the Internet, which typically either lack congestion control or use proprietary congestion control mechanisms. This can easily cause congestion collapse or compatibility problems. Datagram Congestion Control Protocol (Dccp) fills the gap betweenUdp andTcp, featuring congestion control rather than reliability for packet-switched rich content delivery with high degree of flexibility. We present aDccp model designed and implemented withOpnet Modeler, and the experiments and evaluation focused on largely the smoothness of the data rates, and the fairness between concurrentDccp flows andTcp flows. We foundDccp-ccid3 demonstrates stable data rates under different scenarios, and the fairness betweenDccp andTcp is only achieved under certain conditions. We also validated that the throughput ofDccp-Ccid3 is proportional to the average packet size, and relatively fixed packet size is critical for the optimal operation ofDccp. Problems in the slow start phase and insufficient receiver buffer size were identified and we hereby proposed solutions on this.     

Application of ant colony optimization to adaptive routing in aleo telecomunications satellite network

Ant colony optimization (Aco) has been proposed as a promising tool for adaptive routing in telecommunications networks. The algorithm is applied here to a simulation of a satellite telecommunications network with 72Leo nodes and 121 earth stations. Three variants ofAco are tested in order to assess the relative importance of the different components of the algorithm. The bestAco variant consistently gives performance superior to that obtained with a standard link state algorithm (Spf), under a variety of traffic conditions, and at negligible cost in terms of routing bandwidth.     

WLAN standards and evolutions

Wireless Local Area Networks technologies have known an important technological and commercial development. Multiplicity of standards and variety of domains of use make necessary to compose with different technologies that can be seen either as concurrent or complementary. In this article, after positioning the different types of wireless networks (IEEE 802.11, HomeRF,HIPERLAN/2, Bluetooth) for mass market and professional applications destination, some generalities are briefly reminded such as centralised and ad-hoc architectures, regulatory constraints in the 2.45 and 5GHZ frequency bands used forWLAN, typical ranges, mobility and security features and limitations. Then the differentIEEE (802.11, 802.11a et 802.11b) andETSI (HIPERLAN/2) standards are described in details as well as their foreseen evolutions. It appears that 802.11 family of standards would take benefit of the currently existing products to evolve smoothly while integrating new features (broadband 802.11a physical layer, necessary radio features to meet European regulatory requirements, future introduction of Quality of Service schemes…). In the meantime,HIPERLAN/2 which has been specified as a complete system already supports most of those important features and is able to be adapted to various kinds of higher network layers. Lastly, it is shown that interworking schemes between 3G cellular systems andWLAN currently under investigations in 3GPP andETSI BRAN should permit in the future to easily operate wide area and multi-access technology based mobile networks.     

A MC-CDMA system analysis in a software radio context

This paper presents a Multi-Carrier Code Division Multiple Access (Mc-Cdma) system analysis in a software radio context. Based on a combination of multi-carrier modulation and code division multiple access,Mc-Cdma benefits from the main advantages from both schemes: high spectral efficiency, high flexibility, multiple access capabilities, etc. It is firstly shown why, nowadays,Mc-Cdma is undoubtedly a high potential candidate for the air interface of the 4G cellular networks. TheMc-Cdma concept and the block-diagrams of the transmitter and the receiver are presented first. Afterwards, the technical issues concerning the processing devices for the implementation ofMc-Cdma systems in a software radio context are analysed. The advantages and disadvantages of Digital Signal Processors (Dsps) and Field Programmable Gate Arrays (Fgpas) components are discussed. The implementation ofMc-Cdma systems and the integration of signal processing algorithms as Fast Hadamard Transform (Fht) and Inverse Fast Fourier Transform (Ifft) are considered and analysed for the first time. Finally, implementation results with a mixed prototyping board are presented. Then, it is shown that a new combination of the flow graphs ofFht andIfft leads to interesting computation savings and that hardware structures asFgpas are more adapted thanDsps to those intensive computation functions. Finally, for the completeMc-Cdma modem implementation, the necessity of a Co-Design methodology is highlighted in order to obtain the best matching between algorithms and architecture.     

Securing communications overAtm networks: the remoteAtm private networks interconnection example

When remoteAtm sites communicate through anAtm public network, a number of security problems arise, such as hacking, eavesdropping and traffic tampering. This paper proposes three contributions to these security problems. Firstly, risks due toAtm technology usage are detailed. Secondly, a survey of existing techniques aiming at securingAtm communications is presented with emphasis on theAtm Forum’s security specifications. Thirdly, a new solution called Safe (which stands for Solution for anAtm Frequent communications Environment) developed in the Démostène project is described. Safe realizes both firewall’s filtering functions and communications protection over theAtm network. The main idea of Safe is to use signaling (Uni 3.1) as a means to exchange security information over the network. This idea has been implemented and introduced to theAtm Forum.     

An evaluation oftcp with explicit congestion notification

We study the effect of Explicit Congestion Notification (ecn) ontcp for relatively large but finite file transfers inip networks, and compare it to other congestion avoidance mechanisms, namely Drop Tail (dt) and Random Early Detection (red). We use simulation to measuretcp performance for transfers initiated by a varying number of end hosts. In contrast to previous work, we focus on situations in which all nodes in the network operate uniformly under the same mechanism (dt orred orecn). Our results show that under such uniform conditionsecn does not necessarily lead to significant improvement intcp goodput, although in no case does it lead to an actual degradation in performance. Our results also show that, withecn, tcp flows benefit from lower overhead for unsuccessful transmissions. Furthermore, lockouts are largely avoided. In other words, in an all-ecn network resources are shared more fairly. Finally, we show that global synchronization is no longer an issue, and argue that currenttcp versions have essentially solved the problem, regardless of the queue management scheme employed.     

Optimizing IP networks in a hybrid IGP/MPLS environment

In this paper, we consider a traffic engineering (te) approach toip networks in a hybridigp/mpls environment. Thoughigp (Interior Gateway Protocol) routing has proven its scalability and reliability, effective traffic engineering has been difficult to achieve in public IP networks because of the limited functional capabilities of conventionalip technologies.mpls (Multi-Protocol Label Switching) on the one hand enhances the possibility to engineer traffic onip networks by allowing explicit routes. But on the other hand it suffers from the scalability (n-square) problem. Hybridigp/mpls approaches rely onip native routing as much as possible and usempls only if necessary. In this work we propose a novel hybrid traffic engineering method based on genetic algorithms, which can be considered as an offlinete approach to handle long or medium-term traffic variations in the range days, weeks or months. In our approach the maximum number of hops anlsp (Label Switched Path) may take and the number oflsps which are applied solely to improve the routing performance, are treated as constraints due to delay considerations and the complexity of management. We apply our method to the German scientific network (b-win) for which a traffic matrix is available and also to some other networks with a simple demand model. We will show results comparing this hybridigp/mpls routing scenario with the result of pureigp routing and that of a full meshmpls with and without traffic splitting.     

A countermeasure againstDDOS attacks using active networks technologies

A Distributed Denial of Service (DDoCS) attack consumes the resources of a remote host or network by sending a massive amount ofIP packets from many distributed hosts. It is a pressing problem on the Internet as demonstrated by recent attacks on major e-commerce servers andISPs. Since the attack is distributed and the attack tools evolve at a rapid and alarming rate, an effective solution must be formulated using a distributed and adaptive approach. In this paper, we propose a countermeasure againstDDoCS attacks using a method we call Active Shaping. Our method employs the Active Networks technologies, which incorporates programmability into network nodes. The Active Networks technology enables us to deter congestion and bandwidth consumption of the backbone network caused byDDoCS attacks, and to prevent our system from dropping packets of legitimate users mistakenly. This paper introduces the concept of our method, system design and evaluates the effectiveness of our method using a prototype.     

Modeling of submicrometer gate GaAs field effect transistors

Before describing the mainFet modelings today available, the main technological evolutions ofMesfet andTegfet are summarized. It is brought some information on the various physical effects that occur in the devices and that must be taken into account in the models. It is shown that the different kinds of modelings (Monte Carlo, two dimensional, one dimensional) constitute a continuous chain, where the different elements appear strictly complementary. Finally, the present situation concerning modeling ofMesfet andTegfet will be presented.     

MOEMS devices and their applications to optical telecommunication systems

This paper describes first the basicmoems technologies and attempts to point out the various degrees of freedom that are available for the designer. Then, it will review some of the most important architectures ofmoems demonstrated up to now, for optical switching and wavelength management inWDM networks. These technologies are also very promising for optical connectorization, and could open the way to new components that could be cheap enough for being used at the subscriber level. An analysis of the present status ofmoems technologies, the main short term issues, and some development prospects will finally be given.     

Un environnement de conception de systèmes distribués basé sur UML

This paper introduces a new environment for developing distributed systems. It is based on theTurtle uml profile. Analysis and design phases, described in previous papers, have been extended with an additional deployment phase. In this new step,Turtle components are deployed over hardware execution nodes, and nodes are connected together throughout links,Turtle deployment diagrams are given a formal semantics inRt-lotos, therefore following the approach used forTurtle analysis and design diagrams. Moreover, the paper presents a Java code generator which outputs appropriate Java code forTurtle deployment diagrams. This code is automatically deployable on networks because it implements node communication using network protocols such asUdp orRmi. ttool, the turtle toolkit has been extended to support these new diagrams and code generators. The attack of protected data exchanged throughout securedHttp sessions serves as example.     

Measurement-based admission control in UMTS

In this paper, we develop an efficient Call Admission Control (cac) algorithm forumts systems. We first introduce the expressions that we developed for Signal-to-Interference (sir) for both uplink and downlink, to obtain a novelcac algorithm that takes into account, in addition tosir constraints, the effects of mobility, coverage as well as the wired capacity behind the base station, for the uplink, and the maximal transmission power of the base station, for the downlink. As of its implementation, we investigate the measurement-based approach as a means to predict future, both handoff and new, call arrivals and thus manage different priority levels depending on a tunable coefficient. Compared to classicalcac algorithms, ourcac mechanism achieves better performance in terms of outage probability and QoS management.     

Bandwidth sharing under the assured forwarding Per-Hop behavior

The DiffServ’s Assured Forwarding (af) Per-Hop Behavior (phb) Group defines a differentiated forwarding of packets in four independent classes, each class having three levels of drop precedence. Specific end-to-end services based on thisphb are still being defined. A particular type of service that could assure a given rate to a traffic aggregate has been outlined elsewhere. In such a service, a fair distribution of bandwidth is one of the main concerns. This paper presents experimental work carried out to evaluate howaf distributes bandwidth among flows under different load conditions and traffic patterns. We focused on the effect that marking mechanisms have on bandwidth sharing among flows within a singleaf class. The traffic types we used includeudp flows, individual and aggregatedtcp flows, mix oftcp andudp, tcp sessions with heterogeneous round-trip times, as well as color-blind and color-aware re-marking at the aggregation point fortcp flows. Tests were performed on real and simulated networks. We have found certain conditions under whichaf distributes bandwidth fairly among nonadaptiveudp flows andtcp aggregates. Finally, we evaluate a basic rule for setting the parameters of the two-rate Three-Color Marker conditioning algorithm (trtcm) in order to achieve a better bandwidth distribution fortcp flows.