TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
On routes and multicast trees in the Internet
ACM SIGCOMM Computer Communication Review
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
On the efficiency of multicast
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computer
QoS Routing: Average Complexity and Hopcount in m Dimensions
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
The observable part of a network
IEEE/ACM Transactions on Networking (TON)
Alias resolution techniques: long-term analysis of alias stability in internet routers
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Hi-index | 0.00 |
Based on RIPE NCC traceroute measurement data, we attempt to model the Internet graph with the graph G1, which is the union of the most frequently occurring paths in the RIPE traceroute database. After analyzing the topological properties of this graph, a striking agreement with the properties of the uniform recursive tree has been found. This similarity allows us to compute the efficiency of multicast. After assigning polynomially distributed link weights to the edges of the graph G1 and comparing the simulated shortest paths with the traceroutes, no clear conclusions on the link weight structure could be deduced. Finally, possible implications of the measurement data on the provisioning of Quality of Service are suggested.