A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
On the efficiency of multicast
IEEE/ACM Transactions on Networking (TON)
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
Probability in the Engineering and Informational Sciences
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
QoS Routing: Average Complexity and Hopcount in m Dimensions
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Performance analysis of the AntNet algorithm
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end loss probabilities in different internet-like networks with a given average hop count
ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
Connectivity of Waxman topology models
Computer Communications
The influence of network topological models on the prediction of end-to-end loss probabilities
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
A comparison of exact and ε-approximation algorithms for constrained routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
On the complexity of QoS routing
Computer Communications
| Hi-index | 0.00 |
The Waxman graphs are frequently chosen in simulations as topologies resembling communications networks. For the Waxman graphs, we present analytic, exact expressions for the link density (average number of links) and the average number of paths between two nodes. These results show the similarity of Waxman graphs to the simpler class Gp(N). The first result enables one to compare simulations performed on the Waxman graph with those on other graphs with same link density. The average number of paths in Waxman graphs can be useful to dimension (or estimate) routing paths in networks. Although higher-order moments of the number of paths in Gp(N) are difficult to compute analytically, the probability distribution of the hopcount of a path between two arbitrary nodes seems well approximated by a Poisson law.