PRUNED FORWARDING SET FOR SCALABLE TUNNELING APPLICATIONS IN DISTRIBUTED USER PLANE

• US 20120224477A1
• Filed: 03/02/2011
• Published: 09/06/2012
• Est. Priority Date: 03/02/2011
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Balasubramanian, Chandramouli, Jonnalagadda, V.S. Jagannadham (Jack), Kean, Brian, Yu, Xianghai, Tóth, Zoltán
• Application Number:
  US13/039,220
• Publication Number:
  US 20120224477A1
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/245 Link aggregation, e.g. trunking

Abstract

A method and system for reducing congestion and latency in a communication system by creating a pruned forwarding set for scalable tunneling applications. The communication system provides a communication link between a mobile communication device and a network, such as the Internet. The method entails using information included within a data packet to determine a corresponding tunnel peer address, which is then resolved onto a set of paths. Each path includes respective adjacency information. A determination of whether to prune each respective path is made by using the respective adjacency information. The pruned set of paths is used to identify available paths for the communication link. By pruning in this manner, the line card being used as the home slot for a given session may also be used as the egress slot, thereby reducing congestion and latency in the communication system.

Claims

1. A method for reducing congestion and latency in a communication system configured to provide a communication link between a communication device and a network, the method comprising:

receiving a packet, the packet including identification information relating to a communication session in which the communication device is participating;

using the identification information to determine a corresponding tunnel peer address;

resolving the determined tunnel peer address onto a set of paths, each path including respective adjacency information;

determining whether to prune each respective path from the set of paths by using the respective adjacency information ;

based on the pruning determinations, reducing a number of potential paths by pruning the set of paths; and

using the pruned set of paths to identify available paths for the communication link.

2. The method of claim 1, wherein the resolving further includes creating a set of next hops corresponding to each respective path.

3. The method of claim 1, wherein the using the respective adjacency information further includes determining an association with each potential physical port corresponding to the respective path and calculating an adjacency value based on the determined association.

4. The method of claim 1, wherein the determination whether to prune the respective path is based on whether the adjacency information indicates that a next hop is on the same line card or on a different line card.

5. The method of claim 1, further comprising:

storing the unpruned set of paths in a database;

generating and updating a set of card-specific pruned sets of paths from the unpruned set of paths; and

storing each respective card-specific pruned set of paths on the respective line card.

6. The method of claim 1, wherein the network is the Internet.

7. The method of claim 1, wherein the communication device uses tunnels to participate in communication sessions.

8. A gateway node for reducing congestion and latency in a communication system, the system including a communication device and a network, the communication device in communication with the network via the gateway node, and the gateway node comprising:

a backplane;

a controller card installed in a slot and coupled to the backplane, the controller card including a processor; and

a plurality of data cards, each installed in a respective slot and coupled to the backplane such that at least one packet can be transmitted within the node from a first card to a second card via the backplane, each of the data cards including at least one port for transmitting and receiving at least one packet and a database for storing path information;

wherein, by using predetermined position information relating to a current location of the communication device and identification information relating to an active communication session in which the communication device is participating, the processor is configured to;

use the position information to determine a corresponding data card that serves the active communication session;

use the identification information to determine a corresponding tunnel peer address;

resolve the determined tunnel peer address onto a set of paths, each path including respective adjacency information;

determine whether to prune each respective path from the set of paths by using the respective adjacency information;

based on the pruning determinations, reduce a number of potential paths by pruning the set of paths; and

use the pruned set of paths to identify available paths for a communication link between the communication device and the network via the gateway node.

9. The gateway node of claim 8, wherein the processor is further configured to resolve the determined tunnel peer address by creating a set of next hops corresponding to each respective path.

10. The gateway node of claim 8, wherein the processor is further configured to use the respective adjacency information to determine an association with each potential physical port corresponding to the respective path and to calculate an adjacency value based on the determined association.

11. The gateway node of claim 8, wherein the determination whether to prune the respective path is based on whether the adjacency information indicates that a next hop is on the same data card or on a different data card.

12. The gateway node of claim 8, wherein the processor is further configured to:

store the unpruned set of paths in a database;

generate and update a set of card-specific pruned sets of paths from the unpruned set of paths; and

store each respective card-specific pruned set of paths in the database corresponding to the respective data card.

13. The gateway node of claim 8, wherein the network is the Internet.

14. The gateway node of claim 8, wherein the communication device uses tunnels to participate in communication sessions.

15. A computer program product for reducing congestion and latency in a communication system configured to provide a communication link between a communication device and a network, the computer program product comprising a non-transitory computer readable medium storing computer readable program code, the computer readable program code including instructions for causing a computer to:

use identification information relating to a communication session in which the communication device is participating and contained in the received packet to determine a corresponding tunnel peer address;

resolve the determined tunnel peer address onto a set of paths, each path including respective adjacency information;

determine whether to prune each respective path from the set of paths by using the respective adjacency information;

based on the pruning determinations, reduce a number of potential paths by pruning the set of paths; and

use the pruned set of paths to identify available paths for the communication link.

16. The computer program product of claim 15, wherein the instructions for causing a computer to resolve the determined tunnel peer address further include instructions for causing a computer to create a set of next hops corresponding to each respective path.

17. The computer program product of claim 15, wherein the instructions for causing a computer to use the respective adjacency information further include instructions for causing a computer to determine an association with each potential physical port corresponding to the respective path and to calculate an adjacency value based on the determined association.

18. The computer program product of claim 15, wherein the determination whether to prune the respective path is based on whether the adjacency information indicates that a next hop is on the same line card or on a different line card.

19. The computer program product of claim 15, wherein the computer readable program code further includes instructions for causing a computer to:

store the unpruned set of paths in a database;

generate and update a set of card-specific pruned sets of paths from the unpruned set of paths; and

store each respective card-specific pruned set of paths on the respective line card.

20. The computer program product of claim 15, wherein the network is the Internet.

21. The computer program product of claim 15, wherein the communication device uses tunnels to participate in communication sessions.