Cited By
View all- Campos RRicardo M(2019)A fast algorithm for computing minimum routing cost spanning treesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2008.08.01352:17(3229-3247)Online publication date: 6-Jan-2019
- JIN DCHEN WSU LLI YZENG L(2009)Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single FailureIEICE Transactions on Communications10.1587/transcom.E92.B.909E92-B:3(909-921)Online publication date: 2009
- Elmeleegy KCox A(2009)EtherProxy: Scaling Ethernet By Suppressing Broadcast TrafficIEEE INFOCOM 2009 - The 28th Conference on Computer Communications10.1109/INFCOM.2009.5062076(1584-1592)Online publication date: Apr-2009
- Show More Cited By