An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Routing through networks with hierarchical topology aggregation
Journal of High Speed Networks
Topology aggregation for directed graphs
IEEE/ACM Transactions on Networking (TON)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Texture Mapping Using Surface Flattening via Multidimensional Scaling
IEEE Transactions on Visualization and Computer Graphics
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the accuracy of decentralized virtual coordinate systems in adversarial networks
Proceedings of the 14th ACM conference on Computer and communications security
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hyperbolic embedding of internet graph for distance estimation and overlay construction
IEEE/ACM Transactions on Networking (TON)
On the internet delay space dimensionality
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Characteristics of Internet Latency and Their Impact on Distance Prediction Accuracy
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
DCS: A Distributed Coordinate System for Network Positioning
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Molecular dynamics modelling of the temporal changes in complex networks
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Robust Decentralized Virtual Coordinate Systems in Adversarial Environments
ACM Transactions on Information and System Security (TISSEC)
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Multi-manifold model of the Internet delay space
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selection, and application level routing. We propose a new graph embedding scheme called Big-Bang Simulation (BBS), which simulates an explosion of particles under a force field derived from embedding error. BBS is shown to be significantly more accurate compared to all other embedding methods, including GNP. We report an extensive simulation study of BBS compared with several known embedding schemes and show its advantage for distance estimation (as in the IDMaps project), mirror selection, and topology aggregation.