Method for finding a resource in a scalable distributed computing environment

• US 5,778,185 A
• Filed: 07/21/1997
• Issued: 07/07/1998
• Est. Priority Date: 08/19/1994
• Status: Expired due to Term

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: PeerLogic, Inc. (Synchronoss Technologies Incorporated)
• Inventors: Ramakrishnan, Krish, Gregerson, Daniel P., Farrell, David R., Wallis, Ian F., Ahuja, Ratinder P., Gaitonde, Sunil S., Shafiq, Muhammad
• Primary Examiner(s): Harrell, Robert B.
• Application Number:
  US08/897,861
• Time in Patent Office: 351 Days
• Field of Search: 364/DIG. 1 MS, 364/DIG. 2 MS, 395/200.3, 395/200.31, 395/200.53, 395/200.54, 395/200.56, 395/200.59
• US Class Current: 709/226
• CPC Class Codes: G06F 2209/503 Resource availability
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 69/24 Negotiation of communication capabilities
• CPC Class Codes: H04L 69/32 Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04Q 2213/1305 Software aspects
• CPC Class Codes: H04Q 2213/13107 Control equipment for a part of the connection, distributed control, co-processing
• CPC Class Codes: H04Q 2213/13141 Hunting for free outlet, circuit or channel
• CPC Class Codes: H04Q 2213/13204 Protocols
• CPC Class Codes: H04Q 2213/13353 Routing table, map memory
• CPC Class Codes: H04Q 2213/13383 Hierarchy of switches, main and subexchange, e.g. satellite exchange
• CPC Class Codes: H04Q 2213/13388 Saturation signaling systems

Abstract

A method for finding a resource requested by a node in a scalable system. The system interconnects a plurality of nodes, with at least one node being associated with at least one resource. Each resource has an active state, in which the resource is available to other nodes, and an inactive state, in which the resource is not available. The method includes automatically identifying resources which become available by switching from the inactive to the active state. The method also includes automatically informing the requesting node that the requested resource has become available.

Claims

1. A method for satisfying a request for a requested resource, the request made by a node in a scalable system interconnecting a plurality of nodes on a digital network, at least one of the plurality of nodes being associated with one or more resources, each resource having an active state in which the resource is available to other nodes and an inactive state in which the resource is not available, each resource having a name the method comprising the steps of:

storing the request if the requested resource is not available;

automatically identifying by the node a resource that becomes available when the resources switches from the inactive to the active state; and

automatically informing the node that the requested resource has become available if the resource matches the requested resource;

such that before the node makes the request, the scalable system can be unaware of the name of the requested resource.

2. The method of claim 1 wherein said plurality of nodes are arranged in at least two levels, and wherein nodes in a first level contain information relating to the resources present in nodes in a second level.

3. The method of claim 2 wherein:

at least one node in the first level contains a cache for storing requests for resources; and

the step of storing the request comprises the step of storing the request in the cache.

4. The method of claim 2 further comprising the step of removing the request from the cache when the requested resource becomes available and satisfies the request.

5. The method of claim 2 wherein the first level is a parent level and the second level is a child level, each node in the parent level being associated with one or more nodes in the child level and each node in the child level being associated with one node in the parent level.

6. The method of claim 1 wherein:

at least one of said plurality of nodes contains a cache for storing requests for resources; and

the step of storing the request comprises the step of storing the request in the cache.

7. The method of claim 6 further comprising the step of removing the request from the cache when the requested resource becomes available and satisfies the request.