Lexicographic products in metarouting
Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the most important attribute of each route is considered first, and if this does not give enough information to decide which route is better, the next attribute is considered; and so on. We investigate protocols that find globally optimal paths and protocols that find only locally optimal paths. In each case we characterize exactly when lexicographic products can be used to define well- behaved routing protocols. We apply our results to protocols that can partition a network into distinct administrative regions, such us OSPF areas and BGP autonomous systems. We show that in some cases this type of local autonomy is fully compatible with global optimality.
Alexander J. T. Gurney Timothy G. Griffin
Computer Laboratory University of Cambridge
国际会议
The 15th IEEE International Conference on Network Protocols(ICNP 2007)(第15届IEEE国际网络协议大会)
北京
英文
113-122
2007-10-16（万方平台首次上网日期，不代表论文的发表时间）