New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
IEEE/ACM Transactions on Networking (TON)
A multi-path routing algorithm for IP networks based on flow optimisation
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Legacy IP routing restricts the efficacy of traffic engineering solutions. This restriction stems from the constraint that traffic at a node must be uniformly split across all next-hop nodes corresponding to equal cost shortest path to a destination. Proposals that alleviate this constraint either completely overhaul legacy IP routing, or introduce complex control and/or forwarding plane components. This additional complexity departs from the elegant simplicity of legacy routing protocols where statically optimized link weights embed all traffic engineering semantics. We present Interface Split Routing (ISR), which retains the basic forwarding and control mechanism of legacy IP routing. Furthermore, a set of link weights embed all traffic engineering semantics in ISR. However, ISR makes possible finer-grained traffic engineering by configuring independent sets of next-hops to a destination at each incoming interface. This lends itself well to modern router architectures where each incoming interface has its own forwarding table. Consequently, at the aggregated node level, traffic to a particular destination may be non-uniformly distributed across next-hop nodes. Hence, ISR allows additional flexibility in routing traffic as compared to default IP routing while retaining its simplicity. We conduct simulation studies on representative ISP topologies to compare ISR with traditional link-weight-optimized routing. ISR reduces the difference between optimal routing and weight-optimized routing by 50%.