These topologies can be referenced to this paper:
"Policy-Aware Topologies for Efficient Inter-Domain Routing Evaluations" 
Yihua He and Srikanth V. Krishnamurthy and Michalis Faloutsos and Marek Chrobak 
IEEE INFOCOM 2008 Mini-Conference, Phoenix, AZ, USA (Acceptance Ratio: 9.3% 85/900)


Our experiments suggest that below 5000 nodes the graph metrics
change significantly.


 I included 9 sampled topologies and the original one from Dec 2006
 in a tar.gz file: www.cs.ucr.edu/~yhe/topologies.tar.gz. The 9 sampled
 topologies range from about 600 nodes to 14,000 nodes. The original  
 one  has about ~25,000 nodes.

Since it is a sampling algorithm, it requires the original topology. I have an original topology derived from Routeviews in Dec 2006, and with their AS relationships classified by Gao's algorithm. If you want to use something other than that, you can send me a large topology (preferrably a link where I can download) in the following plain text format:


Legend:
#AS1  AS2  Relationship
1 2 P
1 3 P
1 6 P
2 3 E
2 4 P
3 5 P
5 6 P

E.g., in the above 6-node topology, AS1 is AS2's provider, AS2 and  
AS3 have peer-to-peer relationship and etc. It doesn't accept complex  
relationship for now (e.g., AS1 and AS2 can not have peer-to-peer  
relationship while AS1 is AS2's provider)

Lead research: Yihua He, UCR now at Yahoo.



--  Michalis

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Michalis Faloutsos                     951 827-2480 (o)
% UC Riverside, Dpt Comp. Sci.     951 328-9296 (h)
% Riverside, CA 92521, USA          951 827-4643 (FAX)
%
%  HTTP  : www.cs.ucr.edu/~michalis/
%  E-mail: michalis@cs.ucr.edu
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%