Flood signaling architecture and process for provisioning communication paths

• US 7,289,450 B2
• Filed: 06/25/2002
• Issued: 10/30/2007
• Est. Priority Date: 06/25/2002
• Status: Expired due to Fees

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Nakata, Tsuneo
• Primary Examiner(s): Jung; Min
• Application Number:
  US10/179,043
• Publication Number:
  US 20030235154A1
• Time in Patent Office: 1,953 Days
• Field of Search: 370/351, 370/390, 370/400, 370/216, 370/217, 370/225, 370/227, 370/228, 370/248, 370/468
• US Class Current: 370/248
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/724 at intermediate nodes, e.g. resource reservation protocol [RSVP]
• CPC Class Codes: H04L 47/728 for backup paths
• CPC Class Codes: H04L 47/741 Holding a request until resources become available
• CPC Class Codes: H04L 47/746 Reaction triggered by a failure
• CPC Class Codes: H04L 47/783 Distributed allocation of resources, e.g. bandwidth brokers
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data

Abstract

A method for establishing a communications path between a source node and destination node. The method includes defining a first group of network elements (NEs) suitable for use in the communications path, contemporaneously determining available resources within each of the NEs of the first group of NEs, and contemporaneously reserving those available resources appropriate to establish the communications path. The reserved resources sufficient to establish the communications path are selected, while those reserved resources not selected are released. In the absence of available resources sufficient to establish the communications path, the method is repeated using a second group of NEs suitable for establishing the communications path.

Claims

1. A method for establisning a communications path between a source network element (NE) and a destination NE, comprising:

(a) defining flooding scope stages including respective groups of NEs for use in establishing said communications path, each flooding scope stage including NEs providing at least one potential path between said source NE and said destination NE, said flooding scope stages comprising a first group of NEs and a second group of NEs having at least one NE not associated with the first group of NEs;

(b) contemporaneously determining available resources within each of the NEs of said first group of NEs;

(c) contemporaneously reserving those available resources appropriate to establish said communications path;

(d) selecting reserved resources sufficient to establish said communications path;

(e) releasing those reserved resources not selected; and

(f) in the absence of available resources sufficient to establish said communications path, repeating steps (b)-(e) using the second group of NEs.

2. The method of claim 1, wherein the second group of NEs comprises at least a portion of the first group of NEs and at least one additional network element not associated with the first group of NEs.

3. The method of claim 1, wherein:

(g) in the absence of available resources sufficient to establish the communications path using the second group of NEs, repeating steps (b)-(e) using a third group of NEs suitable for establishing said communications path.

4. The method of claim 1, wherein said defining step (a) comprises defining the flooding scope stages on-demand, upon receiving a request.

5. The method of claim 1, wherein said defining step (a) comprises defining the flooding scope stages at the time a Path Manager (PM) is instantiated, wherein the PM is instantiated on a first NE in the first group of NEs, wherein the first NE is a source of the communications path.

6. The method of claim 1, wherein said defining step (a) comprises defining the flooding scope stages by listing all the links between any nodes with a distance less than a particular number from both of source and destination.

7. The method of claim 1, wherein said defining step (a) comprises defining the flooding scope stages by using various routing algorithms.

17. The method of claim 1, wherein said reserving step (c) comprises:

returning a booked message from each of ones of the NEs in the first group of NEs on which available resources are determined to a source NE to reserve the available resources of the ones of the NEs as the respective reserved resources.

18. The method of claim 17, wherein said selecting step (d) comprises:

determining whether said reserved resources of the ones of the NEs form said communications path between the source and destination nodes.

19. The method of claim 18, wherein said determining step comprises:

selecting optimal reserved resources among said reserved resources of the ones of the NEs to form said communications path.

20. The method of claim 19, wherein said selecting step (d) further comprises:

sending occupied messages to each of the NEs on which the respective optimal reserved resources are selected to form said communications path.

21. The method of claim 1, wherein said releasing step (e) comprises:

sending release messages to those NEs of the first group of NEs for which associated reserved resources are not selected.

8. The method of step 1, wherein said determining step (b) comprises:

sending request messages from a PM at a source node to resource managers (RM) at each network element within the first group of NEs; and

returning response messages from each said RM to said PM.

9. The method of claim 8, wherein said response message comprises a failure message indicating that a particular resource in said first group of NEs is an unavailable resource for establishing said communications path.

10. The method of claim 9, further comprising:

(g) in the absence of available resources sufficient to establish the communications path from the second group of NEs, repeating steps (b)-(e) using a third group of NEs suitable for establishing said communications path;

wherein, prior to implementing step (g), said method further comprises;

restoring an unavailable resource to an available resource in said first group of NEs.

11. The method of claim 10, wherein said restoring step comprises:

sending a notice of resource availability to said PM in said first group of NEs prior to implementing step (g).

12. The method of claim 11, wherein step (g) further comprises:

determining whether said communications path may not be established due to unavailable resources sending said failure messages.

13. The method of claim 8, wherein said response message comprises an inquiry message indicating a conflict for contention of a resource at a network element reserved by at least two PMs.

14. The method of claim 13, further comprising:

resolving said reservation conflict by selecting a PM having a priority level greater than other conflicting PMs.

15. The method of claim 14, further comprising:

in the absence of said resource being previously selected by a lower priority PM, revoking reserved resource allocation to said lower prioritized PMs.

16. The method of claim 15, further comprising:

selecting said reserved resource at said network element by said higher prioritized PM.