Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs
2. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O …

This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …

In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having
some particular properties concerning a hamiltonian properties, for example, spanning trees …

We show that the de Bruijn graph is appropriate for maintaining dynamic connections, eg,
between the members of a P2P application who join and leave the system at their …

Both Hypercube and deBruijn networks possess desirable properties. It should be
understood, though, that some of the attractive features of one are not found in the other. The …

A refined heuristic for computing schedules for gossiping in the telephone model is
presented. The heuristic is fast: for a network with n nodes and m edges, requiring R rounds …

We show that the independent spanning tree conjecture on digraphs is true if we restrict
ourselves to line digraphs. Also, we construct independent spanning trees with small depths …

Abstract In the Binary Decision Diagram (BDD)-based network reliability analysis, heuristics
have been widely used to obtain a reasonably good ordering of edge variables. Orderings …

The problem of broadcasting long messages on store-and-forward communication networks,
where a processor (node) can send and receive messages simultaneously to and from all its …

We present a strongly polynomial-time algorithm to generate bandwidth optimal
allgather/reduce-scatter on any network topology, with or without switches. Our algorithm …