K-anycasting strategies in networks: To grow or to prune?

  • Prithwish Basu
  • Published 2016 in
    MILCOM 2016 - 2016 IEEE Military Communications…

Abstract

Disseminating content to a given subset of nodes in a network in a cost-effective manner is a fundamental problem in networks, and is referred to as multicast. If reaching all the nodes in the set is not necessary and reaching a quorum of size k within the set is sufficient, then the problem is referred to as k-anycast or any-k-cast. This has applications… (More)
DOI: 10.1109/MILCOM.2016.7795394

4 Figures and Tables

Topics

  • Presentations referencing similar topics