Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Fault isolation in multicast trees
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Practical Multicast Monitoring Scheme TITLE2:
A Practical Multicast Monitoring Scheme TITLE2:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
The use of end-to-end multicast measurements for characterizing internal network behavior
IEEE Communications Magazine
The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment
IEEE Network: The Magazine of Global Internetworking
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the number of distributed measurement points for network tomography
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Tomography-based overlay network monitoring
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Algorithmic foundations of the internet
ACM SIGACT News
Robust monitoring of link delays and faults in IP networks
IEEE/ACM Transactions on Networking (TON)
End-to-end measurements over GPRS-EDGE networks
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Probe Station Placement for Robust Monitoring of Networks
Journal of Network and Systems Management
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
End-to-end quality of service seen by applications: A statistical learning approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed active measuring link bandwidth in IP networks
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Algorithmic foundations of the internet: roundup
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
| Hi-index | 0.00 |
There has been considerable activity recently to develop monitoring and debugging tools for a multicast session (tree). With these tools in mind, we focus on the problem of how to lay out multicast sessions so as to cover a set of links of interest within a network. We define two variations of this layout (cover) problems that differ in what it means for a link to be covered. We then focus on the minimum cost problem, to determine the minimum cost set of trees that cover the links in question. We show that, with few exceptions, the minimum cost problems are NP-hard and that even finding an approximation within a certain factor is NP-hard. One exception is when the underlyingne twork topology is a tree. For this case, we demonstrate an efficient algorithm that finds the optimal solution. We also present several computationally efficient heuristics and their evaluation through simulation. We find that two heuristics, a greedy heuristic that combines sets of trees with three or fewer receivers, and a heuristic based on our tree algorithm, both perform reasonably well. The remainder of the paper applies our techniques to the vBNS network and randomly generated networks, examining the effectiveness of the different heuristics.