Retour au site du LAAS-CNRS

Laboratoire d’analyse et d’architecture des systèmes
Choisir la langue : FR | EN

554documents trouvés

18295
02/11/2018

Virtual Link Embedding in Software-Defined Multi-radio Multi-channel Multi-hop Wireless Networks

L.CHEN, S.ABDELLATIF, A.SIMO TEGUEU, T.GAYRAUD

SARA

Manifestation avec acte : ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems ( MSWIM ) 2018 du 28 octobre au 02 novembre 2018, Montreal (Canada), Novembre 2018, 10p. , N° 18295

Lien : https://hal.archives-ouvertes.fr/hal-01869640

Diffusable

Plus d'informations

Abstract

There is rising interest in applying SDN principles to wireless multi-hop networks, as this paves the way towards bringing the pro-grammability and flexibility that is lacking in today's distributed wireless networks (ad-hoc, mesh or sensor networks) with the promising perspectives of better mitigating issues as scalability, mobility and interference management and supporting improved controlled QoS services. This paper investigates this latter aspect and proposes an Integer Linear Programming (ILP) based wireless resource allocation scheme for the provision of point-to-point and point-to-multipoint end-to-end virtual links with bandwidth requirements in software-defined multi-radio multi-channel wireless multi-hop networks. The proposed scheme considers the specificities of wireless communications: the broadcast nature of wireless links which can be leveraged for point-to-multipoint links resource allocations, and, the interference between surrounding wireless links. It also considers switching resource consumption of wireless nodes since, for the time being, the size of SDN forwarding tables remains quite limited. A Genetic Algorithm derived from the ILP formulation is also proposed to address the case of large wireless networks. Our simulation results show that both methods work effectively.

144675
18317
19/10/2018

Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays (long version)

T.NGUYEN, O.BRUN, B.PRABHU

SARA

Rapport LAAS N°18317, Octobre 2018, 33p.

Lien : https://hal.laas.fr/hal-01575320

Diffusable

Plus d'informations

Abstract

We analyse the performance of an incentive scheme for two-hop DTNs in which a back-logged source proposes a fixed reward to the relays to deliver a message. Only one message at a time is proposed by source. For a given message, only the first relay to deliver this message gets the reward corresponding to this message thereby inducing a competition between the relays. The relays seek to maximize the expected reward for each message whereas the objective of the source is to satisfy a given constraint on the probability of message delivery. We show that the optimal policy of a relay is of threshold type: it accepts a message until a first threshold and then keeps the message until it either meets the destination or reaches the second threshold. Formulas for computing the thresholds as well as probability of message delivery are derived for a backlogged source.

144820
18181
01/10/2018

AFIRM: Adaptive forwarding based link recovery for mobility support in NDN/IoT networks

M.MEDDEB, A.DHRAIEF, A.BELGHITH, T.MONTEIL, K.DRIRA, S.GANNOUNI

SARA, HANA Research Group, King Saud University

Revue Scientifique : Future Generation Computer Systems, Vol.87, pp.351-363, Octobre 2018 , N° 18181

Lien : https://hal.laas.fr/hal-01826952

Diffusable

Plus d'informations

Abstract

The Internet of Things (IoT) ecosystem includes a plethora of devices equipped with heterogeneous communication interfaces. They exhibit different mobility patterns and hardware constraints as memory, battery and processing power. On the other hand, IoT applications are overlayed on top of these constrained-devices imposing stringent requirements in term of data availability, data coherence, and response latency. To cope with these challenges, Named Data Networking (NDN) architecture is positioned in the middle layer to act as the networking layer. By providing easy data access thanks to the unique and location-independent content names, in-network caching and name-based routing, NDN expects to hide from IoT applications the complexity and diversity of the underlying Things by adapting the network operation to their features. In this paper, we focus on data availability requirements threatened by high IoT network dynamics related to sensors mobility. We address the producer mobility issue in NDN/IoT networks using the routing-based approach. We propose a novel and efficient forwarding algorithm named AFIRM in order to support producer mobility, and compare its performances to those of other relevant solutions based on the routing approach.

143993
18269
28/09/2018

Rethinking IXPs' Architecture in the Age of SDN

M.BRUYERE, G.ANTICHI, E.FERNANDES, R.LAPEYRADE, S.UHLIG, P.OWEZARSKI, A.W.MOORE, I.CASTRO

SARA, Univ Quenn Mary, Londres, CAMBRIDGE

Revue Scientifique : IEEE Journal on Selected Areas in Communications, 8p., Septembre 2018, DOI: 10.1109/JSAC.2018.2871294 , N° 18269

Lien : https://hal.laas.fr/hal-01862776

Diffusable

Plus d'informations

Abstract

Software Defined Internet eXchange Points (SDXs) are a promising solution to the long-standing limitations and problems of interdomain routing. While proposed SDX architectures have improved the scalability of the control plane, these solutions have ignored the underlying fabric upon which they should be deployed. In this paper, we present Umbrella, a software defined interconnection fabric that complements and enhances those architectures. Umbrella is a switching fabric architecture and management approach that improves the overall robustness, limiting control plane dependency and suitable for the topology of any existing Internet eXchange Point (IXP). We validate Umbrella through a real-world deployment on two production IXPs, TouSIX and NSPIXP-3, and demonstrate its use in practice, sharing our experience of the challenges faced.

144577
18274
28/09/2018

Computing Parameters of Sequence-Based Dynamic Graphs

A.CASTEIGTS, R.KLASING, MYNEGGAZ, J.PETERS

LABRI, SARA, SFU

Revue Scientifique : Theory of Computing Systems, 24p., Septembre 2018, DOI : 10.1007/s00224-018-9876-z , N° 18274

Lien : https://hal.archives-ouvertes.fr/hal-01872351

Diffusable

Plus d'informations

Abstract

We present a general framework for computing parameters of dynamic networks which are modelled as a sequence G=(G1,G2,…,Gδ) of static graphs such that Gi=(V,Ei) represents the network topology at time i and changes between consecutive static graphs are arbitrary. The framework operates at a high level, manipulating the graphs in the sequence as atomic elements with two types of operations: a composition operation and a test operation. The framework allows us to compute different parameters of dynamic graphs using a common high-level strategy by using composition and test operations that are specific to the parameter. The resulting algorithms are optimal in the sense that they use only O(δ) composition and test operations, where δ is the length of the sequence. We illustrate our framework with three minimization problems, bounded realization of the footprint, temporal diameter, and round trip temporal diameter, and with T-interval connectivity which is a maximization problem. We prove that the problems are in NC by presenting polylogarithmic-time parallel versions of the algorithms. Finally, we show that the algorithms can operate online with amortized complexity Θ(1) composition and test operations for each graph in the sequence.

144590
18257
26/09/2018

Executing bigraphical reactive systems

A.GASSARA, I.BOUASSIDA, M.JMAIEL, K.DRIRA

ReDCAD Laboratory, SARA

Revue Scientifique : Discrete Applied Mathematics, 25p., Septembre 2018, doi 10.1016/j.dam.2018.07.006 , N° 18257

Lien : https://hal.archives-ouvertes.fr/hal-01879533

Diffusable

Plus d'informations

Abstract

In order to enable experimentations and simulations of bigraphs, we need an implementation of their dynamic. In this paper, we tackle the matching issue of this task. We present a solution based on an investigation on graph matching. We propose to simulate a bigraphical reactive system (i.e., bigraphs with a set of reaction rules that allow their rewriting) with a graph transformation system. First, we translate a bigraph to a ranked graph. This translation is ensured by defining a faithful functor that allows to move from the bigraph category to the ranked graph category. Then, we show that reaction rules can be simulated with graph rules. Hence, we provide a formal basis allowing to execute bigraph transformations by simulating their translation aiming to use well-established and efficient graph transformation tools.

144513
18260
26/09/2018

Joint Minimization of Monitoring Cost and Delay in Overlay Networks: Optimal Policies with a Markovian Approach

S.VATON, O.BRUN, M.MOUCHET, P.BELZARENA, I.AMIGO, B.PRABHU, T.CHONAVEL

UBL, SARA, IMT Atlantique, UdelaR

Revue Scientifique : Journal of Network and Systems Management, Septembre 2018, DOI : 10.1007/s10922-018-9464-1 , N° 18260

Lien : https://hal.archives-ouvertes.fr/hal-01857738

Diffusable

Plus d'informations

Abstract

Continuous monitoring of network resources enables to make more-informed resource allocation decisions but incurs overheads. We investigate the trade-off between monitoring costs and benefits of accurate state information for a routing problem. In our approach link delays are modeled by Markov chains or hidden Markov models. The current delay information on a link can be obtained by actively monitoring this link at a fixed cost. At each time slot, the decision maker chooses to monitor a subset of links with the objective of minimizing a linear combination of long-run average delay and monitoring costs. This decision problem is modeled as a Markov decision process whose solution is computed numerically. In addition, in simple settings we prove that immediate monitoring cost and delay minimization leads to a threshold policy on a filter which sums up information from past measurements. The lightweight method as well as the optimal policy are tested on several use-cases. We demonstrate on an overlay of 30 nodes of RIPE Atlas that we obtain delay values close to the performance of the always best path with an extremely low monitoring effort when delays between nodes are modeled with hierarchical Dirichlet process hidden Markov models.

144521
18250
07/09/2018

Skin Lesion Analysis Towards Melanoma Detection for ISIC 2018

Q.H.LU, T.NGUYEN, TTN.NGUYEN, T.Z.NGUYEN, T.D.Tô

IMT, Toulouse, SARA

Rapport LAAS N°18250, Septembre 2018, 4p.

Lien : https://hal.archives-ouvertes.fr/hal-01847743

Diffusable

Plus d'informations

Abstract

In this paper we summarize our methods for the ISIC 2018 Competition: Skin Lesion Analysis Towards Melanoma Detection.

144417
18270
20/08/2018

Evaluating the Impact of Traffic Sampling on AATAC's DDoS Detection

G.ROUDIERE, P.OWEZARSKI

TSF, SARA

Manifestation avec acte : Workshop on Traffic Measurements for Cybersecurity ( WTMC ) 2018 du 20 août au 20 août 2018, Budapest (Hongrie), Août 2018, pp.27-32 , N° 18270

Lien : https://hal.laas.fr/hal-01862765

Diffusable

Plus d'informations

Abstract

As Distributed Denial of Service (DDoS) attack are still a severe threat for the Internet stakeholders, they should be detected with efficient tools meeting industrial requirements. In a previous paper, we introduced the AATAC detector, which showed its ability to accurately detect DDoS attacks in real time on full traffic, while being able to cope with the several constraints due to an industrial operation. However, in a realistic scenario, network monitoring is done using sampled traffic. Such sampling may impact the detection accuracy or the pertinence of produced results. Consequently, in this paper, we evaluate AATAC over sampled traffic. We use five different count-based or time-based sampling techniques, and show that AATAC's resources consumption is in general greatly reduced with little to no impact on the detection accuracy. Obtained results are succinctly compared with those from FastNetMon, an open-source threshold-based DDoS detector.

144579
18086
06/08/2018

Reasoning on the edge or in the cloud ?

N.SEYDOUX, K.DRIRA, N.HERNANDEZ, T.MONTEIL

SARA, IRIT

Revue Scientifique : Internet Technology Letters, 6p., Août 2018, doi 10.1002/itl2.51 , N° 18086

Lien : https://hal.laas.fr/hal-01768546

Diffusable

Plus d'informations

Abstract

The emergence of the IoT and the Semantic Web of Things is leading to intensive cloud processing executing reasoning rules over large volumes of enriched data. However, the role of the cloud in existing approaches as a central point for both data processing and provisioning reduces scalability and introduces latency. This paper sketches a new approach for rule-based reasoning, enabling distributed rule evaluation on edge nodes and reducing the latency for IoT applications while avoiding the total dependence on a central node. This approach is evaluated in a simulated smart building.

144072
Les informations recueillies font l’objet d’un traitement informatique destiné à des statistiques d'utilisation du formulaire de recherche dans la base de données des publications scientifiques. Les destinataires des données sont : le service de documentation du LAAS.Conformément à la loi « informatique et libertés » du 6 janvier 1978 modifiée en 2004, vous bénéficiez d’un droit d’accès et de rectification aux informations qui vous concernent, que vous pouvez exercer en vous adressant à
Pour recevoir une copie des documents, contacter doc@laas.fr en mentionnant le n° de rapport LAAS et votre adresse postale. Signalez tout problème de dysfonctionnement à sysadmin@laas.fr. http://www.laas.fr/pulman/pulman-isens/web/app.php/