See this document in CiteSeerX!

Static and Dynamic Evaluation of QoS Properties (2000)  (Make Corrections)  
Gopal Pandurangan, Eli Upfal



  Home/Search   Context   Related

 
View or download:
brown.edu/people/gopal/subfinal.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brown.edu/people/gopal/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Efficient utilization of modern high bandwidth communication networks relies on statistical multiplexing of many logical channels through one physical channel. Communication requests typically include some statistical characterization of the requested connection (such as pick value, mean values, etc)... (Update)

Similar documents (at the sentence level):
28.3%:   Static and Dynamic Evaluation of QoS Properties - Pandurangan, Upfal   (Correct)

Active bibliography (related documents):   More   All
0.2:   Large Scale Inference and Tomography for Network.. - Coates, Hero, Nowak, Yu (2001)   (Correct)
0.2:   Internet Tomography - Coates, Hero, Nowak, Yu (2002)   (Correct)
0.1:   Limit Theorems and Estimation for Structural and Aggregate.. - Rolls (2003)   (Correct)

Similar documents based on text:   More   All
0.2:   Can Entropy Characterize Performance of Online Algorithms? - Pandurangan, Upfal (2001)   (Correct)
0.2:   Computing Near Optimal Strategies for Stochastic.. - Hauskrecht.. (1999)   (Correct)
0.2:   Building P2P networks with good topological properties - Pandurangan, Raghavan, Upfal (2002)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ pandurangan99static,
    author = "Gopal Pandurangan and Eli Upfal",
    title = "Static and dynamic evaluation of {QoS} properties",
    pages = "566--573",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/pandurangan00static.html" }
Citations (may not include all citations):
283   Stochastic Theory of a Data Handling System with Multiple So.. (context) - Anick, Mitra et al. - 1982
163   The Complexity of Enumeration and Reliability Problems (context) - Valiant - 1979
158   Resource Allocation for Broadband Networks (context) - Hui - 1988
68   Monte-Carlo Approximation Algorithms for Enumeration Problem.. (context) - Karp, Luby et al. - 1989
60   Routing in Communications Networks (context) - Steenstrup - 1995
24   On Routing in ATM Networks - Gupta, Ross et al.
23   Proof of a Fundamental Result in SelfSimilar Trac Modeling (context) - Taqqu, Willinger et al. - 1997
17   ective Bandwidth of General Markovian Trac Sources and Admis.. (context) - Elwalid, Mitra - 1993
12   Allocating Bandwidth for Bursty Connections - Kleinberg, Rabani et al. - 1997
4   Royal Statistical Society Lecture Notes Series (context) - Kelly, on et al. - 1996
2   Ecient Estimation of Cell Blocking Probability for ATM Syste.. (context) - Wang, Frost - 1993
1   Modeling Communication Networks (context) - Kelly - 1995

Documents on the same site (http://www.cs.brown.edu/people/gopal/):   More
Building Low-Diameter P2P Networks - Pandurangan, Raghavan, Upfal (2001)   (Correct)
Building P2P networks with good topological properties - Pandurangan, Raghavan, Upfal (2002)   (Correct)
Can Entropy Characterize Performance of Online Algorithms? - Pandurangan, Upfal (2001)   (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