Apparatus and method for displaying data communication network configuration after searching the network

• US 5,202,985 A
• Filed: 12/02/1991
• Issued: 04/13/1993
• Est. Priority Date: 04/14/1988
• Status: Expired due to Fees

• Current Assignee: Racal-Datacom, Inc. (Thales SA)
• Original Assignee: Racal-Datacom, Inc. (Thales SA)
• Inventors: Goyal, Praduemn K.
• Primary Examiner(s): Harrell, Robert B.
• Application Number:
  US07/801,320
• Time in Patent Office: 498 Days
• Field of Search: 364/DIG. 1, 364/DIG. 2, 395/200, 395/250, 395/275, 395/325, 395/100, 395/600, 395/700, 395/725, 395/800
• US Class Current: 709/218
• CPC Class Codes: H04L 41/024 using relational databases for representation of network management data, e.g. managing via structured query language [SQL]
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]
• CPC Class Codes: Y10S 707/922 Communications
• CPC Class Codes: Y10S 707/954 Relational
• CPC Class Codes: Y10S 707/959 Network
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

In a data communication network, a method and apparatus for determining routing in a diagnostic channel utilizes a search token which is passed through nodes of a memory model of the network. The memory model represents nodes as one (or a combination of) object models representing aggregation, deaggregation, mesh or translation operations. By referring to a relational database, selective searches are performed without need to flood the network with search tokens. The search results may be displayed graphically for easier understanding. The method also has general application to a relational database management system by allowing for display of the database relationships and interconnections in a graphical manner for easier interpretation by the user.

Claims

1. A computer implemented method for providing a response to a query of a relational database having a plurality of entries describing a model of a communication network, said model of said communication network comprising a plurality of elements which are interconnected by a plurality communication links, said plurality of elements being located at a plurality of nodes in said communication network, said plurality of elements including at least two types of elements selected from a set of types of elements consisting of a modem element, a multiplexer element and Digital Service Unit element, said method comprising the steps of:

first, searching said database for said entries which satisfy a search criterion, said search criterion including the criterion of selection of only said entries representative of a predetermined one of said types of elements;

said first step of searching through said database including the further ordered steps of;

a) generating a token including said search criterion;

b) placing said token on an incoming port of first one of said elements having at least one incoming port and at least one outgoing port;

c) determining whether said first element has characteristics which satisfy said search criterion;

d) transforming said token to said outgoing port of said first element in accordance with a stored internal switch mapping which describes how said at least one incoming port of said first element is mapped to said at least one outgoing port of said first element;

e) moving said token to an externally connected second one of said elements using a stored external connection mapping which describes how said first element is interconnected with said second element; and

d) recording a list of the elements traversed as by the above steps which satisfy said search criterion;

second, ascertaining a structural interrelationship between said entries which satisfy said search criterion; and

third, generating a graphical representation of said structural interrelationship between said entries which satisfy said search criterion, whereby said graphical representation of said communication network includes only said predetermined one of said types of elements.

2. The method of claim 1, wherein said second step of ascertaining includes the further step of storing said graphical representation of said interrelationship in a computer memory.

3. The method of claim 1, wherein said third step of generating further comprising the step of determining which of a predetermined plurality of graphical symbols best represents each of said entries of said database.

4. The method of claim 3, further comprising the step of displaying said graphical representation of said structural interrelationship on a computer display with said graphical symbols interconnected to represent said structural interrelationship of said entries after said third step.

5. The method of claim 1, wherein said database entries include information about said elements of said communication network.

6. The method of claim 1, wherein said model is stored in a memory resident model.

7. The method of claim 6, wherein said first step further comprises the step of searching through a secondary storage medium to find said entries in the event searching through said memory resident model fails to contain needed information.

8. The method of claim 7, wherein said secondary storage medium stores a database containing relationships of said elements in said model.

9. An apparatus for displaying a graphical representation of a selected portion of information from a database describing a communication network, said network comprising a plurality of elements interconnected by communication links, said plurality of elements being located at a plurality of nodes in said communication network, said plurality of elements including at least two types of elements selected from a set of types of elements consisting of a modem element, a multiplexer element and Digital Service Unit element, comprising in combination:

searching means for searching said database for entries which satisfy a search criterion, said search criterion including the criterion of selection of only a predetermined one of said types of elements of said communication network, so that said graphical representation of said communication network includes only said predetermined type of element;

said searching means further including;

a) means for generating a token including said search criterion;

b) means for placing said token on an incoming port of first one of said elements having at least one incoming port and at least one outgoing port;

c) means for determining whether said first element has characteristics which satisfy said search criterion;

d) means for transforming said token to said outgoing port of said first element in accordance with a stored internal switch map which describes how said at least one incoming port of said first element is mapped to said at least one outgoing port of said first element;

e) means for moving said token to an externally connected second one of said elements using a stored external connection map which describes how said first element is interconnected with said second element; and

d) means for recording a list of the elements traversed by said searching means which satisfy said search criterion;

ascertaining means, receiving said entries from said searching means, for ascertaining a structural interrelationship between said entries which satisfy said search criterion; and

generating means, responsive to said ascertaining means, for generating a graphical representation of said interrelationship between said entries which satisfy said search criterion.

10. The apparatus of claim 9, wherein said searching means conducts a search of a memory resident model.

11. The apparatus of claim 10, wherein said searching means conducts a search of a database in the event said memory resident model does not contain enough information to satisfy said search criterion.