Directory structure for large scale telecommunications network allowing location of roaming mobile subscribers
First Claim
Patent Images
1. A directory/network structure for call routing and storing data pertaining to mobile radiotelephone subscribers;
- comprising;
a plurality of data handling nodes connected in a bifurcating tree type geometric configuration, including a root node, a plurality of service nodes including a home node and a plurality of visited service nodes and a plurality of levels of intermediary nodes between the root node and the service nodes,each of the root, service and intermediary nodes including data storage and processing circuitry for handling subscriber information and routing calls, including routines for subscriber information inquiries and subscriber inquiry call routing, including;
said subscriber information being only stored at nodes in a shortest path between a visited node and the home node;
means for addressing subscriber information requests to a node in the tree common to a subscriber'"'"'s home node and a visited node location if the subscriber is roaming;
each node including processing means for directing information requests in a search pattern allowing a node at a minimum level of the tree height above a level of the service nodes with subscriber information to process the subscriber information request; and
each node further including switching routing means for routing call requests through a node at a minimum level of the tree above a level of the service nodes at which the call request is entered.
2 Assignments
0 Petitions
Accused Products
Abstract
A mobile telecommunications system for a large area telecommunications system, including a plurality of different networks, has a directory/network structure for minimizing data storage and transmission and switching capacity requirements for locating roaming mobile terminals. A directory/network structure is provided with a plurality of directory/switching nodes arranged such that only one logical information and transmission path exists between any two nodes.
62 Citations
9 Claims
-
1. A directory/network structure for call routing and storing data pertaining to mobile radiotelephone subscribers;
-
comprising; a plurality of data handling nodes connected in a bifurcating tree type geometric configuration, including a root node, a plurality of service nodes including a home node and a plurality of visited service nodes and a plurality of levels of intermediary nodes between the root node and the service nodes, each of the root, service and intermediary nodes including data storage and processing circuitry for handling subscriber information and routing calls, including routines for subscriber information inquiries and subscriber inquiry call routing, including; said subscriber information being only stored at nodes in a shortest path between a visited node and the home node; means for addressing subscriber information requests to a node in the tree common to a subscriber'"'"'s home node and a visited node location if the subscriber is roaming; each node including processing means for directing information requests in a search pattern allowing a node at a minimum level of the tree height above a level of the service nodes with subscriber information to process the subscriber information request; and each node further including switching routing means for routing call requests through a node at a minimum level of the tree above a level of the service nodes at which the call request is entered. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of call routing and storing data pertaining to mobile radiotelephone subscribers:
-
comprising the steps of; providing a plurality of data handling nodes each including data storage and data processing circuitry; connecting the nodes into a bifurcating tree structure geometric configuration including a root node, plurality of service nodes and a plurality of intermediate nodes coupling the service nodes and the root node; addressing subscriber information requests to a particular node sequentially from a preceding node in response to initiation of a request from a home node of the subscriber; said subscriber information being only stored at nodes in a shortest path between a visited node and the home node; independently processing the request in each node in sequence from a preceding node; continuing information processing until a node at a minimum level of the tree has sufficient information to fulfill the subscriber information request. - View Dependent Claims (8, 9)
-
Specification