2 research outputs found

    OVERLAY MULTICAST TREE MINIMIZING AVERAGE TIME DELAY

    No full text
    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 end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.X111sciescopu

    Overlay Multicast Tree Minimizing Average Time Delay

    No full text
    corecore