Telephonic communications – Plural exchange network or interconnection – With interexchange network routing
Reexamination Certificate
2001-12-10
2004-12-07
Hong, Harry S. (Department: 2642)
Telephonic communications
Plural exchange network or interconnection
With interexchange network routing
C379S201050, C379S201120
Reexamination Certificate
active
06829346
ABSTRACT:
BACKGROUND OF INVENTION
The invention relates to telecommunications networks, and more particularly to advanced architectures for the description of telecommunication services.
The feature-interaction problem arises from the incremental, feature-by-feature, extension of telecommunications system functionality. As new features such as call forwarding, call waiting, or three-way calling have been added to telecommunication systems, it has become increasingly difficult to manage the behavioral complexity of the features and their interactions. Redesign of old features to fit smoothly with the new features is scarcely ever a practical option. Eventually, the resulting complexity damages the quality and productivity of all phases of telecommunication software development.
In the pending utility application, “Telecommunication System and Method,” Ser. No. 09/034,681, filed on Mar. 4, 1998, which is incorporated by reference herein, the inventors introduced an architecture for managing the feature-interaction problem. The inventors presented a virtual architecture for telecommunication systems, which they called distributed feature composition (DFC), in which a feature corresponds to a component type; each telephone call is handled by building a configuration of instances of these components, according to the features to be applied to that particular call. The feature component instances communicate by featureless internal calls that are connected by the underlying architectural substrate. A new feature is specified by describing its corresponding component type (or occasionally, two component types) and the rules for including the component instances into configurations. In the pending utility applications, “Routing Extensions For Telecommunications Network System And Method,” Ser. No. 09/644,128, filed Aug. 23, 2000, and “Protocol Extensions For Telecommunications Network Systems and Method,” Ser. No. 09/644,461, filed Aug. 23, 2000, “Signaling/Media Separation for Telecommunication Network System and Method,” Ser. No. 09/716,102, filed on Nov. 17, 2000, which are incorporated by reference herein, the inventors enhanced and modified DFC to accommodate open telecommunication systems, mobile telecommunication users, multimedia telecommunication services, unified messaging, and other aspects of modern telecommunication systems and services.
As discussed in the above-mentioned pending applications, DFC “address data” is data in the distributed feature system associated directly with individual addresses. The location of this data is an important problem, for several reasons. Its size is directly proportional to the number of addresses in use, which means that a successful DFC-like network will have a large quantity of DFC address data to manage. DFC address data is used frequently by routers and feature boxes in the above schemes, so access to it should be quick. Finally, DFC address data is data that describes or belongs to customers, and is therefore subject to many concerns about security, privacy, and protection behind administrative boundaries.
SUMMARY OF INVENTION
A distributed features system is disclosed which permits a telecommunication network to efficiently distribute data related to network addresses. In accordance with an aspect of the invention, the routing scheme of the distributed feature system permits address data to be partitioned across a plurality of nodes such that the address data and feature modules subscribed to by the address data can be located at the same node. The routing algorithm can be designed so that—as a communication usage unfolds—it never requires the data or feature modules of more than one address at a time. A communication usage unfolds within the node where an address is located, adding its feature modules and using its slice of the routing data, until the need for this address is exhausted and a different address becomes relevant. The node consults a service which identifies the node at which is located the address data needed for the usage. Then, the usage can jump to the location of the new address and continue to unfold, ultimately assembling the modules in a usage that spans the different nodes. This approach advantageously requires only one copy of a slice of the address data in the distributed feature system. The routing in the distributed feature system always has local access to address-partitioned routing data, and all feature modules have local access to their address-partitioned operational data.
These and other aspects and advantages of the invention will be apparent to those of ordinary skill in the art by reference to the following detailed description and the accompanying drawings.
REFERENCES:
patent: 4488004 (1984-12-01), Bogart et al.
patent: 5583929 (1996-12-01), Ardon
patent: 6160883 (2000-12-01), Jackson et al.
patent: 6404878 (2002-06-01), Jackson et al.
Jackson Michael A
Ramming James Christopher
Zave Pamela
AT&T Corp.
Hong Harry S.
LandOfFree
Routing optimizations for telecommunications network system... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Routing optimizations for telecommunications network system..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing optimizations for telecommunications network system... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3274160