Browsing by Subject "Balancing problems"

Now showing items 1-5 of 5

    • Article  

      Balancing wireless data broadcasting and information hovering for efficient information dissemination 

      Liaskos, Christos K.; Xeros, Andreas; Papadimitriou, Georgios I.; Lestas, Marios; Pitsillides, Andreas (2012)
      Wireless data broadcasting is an efficient, bandwidth preserving way of data dissemination. However, as the amount of data increases, the waiting time of the clients becomes unacceptably high. The present paper proposes ...
    • Article  

      A combinatorial treatment of balancing networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
    • Conference Object  

      Distributed minimum-time weight balancing over digraphs 

      Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (IEEE Computer Society, 2014)
      We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Conference Object  

      Integer weight balancing in directed graphs in the presence of communication delays 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...