University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Network-Design Sensitivity Analysis

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Network-Design Sensitivity Analysis

Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki .

Traffic matrices are used in many network engineering tasks, for instance optimal network design. Unfortunately, mea- surements of these matrices are error-prone, a problem that is exacerbated when they are extrapolated to provide the predictions used in planning. Practical network design and management should consider sensitivity to such errors, but although robust optimisation techniques exist, it seems they are rarely used, at least in part because of the difficulty in generating an ensemble of admissible traffic matrices with a controllable error level. We present a fast and flexible technique of generating synthetic traffic matrices. We demonstrate the utility of the method by presenting a methodology for robust network de- sign based on adaptation of the mean-risk analysis concept from finance

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, TBC DAMTP ML for Science Reading Group

Other talks

Necessary mechanisms for super AI and stopping hallucinations: The consistent reasoning paradox and the indeterminacy function The search for a new population of strong gravitational lenses with JWST Feedback and the circumgalactic medium Title to be confirmed Title to be confirmed Polar Oceans Seminar Talk
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity