(Enter summary)
Abstract: Routing optimization is used to find a set of routes
that minimizes cost (delay, utilization). Previous work has addressed
this problem for the case of a known, static end-to-end
traffic matrix. In the Internet, it is difficult to accurately estimate
a traffic matrix, and the constantly changing nature of Internet
traffic makes it costly to maintain optimal routing by responding
to traffic changes. Thus, it is of interest to maintain a set of
routes that are "good" for a number of different... (Update)
Cited by: More
On Optimal Routing with Multiple Traffic Matrices - Chun Zhang Yong (2004)
(Correct)
Active bibliography (related documents): More All
0.3: Decomposition of Large IP Networks for Routing.. - Milbrandt, Köhler.. (2002)
(Correct)
0.2: Hypercube Embeddings and Designs - Laurent, Deza (1994)
(Correct)
0.2: Quaternary Quadratic Residue Codes and Unimodular Lattices - Bonnecaze, Calderbank, Sole (1995)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
Chun Zhang, Yong Liu, Weibo Gong, Jim Kurose, Robbert Moll, and Don Towsley, "On optimal routing with multiple traffic matrices," in CMPSCI Tech Report 04-60, UMASS, 2004. http://citeseer.ist.psu.edu/article/zhang04optimal.html More
@misc{ zhang04optimal,
author = "C. Zhang and Y. Liu and W. Gong and J. Kurose and R. Moll and D. Towsley",
title = "On optimal routing with multiple traffic matrices",
text = "Chun Zhang, Yong Liu, Weibo Gong, Jim Kurose, Robbert Moll, and Don Towsley,
On optimal routing with multiple traffic matrices, in CMPSCI Tech Report
04-60, UMASS, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/zhang04optimal.html" }
Citations (may not include all citations):
344
How to model an internetwork
- Zegura, Calvert et al. - 1996
134
Statistical Inference (context) - Casella, Berger - 2002
107
Modeling internet topology
- Calvert, Doar et al. - 1997
101
Internet traffic engineering by optimizing OSPF weights
- Fortz, Thorup - 2000
55
A minimum delay routing algorithm using distributed computat.. (context) - Gallager - 1977
30
Optimizing OSPF/IS-IS weights in a changing world (context) - Fortz, Thorup - 2002
30
Internet traffic engineering without full mesh overlaying (context) - Wang, Wang et al. - 2001
26
GT-ITM: Georgia tech internetwork topology models (software (context) - Zegura
17
Achieving nearoptimal traffic engineering solutions for curr..
- Sridharan, Guerin et al. - 2003
16
Making intra-domain routing robust to changing and uncertain.. (context) - Applegate, Cohen - 2003
13
Optimal routing in a packet-switched computer network (context) - Cantor, Gerla - 1974
8
A recursive random search algorithm for large-scale network .. (context) - Ye, Kalyanaraman - 2003
6
Traffic engineering with estimated traffic matrices
- Roughan, Thorup et al. - 2003
5
Combinatorial Theory (context) - Hall - 1986
3
OSPF version 2 (RFC 2328 (context) - Moy - 1998
2
Requirements for traffic engineering over MPLS (RFC 2702 (context) - Awduche, Malcolm et al. - 1999
1
On optimal routing with multiple traffic matrices
- Zhang, Liu et al. - 2004
http://www.ilog.com
Documents on the same site (http://www-unix.ecs.umass.edu/~gong/): More
Analysis of An AIMD Based Collision Avoidance Protocol in.. - Cai, Liu, Gong
(Correct)
On Fluid Queueing Systems with Strict Priority - Yong Liu Member (2001)
(Correct)
Worm Propagation Modeling and Analysis under Dynamic.. - Zou, Gong, Towsley (2003)
(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