| | Sigcomm 2006 Form >> Policy-based Routing with Non-strict Preferences (Site not responding. Last check: ) |
 | | Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. |
 | | In the presence of ambiguous preferences at pairs, or even multiple collections of paths, a challenge is to ensure robustness in the complex and sophisticated situations of policy-based routing where heterogeneous routing policies are allowed among routing systems. |
 | | This paper presents an extensive study of policy-based routing with non-strict preferences, deriving suffient conditions that ensure the existence, optimality and asynchronous convergence of stable routings. |
| sigcomm06.stanford.edu /discussion/showpaper.php?paper_id=35&PHPSESSID=77eb9856be2ee44069e7be61fd308d15 (333 words) |