An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
ATM, volume 1 (2nd ed.): foundation for broadband networks
ATM, volume 1 (2nd ed.): foundation for broadband networks
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
ACM Transactions on Computer Systems (TOCS)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts
Proceedings of the 8th annual international conference on Mobile computing and networking
Introduction to Algorithms
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Network topology generators: degree-based vs. structural
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
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
How good can IP routing be?
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Decoupling policy from mechanism in Internet routing
ACM SIGCOMM Computer Communication Review
A system for authenticated policy-compliant routing
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A virtualized link layer with support for indirection
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Secure and policy-compliant source routing
IEEE/ACM Transactions on Networking (TON)
LIPSIN: line speed publish/subscribe inter-networking
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Explicit routing in multicast overlay networks
Computer Communications
On the safety and security of path splicing: a case study for path splicing on the GÉANT network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of path splicing on the GÉANT and the Sprint networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
A backup tree algorithm for multicast overlay networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Data protection based on physical separation: concepts and application scenarios
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Revisiting flow-based load balancing: Stateless path selection in data center networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
BGP-XM: BGP eXtended Multipath for transit Autonomous Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
Today the Internet offers a single path between end-systems even though it intrinsically has a large multiplicity of paths. This paper proposes an evolutionary architectural framework "BANANAS" aimed at simplifying the introduction of multipath routing in the Internet. The framework starts with the observation that a path can be encoded as a short hash ("PathID") of a sequence of globally known identifiers. The PathID therefore has global significance (unlike MPLS or ATM labels). This property allows multipath capable nodes to autonomously compute PathIDs in a partially upgraded network without requiring an explicit signaling protocol for path setup. We show that this framework allows the introduction of sophisticated explicit routing and multipath capabilities within the context of widely deployed connectionless routing protocols (e.g. OSPF, IS-IS, BGP) or overlay networks. We establish these characteristics through the development of PathID encoding and route-computation schemes. The BANANAS framework also allows considerable flexibility in terms of architectural function placement and complexity management. To illustrate this feature, we develop an efficient variable-length hashing scheme that moves control-plane complexity and state over-heads to network edges, allowing a very simple interior node design. All the schemes have been evaluated using both sizable SSFNet simulations and Linux/Zebra implementation evaluated on Utah's Emulab testbed facility.