Method of configuring hierarchical network of user group and resource group and key distribution center

• US 8,032,926 B2
• Filed: 10/30/2007
• Issued: 10/04/2011
• Est. Priority Date: 12/06/2006
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Lee, Soo In, Koo, Han Seung, Song, Yun Jeong
• Primary Examiner(s): Dinh; Minh
• Assistant Examiner(s): PERUNGAVOOR, VENKATANARAY
• Application Number:
  US11/978,877
• Publication Number:
  US 20080141177A1
• Time in Patent Office: 1,435 Days
• Field of Search: None
• US Class Current: 726/3
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 63/062 for key distribution, e.g. centrally by trusted party cryptographic mechanisms or cryptographic arrangements for key distribution involving a central third party H04L9/0819
• CPC Class Codes: H04L 63/104 Grouping of entities

Abstract

Provided are a method of configuring a hierarchical network of user groups and resource groups, and a key distribution center. The method includes the steps of: analyzing hierarchical connection relationships between respective user groups and respective resource groups, comparing redundancy rates of the respective hierarchical connection relationships, and determining a connection mode having a larger redundancy rate; separating the respective user groups and resource groups and hierarchically connecting the user groups with the resource groups, according to the determined connection mode; comparing hierarchical connections between the respective separated user groups and resource groups, and removing an overlapping hierarchical connection; and recombining the separate hierarchical connections except for the overlapping hierarchical connection, and configuring an entire network.

Claims

1. A method of configuring a hierarchical network of user groups and resource groups, the method comprising the steps of:

(a) analyzing hierarchical connection relationships between the respective user groups and the respective resource groups, comparing redundancy rates of the respective hierarchical connection relationships, and determining a connection mode having a larger redundancy rate;

(b) separating the respective user groups and resource groups and hierarchically connecting the user groups with the resource groups, according to the determined connection mode;

(c) comparing hierarchical connections between the respective separated user groups and resource groups, and removing an overlapping hierarchical connection; and

(d) recombining the hierarchical connections of step (c) except for the overlapping hierarchical connection, and configuring an entire network, wherein the redundancy rates are determined corresponding to a user group set (US) primary redundancy set (UPRS) and a resource group set (RS) primary redundancy set (RPRS),

said analyzing, separating, comparing and recombining being performed by a server computer executing instructions stored in a memory to perform said steps.

2. The method of claim 1, wherein the UPRS includes elements having the same hierarchical relationship among hierarchical relationships having the respective user groups as their roots, and the elements do not have a common component.

3. The method of claim 1, wherein the RPRS includes elements having the same hierarchical relationship among hierarchical relationships having the respective resource groups as their roots, and the elements do not have a common component.

4. The method of claim 2, wherein when the elements of the primary redundancy set (PRS) have a common component, only one element having the largest overlap counter (OC) is included in the PRS.

5. The method of claim 3, wherein when the elements of the primary redundancy set (PRS) have a common component, only one element having the largest overlap counter (OC) is included in the PRS.

6. The method of claim 1, wherein the hierarchical connection method of step (b) is a star graph method whereby an intermediate node is not generated when the respective user groups and resource groups are hierarchically connected.

7. The method of claim 6, wherein when the user groups and resource groups are hierarchically connected, roots of the hierarchical connections are determined according to the connection mode of step (a).

8. The method of claim 1, wherein when the user groups and resource groups are hierarchically connected, the overlapping hierarchical connection of step (c) has the same parent node and child node.

9. The method of claim 1, further comprising the step of, after removing the overlapping hierarchical connection, integrating the hierarchical connection relationships between the respective user groups and resource groups to complete hierarchical relationships between the total user groups and resource groups, and aligning roots and end-nodes of the hierarchical relationships.

10. A key distribution server managing a centralized network connecting at least one user group with at least one resource group, the key distribution server comprising:

a memory storing instructions;

a processor executing the instructions to;

i) analyze a hierarchical connection relationship between each user group and each resource group, compare redundancy rates of the respective hierarchical connection relationships, and determine a connection mode having a larger redundancy rate;

hierarchically connect the user group with the resource group according to the determined connection mode; and

removing an overlapping hierarchical connection from the hierarchical connection between the user group and resource group,

wherein the redundancy rates are determined corresponding to a user group set (US) primary redundancy set (UPRS) and a resource group set (RS) primary redundancy set (RPRS).

11. The key distribution server of claim 10, wherein the UPRS includes elements having the same hierarchical relationship among hierarchical relationships having the respective user groups as their roots, and the elements do not have a common component.

12. The key distribution server of claim 10, wherein the RPRS includes elements having the same hierarchical relationship among hierarchical relationships having the respective resource groups as their roots, and the elements do not have a common component.

13. The key distribution server of claim 11, wherein when the elements of the primary redundancy set (PRS) have a common component, only one element having the largest overlap counter (OC) is included in the PRS.

14. The key distribution server of claim 12, wherein when the elements of the primary redundancy set (PRS) have a common component, only one element having the largest overlap counter (OC) is included in the PRS.

15. The key distribution server of claim 10, wherein the hierarchical connection method is a star graph method whereby an intermediate node is not generated when each user group and each resource group are hierarchically connected.

16. The key distribution server of claim 15, wherein when the user group and the resource group are hierarchically connected, a root of the hierarchical connection is determined according to the connection mode.

17. The key distribution server of claim 10, wherein when the user group and the resource group are hierarchically connected, the overlapping hierarchical connection has the same parent node and child node.

18. The key distribution server of claim 10, wherein the processor further executes instructions to after removing the overlapping hierarchical connection, integrate the hierarchical connection relationship between each user group and each resource group to complete a hierarchical relationship between the total user groups and resource groups, and align a root and an end-node of the hierarchical relationship.