SLICED TUNNELS IN A COMPUTER NETWORK

摘要

In one embodiment, a path for a sliced tunnel that extends from a head-end node to a tail-end node is computed. The sliced tunnel is furcated into a plurality of child tunnels at one or more fork nodes located downstream from the head-end node. Each child tunnel carries a portion of traffic for the sliced tunnel. The sliced tunnel is merged at one or more merge nodes located downstream from respective ones of the fork nodes. The portions of traffic on the child tunnels are aggregated at the merge nodes. The head-end node sends a signaling message to establish the sliced tunnel along the computed path. The signaling message includes an indication of the one or more fork nodes where the io sliced tunnel is furcated into child tunnels and the one or more merge nodes where child tunnels are merged. The head-end node then forwards traffic onto the sliced tunnel.