Telecommunications call-processing arrangement

US5311584A · kind A · utility

Assignee

• AT&T Bell Laboratories · US

Inventors

• Frank J. Bogart · Boulder, US
• Bruce D. Butterfield · Broomfield, US
• David Chavez · Northglenn, US
• Henry C. Dittmer · Westminster, US
• Frederick R. Fix · Arvada, US
• Larry J. Hardouin · Westminster, US
• Nancy K. Schmidt · Broomfield, US
• Linda L. Thomson · Westminster, US

Key dates

• Filing date: Oct 31, 1991
• Grant date: May 10, 1994
• Expiry date: Oct 31, 2011

Classification

• Technology area (CPC H): Electricity
• CPC primary: H04Q2213/13541
• WIPO field: Telecommunications
• WIPO sector: Electrical engineering

Abstract

A call-processing arrangement (200) views a network numbering plan as a language in the mathematical/computer science sense and takes a lexicographic approach to call processing. Numbering plan syntax is defined by data in tree data structures (320, 330), and numbering plan grammar is defined by data in matrix data structures (400, 410). The data structures are used by numbering plan-independent functions to determine the meaning of call-associated digit strings and to specify the treatment (e.g., routing, features,) to be given to the call based on that meaning. A string-identification function (340) applies collected digits to the trees and matrices to find leafs (312) that define digit strings that make up the number. A string-action function (341) uses the definitions in the found leafs to form a call-route-specifying or call-feature-specifying index (254) for the call. A generalized route-selection function (343) uses a set of first call characteristics including the route-or-feature-specifying index to select from multi-dimensional matrices (1200, 1202) either a feature module (205) to be invoked or a routing-pattern number (1201), and in the latter case uses a set of second …