Resource separation in a call and connection separated network

• US 5,809,129 A
• Filed: 09/12/1995
• Issued: 09/15/1998
• Est. Priority Date: 09/12/1994
• Status: Expired due to Term

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Andersson, Erik Staffan, Nilsson, Nils Bertil
• Primary Examiner(s): Matar, Ahmad F.
• Assistant Examiner(s): Wolinsky, Scott
• Application Number:
  US08/527,012
• Time in Patent Office: 1,099 Days
• Field of Search: 379/219, 379/220, 379/221, 379/207, 379/201, 379/111, 379/112, 379/113, 379/133, 379/134, 379/137, 379/138, 379/139, 395/51, 395/908, 395/909
• US Class Current: 379/221.06
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/5619 Network Node Interface, e.g. tandem connections, transit switching
• CPC Class Codes: H04L 2012/5623 Network design, dimensioning, topology or optimisation
• CPC Class Codes: H04L 2012/5625 Operations, administration and maintenance [OAM]
• CPC Class Codes: H04L 2012/5632 Bandwidth allocation
• CPC Class Codes: H04Q 2213/13526 resource management
• CPC Class Codes: H04Q 2213/13533 multivendor and hybrid, e.g. public/private, networks, inc. international
• CPC Class Codes: H04Q 3/0016 Arrangements providing connection between exchanges
• CPC Class Codes: H04Q 3/0062 Provisions for network management
• CPC Class Codes: H04Q 3/665 Circuit arrangements therefor

Abstract

In a call and connection separated network, a method of providing distribution of resources of a physical network among different logical networks which are using the physical network for establishing connections. All of the physical resources of the physical network are mapped onto a single logical network description that will comprise nodes, trunk groups interconnecting the nodes, and resource pools. The different logical networks are created by routing tables located at each of the nodes. The routing tables are provided with a fixed maximum percentage figure relating to the maximum amount by which an individual logical network is allowed to use a common resource thus distributing the resources between the different logical networks. By assigning an individual maximum percentage figure to each of the logical networks and in so doing observing the sum of the maximum percentages for all logical networks, it is possible to create complete resource separation of the resource or competition for the resource among the logical networks.

Claims

1. In a call and connection separated network, a method for distributing a resource of a physical network among different logical networks which are using the physical network for establishing connections, said method comprising the steps of:

mapping the resource of the physical network to a corresponding resource in a single network description for said call and connection separated network;

using analysis table means to define one or more logical networks for said call and connection separated network, each logical network including a subset of resources of said single network description;

initially distributing the resource of the physical network among said one or more logical networks by assigning to each logical network a respective portion of the corresponding resource of the single network description, wherein a respective portion initially assigned to an individual logical network is indicative of a maximum extent to which said individual logical network is permitted to seize the corresponding resource; and

thereafter

dynamically distributing the corresponding resource among said logical networks while ensuring that no individual logical network seizes a portion of the corresponding resource which would exceed a maximum seizure extent defined for said individual logical network with respect to the corresponding resource.

2. A method according to claim 1, wherein said step of dynamically distributing the corresponding resource includes the steps of:

comparing a current extent to which an individual logical network has seized the corresponding resource with a maximum seizure extent defined for said individual logical network with respect to the corresponding resource; and

assigning a requested portion of the corresponding resource to said individual logical network in dependence upon a result of said step of comparing.

3. A method according to claim 2, wherein the corresponding resource is associated with a table comprising, for each one of said logical networks, data relating to a maximum seizure extent for the corresponding resource.

4. A method according to claim 3, wherein said initial distribution is made such that each one of the logical networks is guaranteed a minimum amount of the corresponding resource.

5. A method according to claim 3, wherein said initial distribution is made such that said logical networks compete for a portion of the total of the corresponding resource.

6. A method according to claim 3, wherein said initial distribution is made such that there is an open competition between said logical networks for the corresponding resource.

7. A method according to claim 1, wherein said step of dynamically distributing the corresponding resource is conducted in connection with routing analysis.

8. A method according to claim 7, wherein input data to said routing analysis includes a destination of a desired connection, and wherein result/output data of said routing analysis includes an identity of a resource associated with the destination, an identity of a logical network requesting the resource associated with the destination, and a maximum seizure extent defined for said identified logical network with respect to the resource associated with the destination.

9. A method according to claim 8, wherein a comparison of a current seizure extent with a maximum seizure extent is made in the identified resource.

10. A method according to claim 9, wherein said result/output data of said routing analysis is transferred to the identified resource.