Making intra-domain routing robust to changing and uncertain traffic demands
Authors:
Top Cited Papers
Open Access
- 25 August 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 313-324
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimal oblivious routing in polynomial time2003
- Internet traffic engineering by optimizing OSPF weights2002
- Measuring ISP topologies with rocketfuel2002
- Optimizing OSPF/IS-IS weights in a changing worldIEEE Journal on Selected Areas in Communications, 2002
- Inferring link weights using end-to-end measurements2002
- Experience in measuring backbone traffic variability2002
- Trajectory sampling for direct traffic observationIEEE/ACM Transactions on Networking, 2001
- Deriving traffic demands for operational IP networks: methodology and experienceIEEE/ACM Transactions on Networking, 2001
- Time-Varying Network Tomography: Router Link DataJournal of the American Statistical Association, 2000
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984