References of "Guinand, Frédéric"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailNGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning
Changaival, Boonyarit UL; Danoy, Grégoire UL; Kliazovich et al

in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020)

Detailed reference viewed: 90 (12 UL)
Full Text
Peer Reviewed
See detailDACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network
Rosalie, Martin UL; Etancelin, Jean-Matthieu; Fabbri, André et al

in Ad Hoc Networks (2019), 87

The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as ... [more ▼]

The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as long as possible and cover a surface as large as possible. While most of the time this problem is formulated as a multi-objective optimization problem we present a new decentralized approach for building a connected dominating set (CDS) coupled with attractive and repulsive forces for the movement of sensors in order to maintain the network connectivity. The approach is implemented as a hybrid decentralized algorithm: DACYCLEM (Decentralized Algorithm under Connectivity constraint with mobilitY for Coverage and LifEtime Maximization). The lifetime and the coverage achieved by our approach are the results of the local interactions between the sensors and were not obtained by the application of a direct optimization method. We also introduce a new metric, the speed of coverage, to evaluate the balance between coverage and lifetime. Finally, our simulation results show that one single parameter of DACYCLEM is responsible for the balancing between coverage and lifetime. [less ▲]

Detailed reference viewed: 288 (8 UL)
Full Text
Peer Reviewed
See detailToward Real-world Vehicle Placement Optimization in Round-trip Carsharing
Changaival, Boonyarit UL; Danoy, Grégoire UL; Kliazovich, Dzmitry et al

in Proceedings of the Genetic and Evolutionary Computation Conference (2019)

Detailed reference viewed: 149 (14 UL)
Full Text
Peer Reviewed
See detailLoad Balancing at the Edge of Chaos: How Can Self-Organized Criticality Lead to Energy-Efficient Computing
Laredo, Jean-Luis; Guinand, Frédéric; Damien, Olivier et al

in IEEE Transactions on Parallel and Distributed Systems (2017), 28

This paper investigates a self-organized critical approach for dynamically load-balancing computational workloads. The proposed model is based on the Bak-Tang-Wiesenfeld sandpile: a cellular automaton ... [more ▼]

This paper investigates a self-organized critical approach for dynamically load-balancing computational workloads. The proposed model is based on the Bak-Tang-Wiesenfeld sandpile: a cellular automaton that works in a critical regime at the edge of chaos. In analogy to grains of sand, tasks arrive, pile up and slip through the different processing elements or sites of the system. When a pile exceeds a certain threshold, it collapses and initiates an avalanche of migrating tasks, i.e. producing load-balancing. We show that the frequency of such avalanches is in power-law relation with their sizes, a scale-invariant fingerprint of self-organized criticality that emerges without any tuning of parameters. Such an emergent pattern has organic properties such as the self-organization of tasks into resources or the self-optimization of the computing performance. The conducted experimentation also reveals that the system is in balanced (i.e. not driving to overloaded or underutilized resources) as long as the arrival rate of tasks equals the processing power of the system. Taking advantage of this fact, we hypothesize that the processing elements can be turned on and off depending on the state of the workload as to maximize the utilization of resources. An interesting side-effect is that the overall energy consumption of the system is minimized without compromising the quality of service. [less ▲]

Detailed reference viewed: 72 (2 UL)
Full Text
Peer Reviewed
See detailThe sandpile scheduler: How self-organized criticality may lead to dynamic load-balancing
Jimenez Laredo, Juan Luis UL; Bouvry, Pascal UL; Guinand, Frederic et al

in Cluster Computing (2014)

This paper studies a self-organized criticality model called sandpile for dynamically load-balancing tasks arriving in the form of Bag-of-Tasks in large-scale decentralized system. The sandpile is ... [more ▼]

This paper studies a self-organized criticality model called sandpile for dynamically load-balancing tasks arriving in the form of Bag-of-Tasks in large-scale decentralized system. The sandpile is designed as a decentralized agent system characterizing a cellular automaton, which works in a critical state at the edge of chaos. Depending on the state of the cellular automaton, different responses may occur when a new task is assigned to a resource: it may change nothing or generate avalanches that reconfigure the state of the system. The abundance of such avalanches is in power-law relation with their sizes, a scale-invariant behavior that emerges without requiring tuning or control parameters. That means that large—catastrophic—avalanches are very rare but small ones occur very often. Such emergent pattern can be efficiently adapted for non-clairvoyant scheduling, where tasks are load balanced in computing resources trying to maximize the performance but without assuming any knowledge on the tasks features. The algorithm design is experimentally validated showing that the sandpile is able to find near-optimal schedules by reacting differently to different conditions of workloads and architectures. [less ▲]

Detailed reference viewed: 204 (3 UL)
Full Text
Peer Reviewed
See detailToken Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad hoc - Delay Tolerant Networks
Piyatumrong, Apivadee UL; Ruiz, Patricia UL; Bouvry, Pascal UL et al

in IAIT (2009)

This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like ... [more ▼]

This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like disappearance of mobile devices, connection disruptions, network partitioning, etc. Techniques based on tree topologies are well known for increasing the efficiency of network protocols and/or applications, such as Dynamicity Aware - Graph Relabeling System (DA-GRS). One of the main features of these tree based topologies is the existence of a token traversing in every tree. The use of tokens enables the creation and maintenance of spanning trees in dynamic environments. Subsequently, managing tree-based backbones relies heavily on the token behavior. An efficient and optimal token traversal can highly impact the design of the tree and its usage. In this article, we present a comparison of three distributed and decentralized techniques available for token management, which are Randomness, TABU and Depth First Search. [less ▲]

Detailed reference viewed: 137 (0 UL)
Peer Reviewed
See detailA Context-Aware Broadcast Protocol for Mobile Wireless Networks
Hogie, Luc UL; Danoy, Grégoire UL; Bouvry, Pascal UL et al

in Second International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008) (2008)

Detailed reference viewed: 105 (4 UL)
Peer Reviewed
See detailSimulating Realistic Mobility Models for Large Heterogeneous MANETs
Hogie, Luc UL; Bouvry, Pascal UL; Guinand, Frédéric et al

in 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06) (2006)

Detailed reference viewed: 90 (0 UL)