Search - Department of Networks, Systems and Services Access content directly

Filter your results

1 136 Results
Image document

A Game Theoretical Model addressing Misbehavior in Crowdsourcing IoT

Runbo Su , Arbia Riahi Sfar , Enrico Natalizio , Pascal Moyal , Ye-Qiong Song
20th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON 2023), IEEE, Sep 2023, Madrid, Spain
Conference papers hal-04205286v1
Image document

A Role-based Trust Model assessing IoA services: First Results on Real MAS Implementation by using ROS 2

Runbo Su , Amaury Saint-Jore
Preprints, Working Papers, ... hal-04161463v1
Image document

A lightweight cooperative trust model for IoV

Runbo Su , Yujun Jin , Ye-Qiong Song
The 32nd International Conference on Computer Communications and Networks (ICCCN 2023), Jul 2023, Honolulu, United States
Conference poster hal-04152830v1
Image document

ML Models for Detecting QoE Degradation in Low-Latency Applications: A Cloud-Gaming Case Study

Joël Roman Ky , Bertrand Mathieu , Abdelkader Lahmadi , Raouf Boutaba
IEEE Transactions on Network and Service Management, 2023, pp.1-1. ⟨10.1109/TNSM.2023.3293806⟩
Journal articles hal-04160235v1
Image document

Avoiding the 1 TB Storage Wall: Leveraging Ethereum's DHT to Reduce Peer Storage Needs

Jean-Philippe Eisenbarth , Thibault Cholez , Olivier Perrin
The 5th ACM International Symposium on Blockchain and Secure Critical Infrastructure (BSCI 2023), ACM ASIACCS Workshop, Jul 2023, Melbourne, Australia. pp.10
Conference papers hal-04163897v2
Image document

A Hybrid P4/NFV Architecture for Cloud Gaming Traffic Detection with Unsupervised ML

Joël Roman Ky , Philippe Graff , Bertrand Mathieu , Thibault Cholez
28th IEEE Symposium on Computers and Communications (ISCC 2023), IEEE, Jul 2023, Gammarth, Tunisia. pp.733-738, ⟨10.1109/ISCC58397.2023.10217863⟩
Conference papers hal-04130096v1
Image document

Privacy leakages on NLP models and mitigations through a use case on medical data

Gaspard Berthelier , Antoine Boutet , Antoine Richard
COMPAS 2023 - Conférence francophone d'informatique en Parallélisme, Architecture et Système, LISTIC - Laboratoire d’Informatique, Systèmes, Traitement de l’Information et de la Connaissance / USBM - Université Savoie Mont Blanc, Jul 2023, Annecy, France. pp.1-8
Conference papers hal-04138528v1

Computing Robust Solutions for the Stochastic CARP

Gérard Fleury , Philippe Lacomme , Christian Prins , Wahiba Ramdane Cherif-Khettaf
ODYSSEUS 2003 Second International Workshop on Freight Transportation and Logistics Mondello (Palermo), Sicily, Italy, May 27-30, 2003, Jun 2023, Palermo, France
Conference papers hal-04146655v1
Image document

Exploiting the synergies of unmanned aerial vehicles (UAVs) and 5G network

Debashisha Mishra
Emerging Technologies [cs.ET]. Université de Lorraine, 2023. English. ⟨NNT : 2023LORR0058⟩
Theses tel-04193151v1

Resilient leader-following formation control for a fleet of unmanned aerial vehicles under cyber-attacks

Juan Antonio Vazquez Trejo , Adrien Guenard , Manuel Adam-Medina , Laurent Ciarletta , Jean-Christophe Ponsart , et al.
International Conference on Unmanned Aircraft Systems, ICUAS 2023, Jun 2023, Warsaw, Poland. ⟨10.1109/ICUAS57906.2023.10156075⟩
Conference papers hal-04199781v1
Image document

Valorisation de la DHT d'Ethereum pour réduire les besoins de stockage des pairs

Jean-Philippe Eisenbarth , Thibault Cholez , Olivier Perrin
CoRes 2023 - 8èmes Rencontres Francophones sur la Conception de protocoles, l'évaluation de performances et l'expérimentation de Réseaux de communication, May 2023, Cargèse (Corse), France
Conference papers hal-04080219v1
Image document

REWIRE -Cybersecurity skills alliance: a new vision for Europe

Matthews Jose , Rémi Badonnel , Thibault Cholez , Hervé Debar , Olivier Levillain , et al.
RESSI 2023 : Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, 2023
Other publications hal-04165397v1
Image document

Evaluation Framework for ML-based IDS

Solayman Ayoubi , Gregory Blanc , Houda Jmila , Sébastien Tixeuil , Thomas Silverston
RESSI 2023 : Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, May 2023, Neuvy-sur-Barangeon, France
Conference poster hal-04164441v1
Image document

Efficient Identification of Cloud Gaming Traffic at the Edge

Philippe Graff , Xavier Marchal , Thibault Cholez , Bertrand Mathieu , Olivier Festor
NOMS 2023 - 36th IEEE/IFIP Network Operations and Management Symposium, May 2023, Miami, United States. pp.10, ⟨10.1109/NOMS56928.2023.10154417⟩
Conference papers hal-04056607v1
Image document

Auto-tuning of Hyper-parameters for Detecting Network Intrusions via Meta-learning

Omar Anser , Jérôme François , Isabelle Chrisment
NOMS 2023 - IEEE/IFIP Network Operations and Management Symposium (NOMS) - AnNet workshop, IEEE; IFIP, May 2023, Miami, United States. pp.1-6, ⟨10.1109/NOMS56928.2023.10154381⟩
Conference papers hal-04180417v1
Image document

Multi-label Classification of Hosts Observed through a Darknet

Enzo D’andréa , Jérôme François , Olivier Festor , Mehdi Zakroum
NOMS 2023 - IEEE/IFIP Network Operations and Management Symposium (NOMS) - Experience Session, May 2023, Miami, United States. ⟨10.1109/NOMS56928.2023.10154356⟩
Conference papers hal-04180419v1
Image document

HiFiPot: a High-Fidelity Emulation Framework for Internet of Things Honeypots

Pierre-Marie Junges , Jérôme François , Olivier Festor
NOMS 2023 - IEEE/IFIP Network Operations and Management Symposium (NOMS), May 2023, Miami, United States. ⟨10.1109/NOMS56928.2023.10154359⟩
Conference papers hal-04180801v1

In-network real-value computation on programmable switches

Matthews Jose
Computer Science [cs]. Université de Lorraine, 2023. English. ⟨NNT : 2023LORR0057⟩
Theses tel-04194968v1

Membrane Separation Processes Using Machine Learning Based Mathematical Programming Models

Amalia Macali
Computer Science [cs]. Université de Lorraine, 2023. English. ⟨NNT : 2023LORR0038⟩
Theses tel-04157670v1
Image document

Synql: Replicated Relations and Integrity Maintenance

Victorien Elvinger , Claudia-Lavinia Ignat
Inria. 2023
Reports hal-03999168v1

Optimization of Direct Transportation Flows for the Removal of Construction Waste Bins with both Resource and Task Availability Interval Constraints

Safae Abderebbi , Wahiba Ramdane Cherif-Khettaf
The optimization of the Big-bag removal is studied in (Jaballah and Ramdane Cherif-Khettaf, 2021; Ramdane Cherif-Khettaf et al., 2022) where a new vehicle routing model called the Multi-Trip Pickup and Delivery Problem, with Split loads, Profits and Multiple Time Windows was proposed. This model allowed mutualization of material delivery with Big- Bag waste removal, using tail-lift truck fleet. In this study, we focus only on waste bin removal, which consists in performing a set of direct trips from the platform to the construction sites to satisfy construction site requests for full bins removal and their replacement by empty bins. The remainder of the paper is organized as follows. Section 2 describes the problem and related literature; two MIP models are presented in section 3. Experimental results with the definition of benchmarks are given in section 4. Finally, concluding remarks are given in section 5. 2 PROBLEM DESCRIPTION AND RELATED LITERATURE A limited heterogeneous fleet of tipper trucks (vehicles) situated at the platform must perform multiple direct trips between the platform and the construction sites. The vehicles differ by their speed and their distance limit. Each trip consists of loading an empty bin at the platform, delivering it to a given construction site, collecting a full waste bin from this construction site, and unloading it in the recycling center located just next to the platform. Each vehicle has one or more periods of availability, which represent the time windows when the vehicles are available at the platform and so can move to the construction sites to collect waste bins, outside of these periods of availability, the vehicles can be mobilized for other tasks external to the platform and can’t satisfy the request of bin removal. The platform also has a period of availability, that is given by the platform's opening hours. The construction sites have one or more types of bins depending on the specificity of the works in progress in the construction site (bin for wood, bin for metals, bin for plaster, bin for inert materials, etc.). Each site has only one bin per type, and must therefore send to the platform requests for bin removal. The platform must manage the bins waste removal with the available resources and ensure the replacement of each full bin with an empty one. The construction sites also have one or more periods of availability during which vehicles access is allowed, and thus the arrival and departure of vehicles at the construction site location must be within one of the availability time windows allowed by the construction site. We denote by a bin removal task, all operations that consists of loading the vehicle with an empty bin at the platform, travelling from the platform to the construction site, unloading the empty bin at the construction site, loading the full bin, travelling back to the platform and unloading the full bin at the platform's recycling center. Platform service time is the time required for loading and unloading the bin on the platform. This problem can be modelled as unrelated parallel machine scheduling problem in which the vehicles can be represented as machines with multiple periods of availability and the bin removal tasks as jobs that have one or multiple periods of availability, and require a certain amount of processing time, that depends on the vehicle that is used. In addition, the constraint of availability of the tasks in our case concerns only a part of the task processing time, it is the loading and unloading part at the location of the construction site and does not concern the part of the travel to and from the site. The objective is to perform the maximum number of bin removal tasks, to determine the assignment of tasks to the availability intervals of the vehicles; and to define the sequence of satisfied tasks per available interval of each used vehicle. In terms of computational complexity (Lenstra et al., 1977) proved that the single machine scheduling problem with only release dates, which is a special case of our problem is NP-hard. In literature, extensive studies have been conducted in the area of parallel machine scheduling with time constraints without availability constraints (Arik et al.,2022; Osorio-Valenzuela et al., 2019). In most of the research reviewed in the area of parallel machine scheduling, the availability constraints are defined on resources (Such-Jeng, 2013). Very few studies consider the availability intervals of tasks as in (Gedik et al.,2016). A survey on parallel machine scheduling under availability constraints can be found (Kaabi and Harrath, 2014). Despite the abundant literature on parallel machine scheduling, the problem that we present here is in our knowledge a novel one and allows us to model a new constraint in unrelated parallel machine scheduling problems, that is both resource and task multiple availability interval constraint. Our contribution can be summarized in the two following issues: ─ Modeling a real problem of direct transportation of bin waste in the construction sector as a parallel machine scheduling problem with a new specific constraint that is multiple periods ofICORES 2023 - 12th International Conference on Operations Research and Enterprise Systems, Feb 2023, Lisbon, Portugal. pp.221-228, ⟨10.5220/0011821900003396⟩
Conference papers hal-04056131v1
Image document

Méthodes de détection pour la sécurité des systèmes IoT hétérogènes

Adrien Hemmer
Informatique [cs]. Université de Lorraine, 2023. Français. ⟨NNT : 2023LORR0020⟩
Theses tel-04158359v1
Image document

Approche hiérarchique de co-simulation pour l'étude des échanges d’énergie des micro-réseaux

Jean-Baptiste Wiart
Modélisation et simulation. Université de Lorraine, 2023. Français. ⟨NNT : 2023LORR0026⟩
Theses tel-04142176v2
Image document

An Analysis of Cloud Gaming Platforms Behaviour Under Synthetic Network Constraints and Real Cellular Networks Conditions

Xavier Marchal , Philippe Graff , Joël Roman Ky , Thibault Cholez , Stéphane Tuffin , et al.
Journal of Network and Systems Management, 2023, Special Issue on High-Precision, Predictable and Low-Latency Networking, 31 (2), pp.39. ⟨10.1007/s10922-023-09720-9⟩
Journal articles hal-04050288v1

Flow Lenia: Mass conservation for the study of virtual creatures in continuous cellular automata

Erwan Plantec , Gautier Hamon , Mayalen Etcheverry , Pierre-Yves Oudeyer , Clément Moulin-Frier , et al.
Preprints, Working Papers, ... hal-03904389v1
Image document

Analyse, valorisation et protection des réseaux pair-à-pair de blockchains publiques

Jean-Philippe Eisenbarth
Informatique [cs]. Université de Lorraine, 2022. Français. ⟨NNT : 2022LORR0213⟩
Theses tel-04056712v1
Image document

Data-driven evaluation of intrusion detectors: a methodological framework

Solayman Ayoubi , Gregory Blanc , Houda Jmila , Thomas Silverston , Sébastien Tixeuil
FPS 2022 - 15th International Symposium on Foundations & Practice of Security, Dec 2022, Ottawa, ON, Canada. pp.142-157, ⟨10.1007/978-3-031-30122-3_9⟩
Conference papers hal-04055085v1
Image document

Methodology for an Augmented Business Process Management in IoT Environment

Abir Ismaili-Alaoui
Computer Science [cs]. Université de Lorraine; Université Mohammed V (Rabat), 2022. English. ⟨NNT : 2022LORR0232⟩
Theses tel-04062128v1
Image document

Explainable artificial intelligence for cybersecurity: a literature survey

Fabien Charmet , Harry Chandra Tanuwidjaja , Solayman Ayoubi , Pierre-François Gimenez , Yufei Han , et al.
Annals of Telecommunications - annales des télécommunications, 2022, 77 (11-12), pp.789-812. ⟨10.1007/s12243-022-00926-7⟩
Journal articles hal-03965590v1
Image document

Efficient Renaming in Sequence CRDTs

Matthieu Nicolas , Gerald Oster , Olivier Perrin
IEEE Transactions on Parallel and Distributed Systems, 2022, 33 (12), pp.3870-3885. ⟨10.1109/TPDS.2022.3172570⟩
Journal articles hal-03772633v1