An Axiomatic Approach to Routing

Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner. The delivery of information in such multi-agent systems is typically implemented through routing protocols that determine how information flows through the network. Different routing protocols exist each with its own benefits, but it is generally unclear which properties can be successfully combined within a given algorithm. We approach this problem from the axiomatic point of view, i.e., we try to establish what are the properties we would seek to see in such a system, and examine the different properties which uniquely define common routing algorithms used today. We examine several desirable properties, such as robustness, which ensures adding nodes and edges does not change the routing in a radical, unpredictable ways; and properties that depend on the operating environment, such as an "economic model", where nodes choose their paths based on the cost they are charged to pass information to the next node. We proceed to fully characterize minimal spanning tree, shortest path, and weakest link routing algorithms, showing a tight set of axioms for each.

[1]  Edmund H. Durfee,et al.  Coherent Cooperation Among Communicating Problem Solvers , 1987, IEEE Transactions on Computers.

[2]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

[3]  Adam Tauman Kalai,et al.  Trust-based recommendation systems: an axiomatic approach , 2008, WWW.

[4]  Jason Liu,et al.  Experimental Evaluation of Wireless Simulation Assumptions , 2004, MSWiM '04.

[5]  Moshe Tennenholtz,et al.  Mechanisms for multi-level marketing , 2011, EC '11.

[6]  Ramesh Govindan,et al.  Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications , 2005, SIGCOMM 2005.

[7]  Organizations , 1992, Restoration & Management Notes.

[8]  Jay R. Galbraith Designing Complex Organizations , 1973 .

[9]  Sunil Arya,et al.  Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.

[10]  Lixin Gao,et al.  Stable Internet routing without global coordination , 2000, SIGMETRICS '00.

[11]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.

[12]  Mark S. Fox,et al.  An Organizational View of Distributed Systems , 1988, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Michael Schapira,et al.  Interdomain routing and games , 2008, SIAM J. Comput..

[14]  Zhu Han,et al.  Information theoretic framework of trust modeling and evaluation for ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

[15]  M. Karsten,et al.  An axiomatic basis for communication , 2007, SIGCOMM '07.

[16]  Judea Pearl,et al.  Causal networks: semantics and expressiveness , 2013, UAI.

[17]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[18]  Moshe Tennenholtz,et al.  An axiomatic approach to personalized ranking systems , 2007, JACM.