Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
QoSMIC: quality of service sensitive multicast Internet protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A distributed route-selection scheme for establishing real-time channels
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
Multicast routing and resource allocation for high-speed networks
Multicast routing and resource allocation for high-speed networks
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
Hi-index | 0.24 |
Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We believe that such paths are prone to delay constraint violations during load variations in the network. The root of such violations can be found in the imprecision of delay information during the routing process. In this paper, we propose a new approach for delay-constrained routing which captures the tradeoff between cost minimization and the risk level regarding to the delay constraint. We propose a protocol called Parameterized Delay-Constrained Routing protocol that implements our approach using a simple and efficient parameterized selection function. We expand this work to multicasting by proposing three new delay-constrained multicast routing protocols based on the source (Nai@?ve), destination (Greedy) and mixed multicast routing techniques. Our simulations show that our protocols produce paths and trees which are stable, less risky and suitable for various network conditions.