We present heuristics for mukicast tree construction for communication that dependa on: i) bounded end-to-end delay along the paths from source to each destination, and ii) minimum cost of tbe multicast tree, where edge coat and edge delay can be independent metrics. This problem of computing such a constrained mtdticaat tree is NP-complete. We show that the heuristlca demonstrate good average case behavior in terms of coat as determined through simulations on a large number of graphs.
We describe the concept of the relocatable continuous media filter. The novelty of these filters is how they can propagate over a dissemination tree in a network. We describe the filter propagation protocol to achieve this. Execution of filters inside a network allows the network to be viewed in a novel way, as a '+processor" with its "'instruction set" being the various types of available filters. Since filters generally modify the data rate of the continuous media stream, usually (but not necessarily) reducing it, filters allow the trading off of bandwidth and processing in a network.
MotivationHigh performance workstations and high capacity networks have become enabling technologies for distributed continuous media (CM) applications. For example, videoconferencing and remote video services will be popular for business and home users, while visualization of animations of remotely-located scientific data sets will be popular for scientific users.While the networks of the near future will offer gigabit per second and higher bandwidths, we believe there will always be a need for more bandwidth given the current trends toward videoconferencing, hundreds of channels offered by cable television providers, as well as the desire for user-selectable on-demand "pay-per-view" home movies. These video applications are highly I/O-intensive; for example, the data rate for a single
We consider the problem of optimal multicast routing with Quality of Service constraints motivated by the requirements of interactive continuous media communication, e.g., real-time teleconferencing. We concentrate on distributed algorithms for determining a tree over the network topology, rooted at the source and spanning the intended destinations. Quality of Service requirements for interactive continuous media typically impose constraints on some metric over the individual paths from the source to each destination, usually in the form of an upper bound on the delay. Thus, we focus on the problem of minimizing the cost of the tree while at the same time satisfying a common constraint over individual source-destination paths. We have shown that this problem is intractable, but have also devised centralized polynomial time heuristics that perform well. Here we present distributed algorithms to minimize tree cost while satisfying the constraints on the paths from the source to each destination.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.