Networks
Computer networks: 2nd edition
Computer networks: 2nd edition
Fast connection establishment in high speed networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Communicating with virtual paths and virtual channels
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing algorithm for nodal load balancing
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Reliable multi-user tree setup with local identifiers
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
Evaluation of algorithms for multipoint routing
Evaluation of algorithms for multipoint routing
Architectural and protocol frameworks for multicast data transport in multi-service networks
ACM SIGCOMM Computer Communication Review
Cost analysis of multicast transport architectures in multiservice networks
IEEE/ACM Transactions on Networking (TON)
Packet delay in models of data networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
New Distributed Multicast Routing and Its Performance Evaluation
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Performance Modelling of Reliable Multicast Transmission
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
AMRST: adaptive multicast routing protocol for satellite-terrestrial networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Research: The impact of routing on multicast error recovery
Computer Communications
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
Computer Communications
| Hi-index | 0.00 |
Routing connections in a point-to-point network is typically treated as a shortest path problem in a graph. Nodes represent switching systems, edges represent links and the edge lengths represent the costs associated with using a link. With multicast routing, one is interested in the shortest subtree of the network containing a given set of hosts. This is essentially a Steiner Tree problem in graphs and is known to be NP-complete [Karp]. Traditionally, the multicast routing algorithms proposed for packet switched networks like asynchronous transfer mode (ATM) networks have been aimed at minimising the total link cost of the Steiner tree [Waxman88], [Jaffe83] and do not take the geographical spreading of the connections into account. A dynamic point-to-multipoint routing algorithm is proposed, which takes into account the concept of geographic spread (also defined) of the connections and its performance is evaluated against the KMB near optimal heuristic algorithm for solving the Steiner tree problem [Kou].