All Publications

@inproceedings{nokey,

title = {AIvolution, Assessing the Potential and Impact of AI and Digital Technologies in the EU},

author = {Juan Antonio Cordero},

year  = {2024},

date = {2024-09-18},

urldate = {2024-09-18},

booktitle = {Proc. of the IEEE International Symposium on Technology and Society (ISTAS 2024) },

publisher = {IEEE},

abstract = {As automation and digitalisation become more pervasive, understanding their social implications, opportunities and risks, as well as appropriate policies and regulatory needs, require increasing inter-disciplinary efforts.

This paper describes the motivation, format and outcomes of the AIvolution event about AI and digital technologies, organized in the European Parliament (EP) on November 2023, for that purpose.

It presents the main topics addressed, the key contributions that were presented, the discussions that took place, and the main takeaways, as well as the perspectives to continue these exchanges in further initiatives.},

keywords = {Scientific dissemination},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {On the Dynamics of Single-Orbit Requester-Provider Systems},

author = {Juan Antonio Cordero},

editor = {ACM},

url = {https://dl.acm.org/doi/10.1145/3616388.3617517},

doi = {10.1145/3616388.3617517},

year  = {2023},

date = {2023-10-30},

urldate = {2023-10-30},

booktitle = {Proc. 26th ACM International Conference on Modeling, Analysis 

and Simulation of Wireless and Mobile Systems (MSWiM'2023)},

publisher = {ACM},

abstract = {This paper considers decentralized systems of multiple agents that interact in order to perform distributed computing or efficient information transfer in variant, constrained environments. These systems appear in various relevant use cases, including reliable multicast distribution, or dynamic resource allocation in systems in the Internet edge (datacenters, IOT deployments). This paper introduces an abstract, mathematical model, that allows to study analytically the behavior of these systems, as a set of interacting requesters and providers. The paper describes system orbits, and concentrates on the study of single-orbit systems. Ergodicity of system behavior in the single-orbit case is proved, and a full description of the stationary system behavior is derived. Closed expressions of the stationary distribution of requester decisions are provided. Analytical results are validated through extensive simulations. These single-orbit results are a necessary step for the analysis and further optimization of dynamic performance of these systems.},

keywords = {Autoconfiguration, Constrained Networks, DynSys, Infrastructure for Big Data, IoT, Modeling},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Metasurface for Enhanced Millimeter-Wave Communications under Imperfect Beam Alignment},

author = {Jesús A. Cumana Morales and Marceau Coupechoux and Juan Antonio Cordero},

year  = {2023},

date = {2023-09-04},

urldate = {2023-09-04},

booktitle = {Proc. IEEE International Mediterranean Conference on Communications and Networking (MeditCom'2023)},

publisher = {IEEE},

abstract = {In this work, we investigate the impact of beam misalignment in the performance of a wireless system employing a metasurface to improve coverage in a non-line-of-sight (NLOS) scenario. The metasurface is modeled by an array of small radiating elements each of them terminated with a complex load. An equivalent Array Factor is defined, which allows visualizing the beamsteering properties of the metasurface in far-field conditions. Angular misalignment is modeled using a truncated Gaussian distribution and an expression to evaluate signal-to-noise ratio (SNR) in the presence of misalignment is derived. Numerical results show an SNR degradation close to 8 dB for 5° error magnitude and up to 14 dB if high-gain unit cells are used. Three mechanisms are explored, which can be used to reduce SNR degradation: increasing Metasurface dimensions allows recovering SNR by 7.4 dB, low unit cell gain allows improving SNR by close to 10.5 dB when compared to a high-gain cell and base station beamwidth decrease from 25.6° to 12.7° allows recovering SNR by 4 dB thanks to the higher BS beam gain.  },

keywords = {Performance, Performance Evaluation, Wireless},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Understanding Semantics in Feature Selection for Fault Diagnosis in Network Telemetry Data},

author = {Thomas Feltin and Juan Antonio Cordero and Thomas Heide Clausen and Frank Brockners},

editor = {IEEE},

url = {https://www.epizeuxis.net/wp-content/uploads/2023/06/2023009866.pdf},

year  = {2023},

date = {2023-05-08},

urldate = {2023-05-08},

booktitle = {Proc. IEEE/IFIP Network Operations and Management Symposium 2023},

publisher = {IEEE},

abstract = {Expert systems for fault diagnosis are computationally expensive to build and maintain, and lack scalability and inherent adaptability to unknown events or modifications in the topology of the monitored system. While data-driven feature se- lection mechanisms can facilitate diagnosis without the hardship of developing and maintaining expert systems, purely data-driven mechanisms lack understanding of semantic importance within a feature set, and would benefit from additional domain knowledge. Part of this additional knowledge can be extracted from meta-data. The proposed approach combines data-driven metrics and semantic information contained in the feature names to produce selections of features which best represent an underlying event. This study extends a cross entropy based optimization method to join semantic importance with data behavior. A benchmarking architecture is introduced to evaluate the benefits of semantic analysis, and demonstrate the performance and robustness of semantic feature selection on different types of faults in network telemetry datasets, modeled with the YANG data modeling language. The results illustrate the interest of such a complementary meta-data analysis for data-driven fault diagnosis, and highlight the robustness of the studied approach against variations in the input feature set.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyj,

title = {Learning Distributed and Fair Policies for Network Load Balancing as Markov Potentia Game},

author = {Zhiyuan Yao and Zihan Ding},

url = {https://arxiv.org/pdf/2206.01451},

year  = {2022},

date = {2022-11-28},

urldate = {2022-11-28},

booktitle = {36th Conference on Neural Information Processing Systems (NeurIPS 2022)},

abstract = {This paper investigates the network load balancing problem in data centers (DCs) where multiple load balancers (LBs) are deployed, using the multi-agent reinforcement learning (MARL) framework. The challenges of this problem consist of the heterogeneous processing architecture and dynamic environments, as well as limited and partial observability of each LB agent in distributed networking systems, which can largely degrade the performance of in-production load balancing algorithms in real-world setups. Centralised-training-decentralised-execution (CTDE) RL scheme has been proposed to improve MARL performance, yet it incurs -- especially in distributed networking systems, which prefer distributed and plug-and-play design scheme -- additional communication and management overhead among agents. We formulate the multi-agent load balancing problem as a Markov potential game, with a carefully and properly designed workload distribution fairness as the potential function. A fully distributed MARL algorithm is proposed to approximate the Nash equilibrium of the game. Experimental evaluations involve both an event-driven simulator and real-world system, where the proposed MARL load balancing algorithm shows close-to-optimal performance in simulations, and superior results over in-production LBs in the real-world system.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing, Machine Learning},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyg,

title = {Efficient Data-Driven Network Functions},

author = {Zhiyuan Yao and Yoann Desmouceaux and Juan Antonio Cordero and Mark Townsley and Thomas Heide Clausen},

url = {https://arxiv.org/pdf/2208.11385},

year  = {2022},

date = {2022-10-18},

urldate = {2022-10-18},

booktitle = {30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)},

abstract = {Cloud environments require dynamic and adaptive networking policies. It is preferred to use heuristics over advanced learning algorithms in Virtual Network Functions (VNFs) in production becuase of high-performance constraints. This paper proposes Aquarius to passively yet efficiently gather observations and enable the use of machine learning to collect, infer, and supply accurate networking state information-without incurring additional signalling and management overhead. This paper illustrates the use of Aquarius with a traffic classifier, an autoscaling system, and a load balancer-and demonstrates the use of three different machine learning paradigms-unsupervised, supervised, and reinforcement learning, within Aquarius, for inferring network state. Testbed evaluations show that Aquarius increases network state visibility and brings notable performance gains with low overhead.},

keywords = {Chaire Cisco, Infrastructure for Big Data, Machine Learning, Network Management},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyh,

title = {Multi-agent reinforcement learning for network load balancing in data center},

author = {Zhiyuan Yao and Zihan Ding and Thomas Heide Clausen},

url = {https://www.researchgate.net/profile/Zhiyuan_Yao13/publication/358163217_Multi-Agent_Reinforcement_Learning_for_Network_Load_Balancing_in_Data_Center/links/62fe5fd3e3c7de4c34666311/Multi-Agent-Reinforcement-Learning-for-Network-Load-Balancing-in-Data-Center.pdf},

doi = {10.1145/3511808.3557133},

year  = {2022},

date = {2022-10-17},

urldate = {2022-10-17},

booktitle = {31st ACM International Conference on Information and Knowledge Management (CIKM'22)},

abstract = {This paper presents the network load balancing problem, a challenging real-world task for multi-agent reinforcement learning (MARL) methods. Conventional heuristic solutions like Weighted-Cost Multi-Path (WCMP) and Local Shortest Queue (LSQ) are less flexible to the changing workload distributions and arrival rates, with a poor balance among multiple load balancers. The cooperative network load balancing task is formulated as a Dec-POMDP problem, which naturally induces the MARL methods. To bridge the reality gap for applying learning-based methods, all models are directly trained and evaluated on a real-world system from moderate- to large-scale setups. Experimental evaluations show that the independent and “selfish” load balancing strategies are not necessarily the globally optimal ones, while the proposed MARL solution has a superior performance over different realistic settings. Additionally, the potential difficulties of the application and deployment of MARL methods for network load balancing are analysed, which helps draw the attention of the learning and network communities to such challenges.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{dowling2022continuous,

title = {Continuous Authentication in Secure Messaging},

author = {Benjamin Dowling and Felix Günther and Alexandre Poirrier},

editor = {Vijayalakshmi Atluri

and Roberto Di Pietro

and Christian D. Jensen

and Weizhi Meng},

url = {https://link.springer.com/chapter/10.1007/978-3-031-17146-8_18},

doi = {10.1007/978-3-031-17146-8_18},

isbn = {978-3-031-17146-8},

year  = {2022},

date = {2022-09-22},

urldate = {2022-09-22},

booktitle = {Lecture Notes in Computer Science},

volume = {13555},

pages = {361--381},

publisher = {Springer Nature Switzerland},

address = {Cham},

series = {Computer Security – ESORICS 2022},

abstract = {Secure messaging schemes such as the Signal protocol rely on out-of-band channels to verify the authenticity of long-running communication. Such out-of-band checks however are only rarely actually performed by users in practice.



In this paper, we propose a new method for performing continuous authentication during a secure messaging session, without the need for an out-of-band channel. Leveraging the users’ long-term secrets, our Authentication Steps extension guarantees authenticity as long as long-term secrets are not compromised, strengthening Signal’s post-compromise security. Our mechanism further allows to detect a potential compromise of long-term secrets after the fact via an out-of-band channel.



Our protocol comes with a novel, formal security definition capturing continuous authentication, a general construction for Signal-like protocols, and a security proof for the proposed instantiation. We further provide a prototype implementation which seamlessly integrates on top of the official Signal Java library, together with bandwidth and storage overhead benchmarks.},

keywords = {Protocols, Signal},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {OpenAPI Extended Security Scheme: A Method to Reduce the Prevalence of BOLA},

author = {Rami Haddad and Reem Melki and Serban Cosma},

year  = {2022},

date = {2022-09-19},

urldate = {2022-09-19},

booktitle = {API Specifications Conference (ASC)},

organization = {OpenAPI Initiative},

keywords = {Chaire Cisco, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Réactivité, efficacité et apprentissage: problèmes d’aide à la prise de décision dans des réseaux décentralisés},

author = {Juan Antonio Cordero},

year  = {2022},

date = {2022-02-23},

urldate = {2022-02-23},

booktitle = {23ème Congrès de la ROADEF},

organization = {Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF)},

keywords = {Autoconfiguration, IoT, Scientific dissemination},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yao2021reinforced,

title = {Reinforced Workload Distribution Fairness},

author = {Zhiyuan Yao and Zihan Ding and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2111.00008-1.pdf},

year  = {2021},

date = {2021-12-01},

urldate = {2021-12-01},

booktitle = {Machine Learning for Systems at 35th Conference on Neural Information Processing Systems (NeurIPS 2021)},

abstract = {Network load balancers are central components in data centers, that distributes workloads across multiple servers and thereby contribute to offering scalable services. However, when load balancers operate in dynamic environments with limited monitoring of application server loads, they rely on heuristic algorithms that require manual configurations for fairness and performance. To alleviate that, this paper proposes a distributed asynchronous reinforcement learning mechanism to-with no active load balancer state monitoring and limited network observations-improve the fairness of the workload distribution achieved by a load balancer. The performance of proposed mechanism is evaluated and compared with stateof-the-art load balancing algorithms in a simulator, under configurations with progressively increasing complexities. Preliminary results show promise in RLbased load balancing algorithms, and identify additional challenges and future research directions, including reward function design and model scalability.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yao2021intelligent,

title = {Towards Intelligent Load Balancing in Data Centers},

author = {Zhiyuan Yao and Yoann Desmouceaux and Mark Townsley and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2110.15788.pdf},

year  = {2021},

date = {2021-12-01},

urldate = {2021-12-01},

booktitle = {Machine Learning for Systems at 35th Conference on Neural Information Processing Systems (NeurIPS 2021), Dec 2021, Sydney, Australia},

abstract = {Network load balancers are important components in data centers to provide scalable services. Workload distribution algorithms are based on heuristics, e.g., Equal-Cost Multi-Path (ECMP), Weighted-Cost Multi-Path (WCMP) or naive machine learning (ML) algorithms, e.g., ridge regression. Advanced ML-based approaches help achieve performance gain in different networking and system problems. However, it is challenging to apply ML algorithms on networking problems in real-life systems. It requires domain knowledge to collect features from low-latency, high-throughput, and scalable networking systems, which are dynamic and heterogenous. This paper proposes Aquarius to bridge the gap between ML and networking systems and demonstrates its usage in the context of network load balancers. This paper demonstrates its ability of conducting both offline data analysis and online model deployment in realistic systems. The results show that the ML model trained and deployed using Aquarius improves load balancing performance yet they also reveals more challenges to be resolved to apply ML for networking systems.},

keywords = {Chaire Cisco, Infrastructure for Big Data},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{rizzi2021charon,

title = {Charon: Load-Aware Load-Balancing in P4},

author = {Carmine Rizzi and Zhiyuan Yao and Yoann Desmouceaux and Mark Townsley and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2110.14389.pdf},

year  = {2021},

date = {2021-10-01},

urldate = {2021-01-01},

booktitle = {1st Joint International Workshop on Network Programmability & Automation (NetPA) at 17th International Conference on Network and Service Management (CNSM 2021),},

abstract = {Load-Balancers play an important role in data centers as they distribute network flows across application servers and guarantee per-connection consistency. It is hard however to make fair load balancing decisions so that all resources are efficiently occupied yet not overloaded. Tracking connection states allows to infer server load states and make informed decisions, but at the cost of additional memory space consumption. This makes it hard to implement on programmable hardware, which has constrained memory but offers line-rate performance. This paper presents Charon, a stateless load-aware load balancer that has line-rate performance implemented in P4-NetFPGA. Charon passively collects load states from application servers and employs the power-of-2-choices scheme to make data-driven load balancing decisions and improve resource utilization. Perconnection consistency is preserved statelessly by encoding server ID in a covert channel. The prototype design and implementation details are described in this paper. Simulation results show performance gains in terms of load distribution fairness, quality of service, throughput and processing latency.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Hawari2021,

title = {OP4T: Bringing Advanced Network Packet Timestamping into the Field},

author = {Mohammed Hawari and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/03/paper.pdf},

doi = {10.1109/ICOIN50884.2021.9333927},

year  = {2021},

date = {2021-01-13},

booktitle = {2021 International Conference on Information Networking (ICOIN)},

pages = {137-142},

abstract = {Because it is very bursty, the microsecond-scale temporal behaviour of network traffic in data-centres is chal- lenging to measure and understand. To bring observability into data-centre networks, this paper introduces the Open Platform for Programmable Precise Packet Timestamping (OP4T), a hardware architecture, targeting Field-Programmable Gateway Arrays (FPGAs), integrated into data-centre servers as a Smart Network Interface Card (SmartNIC), and flexible enough to enable advanced latency diagnosis. 

In this paper, OP4T is specified, and an open-source im- plementation of that architecture is proposed, targeting the NetFPGA SUME prototyping board. By leveraging the P4 programming language, and partial reconfiguration, that open- source implementation is experimentally shown to enable in-band, precise packet timestamping, without sacrificing the achievable throughput. As an illustration, OP4T is shown to be usable to measure fine-grained properties of a software packet forwarder, e.g., packet batching.},

keywords = {Chaire Cisco, Infrastructure for Big Data},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Feltin2020,

title = {Semantic feature selection for network telemetry event description},

author = {Thomas Feltin and Parisa Foroughi and Wenqin Shao and Frank Brockners and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2020/08/AnNet20201-1.pdf},

doi = {10.1109/NOMS47738.2020.9110382},

isbn = {2374-9709},

year  = {2020},

date = {2020-04-20},

booktitle = {NOMS 2020 - 2020 IEEE/IFIP Network Operations and Management Symposium},

pages = {1-6},

abstract = {Model driven telemetry (MDT) enables the real-time collection of hundreds of thousands of counters on large-scale networks, with contextual information to each counter provided in the telemetry data structure definition. Explaining network events in such datasets implies substantial analysis by a domain expert. This paper presents an semantic feature selection method, to find the most important counters which describe a given event in a telemetry dataset, and facilitate the explanation process. This paper proposes a metric for estimating the importance of features in a dataset with descriptive feature names, to find those that are most meaningful to a human. With this estimation, this paper presents a cross-entropy based metric describing the quality of a selection of counters, which is combined with the data behavior to define an optimization goal. The computation of optimal selections distills intelligible and precise selections of counters with adjustable verbosity, and describes events with a few selected counters outlining the root cause of network events.},

keywords = {contextual information, cross-entropy based metric, data analysis, data behavior, data structures, Decision support, explanation, explanation process, feature selection, large-scale networks, model driven telemetry, Network Management, network telemetry event description, real-time systems, Selection process, semantic feature selection, telemetry, telemetry data structure},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2019,

title = { Modeling Dynamic Resource Allocation in the Edge},

author = {Juan Antonio Cordero and Wei Lou},

year  = {2019},

date = {2019-11-26},

urldate = {2019-11-26},

booktitle = {Proceedings of the 8th IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN'2019).

},

publisher = {IEEE},

abstract = {Edge computing technologies and integrated archi- tectures have been deployed to accommodate Internet traffic growth. These architectures include facilities (cloudlets, micro DCs) to cache and serve contents close to consumers. Resulting systems adapt to observed request/consumption patterns by allowing cloudlet coordination for content caching/dissemination. This paper presents a novel analytical model of transient dy- namics of the cloudlets set. The model is used to study system convergence, stability and delivered content locality. Results from this model are validated via simulations.},

keywords = {Modeling, Performance Evaluation},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Desmouceaux2018e,

title = {Zero-Loss Virtual Machine Migration with IPv6 Segment Routing},

author = {Yoann Desmouceaux and Mark Townsley and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/Zero-Loss-Virtual-Machine-Migration-with-Segment-Routing.pdf},

year  = {2018},

date = {2018-11-01},

booktitle = {Proceedings 1st SR+SFC Workshop at IEEE CNSM},

abstract = {With the development of large-scale data centers, Virtual Machine (VM) migration is a key component for resource optimization, cost reduction, and maintenance. From a network perspective, traditional VM migration mechanisms rely on the hypervisor running at the destination host advertising the new location of the VM once migration is complete. However, this creates a period of time during which the VM is not reachable, yielding packet loss. 

This paper introduces a method to perform zero-loss VM migration by using IPv6 Segment Routing (SR). Rather than letting the hypervisor update a locator mapping after VM migration is complete, a logical path consisting of the source and destination hosts is pre-provisioned. Packets destined to the migrating VM are sent through this path using SR, shortly before, during, and shortly after migration – the virtual router on the source host being in charge of forwarding packets locally if the VM migration has not completed yet, or to the destination host otherwise. The proposed mechanism is implemented as a VPP plugin, and feasibility of zero-loss VM migration is demonstrated with various workloads. Evaluation shows that this yields benefits in terms of session opening latency and TCP throughput.},

keywords = {Chaire Cisco, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pit--Claudel2018,

title = {Stateless Load-Aware Load Balancing in P4},

author = {Benoit Pit--Claudel and Yoann Desmouceaux and Pierre Pfister and Mark Townsley and Thomas Clausen},

url = {http://www.thomasclausen.net/en/p4eu-2018/},

year  = {2018},

date = {2018-09-24},

publisher = {1st P4 European Workshop (P4EU)},

abstract = {Leveraging the performance opportunities offered by programmable hardware, stateless load-balancing architectures allowing line-rate processing are appealing. Moreover, it has been demonstrated that significantly fairer load-balancing can be achieved by an architecture that considers the actual load of application instances when dispatching connection requests. Architectures which maintain per-connection state for resiliency and/or track application load state for fairness are, however, at odds with hardware-imposed memory constraints. Thus, a desirable load-balancer for programmable hardware would be both stateless and able to dispatch queries to application instances according to their current load. 

 

This paper presents SHELL, a stateless application-aware load-balancer combining (i) a power-of-choices scheme using IPv6 Segment Routing to dispatch new flows to a suitable application instance from among multiple candidates, and (ii) the use of a covert channel to record/report which flow was assigned to which candidate in a stateless fashion. In addition, consistent hashing versioning is used to ensure that connections are maintained to the correct application instance, using Segment Routing to “browse” through the history when needed. The stateless design of SHELL makes it suitable for hardware implementation, and this paper describes the implementation of a P4-NetFPGA prototype. A performance evaluation of this SHELL implementation demonstrates throughput and latency characteristics comparable to other stateless load-balancing implementations, while enabling application instance-load-aware dispatching and significantly increasing per-connection consistency resiliency.},

keywords = {Chaire Cisco, load balancing, NetFPGA, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{10.1007/978-3-319-75928-9_60,

title = {Flying Ad Hoc Network for Emergency Applications Connected to a Fog System},

author = {Dan Radu and Adrian Cretu and Benoit Parrein and Jiazi Yi and Camelia Avram and Adina Astilean},

editor = {Leonard Barolli and Fatos Xhafa and Nadeem Javaid and Evjola Spaho and Vladi Kolici},

url = {https://www.researchgate.net/publication/323361307_Flying_Ad_Hoc_Network_for_Emergency_Applications_Connected_to_a_Fog_System},

doi = {10.1007/978-3-319-75928-9_60},

isbn = {978-3-319-75928-9},

year  = {2018},

date = {2018-01-01},

pages = {675--686},

publisher = {Springer International Publishing},

address = {Cham},

abstract = {The main objective of this paper is to improve the efficiency of vegetation fire emergency interventions by using MP-OLSR routing protocol for data transmission in Flying Ad Hoc NETwork (FANET) applications. The presented conceptual system design could potentially increase the rescuing chances of people caught up in natural disaster environments, the final goal being to provide public safety services to interested parties. The proposed system architecture model relies on emerging technologies (Internet of Things & Fog, Smart Cities, Mobile Ad Hoc Networks) and actual concepts available in the scientific literature. The two main components of the system consist in a FANET, capable of collecting fire detection data from GPS and video enabled drones, and a Fog/Edge node that allows data collection and analysis, but also provides public safety services for interested parties. The sensing nodes forward data packets through multiple mobile hops until they reach the central management system. A proof of concept based on MP-OLSR routing protocol for efficient data transmission in FANET scenarios and possible public safety rescuing services is given.},

keywords = {Ad-Hoc, MP-OLSR, Multipath, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Perez2017,

title = {ODMAC++: An IoT Communication Manager based on Energy Harvesting Prediction},

author = {Samuel Perez and Juan Antonio Cordero and Marceau Coupechoux},

year  = {2017},

date = {2017-10-08},

booktitle = {Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'2017).},

publisher = {IEEE},

abstract = {In large low-power networks of battery-driven sen- sors, power outages are a major concern and communication rates have to be carefully designed in order to optimize energy consumption, network connectivity and sensors lifetime. In some IoT use cases, power can be supplied to sensors by way of renewable energy automatic harvesting (solar panels, etc.). Given the high variability of energy arrival processes, energy consumption in sensors, in particular caused by transmissions to the sink, has to be aligned with energy harvesting patterns, so as to maximize throughput while avoiding power outages that may arise when the battery is empty. This paper proposes ODMAC++, an extension to a well-known protocol for sensor transmission scheduling in a WSN. ODMAC++ relies on learning techniques to adapt sensors communication rate to energy harvesting patterns, and uses a beaconing mechanism whose frequency is adjusted based on past measurements on the harvested energy process. Simulations based on analytical energy arrival models and on real solar radiation measurements indicate that ODMAC++ is able to avoid power outages and to cope with battery limitation and energy variations due to variability in time.},

keywords = {Chaire Cisco, Constrained Networks, IoT, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Desmouceaux2017b,

title = {SRLB: The Power of Choices in Load Balancing with Segment Routing},

author = {Yoann Desmouceaux and Pierre Pfister and Jerome Tollet and W. Mark Townsley and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2017/05/camera-ready-ieeepdfexpress.pdf},

year  = {2017},

date = {2017-06-05},

booktitle = {In Proceedings of the 37th IEEE International Conference on Distributed Computing Systems (ICDCS)},

abstract = {Network load-balancers generally either do not take application state into account, or do so at the cost of a central- ized monitoring system. This paper introduces a load-balancer running exclusively within the IP forwarding plane, i.e. in an application protocol agnostic fashion – yet which still provides application-awareness and makes real-time, decentralized deci- sions. To that end, IPv6 Segment Routing is used to direct data packets from a new flow through a chain of candidate servers, until one decides to accept the connection, based on its local state. This way, applications themselves naturally decide on how to share incoming connections, while incurring minimal network overhead, and no out-of-band signaling.

Tests on different workloads – including realistic workloads such as replaying actual Wikipedia access traffic towards a set of replica Wikipedia instances – show significant performance benefits, in terms of shorter response times, when compared to a traditional random load-balancer.},

keywords = {Chaire Cisco, dc-optimization, Infrastructure for Big Data, load balancing, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2016b,

title = {Not So Far: Improving Autonomous Content Discovery and Delivery within Mobile Pedestrian Crowds},

author = {Juan Antonio Cordero and Wei Lou},

year  = {2016},

date = {2016-08-01},

publisher = {Proceedings of the 25th International Conference on Computer Communication and Networks (ICCCN 2016).},

abstract = {The explosion of traffic demands in the edge of the Internet, mostly by mobile users, is putting under pressure current networking infrastructure. This is particularly acute when huge amounts of users and active wireless devices gather in reduced geographical spaces, increasing the risk of exceeding planned capacity of deployed infrastructure. This trend motivates research on mechanisms to offload part of the user injected traffic from the access infrastructure networks and reduce the need of Internet requests and retrievals. This paper concentrates on the ability of mobile meshes to fulfill the requests for contents originated within the mesh, with minimal intervention of the Internet access infrastructure. We propose, discuss and evaluate simple heuristics to improve autonomous content discovery and dissemination within such mobile meshes, characterized by high density and low (pedestrian) mobility, by combining notions already explored in the context of MANET routing: deliberate jittering and autonomous overlay pruning based on link distance. Results over synthetic networks and real mobility traces indicate that proposed mechanisms can be easily deployed and are able to improve efficiency and quality of content request discoveries, by reducing significantly the collisions and increasing the stability of discovered paths in crowded mesh pedestrian networks.},

note = {Accepted},

keywords = {Broadcast, MANET, MANET Broadcast},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Jin2016,

title = {Distributed Node Consensus Protocol: Analysis, Evaluation and Performance},

author = {Kaiwan Jin and Pierre Pfister and Jiazi Yi},

doi = {10.1109/ICC. 2016.7510939},

year  = {2016},

date = {2016-05-23},

publisher = {Proceedings of the IEEE International Conference on Communications (ICC) 2016},

abstract = {Abstract—This paper analyzes and evaluates the Distributed Node Consensus Protocol (DNCP), a state synchronization mech- anism developed by the IETF Homenet working group. DNCP enables network function automation for home networks, which are growing in size and complexity. The basic mechanisms of DNCP are studied in this paper, including the state abstraction, synchronization process and keep-alive mechanism. The over- head is analyzed in single-link topology type. To evaluate the performance of DNCP in more complex scenarios, a reference implementation of DNCP is integrated into ns3 simulator. The convergence time and transmission overhead in various topology types are measured. Based on the obtained results, the correctness of DNCP is verified, and the behavior of DNCP can be concluded.},

keywords = {Chaire Cisco, DNCP, Homenet, MESH},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Toubaline2015,

title = {Observing the State of a Smart Grid Using Bilevel Programming},

author = {Sonia Toubaline and Pierre-Louis Poirion and Claudia D’Ambrosio and Leo Liberti},

url = {https://epizeuxis.net/site/wp-content/uploads/2016/01/cocoa15a.pdf},

year  = {2015},

date = {2015-12-18},

booktitle = {In Proceeding of the 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15),},

publisher = {LNCS 9486, 364-376},

abstract = {Monitoring an electrical network is an important and chal- lenging task. Phasor measurement units are measurement devices that can be used for a state estimation of this network. In this paper we consider a PMU placement problem without conventional measurements and with zero injection nodes for a full observability of the network. We propose two new approaches to model this problem, which take into ac- count a propagation rule based on Ohm’s and Kirchoff’s law. The natural binary linear programming description models an iterative observability process. We remove the iteration by reformulating its fixed point con- ditions to a bilevel program, which we then further reformulate to a single-level mixed-integer linear program. We also present a bilevel al- gorithm to solve directly the proposed bilevel model. We implemented and tested our models and algorithm: the results show that the bilevel algorithm is better in terms of running time and size of instances which can be solved.},

keywords = {Optimisation, Smart Grid, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}