Reverse path forwarding of broadcast packets
Communications of the ACM
Broadcast protocols in packet switched computer networks.
Broadcast protocols in packet switched computer networks.
Mechanisms for broadcast and selective broadcast
Mechanisms for broadcast and selective broadcast
Internet broadcasting
An architecture for a multimedia teleconferencing system
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Multicast tree construction in bus-based networks
Communications of the ACM
The implementation of guaranteed, reliable, secure broadcast networks
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Load balancing with network partitioning using host groups
Parallel Computing
An efficient multicast protocol using de Bruijn structure for mobile computing
ACM SIGCOMM Computer Communication Review
Host groups: a multicast extension for datagram internetworks
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Multicasting in delay tolerant networks: semantic models and routing algorithms
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
On the database/network interface in large-scale publish/subscribe systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
10 networking papers: a blast from the past
ACM SIGCOMM Computer Communication Review
On Bandwidth-Efficient Overlay Multicast
IEEE Transactions on Parallel and Distributed Systems
Seamless multicast handover in an NC-HMIPv6 environment
WSEAS Transactions on Computers
OASIS: An Overlay Abstraction for Re-architecting Large Scale Internet Group Services
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
An XCAST multicast implementation for the OverSim simulator
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Research: High performance transfer services to support multimedia group communications
Computer Communications
| Hi-index | 0.02 |
We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows “shortest” paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.