The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T . In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree...

In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the moment when the results are ready at the output gates – and analysed this complexity measure for prefix computations. Here we consider the problem to sort large integers that are given in binary notation. Contrary to a ...

In this work, we present an overlay multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems. At the same time, the proposed algorithm considers the computing power and the network condition of each end-system as a control variable and thus we can avoid the disastrous case that loads are concentrated to only several endsystems. The multicast tree i...