Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Deadlock-Free Routing Scheme for Interconnection Networks with Irregular Topologies
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Floodless in seattle: a scalable ethernet architecture for large enterprises
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Proceedings of The ACM CoNEXT Student Workshop
Hi-index | 0.01 |
Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)--a forwarding scheme based on a spanning tree that was extended to use some shortcut links.We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing protocols to Ethernet. Finally, TRE is self-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.