Configuration of computer networks

• US 20030097468A1
• Filed: 10/28/2002
• Published: 05/22/2003
• Est. Priority Date: 10/27/2001
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Hamadi, Youssef
• Application Number:
  US10/281,923
• Publication Number:
  US 20030097468A1
• Time in Patent Office: Days
• US Class Current: 709/238
• 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/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/48 Routing tree calculation

Abstract

Systems involving generations of a complex node respresentation of a PNNI peer group are provided. Use is made of a set of restrictive costs, such as a transition matrix, defining the restrictives costs of paths between pairs of border nodes of the peer group. The complex node representation generation method is based on the group evolution process of the logical group representation of a peer group, and use is also made of the spanning tree representation of a network. Complex node representations generated by the disclosed possible number of exception bypasses.

Claims

1. A computer entity comprising:

at least one processor;

at least one data storage device;

an operating system;

a configuration table, said configuration table storing data describing a configuration of a spanning tree; and

a messaging component for sending and receiving of messages over a network, wherein said messaging component operates to send and receive said messages over a set of routes, according to said spanning tree, to a plurality of peer to peer connected computer entities.

2. The computer as claimed in claim 1, comprising:

an acquaintance table, said acquaintance table storing data describing a relationship between a plurality of other computers connected to said computer entity, wherein said relationship is specified as a father relationship or a child relationship for each said specified connected computer.

3. A method of establishing a spanning tree in a network of a plurality of peer to peer connected computer entities, said method comprising:

sending a plurality of configuration messages, each describing a network configuration, amongst said plurality of computers;

sending a plurality of status messages amongst said plurality of computers, each said status message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, each said cost message specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

4. The method of claim 3, wherein said process of determining comprises a plurality of determination processes each carried out locally at a said computer entity of said network.

5. The method of claim 3, comprising:

electing a said computer entity as a root node of said spanning tree.

6. A method of operating a local computer entity within a peer to peer network comprising a plurality of networked computers, for establishing a spanning tree within said network, said method comprising:

receiving configuration data from a plurality of other computer entities in said network;

for each said configuration data received from a said other said computer entity;

determining whether said other computer entity is active or not;

if said other computer entity is active, comparing said received configuration data with a locally stored configuration data stored at said local computer entity; and

if said received configuration data is more optimal than said locally stored configuration data, then adopting said received configuration data by replacing said locally stored configuration data with said received configuration data.

7. The method as claimed in claim 6, wherein said configuration data comprises:

for each said other computer;

data uniquely identifying a root computer entity which said other computer entity regards as being the root of a spanning tree;

establishing a cost data of said other computer entity to said root computer entity, said cost data comprising a number of hops as a shortest route between said root computer entity and said other computer entity.

8. The method as claimed in claim 6, further comprising:

transmitting said stored configuration data, and a local cost data of said local computer entity to a plurality of other computer entities in said network.

9. A method of operating a computer entity to establish a spanning tree within a network, said method comprising:

receiving a plurality of configuration messages from a plurality of other computer entities within said network;

analyzing said plurality of configuration messages received from said plurality of other computers within said network, to determine whether said configurations applied by any said other computer entity is more optional than a local network configuration stored at said computer entity;

if a said received configuration data of a said other computer entity in said network is more optimal than said local network configuration, then adopting said more optimal received configuration data at said computer entity; and

sending a configuration message describing a network configuration stored by said computer to each of a plurality of acquaintance computers connected to said computer entity in said network.

10. The method of claim 9, comprising:

for each said acquaintance computer;

storing data describing said acquaintance computer;

storing a cost parameter data describing a position of said acquaintance computer within a spanning tree.

11. The method of claim 9, comprising:

determining whether a said received configuration message from a said other computer entity describes said other computer entity as being active.

12. The method of claim 9, comprising:

storing a list of active said acquaintance computers at said computer entity; and

for each said active acquaintance computer, comparing a local cost value of said computer entity with a cost value of said acquaintance computer.

13. The method of claim 9, comprising:

storing a list of active said acquaintance computers at said computer entity;

for each said active acquaintance computer, comparing a local cost value of said computer entity with a cost value of said acquaintance computer;

if said local cost value is higher than said acquaintance cost value, then sending said local cost value to said acquaintance computer

14. A computer entity comprising:

at least one data processor;

at least one data storage device;

at least one database, said database comprising an acquaintance data table, storing data describing at least one connected acquaintance computer;

at least one messaging component;

an active status table, comprising data describing a transmission status of each said acquaintance computer;

a cost table, said cost table storing a cost data for each said acquaintance computer; and

a configuration table, storing data describing a local configuration of each said acquaintance computer.

15. A method of file querying in a network comprising a plurality of peer to peer connected computer entities capable of communicating with each other, said method comprising:

configuring a set of connections between said plurality of computers in a spanning tree arrangement, in which a said computer is designated as a root node of said tree, and at least one said computer is designated as a leaf node of said tree; and

propagating a plurality of file query messages amongst said plurality of computers, wherein said file query messages propagate along links of said spanning tree.

16. The method as claimed in claim 15, wherein a said computer receiving a said file query message operates to transmit said file query message to a parent computer of said receiving computer, and at least one child computer of said receiving computer.

17. The method as claimed in claim 16, wherein:

a said node computer receiving a said query message operates to;

read an address field of said message;

determine whether said address field addresses said computer or not;

if said address field addresses said computer, then reading a file address containing said query message;

check an internal file system of said node computer to determine whether said file exists on said computer; and

generate a response message containing a result message specifying whether said file exists at said node computer or not.

18. A method of establishing a spanning tree in a network of plurality of peer to peer connected computer entities, said method comprising;

sending a plurality of configuration messages, each describing a network configuration, amongst said plurality of computers; and

determining from said configuration messages, a spanning tree connectivity between said plurality of computers of said network.

19. Program data comprising instructions for operating a computer entity for carrying out the processes of:

communicating a plurality of messages over a set of routes according to a spanning tree;

storing data describing a relationship between a plurality of computer entities connected in a network, wherein said relationship is specified as a relationship selected from the set of a father relationship and a child relationship, for each of said plurality of computer entities.

20. A computer entity storing program data comprising instructions for operating a computer entity for carrying out the processes of:

communicating a plurality of messages over a set of routes according to a spanning tree;

storing data describing a relationship between a plurality of computer entities connected in a network, wherein said relationship is specified as a relationship selected from the set of a father relationship and a child relationship, for each of said plurality of computer entities

21. A data storage medium storing program data comprising instructions for operating a computer entity for carrying out the processes of:

communicating a plurality of messages over a set of routes according to a spanning tree;

storing data describing a relationship between a plurality of computer entities connected in a network, wherein said relationship is specified as a relationship selected from the set of a father relationship and a child relationship, for each of said plurality of computer entities.

22. Program data carrying instructions for operating a computer entity to perform the processes of:

sending amongst a plurality of computers a plurality of configuration messages, each describing a network configuration;

sending a plurality of status messages amongst said plurality of computers, each said message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

23. A computer entity carrying program data carrying instructions for operating a computer entity to perform the processes of:

sending amongst a plurality of computers a plurality of configuration messages, each describing a network configuration;

sending a plurality of status messages amongst said plurality of computers, each said message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

24. A data storage medium carrying program data carrying instructions for operating a computer entity to perform the processes of:

sending amongst a plurality of computers a plurality of configuration messages, each describing a network configuration;

sending a plurality of status messages amongst said plurality of computers, each said message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

25. Program data comprising instructions for causing a local computer entity to perform a method of:

receiving configuration data from a plurality of other computer entities in a network;

for each said configuration data received from another computer entity;

determining whether said computer entity is active or not;

if said computer entity is active, comparing said received configuration data with a locally stored configuration data stored at said local computer entity; and

if said received configuration data is more optimal than said locally stored configuration data, then adopting said received configuration data by replacing said locally stored configuration data with said received configuration data.

26. A computer entity comprising a data storage medium carrying program data carrying instructions for operating a computer entity to perform the processes of:

sending amongst said plurality of computers a plurality of configuration messages, each describing a network configuration;

sending a plurality of status messages amongst said plurality of computers, each said message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

27. A data storage medium storing program data carrying instructions for operating a computer entity to perform the processes of:

sending amongst a plurality of computers a plurality of configuration messages, each describing a network configuration;

sending a plurality of status messages amongst said plurality of computers, each said status message describing a status of at least one of said plurality of computers;

sending a plurality of cost messages amongst said plurality of computers, specifying a cost of an individual link between an individual pair of said computers; and

determining from said configuration messages, status messages and cost messages, a spanning tree connectivity between said plurality of computers.

28. Program data comprising instructions for controlling a computer entity to perform the processes of:

receiving a plurality of configuration messages from a plurality of other computer entities within a network comprising said computer and a plurality of computer entities;

analyzing said plurality of configuration messages received from said plurality of other computer entities within said network, to determine whether said configurations applied by any one or more of said other computer entities is more optimal than a local network configuration stored at said computer entity;

if a said received configuration data of a said other computer entity in said network is more optimal than said local network configuration, then adopting said more optimal received configuration data at said computer entity; and

sending a configuration message describing a network configuration stored by said computer entity to each of a plurality of acquaintance computers connected to said computer entity in said network.

29. Program data for comprising instructions for causing a computer to perform the method of:

configuring a set of connections between a plurality of computers in a spanning tree arrangement, in which a said computer is designated as a root node of said tree, and at least one said computer is designated as a leaf node of said tree; and

propagating a plurality of file query messages amongst said plurality of computers, wherein said messages propagate along links of said spanning tree.

30. Program data comprising instructions for operating a computer entity to perform a method of establishing a spanning tree in a network of a plurality of peer to peer connected computers entities, said method comprising;

sending a plurality of configuration messages, each describing a network configuration, amongst said plurality of computers;

determining from said configuration messages, a spanning tree connectivity between said plurality of computers.