Establishing connections with a pre-specified quality of service across a communication network

• US 6,678,264 B1
• Filed: 06/30/1999
• Issued: 01/13/2004
• Est. Priority Date: 06/30/1999
• Status: Expired due to Term

• Current Assignee: Genband US LLC (Ribbon Communications, Inc.)
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Gibson, Mark Robert
• Primary Examiner(s): Pham, Chi
• Assistant Examiner(s): JONES, PRENELL P
• Application Number:
  US09/345,069
• Time in Patent Office: 1,658 Days
• Field of Search: 370/352, 370/395-398, 370/238, 370/338, 370/214-217, 370/389, 370/231, 370/355, 370/390, 370/380, 370/417, 709/201, 709/238-242, 455/433-439, 455/466, 455/450-456, 455/440, 714/4
• US Class Current: 370/352
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/30 Routing of multiclass traffic
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/3065 for real time traffic
• CPC Class Codes: H04L 45/64 using an overlay routing layer
• 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/782 Hierarchical allocation of resources, e.g. involving a hierarchy of local and centralised entities
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/825 Involving tunnels, e.g. MPLS
• CPC Class Codes: H04L 47/829 Topology based

Abstract

On receipt of a request for a communication session over a communications network, such as an Internet Protocol communications network, a method of establishing a path for this session which provides a guaranteed quality of service is described. In a preferred example the communications network is an MPLS network and the method uses a modified version of the SIP messaging protocol. A number of possible paths for the communication session are identified and ranked according to factors such as traffic levels. Bandwidth along a chosen path is reserved and a messaging protocol such as CR-LDP used to establish this reserved path for the communication session. An advertising mechanism is used to provide entities in the network with information about topology and traffic levels. This enables the ranks to be determined effectively. The communications network has an overlay network of high capacity paths established on it. By arranging for communication sessions to preferably be established using these pre-determined high capacity paths the complexity of the topology information required is reduced.

Claims

1. A method of establishing a connection between two endpoints in a communications network such that a specified level of quality of service is given for a specified communication session using the established connection, said method comprising the steps of:

(i) determining a plurality of possible paths between the endpoints;

(ii) determining a measure of preference for each of said possible paths by ranking each possible path on the basis of information about the communications network and information about the specified communication session;

(iii) reserving bandwidth along the most preferred path according to said measures of preference; and

(iv) establishing a connection over said most preferred path,

wherein said communications network comprises a plurality of nodes connected together by links and wherein said method further comprises the ster of configuring the communications network such that the links between a first plurality of nodes are of a pre-determined capacity such that in use, each of said links between the first plurality of nodes is capable of sustaining a plurality of separate communication sessions.

2. A method as claimed in claim 1 wherein said step (ii) of determining a measure of preference for each of said possible paths further comprises the steps of:

(i) for each of said possible paths, determining a first set of measures of preference on the basis of information about a region of the communications network around a first one of the two endpoints; and

(ii) for each of said possible paths, determining a second set of measures of preference on the basis of information about a second region of the communications network around a second one of the two endpoints.

3. A method as claimed in claim 2 which further comprises the step of, for each possible path, respectively combining the first and second measures of preference for said each possible path.

4. A method as claimed in claim 1 wherein said most preferred path is arranged to comprise one or more of said links of pre-determined capacity.

5. A method as claimed in claim 2 wherein said communications network comprises a plurality of nodes connected together by links and wherein said method further comprises the step of configuring the communications network such that the links between a first plurality of nodes, located substantially between said first and second regions of the communications network, are of a higher capacity than other links.

6. A method as claimed in claim 1 wherein said communications network comprises a plurality of nodes which are arranged to broadcast information about topology and traffic levels associated with those nodes.

7. A method as claimed in claim 1 wherein said step of determining a plurality of possible paths comprises:

(i) issuing one or more messages from a first one of the endpoints, said messages comprising information about the location of the second endpoint; and

(ii) propagating each of said messages across the communications network to the second endpoint.

8. A method as claimed in claim 7 wherein said communications network comprises a plurality of nodes and wherein said method further comprises the step of:

(i) for each of said messages, recording information in that message about the location of each node traversed by that message.

9. A method as claimed in claim 8 wherein each of said messages contains information about the communication session and wherein said method further comprises the step of:

(i) for each of said messages, when a message traverses a node, making a reservation of bandwidth on a link emanating from that node.

10. A method as claimed in claim 9 wherein said reservations are cancelled unless confirmed within a specified time period.

11. A method as claimed in claim 1 wherein said communications session is for internet protocol traffic.

12. A communications network comprising at least two endpoints between which it is desired to establish a connection such that a specified level of quality of service is given for a specified communication session, said communications network comprising:

(i) a processor arranged to determine a plurality of possible paths between the endpoints;

(ii) a determiner arranged to determine a measure of preference for each of said possible paths on the basis of information about the communications network and information about the specified communication session;

(iii) a reservation mechanism arranged to reserve bandwidth along the most preferred path according to said measures of preference; and

(iv) a connection mechanism arranged to establish a connection over said most preferred path,

wherein said communications network comprises a plurality of nodes connected together by links and wherein said processor is arranged to configure the communications network such that the links between a first plurality of nodes are of a pre-determined capacity such that in use, each of said links between the first plurality of nodes is capable of sustaining a plurality of separate communication sessions.

13. A communications network as claimed in claim 12 which is an internet protocol communications network.

14. A communications network as claimed in claim 12 which is an MPLS communications network.

15. A computer program stored on a computer readable medium said computer program being for controlling a communications network comprising at least two endpoints, said computer program being arranged to control said communications network such that:

(i) a plurality of possible paths between the endpoints is determined;

(ii) a measure of preference for each of said possible paths is determined on the basis of information about the communications network and information about a specified communication session;

(iii) bandwidth is reserved along the most preferred path according to said measures of preference; and

(iv) a connection over said most preferred path is established such that a specified level of quality of service is given for the specified communication session and wherein said communications network comprises a plurality of nodes connected together by links and wherein said method further comprises the step of configuring the communications network such that the links between a first plurality of nodes are of a pre-determined capacity such that in use, each of said links between the first plurality of nodes is capable of sustaining a Durability of separate communication sessions.

16. Apparatus for use in a communications network comprising at least two endpoints between which it is desired to establish a connection such that a specified level of quality of service is given for a specified communication session, said apparatus being associated with one of said endpoints and comprising:

(i) a memory containing information about the topology of at least part of the communications network; and

to record pre-configured links between a first plurality of interlinked nodes of the communications network which are of a pre-determined capacity such that in use, each of said links the nodes are capable of sustaining a plurality of separate communication sessions,

(ii) an input arranged to receive a request for a specified communication session;

(iii) an output arranged to issue a plurality of request messages in response to a request for a specified communication session;

each of said request messages comprising information about the specified communication session.

17. Apparatus as claimed in claim 16 which further comprises a determiner arranged to determine a measure of preference for each of said request messages.

18. Apparatus as claimed in claim 17 which is arranged to receive a plurality of request messages issued by another such entity.

19. Apparatus as claimed in claim 18 wherein said determiner is further arranged to determine a measure of preference for each of said received request messages.