A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Does AS size determine degree in as topology?
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
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
Congestion avoiding mechanism based on inter-domain hierarchy
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Impact of alliances on end-to-end QoS satisfaction in an interdomain network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.00 |
There are different types of links between the domains that compose Internet. Relationships introduced by these types impose a hierarchical structure on the global network. This structure may influence the functioning of the different mechanisms used in the network, notably inter-domain routing protocols. In order to validate a new inter-domain protocol it is necessary to have a model of hierarchical networks. To the best of our knowledge, there is no random topology generator which is well adapted to represent the Internet hierarchy. We try to induce this hierarchy into random topologies generated by BRITE. The obtained results show that the hierarchy inducted in topologies generated with the extended model of Barabási and Albert (BA2) is very close to the real one. The implementation of the proposed solution, the SHIIP program, is available on Internet under a public-domain license.