Policy-based routing with non-strict preferences

Computer Communication Review

Volumn 36, Issue 4, 2006, Pages 387-398

  Chau, Chi Kin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Policy based routing; Robustness

Indexed keywords

MULTIPATH ROUTING; NON STRICT PREFERENCES; POLICY BASED ROUTING; TRAFFIC ENGINEERING;

MULTICASTING; PROBLEM SOLVING; QUALITY OF SERVICE; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

ROUTERS;

EID: 33750308940     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1151659.1159957     Document Type: Conference Paper

References (10)

1. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1989.
2. B. Carré. Graphs and Networks. Oxford University Press, 1979.
3. C. Chau. Policy-based routing with non-strict preferences. Technical report, Computer Laboratory, University of Cambridge, 2006.
4. C. Chau, R. Gibbens, and T. Griffin. Towards a unifying theory for policy-based routing. In Proc. IEEE INFOCOM, April 2006.
5. T. Griffin, F. B. Shepherd, and G. Wilfong. Policy disputes in path-vector protocols. In Proc. Inter. Conf. on Network Protocols, November 1999.
6. T. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 10(2):232-243, April 2002.
7. T. Griffin and J. Sobrinho. Metarouting. In Proc. ACM SIGCOMM, September 2005.
8. M. Mohri. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics, 7(3):321-350, 2002.
9. J. Sobrinho. An algebraic theory of dynamic network routing. IEEE/ACM Transactions on Net-working, 13(5):1160-1173, October 2005.
10. A. Uresin and M. Dubois. Parallel asynchronous algorithms for discrete data. Journal of the ACM, 37(3):588-606, 1990.