Interconnection of broadband local area networks
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Incorporation of multiaccess links into a routing protocol
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
48-bit absolute internet and Ethernet host numbers
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Pitfalls in the design of distributed routing algorithms
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Computer
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Automatic reconfiguration in Autonet
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Designing algorithms for distributed systems with partially synchronized clocks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Multicast routing in internetworks and extended LANs
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Self-stabilization by window washing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Routing in Wormhole-Switched Clustered Networks with Applications to Fault Tolerance
IEEE Transactions on Parallel and Distributed Systems
SmartBridge: a scalable bridge architecture
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
IEEE Transactions on Computers
Fast Dynamic Reconfiguration in Irregular Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Deadlock-free multicasting in irregular networks using prefix routing
The Journal of Supercomputing
Layered Routing in Irregular Networks
IEEE Transactions on Parallel and Distributed Systems
An overlay approach to data security in ad-hoc networks
Ad Hoc Networks
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Simulation-assisted analysis and design of STP-based networks
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Heuristic algorithms for designing self-repairing protection trees in mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended Rebeca
Electronic Notes in Theoretical Computer Science (ENTCS)
Building ethernet connectivity services for provider networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Safe and Distributed Kinodynamic Replanning for Vehicular Networks
Mobile Networks and Applications
SPAIN: COTS data-center Ethernet for multipathing over arbitrary topologies
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
ACM Transactions on Computer Systems (TOCS)
Constructing maximum-lifetime data gathering forests in sensor networks
IEEE/ACM Transactions on Networking (TON)
Hybridizing river formation dynamics and ant colony optimization
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
ALIAS: scalable, decentralized label assignment for data centers
Proceedings of the 2nd ACM Symposium on Cloud Computing
Analysis of security vulnerability diagnosis in mobile IP networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
System development of security vulnerability diagnosis in wireless internet networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Real-time model checking is really simple
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
DPUMA: a highly efficient multicast routing protocol for mobile ad hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Journal of Computer and System Sciences
Routes building approach for multicast applications in metro ethernet networks
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
An ACO-RFD hybrid method to solve NP-complete problems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A protocol and algorithm are given in which bridges in an extended Local Area Network of arbitrary topology compute, in a distributed fashion, an acyclic spanning subset of the network.The algorithm converges in time proportional to the diameter of the extended LAN, and requires a very small amount of memory per bridge, and communications bandwidth per LAN, independent of the total number of bridges or the total number of links in the network.AlgorhymeI think that I shall never see A graph more lovely than a tree.A tree whose crucial property Is loop-free connectivity.A tree which must be sure to span So packets can reach every LAN.First the Root must be selected By ID it is elected.Least cost paths from Root are traced. In the tree these paths are placed.A mesh is made by folks like me Then bridges find a spanning tree.