The Experts below are selected from a list of 183 Experts worldwide ranked by ideXlab platform

Márk Jelasity - One of the best experts on this subject based on the ideXlab platform.

  • Token Account Algorithms: The Best of the Proactive and Reactive Worlds
    2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), 2018
    Co-Authors: Gábor Danner, Márk Jelasity
    Abstract:

    Many decentralized Algorithms allow both proactive and reactive implementations. Examples include gossip protocols for broadcasting and decentralized computing, as well as chaotic matrix iteration Algorithms. In proactive systems, nodes communicate at a fixed rate in regular intervals, while in reactive systems they communicate in response to certain events such as the arrival of fresh data. Although reactive Algorithms tend to stabilize/converge/self-heal much faster, they have serious drawbacks: they may cause bursts in bandwidth consumption, and they may also cause starvation when the number of messages circulating in the system becomes too low. Proactive Algorithms do not have these problems, but nodes waste a lot of time sitting on fresh information. Here, we propose a novel family of adaptive protocols that apply rate limiting inspired by the Token Bucket Algorithm to prevent bursts, but they also include proactive communication to prevent starvation. With the help of our traffic shaping service, some applications approach the speed of the reactive implementation, while maintaining strong guarantees regarding the total communication cost and burstiness. Due to the proactive component we can help maintain a certain level of activity despite losing messages due to faults or the application semantics. We perform simulation experiments in different scenarios including a real smartphone availability trace. Our results suggest up to a fourfold speedup in a broadcast application, and an order of magnitude speedup in the case of gossip learning, when compared to the purely proactive implementation.

  • ICDCS - Token Account Algorithms: The Best of the Proactive and Reactive Worlds
    2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), 2018
    Co-Authors: Gábor Danner, Márk Jelasity
    Abstract:

    Many decentralized Algorithms allow both proactive and reactive implementations. Examples include gossip protocols for broadcasting and decentralized computing, as well as chaotic matrix iteration Algorithms. In proactive systems, nodes communicate at a fixed rate in regular intervals, while in reactive systems they communicate in response to certain events such as the arrival of fresh data. Although reactive Algorithms tend to stabilize/converge/self-heal much faster, they have serious drawbacks: they may cause bursts in bandwidth consumption, and they may also cause starvation when the number of messages circulating in the system becomes too low. Proactive Algorithms do not have these problems, but nodes waste a lot of time sitting on fresh information. Here, we propose a novel family of adaptive protocols that apply rate limiting inspired by the Token Bucket Algorithm to prevent bursts, but they also include proactive communication to prevent starvation. With the help of our traffic shaping service, some applications approach the speed of the reactive implementation, while maintaining strong guarantees regarding the total communication cost and burstiness. Due to the proactive component we can help maintain a certain level of activity despite losing messages due to faults or the application semantics. We perform simulation experiments in different scenarios including a real smartphone availability trace. Our results suggest up to a fourfold speedup in a broadcast application, and an order of magnitude speedup in the case of gossip learning, when compared to the purely proactive implementation.

Gábor Danner - One of the best experts on this subject based on the ideXlab platform.

  • Token Account Algorithms: The Best of the Proactive and Reactive Worlds
    2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), 2018
    Co-Authors: Gábor Danner, Márk Jelasity
    Abstract:

    Many decentralized Algorithms allow both proactive and reactive implementations. Examples include gossip protocols for broadcasting and decentralized computing, as well as chaotic matrix iteration Algorithms. In proactive systems, nodes communicate at a fixed rate in regular intervals, while in reactive systems they communicate in response to certain events such as the arrival of fresh data. Although reactive Algorithms tend to stabilize/converge/self-heal much faster, they have serious drawbacks: they may cause bursts in bandwidth consumption, and they may also cause starvation when the number of messages circulating in the system becomes too low. Proactive Algorithms do not have these problems, but nodes waste a lot of time sitting on fresh information. Here, we propose a novel family of adaptive protocols that apply rate limiting inspired by the Token Bucket Algorithm to prevent bursts, but they also include proactive communication to prevent starvation. With the help of our traffic shaping service, some applications approach the speed of the reactive implementation, while maintaining strong guarantees regarding the total communication cost and burstiness. Due to the proactive component we can help maintain a certain level of activity despite losing messages due to faults or the application semantics. We perform simulation experiments in different scenarios including a real smartphone availability trace. Our results suggest up to a fourfold speedup in a broadcast application, and an order of magnitude speedup in the case of gossip learning, when compared to the purely proactive implementation.

  • ICDCS - Token Account Algorithms: The Best of the Proactive and Reactive Worlds
    2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), 2018
    Co-Authors: Gábor Danner, Márk Jelasity
    Abstract:

    Many decentralized Algorithms allow both proactive and reactive implementations. Examples include gossip protocols for broadcasting and decentralized computing, as well as chaotic matrix iteration Algorithms. In proactive systems, nodes communicate at a fixed rate in regular intervals, while in reactive systems they communicate in response to certain events such as the arrival of fresh data. Although reactive Algorithms tend to stabilize/converge/self-heal much faster, they have serious drawbacks: they may cause bursts in bandwidth consumption, and they may also cause starvation when the number of messages circulating in the system becomes too low. Proactive Algorithms do not have these problems, but nodes waste a lot of time sitting on fresh information. Here, we propose a novel family of adaptive protocols that apply rate limiting inspired by the Token Bucket Algorithm to prevent bursts, but they also include proactive communication to prevent starvation. With the help of our traffic shaping service, some applications approach the speed of the reactive implementation, while maintaining strong guarantees regarding the total communication cost and burstiness. Due to the proactive component we can help maintain a certain level of activity despite losing messages due to faults or the application semantics. We perform simulation experiments in different scenarios including a real smartphone availability trace. Our results suggest up to a fourfold speedup in a broadcast application, and an order of magnitude speedup in the case of gossip learning, when compared to the purely proactive implementation.

Salvatore Pontarelli - One of the best experts on this subject based on the ideXlab platform.

  • TIWDC - Implementing a Per-Flow Token Bucket Using Open Packet Processor
    Digital Communication. Towards a Smart and Secure Future Internet, 2017
    Co-Authors: Giuseppe Bianchi, Valerio Bruschi, Marco Bonola, Luca Petrucci, Salvatore Pontarelli
    Abstract:

    In this paper we show how to realize a per-flow QoS (Quality of Service) policy based on the Token Bucket Algorithm using OPP (Open Packet Processor), a recently proposed stateful programmable dataplane. OPP is configured as a switch that enforce a Token Bucket policy independently on each flow processed by the switch controlling their bandwidth and burstiness. The paper shows the design of the Token Bucket Algorithm using the extended finite state machine (EFSM) abstraction provided by OPP and discusses the details of the implementation carried out using a proof-of-concept FPGA prototype of the OPP pipeline.

  • Implementing a per-flow Token Bucket using open packet processor
    Communications in Computer and Information Science, 2017
    Co-Authors: Giuseppe Bianchi, Valerio Bruschi, Marco Bonola, Luca Petrucci, Salvatore Pontarelli
    Abstract:

    © Springer International Publishing AG 2017. In this paper we show how to realize a per-flow QoS (Quality of Service) policy based on the Token Bucket Algorithm using OPP (Open Packet Processor), a recently proposed stateful programmable dataplane. OPP is configured as a switch that enforce a Token Bucket policy independently on each flow processed by the switch controlling their bandwidth and burstiness. The paper shows the design of the Token Bucket Algorithm using the extended finite state machine (EFSM) abstraction provided by OPP and discusses the details of the implementation carried out using a proof-of-concept FPGA prototype of the OPP pipeline.

O. Sallent - One of the best experts on this subject based on the ideXlab platform.

Giuseppe Bianchi - One of the best experts on this subject based on the ideXlab platform.

  • TIWDC - Implementing a Per-Flow Token Bucket Using Open Packet Processor
    Digital Communication. Towards a Smart and Secure Future Internet, 2017
    Co-Authors: Giuseppe Bianchi, Valerio Bruschi, Marco Bonola, Luca Petrucci, Salvatore Pontarelli
    Abstract:

    In this paper we show how to realize a per-flow QoS (Quality of Service) policy based on the Token Bucket Algorithm using OPP (Open Packet Processor), a recently proposed stateful programmable dataplane. OPP is configured as a switch that enforce a Token Bucket policy independently on each flow processed by the switch controlling their bandwidth and burstiness. The paper shows the design of the Token Bucket Algorithm using the extended finite state machine (EFSM) abstraction provided by OPP and discusses the details of the implementation carried out using a proof-of-concept FPGA prototype of the OPP pipeline.

  • Implementing a per-flow Token Bucket using open packet processor
    Communications in Computer and Information Science, 2017
    Co-Authors: Giuseppe Bianchi, Valerio Bruschi, Marco Bonola, Luca Petrucci, Salvatore Pontarelli
    Abstract:

    © Springer International Publishing AG 2017. In this paper we show how to realize a per-flow QoS (Quality of Service) policy based on the Token Bucket Algorithm using OPP (Open Packet Processor), a recently proposed stateful programmable dataplane. OPP is configured as a switch that enforce a Token Bucket policy independently on each flow processed by the switch controlling their bandwidth and burstiness. The paper shows the design of the Token Bucket Algorithm using the extended finite state machine (EFSM) abstraction provided by OPP and discusses the details of the implementation carried out using a proof-of-concept FPGA prototype of the OPP pipeline.