Scheme for alternative packet overflow routing (SAPOR)

Shortest path routing schemes, like open shortest path first (OSPF), have shortcomings when networks are highly loaded. Traffic engineering of IP networks is required to avoid this problem. Current efforts suggest the optimisation of OSPF weights to balance the network load more evenly. Also, more advanced technologies, like multiprotocol label switching (MPLS), are proposed. One major problem of dynamic routing efforts that use OSPF is the fact that many traffic flows are influenced by single weight changes. We introduce SAPOR (scheme for alternative packet overflow routing), which realises a methodology that can remember the routing of packets for the duration of a micro flow. This allows the rerouting of overflow traffic. In this case, well known concepts and methodologies from conventional circuit switched teletraffic engineering can be adapted for IP networks.

[1]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[2]  J. Murphy,et al.  Traffic Engineering Using OSPF Weights and Splitting Ratios , 2002, INTERWORKING.

[3]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[4]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[5]  Y. Ebihara.  Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[7]  Erwin P. Rathgeb.  Modeling and Performance Comparison of Policing Mechanisms for ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[8]  J. Regnier,et al.  Dynamically controlled routing in networks with non-DCR-compliant switches , 1995 .

[9]  Peter Key,et al.  Dynamic Alternative Routing - Modelling and Behaviour , 1988 .

[10]  Biplab Sikdar,et al.  Traffic management and network control using collaborative on-line simulation , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  David Thaler,et al.  Using name-based mappings to increase hit rates , 1998, TNET.

[12]  A. Inoue,et al.  State- and time-dependent routing in the NTT network , 1995 .

[13]  Ellen W. Zegura,et al.  Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Ying-Dar Lin,et al.  QoS routing granularity in MPLS networks , 2002, IEEE Commun. Mag..

[15]  J. Harmatos.  A heuristic algorithm for solving the static weight optimisation problem in OSPF networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).