Big-Bang simulation for embedding network distances in Euclidean space

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 1922-1932

  Shavitt, Yuval ^a   Tankel, Tomer ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION-LEVEL ROUTING; DISTANCE ESTIMATION; EMBEDDING METHOD; EMBEDDING NETWORK; EUCLIDEAN SPACES; EXTENSIVE SIMULATIONS; FORCE FIELDS; GRAPH EMBEDDINGS; GRAPH METRIC; TOPOLOGY AGGREGATIONS;

GEOMETRY; TOPOLOGY;

COMPUTER SIMULATION;

EID: 0041472446     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2003.1209214     Document Type: Conference Paper

References (18)

1. "Private network - network interface specification version 1.0 (PNNI)," The ATM Forum technical committee," Tech. Recomen-dation, Mar 1996, af-pnni-0055.000.
2. B. Awerbuch and Y. Shavitt, "Topology aggregation for directed graphs," IEEE/ACM Trans. Networking, Feb 2001.
3. W. Theilmann and K. Rothermel, "Dynamic distance maps of the internet," in Infocom, 2000, tel Aviv, Israel.
4. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang, "IDMaps: A global internet host distance estimation service," IEEE/ACM Trans. Networking, Oct 2001.
5. T. Ng and H. Zhang, "Predicting internet network distance with coordinates based approaches," in Infocom, 2002.
6. E. Cronin, S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt, "Constrained mirror placement on the internet," IEEE J. Select. Areas Commun., vol. 20, pp. 1369-1382, Sept. 2002.
7. W. Togerson, "Multidimensional scaling of similarity." Psychome-trika, vol. 30, pp. 379-393, 1965.
8. G. Zigelman, R. Kimmel, and N. Kiryati, "Texture mapping using surface flattening via multidemnsional scaling," IEEE Trans. Visual. Comput. Graphics, 4-6 2002.
9. G. Yona, N. Linial, and M. Linial, "ProtoMap: automatic classification of protein sequences and hierarchy of protein families," Nucleic Acids Research, vol. 28, pp. 49-55, 2000. (Pubitemid 30047712)
10. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, pp. 215-245, 1995.
11. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, "Characterizing the internet hierarchy from multiple vantage points," in Infocom, 2002.
12. B. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., pp. 1617-1622, 1988.
13. R. Albert and A.-L. Barabási, "Topology of evolving networks: local events and universality," Physical Review Letters, pp. 5234-5237, 11 Dec. 2000. (Pubitemid 32871817)
14. Y. Shavitt and T. Tankel, "Big-Bang simulation for embedding network distances in Euclidean space," E.E.-Systems Department, Tel-Aviv University, Tech. Rep., July 2002.
15. T. Kamada and S. Kawai, "An algorithm for drawing general undirected graphs," Information Processing Letters, vol. 31, pp. 7-15, 1989.
16. B. Awerbuch, Y. Du, B. Khan, and Y. Shavitt, "Routing through networks with hierarchical topology aggregation," Journal of High-Speed Net., vol. 7, 1998.
17. W. B. Johnson and J. Lindenstrauss, "Extensions of lipschitz mappings into a hilbert space," Contemporary mathematics, pp. 189-206, 1984.
18. J. Nelder and R. Mead, "A simplex method for function minimization," Computer Journal, pp. 308-313, 1965.