The present disclosure relates to a system and method for efficiently representing and managing a computer facility.
Today's data hosting computing facilities often encompass multiple data centers distributed in many countries in order to better serve globally-based customers. These facilities employs a large number of servers housed in server rooms. The servers provide myriad functionalities and services, and are networked so that each server may communicate with one another and with other equipment. Communication in the data centers are most often based on networks running the IP protocol suite. These computing facilities also use equipment such as routers and switches to transport traffic between the servers and to the outside world.
A system and method have been envisioned for efficiently representing and managing a computer network facility.
A method of representing and managing hierarchical relationship configuration in a computing facility is described. The method includes providing and storing a first index of hardware identifier assigned to each object in the computing facility; providing and storing a second index of ancestry identifiers of each object in the computing facility, the ancestry identifier of an object being the hardware identifier of an ancestor object at 1 to n hierarchy levels above the object; providing and storing a type information element for each ancestor object indicative of a type of ancestor object; and identifying an ancestor object of a particular object in the computing facility by accessing the first index of hardware identifier of the particular object, and identifying an ancestor object thereof of a particular type by accessing the ancestry identifiers and the type information element of the particular object.
A method of representing and managing network connectivity configuration in a computing facility is described. The method includes providing and storing a first index of hardware identifier assigned to each network object in the computing facility; providing and storing a second index of network connector identifiers to each connector object in the computing facility, the connector object of a network object being the hardware component that connects the network object to another network connector or network object; providing and storing an uplink level information element for each uplink network object connected to the network object indicative of an uplink level position from the network object; identifying an uplink network object of a particular network object in the computing facility by accessing the first index of hardware identifier of the particular network object, and identifying uplink network objects thereof by accessing the second index of network connector identifiers of the particular network object, and the level information element of the uplink network objects; and updating the indices and level information elements affected by a change of network connectivity in the computing facility.
A computer-implemented method for managing an hierarchical configuration in a computing facility is described. The computer-implemented method includes providing and storing a first index of hardware identifier assigned to each object in the computing facility; providing and storing a second index of hardware identifiers of each object uplink from the object in the hierarchical configuration in the computing facility; providing and storing an information element associated with each object uplink from the object and indicative of a type of uplink object; and accessing the first index of hardware identifier of, a particular object, and identifying the second index of the uplink objects filtered by the information element to determine a particular object uplink from the particular object.
A computer-readable storage medium storing a representation of an hierarchical configuration in a computing facility is described. The computer-readable medium includes a first index of hardware identifier assigned to each object in the computing facility; a second index of hardware identifiers of each object uplink from the object in the hierarchical configuration in the computing facility; an information element associated with each object uplink from the object and indicative of a type of uplink object; wherein any uplink object of any object in the computing facility is identified by accessing the first index of hardware identifier of the object, and identifying the second index of the objects filtered by the information element; and updating the indices and information elements affected by a change of hierarchical configuration in the computing facility.
A computer-implemented method for managing an hierarchical configuration in a computing facility is described. The method includes accessing a first index of hardware identifier in a table identifying a particular object in the computing facility; accessing a second index of hardware identifier in the table indicative of objects uplink from the particular object in the hierarchical configuration in the computing facility; and filtering the uplink objects using an information element associated with each uplink object to identify a particular a particular type of object uplink from the particular object.
The network nodes of the computer network 10 may be geographically located remotely from one another, or be co-located proximately in the same building or facility. For example, the servers 12 may be located in one or more cities or countries. The network links interconnecting the network nodes may be constructed of any suitable medium such as optical fiber, copper, wireless, etc. Further, any one or more network protocols now known, such IP (Internet Protocol), or to be developed may be used in the network links to transmit data and signals in the computer network 10.
As shown in
Accordingly, the simplified diagram in
Both the computer network connectivity illustrated in
A second table 50 representing the computer network components 38-44 is shown in
A third table 60 representing the computer network connections is shown in
It should be noted that the tables 31, 50, and 60 are greatly simplified in that many additional columns and rows have been omitted from the figures in order to provide a clear and concise explanation.
Using the tables 31, 50, and 60, a user at the computing facility may execute computer code to determine, for example, which router is coupled to a specific server. For example, using the hardware ID=1, SERVER1 is identified in tables 31 and 50. The hardware ID=1 of the hardware ID table 31 is used to join the network component table 50 to arrive at the network component ID=A, which identifies the network component 38 (Eth1). The network component ID=A in the table 50 is then used to join the network connection ID table 60 to determine its uplink network component, which is network component 40 (GBE1) having network component ID=B. The network component ID=B in table 60 is then used to join the network component ID=B in the network component ID table 50, to determine that the network node 34 having hardware ID=2 is associated with network component ID=B.
In the network component ID table 50, hardware ID=2 is also associated with network component ID=C, which is Uplink10GigbitEthernet1 (U10GBE1) 42. This is used to join the network connection ID table 60 to determine that the corresponding uplink network component ID is D, which is 10GigabitEthernet (10GBE) 44. The network component ID=D is used to join the network component ID table 50, to determine that its network node is identified as having the hardware ID=3, which corresponds to the router (Fcr01) 36 identified in the table 31. Accordingly following these steps, the router (Fcr01) 36 is identified as the router that is coupled to the server (Eth1) 32.
As seen above, these repeated table join steps for even a simple query as “get me the router coupled to server X” are expensive and taxing on resources. The above steps may be carried out in the form of database table joins as known in the art or other manners of data structure manipulations later to be developed.
Using the same example described above, SERVER1 has hardware ID=1, which is associated with the network component identified by network component ID=A, at index=101 in the network connectivity configuration table 70. The network component ID=A identifies network component 38 (Eth1). Therefore all three rows having indices 101-103 associated with network component ID=A are relevant to the inquiry as they each indicate a network node that is coupled to SERVER1. Accordingly, filtering using the uplink_level=2, since the router is two levels uplink from the server, the row indicated by index=103 and hardware ID=3, is properly identified as the router (Fcr01) 36 that is the target of the inquiry. Accordingly, instead of having to consult three tables and making many table joining operations, the task of determining the network connectivity configuration is significantly simplified by using the network connectivity configuration table 70. The number of table joins is reduced to one.
Recall that
A user at the computing facility 20 may want to know the data center location of a particular server. Using the hardware location table 90 shown in
Accordingly, in answering the query “in which data center is the server having hardware ID=101,” a table join is made from the hardware location table 90 to the network ancestry table 100 which identifies all the entries with hardware ID=101. Accordingly, filtering using the type data element=“data center” in the third column of these entries, the data center 85 with hardware ID=1 is easily identified in the network ancestry table 100. Therefore, the number of table joins of the improved method is reduced to one.
It may be noted that although the example described above made representation of hardware equipment in the computer network in the tables, other forms of network nodes and network components may also be included. For example, software applications, logical entities, and other objects may be similarly represented and managed as described above.
The features of the present invention which are believed to be novel are set forth below with particularity in the appended claims. However, modifications, variations, and changes to the exemplary embodiments described above will be apparent to those skilled in the art, and the system and method described herein thus encompass such modifications, variations, and changes and are not limited to the specific embodiments described herein.
This application is also a continuation of application Ser. No. 13/185,857, filed Jul. 19, 2011.
Number | Name | Date | Kind |
---|---|---|---|
7002944 | Kats et al. | Feb 2006 | B2 |
7110375 | Khalil et al. | Sep 2006 | B2 |
7209805 | Motoyama | Apr 2007 | B2 |
7391771 | Orava et al. | Jun 2008 | B2 |
7394773 | Brooks | Jul 2008 | B2 |
7739402 | Roese et al. | Jun 2010 | B2 |
8073789 | Wang et al. | Dec 2011 | B2 |
8122127 | Bhatt et al. | Feb 2012 | B2 |
8396954 | Nagaraj et al. | Mar 2013 | B2 |
8402053 | Roediger et al. | Mar 2013 | B2 |
8478891 | Breau et al. | Jul 2013 | B1 |
8639700 | Morphis et al. | Jan 2014 | B2 |
8825829 | Gupta et al. | Sep 2014 | B2 |
20030033402 | Battat et al. | Feb 2003 | A1 |
20050160136 | Takahashi | Jul 2005 | A1 |
20080155094 | Roese et al. | Jun 2008 | A1 |
20110317707 | Banerjee | Dec 2011 | A1 |
20120166392 | Roediger et al. | Jun 2012 | A1 |
20130024458 | Morphis et al. | Jan 2013 | A1 |
Entry |
---|
Non-final office action for U.S. Appl. No. 13/185,857 dated Jun. 28, 2013. |
Notice of Allownce for U.S. Appl. No. 13/185,857 dated Oct. 31, 2013. |
Number | Date | Country | |
---|---|---|---|
20140164588 A1 | Jun 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13185857 | Jul 2011 | US |
Child | 14162491 | US |