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.     

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.     

AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing

With this paper, we propose a distributed online traffic engineering architecture formpls networks. In this architecture, a primary and secondarympls lsp are established from an ingresslsr to every other egresslsr. We propose to split thetcp traffic between the primary and secondary paths using a distributed mechanism based onecn marking andaimd-based rate control. Inspired by the random early detection mechanism for active queue management, we propose a random early reroute scheme to adaptively control the delay difference between the primary and secondarylsps. Considering the adverse effect of packet reordering ontcp performance for packet-based load balancing schemes, we propose that thetcp splitting mechanism operates on a per-flow basis. Using flow-based models developed for Internet traffic and simulations, we show that flow-based distributed multi-path traffic engineering outperforms on a consistent basis the case of a single path in terms of per-flow goodputs. Due to the elimination of out-of-order packet arrivals, flow-based splitting also enhancestcp performance with respect to packet-based splitting especially for longtcp flows that are hit hard by packet reordering. We also compare and contrast two queuing architectures for differential treatment of data packets routed over primary and secondarylsps in thempls data plane, namely first-in-first-out and strict priority queuing. We show through simulations that strict priority queuing is more effective and relatively more robust with respect to the changes in the traffic demand matrix than first-in-first-out queuing in the context of distributed multi-path routing.     

A simulation study of adaptive burst assembly algorithms in optical burst switched networks with self-similar traffic sources

It has been extensively demonstrated that the traffic pattern in today’s Internet is Self-Similar. Burst assembly algorithms utilized in optical burst switched (obs) edge routers can be used to reduce the degree of self-similarity. This work investigates the impact of time and size-based burst assembly algorithms utilized in obs edge routers, on the self-similarity level of the output traffic. Both static and adaptive algorithms are examined. Our study is based on the opnet simulation tool focusing on the characteristics of the output traffic in the presence of self-similar input traffic. To estimate the Hurst parameter of the aggregated input and output traffic streams, we have applied various Hurst parameter estimators. The performance impact of the burst assembly algorithms in terms of burst assembly delay and its jitter is also assessed. Our study has shown that the burst assembly mechanism at the obs edge router reduces the self-similarity level of the output traffic and that this reduction depends on the parameters of the algorithm. Our results reveal that the proposed adaptive burst assembly algorithm performs better comparing to its non-adaptive counterpart.     

Characterization and evaluation of TCP and UDP-based transport on real networks

StandardTcp (RenoTcp) does not perform well on fast long distance networks, due to its AMD congestion control algorithm. In this paper we consider the effectiveness of various alternatives, in particular with respect to their applicability to a production environment. We then characterize and evaluate the achievable throughput, stability and intra-protocol fairness of differentTcp stacks (Scalable,Hstcp,Htcp, FastTcp, Reno,Bictcp, hstcp-lp andLtcp) and aUdp based application level transport protocol (Udtv2) on both production and testbed networks. The characterization is made with respect to both the transient traffic (entry and exit of different streams) and the steady state traffic on production Academic and Research networks, using paths withRtts differing by a factor of 10. We also report on measurements made with 10 Gbit/secNics with and withoutTcp Offload Engines, on 10 Gbit/s dedicated paths set up forSc2004.     

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.     

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.     

10 gigabit Ethernet long-haul transmission without in-line EDFAs

In this contribution, we present experimental results on optical packet transmission of two 10 gigabit ethernet channels (10Ge) over 252 km link of standard single mode fibre (Ssmf, itu-t Recommendation G.652) and 287 km long link composed of 85 km ofSsmf and 202 km of non-zero dispersion-shifted (Nz DSF, itu-t Recommendation G.655) without deployment of in-line erbium-doped fiber amplifiers (Edfas). All the active components, dispersion compensating fibre (Dcf) modules and optical band-pass filters were placed at the transmitter and at the receiver side of the link. To our best knowledge, this is the first report of pure Ethernet transmission without in-lineEdfas over such a distance. The results are encouraging especially for operators of national research and educational networks who rely on leased dark fibres and prefer as long transmission as possible without deployment of in-line amplifiers.     

Bandwidth sharing with heterogeneous flow sizes

We consider a system with two heterogeneous traffic classes. The users from both classes randomly generate service requests, one class having light-tailed properties, the other one exhibiting heavy-tailed characteristics. The heterogeneity in service requirements reflects the extreme variability in flow sizes observed in the Internet, with a vast majority of small transfers (“mice”) and a limited number of exceptionally large flows (“elephants”). The active traffic flows share the available bandwidth in a Processor-Sharing (ps) fashion. Theps discipline has emerged as a natural paradigm for modeling the flow-level performance of band-width-sharing protocols liketcp. The number of simultaneously active traffic flows is limited by a threshold on the maximum system occupancy. We obtain the exact asymptotics of the transfer delays incurred by the users from the light-tailed class. The results show that the threshold mechanism significantly reduces the detrimental performance impact of the heavy-tailed class.     

Recherche locale à voisinage variable pour le routage optique dans des réseaux utilisant des routeurs latins

This paper proposes an approach based on Variable Neighbourhood Search (vns) to solve the Routing and Wavelength Assignment (rwa) problem in optical networks including latin routers. It can be summed up as establishing routing (finding intermediate routers on optical paths between each origin/destination pair) and wavelength assignment of these optical paths in such networks. The problem will be tackled according to two scenarii: to optimize the number of established connections (scenario 1) or to answer as well as possible an accurate traffic array (scenario 2). In traditional optical networks (without latin routers), one often separates routing and wavelength assignment because of the general problem complexity (each of the two sub-problems isnp-hard). However, latin routers introduce constraints connecting routing and assignment, this requires a simultaneous treatment of the two problems. A local search heuristic,vnsfor, based on the definition of different neighbourhoods (with simple and double moves) is proposed in this paper to provide us with solutions close to the optimum. Experimental results show howvnsfor leads to better solutions, according to both scenarii, in comparison with the reference algorithmlonca.     

Rogue-base station detection in WiMax/802.16 wireless access networks

We address the problem of detecting a rogue base station (Bs) in WiMax/802.16 wireless access networks. A rogueBs is a malicious station that impersonates a legitimate access point (Ap). The rogueBs attack represents a major denial-of-service threat against wireless networks. Our approach is based on the observation that inconsistencies in the signal strength reports received by the mobile stations (Mss) can be seen if a rogueBs is present in a network. These reports can be assessed by the legitimate base stations, for instance, when a mobile station undertakes a handover towards anotherBs. Novel algorithms for detecting violations of received signal strength reports consistency are described in this paper. These algorithms can be used by an intrusion detection system localized on the legitimateBss or on a global network management system operating theBss.     

Wideband and dynamic characterization of the 60GHZ indoor radio propagation — future homeWLAN architectures

This paper presents some results of a study concerning the radio propagation at 60GHZ in residential environments performed by theIETR (Electronic and Telecommunication Institute of Rennes, France). This study is part of aRNTR project named “COMMINDOR”. This exploratory project concerns the very high data rate (155 Mbit/s) and small range (about 10 m) radio communication systems for future home networks, which will permit multimedia equipment interconnection and control. The study is based on several measurement campaigns realized with a channel sounder based on the sliding correlation technique. This channel sounder has a 500MhZ bandwidth and a 2.3 ns effective time resolution. The measurements have been performed in residential furnished environments. The study of the angles-of-arrival (AOA) emphases the importance of openings (such as doors, staircase, etc.) for the radio propagation between adjacent rooms. A particular attention is paid to the influence of human activity on radio propagation. It is shown that people movements can make the propagation channel unavailable during about one second. From the characterization study of the indoor radio propagation, several recommendations concerning the deployment of the very high data rate 60GHZ wireless networks are derived.     

Mastering quality of service in GPRS/UMTS an overview

Quality of Service (QoS) has become a very important issue in networking, covering many performance aspects and numerous measures. The deployment of next generation wireless system includes 2.5G General Packet Radio Service (Gprs), which is the packet-switched extension of the Global System for Mobile communications (Gsm), and Third-Generation (3G) Universal Mobile Telecommunications System (Umts) to meet the needs of larger capacity and higher bit rates. AnUmts packet core network is an IP-based network. The Internet Engineering Task Force (Ietf) Forum developed several IP QoS related mechanisms available for IP transport networks. Service Quality Management (Sqm), one component of Telecommunication Management Network (Tun), will enable providers to manage QoS against objectives set out in customer Service Level Agreements (Slas) and will enable customers to compare the service offerings of different service providers.     

Space applications of optical communications

Optical communication in Space is now a reality. In this paper we present the recent developments that were undertaken in Europe for this application. We first describe the different missions where optical communications are useful: link between two geostationary satellites (geo-geo), Data Relay Mission (leo-geo) and High Data Rate Satellite Constellation Network. Then we detail the different candidate laser technologies from the most straightforward technologies that have been developed for optical fiber applications (λ=1.55 µm) and 0.8 µm technology based on Silicon detector to the recent developments based on high power fiber amplifiers. In the last chapter we describe thesilex (Semi conductor Intersatellite Link Experiment) program which performs optical communication betweenspot4 Earth observation satellite (cnes) andartemis (esa). The excellent results based on 0.8 µm laser diode technology are considered to be a major milestone in optical intersatellite communication     

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.     

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.     

ATM and AAL layer issues concerning multimedia applications

This paper presents an overview of the facilities that should be provided by theAtm layer and the adaptation layer (Aal) in order to support multimedia communications. From the analysis of data flows generated by well known multimedia applications and the services that could be offered byAtm networks both in the public and the private domain, we propose solutions enabling the availability of such applications onAtm networks taking into account both economical andQos parameters.     

Europeanist-programme roadmap for optical communications generated by theoptimist thematic network

On the basis of Europeanist project results in the field of photonics, theoptimist thematic network has produced a roadmap for optical communications. This work is described in the present article which provides scenarios for the evolution of the optical network in the coming 10 years. Predictable developments in optical components, sub-systems and systems and their consequences on the architecture and performances of the networks are analysed. Specific interest is focused on the various parts of the network structure namely the access, the metropolitan area, the wide area and the global networks. Technical documents elaborated by theoptimist consortium and minutes fromist workshops can be found on the website http://www.ist-optimist.org/.[1]. They constitute a main source for further information.     

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.     

Parallel interference cancellation efficiency for noisy signals in O-CDMA system

The aim of this paper is to evaluate the robustness of Parallel Interference Cancellation (Pic) to noise contribution for an optical Code Division Multiple Access system. The theoretical expression of thePic error probability is developed in the case of white additive Gaussian noise. From theoretical analysis, we show that, even with noise contribution, thePic receiver outperforms the Conventional Correlation Receiver (Ccr). Moreover, the results highlight that, for a given performance, thePic receiver relaxes not only the constraint on the code length, but also the Signal to Noise Ratio compared toCcr. Particularly, this is proofed in access network context, i.e. 30 users withBer lt; 10^?9.