In other words, the shuffling process of FIG. 32 is an example of how the shuffling steps 710, 740 (FIG. 30) may be performed. [0394] As illustrated in FIG. 32, based on the new flow's inputted (800) resource requirement and destination PE node identification, the algorithm will first search (805) the session table 225 (FIG. 28) to check if there exists at least one parallel link (data tunnel) to