Goodness-of-fit techniques
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
QoS based multicast routing algorithms for real time applications
Performance Evaluation - Special issue on performance and control of network systems
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Search space reduction in QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH
Probability in the Engineering and Informational Sciences
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
On the geographic location of Internet resources
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
A new NS2 module for the simulation of MPLS networks with point-to-multipoint LSP support
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.25 |
Waxman graphs are a popular class of random graphs used for modelling the Internet topology, especially for the intra-domain part. When used for network modelling purposes their connectedness properties are particularly relevant, both for the characteristics of the realized graph and for the generation time. In this paper, the probability of obtaining a connected Waxman graph is derived analytically for the general case of nodes disposed over a rectangular area (as opposed to the special case of an underlying square area already investigated in the literature) and is related to the values of the Waxman parameters used in the generation of the graph.