Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Designing Storage Area Networks: A Practical Reference for Implementing Storage Area Networks
Designing Storage Area Networks: A Practical Reference for Implementing Storage Area Networks
An Efficient QoS Routing Algorithm for Quorumcast Communication
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A hybrid method for solving ARWA problem on WDM network
Computer Communications
A survey of anycast in IPv6 networks
IEEE Communications Magazine
The measured performance of content distribution networks
Computer Communications
Static manycast routing and wavelength assignment over wavelength-routed optical WDM networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Hi-index | 0.00 |
We investigate the problem of multi-resource manycast in mesh networks. The problem of multi-resource manycast extends the traditional manycast problem or k-Steiner tree problem, which finds a minimum cost tree spanning any k vertices. For the traditional manycast, all the vertices in the set of candidate destinations will be regarded as identical. However, the computing capability of the resource at each vertex may be not equivalent in the realistic networks. In this paper, we consider the problem of multi-resource manycast, in which the computing capability of the resource at a vertex is decomposed into discrete units. That is, each vertex may have multiple units of computing resources. The objective is to find a minimum cost tree spanning any k units of computing resources distributed in the networks. We show that multi-resource manycast is NP-Complete. The ILP formulation and approximation analysis are given for this problem. Simple polynomial-time heuristic algorithms are also proposed for the problem of multi-resource manycast. We investigate various approaches to implement multi-resources manycast in mesh networks, and verify the effectiveness of the approaches through simulation.