Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Introduction to algorithms
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
A model, analysis, and protocol framework for soft state-based communication
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Cost, Delay, and Delay Variation Conscious Multicast Routing
Cost, Delay, and Delay Variation Conscious Multicast Routing
Multicast routing in point-to-point networks under constraints
Multicast routing in point-to-point networks under constraints
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
Nettimer: a tool for measuring bottleneck link, bandwidth
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Optimal multicast multichannel routing in computer networks
Computer Communications
Optimal multicast multichannel routing in computer networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
The Journal of Supercomputing
| Hi-index | 0.00 |
This paper studies quality of service (QoS) routing for quorumcast, a generalized form of multicast communication. The need of quorumcast communication arises in a number of distributed applications such as distributed synchronization and resource discovery, but little work has been done on routing quorumcast messages with or without QoS constraints. Moreover, most known research work aimed to construct a minimum cost tree that spans the source and the quorumcast group members. In this paper, we further consider the path quality of a tree in terms of source-destination delay constraints imposed by applications that use the tree. As the delay-constrained quorumcast routing problem is NP-complete, we propose an efficient heuristic QoS routing algorithm. We also consider how to detect and remove loops in the course of tree construction and how to deal with member join/leave in/from the quorumcast pool. Our simulation study shows that the proposed algorithm performs well and constructs a quorumcast tree with the cost close to that of the "optimal" routing tree.