Rethinking the service model: Scaling ethernet to a million nodes, ACM Hotnet, 2004. ,
Revisiting Route Caching: The World Should Be Flat, 2009. ,
DOI : 10.1016/0169-7552(90)90106-3
Portland: a scalable faulttolerant layer 2 data center network fabric, ACM SIGCOMM, pp.39-50, 2009. ,
Viking: a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks, IEEE INFOCOM 2004, 2004. ,
DOI : 10.1109/INFCOM.2004.1354651
Floodless in SEATTLE: a scalable Ethernet architecture for large enterprises, ACM SIGCOMM, 2008. ,
Scalable routing on flat names, Proceedings of the 6th International COnference on, Co-NEXT '10, 2010. ,
DOI : 10.1145/1921168.1921195
The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4, IETF RFC, vol.4728, 2007. ,
DOI : 10.17487/rfc4728
Scalable object-tracking through unattended techniques (SCOUT), Proceedings 2000 International Conference on Network Protocols, pp.253-262, 2000. ,
DOI : 10.1109/ICNP.2000.896309
The landmark hierarchy: a new hierarchy for routing in very large networks, ACM SIGCOMM, pp.35-42, 1988. ,
Virtual ring routing: network routing inspired by dhts, ACM SIGCOMM, pp.351-362, 2006. ,
Enhanced Non-disjoint Multi-path Source Routing Protocol for Wireless Ad-Hoc Networks, ACM ICCSA, pp.1187-1196, 2007. ,
DOI : 10.1007/978-3-540-74484-9_104
MATE: MPLS adaptive traffic engineering, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1300-1309, 2001. ,
DOI : 10.1109/INFCOM.2001.916625
Analysis of an Equal-Cost Multi-Path Algorithm, RFC 2992 (Informational), 2000. ,
DOI : 10.17487/rfc2992
Finding the k shortest paths, Annual IEEE Symposium on, pp.154-165, 1994. ,
shortest simple paths, ACM Transactions on Algorithms, vol.3, issue.4, 2007. ,
DOI : 10.1145/1290672.1290682
Low Complexity Link State Multipath Routing, IEEE INFOCOM Workshops 2009, pp.1-6, 2009. ,
DOI : 10.1109/INFCOMW.2009.5072161
Ant colony optimization for the maximum edge-disjoint paths problem, EvoWorkshops, pp.160-169, 2004. ,
Improved Ant Colony Algorithm for Multipath Routing Algorithm Research, 2010 International Symposium on Intelligence Information Processing and Trusted Computing, pp.651-655, 2010. ,
DOI : 10.1109/IPTC.2010.162
On Selection of Paths for Multipath Routing, IEEE IWQoS, pp.170-184, 2001. ,
DOI : 10.1007/3-540-45512-4_13
Distributed algorithms for computing shortest pairs of disjoint paths, IEEE Transactions on Information Theory, vol.39, issue.2, pp.443-455, 1993. ,
DOI : 10.1109/18.212275
Omnet++ website, 2010. ,
Measuring isp topologies with rocketfuel, ACM SIGCOMM, 2002. ,