Application of the Many Sources Asymptotic in Downscaling Internet-Like Networks
In the authors' earlier paper, they have presented two methods to scale down the topology of the Internet, while preserving important performance metrics. They have shown that the methods can be used to greatly simplify and expedite performance prediction. The key insight that they have leveraged is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Based on this, they have shown that it is possible to infer the performance of the larger Internet by creating and observing a suitably scaled-down replica, consisting of the congested links only. However, two main assumptions of their approach were that uncongested links are known in advance, and that the queueing delays imposed by such links are negligible.