Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A framework for scalable global IP-anycast (GIA)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Efficient Internet Multicast Routing Using Anycast Path Selection
Journal of Network and Systems Management
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
SomeCast: A Paradigm for Real-Time Adaptive Reliable Multicast
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed Admission Control for Anycast Flows with QoS Requirements
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Anycast and multicast are two important Internet services. Combining the two protocols can provide new and practical services. In this paper we propose a new Internet service, Minicast: in the scenario of n replicated or similar servers, deliver a message to at least m members, 1 ≤ m ≤ n. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. The service can provide the same Internet service with an optimal cost, reducing bandwidth consumption, network delay, and so on. We design a multi-core tree based architecture for the Minicast service and present the criteria for calculating the subcores among a subset of Minicast members. Simulation shows that the proposed architecture can even the Minicast traffic, and the Minicast application can save the consumptions of network resource.