Compact policy routing

This paper takes a first step towards generalizing compact routing to arbitrary routing policies that favor a broader set of path attributes beyond path length. Using the formalism of routing algebras we identify the algebraic requirements for a routing policy to be realizable with sublinear size routing tables and we show that a wealth of practical policies can be classified by our results. By generalizing the notion of stretch, we also discover the algebraic validity of compact routing schemes considered so far and we show that there are routing policies for which one cannot expect sublinear scaling even if permitting arbitrary constant stretch.

[1]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[2]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

[3]  Stéphane Pérennes,et al.  Memory requirement for routing in distributed networks , 1996, PODC '96.

[4]  Alexander J. T. Gurney,et al.  Lexicographic products in metarouting , 2007, 2007 IEEE International Conference on Network Protocols.

[5]  Cyril Gavoille,et al.  Routing in distributed networks: overview and open problems , 2001, SIGA.

[6]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[7]  Michel Minoux,et al.  Graphs, dioids and semirings : new models and algorithms , 2008 .

[8]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[9]  Baruch Awerbuch,et al.  Topology aggregation for directed graphs , 2001, TNET.

[10]  Gordon T. Wilfong,et al.  Policy disputes in path-vector protocols , 1999, Proceedings. Seventh International Conference on Network Protocols.

[11]  Satish K. Tripathi,et al.  Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis , 1999, IEEE Netw..

[12]  Lixin Gao,et al.  On inferring and characterizing Internet routing policies , 2003, Journal of Communications and Networks.

[13]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[14]  Pierre Fraigniaud,et al.  Local memory requirement of universal routing schemes , 1996, SPAA '96.

[15]  Xiaowei Yang,et al.  Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.

[16]  G. Huston,et al.  Interconnection, Peering and Settlements , 2003 .

[17]  Richard J. Gibbens,et al.  Towards a Unified Theory of Policy-Based Routing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Pierre Fraigniaud,et al.  Routing in Trees , 2001, ICALP.

[19]  A. Clifford,et al.  The Algebraic Theory of Semigroups, Volume I , 1961 .

[20]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[21]  João L. Sobrinho,et al.  Network routing with path vector protocols: theory and applications , 2003, SIGCOMM '03.

[22]  Greg N. Frederickson,et al.  Designing networks with compact routing tables , 1988, Algorithmica.

[23]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[24]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[25]  Michael Walfish,et al.  A Policy Framework for the Future Internet , 2009, HotNets.

[26]  Lenore Cowen,et al.  Compact routing with minimum stretch , 1999, SODA '99.

[27]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[28]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[29]  Arthur Brady,et al.  On compact routing for the internet , 2007, CCRV.

[30]  João L. Sobrinho.  Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.

[31]  Pierre Fraigniaud,et al.  Memory requirement for universal routing schemes , 1995, PODC '95.