Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Observing TCP dynamics in real networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
Parallel execution for serial simulators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Packet network simulation: speedup and accuracy versus timing granularity
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Using loss pairs to discover network properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Aggregate traffic performance with active queue management and drop from tail
ACM SIGCOMM Computer Communication Review
A flow-based model for internet backbone traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Fluid models and solutions for large-scale IP networks
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Provisioning internet backbone networks to support latency sensitive applications
Provisioning internet backbone networks to support latency sensitive applications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Performance Preserving Network Downscaling
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation
IEEE/ACM Transactions on Networking (TON)
Update on buffer sizing in internet routers
ACM SIGCOMM Computer Communication Review
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Sizing Backbone Internet Links
Operations Research
Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Orbis: rescaling degree correlations to generate annotated internet topologies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling Internet backbone traffic at the flow level
IEEE Transactions on Signal Processing
Time-driven fluid simulation for high-speed networks
IEEE Transactions on Information Theory
Performance Preserving Topological Downscaling of Internet-Like Networks
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
A hierarchical networking architecture based on new switching address
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Flow-based partitioning of network testbed experiments
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
It has been recently suggested that uncongested links could be completely ignored when evaluating Internet's performance. In particular, based on the observation that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows, it has been shown that one can infer the performance of the larger Internet by creating and observing a suitably scaled-down replica, consisting of the congested links only. Given that the majority of Internet links are uncongested, it has been demonstrated that this approach can be used to greatly simplify and expedite performance prediction. However, an important open problem, directly related to the practicability of such an approach, is whether there exist efficient and scalable ways for identifying uncongested links, in large and complex Internet-like networks. Of course, such a question is not only very important for scaling down Internet's topology, but also in many other contexts, e.g. such as in traffic engineering and capacity planning. In this paper we present simple rules that can be used to efficiently identify uncongested Internet links. In particular, we first identify scenarios under which one can easily deduce whether a link is uncongested by inspecting the network topology. Then, we identify scenarios in which this is not possible, and propose an efficient methodology, based on the large deviations theory and flow-level statistics, to approximate the queue length distribution,and in turn, to deduce the congestion level of a link. We also demonstrate how simple commonly used metrics, such as the link utilization, can be quite misleading in classifying an Internet link.