1. Barabási, A.L., Albert, R., 1999. Emergence of scaling in random networks. Science, 286(5439):509–512. [doi:10. 1126/science.286.5439.509]
2. CCITT X.25:1977. Recommendation X.25-Interface Between Data Terminal Equipment (DTE) and Data Circuit-Terminating Equipment (DCE) for Terminals Operating in the Packet Mode on Public Data Networks. International Telegraph and Telephone Consultative Committee (CCITT) Orange Book, Geneva, Switzerland, Vol. VIII-2, p.70–108.
3. Cheriton, D.R., Gritter, M., 2000. TRIAD: a Scalable Deployable NAT-Based Internet Architecture. Available from http://www-dsg.stanford.edu/papers/triad/triad.html [Accessed on Aug. 2, 2011].
4. Cohen, R., Havlin, S., 2003. Scale-free networks are ultrasmall. Phys. Rev. Lett., 90(5):058701. [doi:10.1103/PhysRevLett. 90.058701]
5. Dellamonica, D., Kohayakawa, Y., Rödl, V., Ruciński, A., 2008. Universality of Random Graphs. Proc. 19th Annual ACM-SIAM Symp. on Discrete Algorithms, p.782–788.