University of Cambridge > > Cambridge Networks and Communications meeting > Lexicographic choice and the design of routing protocols

Lexicographic choice and the design of routing protocols

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact James Cruise.

Session 2, Cambridge Networks and Communication Meeting

Computation of best routes for Internet traffic involves the use of several different routing metrics, combined lexicographically into a single preference order. We will see what algebraic properties are required from the components to ensure that the computed routes are indeed optimal (for various definitions of optimality). It will also be shown that lexicographic choice is essential in the context of a network of networks such as the Internet. Several examples of possible interdomain routing metrics will be presented, and we will find out which work and which fail.

This talk is part of the Cambridge Networks and Communications meeting series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity