in Networks under High Loads Anindya Basu Bell Laboratories, Lucent...  Home/Search
Context
Related
| belllabs.com/cm/cs/do...timescales.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: belllabs.com/cm/cs/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We develop a theory of network behavior under high load conditions and rapidly changing traffic demand matrices, using techniques from spectral graph theory and the physics of dynamical systems. We focus on the mean end-to-end delay as the performance metric and show that at high loads, there is a "characteristic timescale" of the network that determines the mean end-to-end delay. We show how this timescale can be analytically determined for a given network and validate our theory using... (Update)
Active bibliography (related documents): More All
0.5: Scaling Properties of the Internet Graph - Akella, Chawla, Kannan, Seshan (2003) (Correct)
0.5: On the Scaling of Congestion in the Internet Graph - Akella, Chawla, Kannan, Seshan (Correct)
0.4: Network Calculus Based Simulation for TCP Congestion Control.. - Kim, Hou (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ under-characteristic,
author = "In Networks Under",
title = "Characteristic Timescales: Analyzing End-to-end Delay",
url = "citeseer.ist.psu.edu/753755.html" }
Citations (may not include all citations):1535 Cambridge University Press (context) - Press, Flannery et al. - 1993
607 Modeling TCP Throughput: A Simple Model and its Empirical Va.. - Padhye, Firoiu et al. - 1998
576 Authoritative Sources in A Hyperlinked Environment - Kleinberg - 1999
354 A Note on Two Problems in Connexion with Graphs (context) - Dijkstra - 1959
335 Routing of Multipoint Connections (context) - Waxman - 1998
225 Emergence of Scaling in Random Networks (context) - asi, Albert - 1999
93 American Mathematical Society (context) - Chung, Theory et al. - 1997
81 Principles of Quantum Mechanics (context) - Dirac - 1982
69 Algorithms for Random Generation and Counting: A Markov Chai.. (context) - Sinclair - 1993
47 Fixed Point Approximations for TCP Behavior in an AQM Networ.. (context) - Bu, Towsley - 2001
44 Course of Theoretical Physics (context) - Landau, Sykes et al. - 1999
42 Approximate Min-Cut Max-Flow Theorem and Approximation Algor.. - Aumann, Rabani et al. - 1998
39 Modern Theory of Critical Phenomena (context) - Ma - 1976
33 Random Evolution in Massive Graphs - Aiello, Chung et al. - 2001
31 The Nonstationarity of Internet Traffic - Cao, Cleveland et al. - 2001
30 Multicommodity Max-Flow Min-Cut Theorems and Their Use in De.. (context) - Leighton, Rao - 1999
30 Cambridge University Press (context) - Norris - 1998
21 Statistical Mechanics (context) - Pathria - 1972
18 Theory of Dynamic Critical Phenomena (context) - Hohenberg, Halperin - 1977
15 Performance and Fluid Simulations of A Novel Shared Buffer M.. - Kumaran, Mitra - 1998
12 Spectral Analysis of Internet Topologies - Gkantsidis, Mihail et al. - 2003
10 Spectral Analysis of Time Series (context) - Priestley - 1981
8 Conductance and Congestion in Power Law Graphs - Gkantsidis, Mihail et al. - 2003
7 and Correlation Functions (context) - Forster, Broken - 1994
6 Faster Network Simulation with Scenario Pre-Filtering (context) - Dutta, Goel et al. - 2002
5 Eigenvalues of Random Power Law Graphs (context) - Chung, Lu et al. - 2003
5 Fluid Models and Solutions for Large-Scale IP Networks - Liu, Presti et al. - 2003
3 Scaling Properties of Internet Graphs - Akella, Chawla et al. - 2003
3 Routing Using Potentials: A Dynamic Traffic-Aware Routing Al.. (context) - Basu, Lin et al. - 2003
1 Measuring Performance of Adhoc Networks Using Timescales for.. (context) - D'Souza, Ramanathan et al. - 2003
http://www.isi.edu/nsnam/ns/
http://www.cs.washington.edu/research/networking/rocketfuel/
Documents on the same site (http://cm.bell-labs.com/cm/cs/papers.html): More
Local Control over Filtered WWW Access - Baker, Grosse (1995) (Correct)
Parameterized Pattern Matching by Boyer-Moore-type Algorithms - Baker (1995) (Correct)
Determining Subspace Information from the Hessian of a Barrier.. - Wright (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC