A multi-path routing algorithm for IP networks based on flow optimisation

Authors:
Henrik Abrahamsson;Bengt Ahlgren;Juan Alonso;Anders Andersson;Per Kreuger
Affiliations:
Swedish Institute of Computer Science;Swedish Institute of Computer Science;Swedish Institute of Computer Science;Swedish Institute of Computer Science;Swedish Institute of Computer Science
Venue:
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
Year:
2002

Citing 3
Cited 5

Deriving traffic demands for operational IP networks: methodology and experience

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Pop-level and access-link-level traffic dynamics in a tier-1 POP

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Traffic matrix estimation on a large IP backbone: a comparison on real data

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)
Interface split routing for finer-grained traffic engineering

Performance Evaluation
Towards ambient networks management

MATA'05 Proceedings of the Second international conference on Mobility Aware Technologies and Applications
Performance of traffic engineering in operational IP networks – an experimental study

IPOM'05 Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based Networks

Quantified Score

Hi-index	0.02

Visualization

Abstract

Intra-domain routing in the Internet normally uses a single shortest path to forward packets towards a specific destination with no knowledge of traffic demand. We present an intra-domain routing algorithm based on multi-commodity flow optimisation which enable load sensitive forwarding over multiple paths. It is neither constrained by weight-tuning of legacy routing protocols, such as OSPF, nor requires a totally new forwarding mechanism, such as MPLS. These characteristics are accomplished by aggregating the traffic flows destined for the same egress into one commodity in the optimisation and using a hash based forwarding mechanism. The aggregation also results in a reduction of computational complexity which makes the algorithm feasible for on-line load balancing. Another contribution is the optimisation objective function which allows precise tuning of the tradeoff between load balancing and total network efficiency.