Lexicographic products in metarouting

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2007, Pages 113-122

  Gurney, Alexander J T ^a   Griffin, Timothy G ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEM (AS); GLOBAL OPTIMALITY; INTERNATIONAL CONFERENCES; METRICS (CO); OPTIMAL PATHS; ROUTE METRICS; ROUTE SELECTION;

INTERNET; NETWORK PROTOCOLS; NETWORK ROUTING;

ROUTING PROTOCOLS;

EID: 48349105873     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2007.4375842     Document Type: Conference Paper

References (25)

1. G. Birkhoff. Lattice Theory, 3rd edition. Amer. Math. Soc., 1967.
2. M.-O. Buob, M. Meulle, and J.-L. Lutton. Un modèle de graphe et de dioïde pour le routage interdomaine. In Colloque Francophone sur l'Ingénierie des Protocoles (CFIP), 2006.
3. B. Carré. Graphs and Networks. Oxford University Press, 1979.
4. Cisco Systems. Enhanced Interior Gateway Routing Protocol, 2005. Technology White Paper: document ID 16406.
5. A. H. Clifford and G. B. Preston. The algebraic theory of semigroups, volume 1. American Mathematical Society, Providence, RI, 1961.
6. A. M. Colman and J. A. Stirk. Singleton bias and lexicographic preferences among equally valued alternatives. Journal of Economic Behaviour and Organization, 40:337-351, 1999.
7. G. Debreu. Representation of a preference ordering by a numerical function. In R. M. Thrall, C. H. Coombs, and R. L. Davis, editors, Decision Processes. Wiley, 1954.
8. P. C. Fishburn. Lexicographic orders, utilities and decision rules: a survey. Management Science, 20(11):1442-1471, July 1974. Theory Series.
9. L. Fuchs. Partially Ordered Algebraic Systems. Addison-Wesley, 1963.
10. M. Gondran and M. Minoux. Graphs and Algorithms. Wiley, 1984.
11. M. Gondran and M. Minoux. Graphes, dioïdes et semi-anneaux: Nouveaux modéles et algorithmes. Tec & Doc, 2001.
12. M. G. Gouda and M. Schneider. Maximizable routing metrics. IEEE/ACM Transactions on Networking, 11(4):663-675, August 2003.
13. T. G. Griffin and A. Gurney. The quadrants model of algebraic routing. Under review, 2007.
14. T. G. Griffin and J. L. Sobrinho. Metarouting. In Proc. ACM SIGCOMM, August 2005.
15. R. E. Johnson. Free products of ordered semigroups. Proceedings of the American Mathematical Society, 19(3):697-700, 1968.
16. K.Varadhan, R.Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32:1-16, 2000.
17. T. Lengauer and D. Theune. Efficient algorithms for path problems with general cost criteria. Lecture Notes in Computer Science, 510:314-326, 1991.
18. T. Lengauer and D. Theune. Unstructured path problems and the making of semirings. Lecture Notes in Computer Science, 519:189-200, 1991.
19. Y. Rekhter and T. Li. A Border Gateway Protocol. RFC 1771 (BGP version 4), March 1995.
20. T. Saitô. Note on the lexicographic product of ordered semigroups. Proceedings of the Japan Academy, 46(5):413-416, 1970.
21. J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop. IEEE/ACM Transactions on Networking, 10(4):541-550, August 2002.
22. J. L. Sobrinho. Network routing with path vector protocols: Theory and applications. In Proc. ACM SIGCOMM, September 2003.
23. J. L. Sobrinho. An algebraic theory of dynamic network routing. IEEE/ACM Transactions on Networking, 13(5):1160-1173, October 2005.
24. M. B. Szendrei. On the structure of orthodox semigroups. Journal of Algebra, 56(1):71-90, 1979.
25. A. Wongseelashote. Semirings and path spaces. Discrete Mathematics, 26(1):55-78, 1979.