Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A survey of fast packet switches
ACM SIGCOMM Computer Communication Review
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Efficient mechanism for fairness and deadlock-avoidance in high-speed networks
Proceedings of the 4th international workshop on Distributed algorithms
Overview of the MetaRing architecture
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Routing and flow control on the MetaNet: an overview
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
METANET: principles of an arbitrary topology LAN
IEEE/ACM Transactions on Networking (TON)
Reverse path forwarding of broadcast packets
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Local fairness in general-topology networks with convergence routing
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Local and congestion-driven fairness algorithm in arbitrary topology networks
IEEE/ACM Transactions on Networking (TON)
A comparison of ring and tree embedding for real-time group multicast
IEEE/ACM Transactions on Networking (TON)
Reliable concurrent multicast from bursty sources
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
| Hi-index | 14.98 |
The problem solved in this work is how multiple nodes in a network with an arbitrary topology can broadcast concurrently, in an asynchronous manner, to all other nodes. Asynchronous means that the nodes do not coordinate their broadcast, and, therefore, it is possible that all nodes will start to broadcast at the same time. Simultaneous broadcast by many nodes can cause traffic congestion, which can result in a traffic loss. The main property of the broadcast algorithms presented in this work is that under any arbitrary broadcast pattern there will be no packet or cell loss due to internal traffic congestion.The routing mechanism used by the broadcast algorithm can be viewed as a variant of deflection routing, which means that a node makes on-line routing decisions based on the local flow of traffic (i.e., internal load conditions). Unlike other deflection techniques, the MetaNet routing is along a global sense of direction, which guarantees that packets will reach their destinations. Thus, we call this method convergence routing (previous deflection algorithms did not guarantee deterministic routing convergence, i.e., a cell/packet can be deflected indefinitely inside the network). As a result of the convergence property, the deflection routing used in this work is the only one with broadcast capability.