Publications
2019 |
Desmouceaux, Yoann; Cordero, Juan Antonio; Clausen, Thomas Reliable B.I.E.R. with Peer Caching Journal Article IEEE Transactions on Network and Service Management, 2019, ISSN: 1932-4537. @article{Desmouceaux2019, title = {Reliable B.I.E.R. with Peer Caching}, author = {Yoann Desmouceaux and Juan Antonio Cordero and Thomas Clausen}, url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/Reliable-B.I.E.R.-with-Peer-Caching.pdf}, doi = {10.1109/TNSM.2019.2950158}, issn = {1932-4537}, year = {2019}, date = {2019-11-01}, journal = {IEEE Transactions on Network and Service Management}, abstract = {Multicast protocols usually require building multicast trees and maintaining state in intermediate routers, incurring operation complexity. B.I.E.R. (Bit-Indexed Explicit Replication) ambitions to alleviate this complexity by allowing for source-driven selection of destinations and state-less packet forwarding. B.I.E.R. can also be used to achieve reliable delivery of content, by retransmitting packet to the exact set of destinations which have missed it. While B.I.E.R.- based reliable multicast exhibits attractive performance attributes, repair of a lost packet is achieved through source retransmissions, which may be costly and even unnecessary if close peers are able to provide a copy of the packet. Thus, this paper extends the use of reliable B.I.E.R. multicast to allow recoveries from peers, using Segment Routing (SR) to steer retransmission requests through potential candidates. A framework is introduced, which can accommodate different policies for the selection of candidate peers for retransmissions. Simple (both static and adaptive) policies are introduced and analyzed, both (i) theoretically and (ii) by way of simulations in data-center-like and real-world topologies. Results indicate that local peer recovery is able to substantially reduce the overall retransmission traffic, and that this can be achieved through simple policies, where no signaling is required to build a set of candidate peers.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Multicast protocols usually require building multicast trees and maintaining state in intermediate routers, incurring operation complexity. B.I.E.R. (Bit-Indexed Explicit Replication) ambitions to alleviate this complexity by allowing for source-driven selection of destinations and state-less packet forwarding. B.I.E.R. can also be used to achieve reliable delivery of content, by retransmitting packet to the exact set of destinations which have missed it. While B.I.E.R.- based reliable multicast exhibits attractive performance attributes, repair of a lost packet is achieved through source retransmissions, which may be costly and even unnecessary if close peers are able to provide a copy of the packet. Thus, this paper extends the use of reliable B.I.E.R. multicast to allow recoveries from peers, using Segment Routing (SR) to steer retransmission requests through potential candidates. A framework is introduced, which can accommodate different policies for the selection of candidate peers for retransmissions. Simple (both static and adaptive) policies are introduced and analyzed, both (i) theoretically and (ii) by way of simulations in data-center-like and real-world topologies. Results indicate that local peer recovery is able to substantially reduce the overall retransmission traffic, and that this can be achieved through simple policies, where no signaling is required to build a set of candidate peers. |
2018 |
Desmouceaux, Yoann; Townsley, Mark; Clausen, Thomas Zero-Loss Virtual Machine Migration with IPv6 Segment Routing Inproceedings Proceedings 1st SR+SFC Workshop at IEEE CNSM, 2018. @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 = {}, pubstate = {published}, tppubtype = {inproceedings} } 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. |
Toussaint, Arthur; Hawari, Mohammed; Clausen, Thomas Chasing Linux Jitter Sources for Uncompressed Video Incollection In Proceedings of the 1st Workshop on High-Precision Networks Operations and Control (HiPNet 2018) ad the IEEE 14th International Conference on Network and Service Management (CNSM), 2018. @incollection{Toussaint2018, title = {Chasing Linux Jitter Sources for Uncompressed Video}, author = {Arthur Toussaint and Mohammed Hawari and Thomas Clausen}, url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/CNSM-HipNet-Toussaint-et.-al.-Chasing-Linux-Jutter-Sources-for-Uncompressed-Video.pdf}, year = {2018}, date = {2018-11-01}, booktitle = {In Proceedings of the 1st Workshop on High-Precision Networks Operations and Control (HiPNet 2018) ad the IEEE 14th International Conference on Network and Service Management (CNSM)}, abstract = {Beyond the transport of uncompressed video over IP networks, defined in standards such as ST2022-6, the ability to build software-based Video Processing Functions (VPF) on commodity hardware and using general purpose Operating Systems is the next logical step in the evolution of the media industry towards an “all-IP” world. In that context, understand- ing the jitter induced on an ST2022-6 stream by a commodity platform is essential. This paper describes a general methodology to enumerate jitter sources on commodity platforms and to quantify their relative contribution to the overall system jitter. The methodology is applied to the Linux kernel, producing a classification of the different sources of jitter, and a quantification of their impact.}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } Beyond the transport of uncompressed video over IP networks, defined in standards such as ST2022-6, the ability to build software-based Video Processing Functions (VPF) on commodity hardware and using general purpose Operating Systems is the next logical step in the evolution of the media industry towards an “all-IP” world. In that context, understand- ing the jitter induced on an ST2022-6 stream by a commodity platform is essential. This paper describes a general methodology to enumerate jitter sources on commodity platforms and to quantify their relative contribution to the overall system jitter. The methodology is applied to the Linux kernel, producing a classification of the different sources of jitter, and a quantification of their impact. |
Pit--Claudel, Benoit; Desmouceaux, Yoann; Pfister, Pierre; Townsley, Mark; Clausen, Thomas Stateless Load-Aware Load Balancing in P4 Inproceedings 1st P4 European Workshop (P4EU), 2018. @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 = {}, pubstate = {published}, tppubtype = {inproceedings} } 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. |
Cordero, Juan Antonio; Lou, Wei Take your time, get it closer: content dissemination within mobile pedestrian crowds Journal Article Wireless Networks, 2018, ISSN: 1572-8196. @article{Cordero2018, title = {Take your time, get it closer: content dissemination within mobile pedestrian crowds}, author = {Juan Antonio Cordero and Wei Lou}, url = {https://doi.org/10.1007/s11276-018-1731-2}, doi = {10.1007/s11276-018-1731-2}, issn = {1572-8196}, year = {2018}, date = {2018-05-05}, journal = {Wireless Networks}, abstract = {The explosion of traffic demands in the edge of the Internet, mostly by mobile users, is putting under pressure current networking infrastructures. 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 edge computing, and in particular, on mechanisms to offload or address locally part of the user injected traffic at the access infrastructure, thus reducing the need of Internet requests and retrievals. This paper concentrates on the ability of mobile crowds --and corresponding access networks---to fulfill content requests originated within the mesh, with minimal intervention of the Internet infrastructure. Simple heuristics are revisited, proposed, discussed and evaluated to improve autonomous content discovery and dissemination within high-density, low-mobility crowds, by combining notions already explored for MANET routing: deliberate jittering and autonomous distance-based overlay pruning. Results over synthetic networks and real mobility traces indicate that these mechanisms improve efficiency and quality of content request discoveries, by reducing significantly collisions and increasing stability of discovered paths in dense pedestrian crowds.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The explosion of traffic demands in the edge of the Internet, mostly by mobile users, is putting under pressure current networking infrastructures. 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 edge computing, and in particular, on mechanisms to offload or address locally part of the user injected traffic at the access infrastructure, thus reducing the need of Internet requests and retrievals. This paper concentrates on the ability of mobile crowds --and corresponding access networks---to fulfill content requests originated within the mesh, with minimal intervention of the Internet infrastructure. Simple heuristics are revisited, proposed, discussed and evaluated to improve autonomous content discovery and dissemination within high-density, low-mobility crowds, by combining notions already explored for MANET routing: deliberate jittering and autonomous distance-based overlay pruning. Results over synthetic networks and real mobility traces indicate that these mechanisms improve efficiency and quality of content request discoveries, by reducing significantly collisions and increasing stability of discovered paths in dense pedestrian crowds. |
Desmouceaux, Yoann; Toubaline, Sonia; Clausen, Thomas Flow-Aware Workload Migration in Data Centers Journal Article Springer - Journal of Network and Systems Management (JONS), 2018. @article{Desmouceaux2018a, title = {Flow-Aware Workload Migration in Data Centers}, author = {Yoann Desmouceaux and Sonia Toubaline and Thomas Clausen}, url = {https://link.springer.com/epdf/10.1007/s10922-018-9452-5?author_access_token=qm_40d91CsNLlZ_vZ0tZFPe4RwlQNchNByi7wbcMAY4xSrvbLplDMLQ3AN9vWEoUIxtZAIdnOGAzJH5W3YOrbGteOLvaEXsEE1xFv66lVxTKlL40BAS25fsaLf8w1RJAvY69owHWqhJkTmAZpvdCkQ%3D%3D https://www.epizeuxis.net/wp-content/uploads/2018/03/jons-2018.pdf}, doi = {10.1007/s10922-018-9452-5}, year = {2018}, date = {2018-03-10}, journal = {Springer - Journal of Network and Systems Management (JONS)}, abstract = {In data centers, subject to workloads with heterogeneous (and sometimes short) lifetimes, workload migration is a way of attaining a more efficient utilization of the underlying physical machines. To not introduce performance degradation, such workload migration must take into account not only machine resources, and per-task resource requirements, but also application dependencies in terms of network communication. This articleformat presents a workload migration model capturing all of these constraints. A linear programming framework is developed allowing accurate representation of per-task resources requirements and inter-task network demands. Using this, a multi-objective problem is formulated to compute a re-allocation of tasks that (i) maximizes the total inter-task throughput, while (ii) minimizing the cost incurred by migration and (iii) allocating the maximum number of new tasks. A baseline algorithm, solving this multi-objective problem using the $epsilon$-constraint method is proposed, in order to generate the set of Pareto-optimal solutions. As this algorithm is compute-intensive for large topologies, a heuristic, which computes an approximation of the Pareto front, is then developed, and evaluated on different topologies and with different machine load factors. These evaluations show that the heuristic can provide close-to-optimal solutions, while reducing the solving time by one to two order of magnitudes. }, keywords = {}, pubstate = {published}, tppubtype = {article} } In data centers, subject to workloads with heterogeneous (and sometimes short) lifetimes, workload migration is a way of attaining a more efficient utilization of the underlying physical machines. To not introduce performance degradation, such workload migration must take into account not only machine resources, and per-task resource requirements, but also application dependencies in terms of network communication. This articleformat presents a workload migration model capturing all of these constraints. A linear programming framework is developed allowing accurate representation of per-task resources requirements and inter-task network demands. Using this, a multi-objective problem is formulated to compute a re-allocation of tasks that (i) maximizes the total inter-task throughput, while (ii) minimizing the cost incurred by migration and (iii) allocating the maximum number of new tasks. A baseline algorithm, solving this multi-objective problem using the $epsilon$-constraint method is proposed, in order to generate the set of Pareto-optimal solutions. As this algorithm is compute-intensive for large topologies, a heuristic, which computes an approximation of the Pareto front, is then developed, and evaluated on different topologies and with different machine load factors. These evaluations show that the heuristic can provide close-to-optimal solutions, while reducing the solving time by one to two order of magnitudes. |
Desmouceaux, Yoann; Clausen, Thomas; Cordero, Juan Antonio; Townsley, Mark W Reliable Multicast with B.I.E.R. Journal Article IEEE/KICS Journal of Communications and Networks (JCN), 20 (2), pp. 182-197, 2018. @article{Desmouceaux0000, title = {Reliable Multicast with B.I.E.R.}, author = {Yoann Desmouceaux and Thomas Clausen and Juan Antonio Cordero and W. Mark Townsley }, url = {http://www.thomasclausen.net/wp-content/uploads/2018/03/jcn-2018.pdf}, year = {2018}, date = {2018-02-28}, journal = {IEEE/KICS Journal of Communications and Networks (JCN)}, volume = {20}, number = {2}, pages = {182-197}, abstract = {Inter-network multicast protocols, which build and maintain multicast trees, incur both explicit protocol signalling, and maintenance of state in intermediate routers in the network. B.I.E.R. (Bit-Indexed Explicit Replication) is a technique which can provide a multicast service yet removes such complexities: in- termediate routers are unencumbered by group management, and no per-group state is to be maintained. This paper explores the use of B.I.E.R. as a basis for develop- ing an efficient and reliable multicast mechanism, where redun- dant traffic is avoided, essential traffic is forwarded along shortest paths, and no per-flow state is required in intermediate routers. Evaluated by way of both an analytical model and network sim- ulation both in generic and in real network topologies with vary- ing background traffic loads, the proposed B.I.E.R.-based reliable multicast mechanism exhibits attractive performance attributes: it attains delivery success rates as high as any other reliable multicast service, but with significantly better link utilisation and no per-flow or per-group state in intermediate routers of the network.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Inter-network multicast protocols, which build and maintain multicast trees, incur both explicit protocol signalling, and maintenance of state in intermediate routers in the network. B.I.E.R. (Bit-Indexed Explicit Replication) is a technique which can provide a multicast service yet removes such complexities: in- termediate routers are unencumbered by group management, and no per-group state is to be maintained. This paper explores the use of B.I.E.R. as a basis for develop- ing an efficient and reliable multicast mechanism, where redun- dant traffic is avoided, essential traffic is forwarded along shortest paths, and no per-flow state is required in intermediate routers. Evaluated by way of both an analytical model and network sim- ulation both in generic and in real network topologies with vary- ing background traffic loads, the proposed B.I.E.R.-based reliable multicast mechanism exhibits attractive performance attributes: it attains delivery success rates as high as any other reliable multicast service, but with significantly better link utilisation and no per-flow or per-group state in intermediate routers of the network. |
Desmouceaux, Yoann; Pfister, Pierre; Tollet, Jérôme; Townsley, Mark W; Clausen, Thomas 6LB: Scalable and Application-Aware Load Balancing with Segment Routing Journal Article IEEE/ACM Transactions on Networking, 26 (2), pp. 819-834, 2018, ISSN: 1063-6692. @article{Desmouceaux2018, title = {6LB: Scalable and Application-Aware Load Balancing with Segment Routing}, author = {Yoann Desmouceaux and Pierre Pfister and Jérôme Tollet and W. Mark Townsley and Thomas Clausen}, url = {http://www.thomasclausen.net/wp-content/uploads/2018/02/2018-IEEE-Transactions-on-Networking-6LB-Scalable-and-Application-Aware-Load-Balancing-with-Segment-Routing.pdf}, doi = {10.1109/TNET.2018.2799242}, issn = {1063-6692}, year = {2018}, date = {2018-02-15}, journal = {IEEE/ACM Transactions on Networking}, volume = {26}, number = {2}, pages = {819-834}, 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 solely on its local state. This way, applications themselves naturally decide on how to fairly share incoming connections, while incurring minimal network overhead, and no out-of-band signaling. A consistent hashing algorithm, as well as an in-band stickiness protocol, allow for the proposed solution to be able to be reliably distributed across a large number of instances. Performance evaluation by means of an analytical model and actual tests on different workloads (including a Wikipedia replay as a realistic workload) show significant performance benefits in terms of shorter response times, when compared to a traditional random load-balancer. In addition, this paper introduces and compares kernel bypass high-performance implementations of both 6LB and a state-of-the-art load-balancer, showing that the significant system-level benefits of 6LB are achievable with a negligible data-path CPU overhead.}, keywords = {}, pubstate = {published}, tppubtype = {article} } 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 solely on its local state. This way, applications themselves naturally decide on how to fairly share incoming connections, while incurring minimal network overhead, and no out-of-band signaling. A consistent hashing algorithm, as well as an in-band stickiness protocol, allow for the proposed solution to be able to be reliably distributed across a large number of instances. Performance evaluation by means of an analytical model and actual tests on different workloads (including a Wikipedia replay as a realistic workload) show significant performance benefits in terms of shorter response times, when compared to a traditional random load-balancer. In addition, this paper introduces and compares kernel bypass high-performance implementations of both 6LB and a state-of-the-art load-balancer, showing that the significant system-level benefits of 6LB are achievable with a negligible data-path CPU overhead. |
2017 |
Perez, Samuel; Cordero, Juan Antonio; Coupechoux, Marceau ODMAC++: An IoT Communication Manager based on Energy Harvesting Prediction Inproceedings Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'2017)., IEEE, 2017. @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 = {}, pubstate = {published}, tppubtype = {inproceedings} } 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. |
Desmouceaux, Yoann; Pfister, Pierre; Tollet, Jerome; Townsley, Mark W; Clausen, Thomas SRLB: The Power of Choices in Load Balancing with Segment Routing Inproceedings In Proceedings of the 37th IEEE International Conference on Distributed Computing Systems (ICDCS), 2017. @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 = {}, pubstate = {published}, tppubtype = {inproceedings} } 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. |
2016 |
Augustin, Aloys; Yi, Jiazi; Clausen, Thomas; Townsley, Mark A Study of LoRa: Long Range & Low Power Networks for the Internet of Things Journal Article MDPI Sensors, 16 (9), pp. 1466, 2016, ISSN: 1424-8220, ((5 yr Impact Factor: 2.437)). @article{Augustin2016, title = {A Study of LoRa: Long Range & Low Power Networks for the Internet of Things}, author = {Aloys Augustin and Jiazi Yi and Thomas Clausen and Mark Townsley}, url = {http://www.thomasclausen.net/2016-a-study-of-lora-long-range-low-power-networks-for-the-internet-of-things/}, doi = {10.3390/s16091466}, issn = {1424-8220}, year = {2016}, date = {2016-09-09}, journal = {MDPI Sensors}, volume = {16}, number = {9}, pages = {1466}, abstract = {LoRa is a long-range, low-power, low-bitrate, wireless telecommunications system, promoted as an infrastructure solution for the Internet of Things: end-devices use LoRa across a single wireless hop to communicate to gateway(s), connected to the Internet and which act as transparent bridges and relay messages between these end-devices and a central network server. This paper provides an overview of LoRa and an in-depth analysis of its functional components. The physical and data link layer performance is evaluated by field tests and simulations. Based on the analysis and evaluations, some possible solutions for performance enhancements are proposed.}, note = {(5 yr Impact Factor: 2.437)}, keywords = {}, pubstate = {published}, tppubtype = {article} } LoRa is a long-range, low-power, low-bitrate, wireless telecommunications system, promoted as an infrastructure solution for the Internet of Things: end-devices use LoRa across a single wireless hop to communicate to gateway(s), connected to the Internet and which act as transparent bridges and relay messages between these end-devices and a central network server. This paper provides an overview of LoRa and an in-depth analysis of its functional components. The physical and data link layer performance is evaluated by field tests and simulations. Based on the analysis and evaluations, some possible solutions for performance enhancements are proposed. |
Jin, Kaiwan; Pfister, Pierre; Yi, Jiazi Distributed Node Consensus Protocol: Analysis, Evaluation and Performance Inproceedings Proceedings of the IEEE International Conference on Communications (ICC) 2016, 2016. @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 = {}, pubstate = {published}, tppubtype = {inproceedings} } 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. |