Next hop computation functions for equal cost multi-path packet switching networks

Abstract

Next hop computation functions for use in a per-node ECMP path determination algorithm are provided, which increase traffic spreading between network resources in an equal cost multi-path packet switch network. In one embodiment, packets are mapped to output ports by causing each ECMP node on the network to implement an entropy preserving mapping function keyed with unique key material. The unique key material enables each node to instantiate a respective mapping function from a common function prototype such that a given input will map to a different output on different nodes. Where an output set of the mapping function is larger than the number of candidate output ports, a compression function is used to convert the keyed output of the mapping function to the candidate set of ECMP ports

Description

[0001] Cross References to Related Applications [0002] This application claims the benefit of U.S. Provisional Application Serial No. 61 / 443,993, filed February 17, 2011, entitled "Next Hop Computation Function for Equal-Cost Multipath Packet-Switched Networks," the contents of which are hereby incorporated by reference is incorporated in this article. technical field [0003] The present invention relates to packet switched networks, and more particularly to a next hop calculation function for equal cost paths in a packet switched network. Background technique [0004] In Ethernet network architectures, devices connected to the network compete for the ability to use a shared telecommunication path at any given time. Where multiple bridges or nodes are used to interconnect network segments, there are often multiple potential paths to the same destination. The benefit of this architecture is that it provides path redundancy between bridges and permits capacity to be adde...

AI Technical Summary

Problems solved by technology

Unfortunately, if figure 1 As shown in , in some areas of the network, the use of the same next-hop computation function on every node can lead to very poor traffic distribution

In particular, regularity or patterns in flow IDs can cause traffic to become concentrated and result in insufficient traffic spreading between available paths on the network

Images