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.
The relative performance of different data collection methods in the assessment of various traffic parameters is significant when the amount of data generated by a complete trace of a traffic interval is computationslly overwhelming, and even capturing summary statistics for all traffic is impractical. This paper presents a study of the performance of various methods of sampling in answering questions related to wide area network traffic characterization. Using a packet trace from a network environment that aggregates traffic from a large number of sources, we simulate various sampling approaches, including time-driven and event-driven methods, with both random and deterministic selection pat t ems, at a variety of granularities. Using several metrics which indicate the similarity between two distributions, we then compare the sampled traces to the parent population, Our results revealed that the timetriggered techniques did not perform as well as the packettriggered ones. Furthermore, the performance differences within each class (packet-based or time-based techniques) are small.
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.