Bounds for the On-line Multicast Problem in Directed Graphs.

Michalis Faloutsos Rajesh Pankaj Kenneth C. Sevcik

Published in: SIROCCO (1997)

Keyphrases

directed graph
random walk
upper bound
maximum flow
lower bound
wireless networks
multicast routing
upper and lower bounds
directed acyclic graph
application layer
overlay network
graph structures
end to end
error bounds
worst case
group membership
graph structure
congestion control
route selection