Data networks (2nd ed.)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Routing in the Internet (2nd ed.)
Routing in the Internet (2nd ed.)
RIP: an intra-domain routing protocol
RIP: an intra-domain routing protocol
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
BGP scaling techniques revisited
ACM SIGCOMM Computer Communication Review
A comparison of scaling techniques for BGP
ACM SIGCOMM Computer Communication Review
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Route oscillations in I-BGP with route reflection
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the MED Oscillation Problem in BGP
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE/ACM Transactions on Networking (TON)
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Path preserving scale down for validation of internet inter-domain routing protocols
Proceedings of the 38th conference on Winter simulation
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Towards a formalism for routing in challenged networks
Proceedings of the second ACM workshop on Challenged networks
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Can Forwarding Loops Appear When Activating iBGP Multipath Load Sharing?
AINTEC '07 Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
A model of configuration languages for routing protocols
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
A Model of Internet Routing Using Semi-modules
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Scalable multi-region routing at inter-domain level
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
A formal study of trust-based routing in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cross-layer design for multihop wireless relaying networks
IEEE Transactions on Wireless Communications
Safe interdomain routing under diverse commercial agreements
IEEE/ACM Transactions on Networking (TON)
FSR: formal analysis and implementation toolkit for safe inter-domain routing
Proceedings of the ACM SIGCOMM 2011 conference
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
Address-based route reflection
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
On the interaction of multiple routing algorithms
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
SIAM Journal on Computing
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
A multi-level approach to link state: ML-OLSR
Proceedings of the 10th ACM international symposium on Mobility management and wireless access
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We develop a non-classic algebraic theory for the purpose of investigating the convergence properties of dynamic routing protocols. The algebraic theory can be regarded as a generalization of shortest-path routing, where the new concept of free cycle generalizes that of a positive-length cycle. A primary result then states that routing protocols always converge, though not necessarily onto optimal paths, in networks where all cycles are free. Monotonicity and isotonicity are two algebraic properties that strengthen convergence results. Monotonicity implies protocol convergence in every network, and isotonicity assures convergence onto optimal paths.A great many applications arise as particular instances of the algebraic theory. In intra-domain routing, we show that routing protocols can be made to converge to shortest and widest paths, for example, but that the composite metric of Internet Gateway Routing Protocol (IGRP) does not lead to optimal paths. The more interesting applications, however, relate to inter-domain routing and its Border Gateway Protocol (BGP), where the algebraic framework provides a mathematical template for the specification, design, and verification of routing policies. We formulate existing guidelines for inter-domain routing in algebraic terms, propose new guidelines contemplating backup relationships between domains, and derive a sufficient condition for signaling correctness of internal-BGP.