MXPA00012001A - Method of and system for providing services in a communications network - Google Patents

Abstract

A system for providing services in a communications network includes a service processing function (19), a universal directory function (21), and a nodal resource manager (23). The service processing function (19) receives service requests, formulates requests for interworking functions based upon service requests, and formulates resource requests based upon service requests and interworking functions. The universal directory function (21) receives addresses from the service processing function (19) and returns interworking functions based upon addresses. The nodal resource manager (23) receives resource requests and allocates resources to the service processing function (19) in response to resource requests. The nodal resource manager (23) maintains a resource database (25) that includes an entry corresponding to each network resource managed by the nodal resource manager (23).

Description

METHOD AND SYSTEM TO PROVIDE SERVICES IN A COMMUNICATIONS NETWORK DESCRIPTION OF THE INVENTION The present invention relates in general to methods and systems for providing services in communications networks, and more particularly, to a method and system for processing requests for services in a telecommunications network. In a public switched telephone network, calls between subscribers, who are connected to different end offices are routed through trunk lines (interurban), and sometimes through intermediate tandem switching offices and constituency switches, also . Traditionally, a call is directed based on a portion of the dialed number. For example, in the United States, a local dialed number consists of seven digits, of which the first three digits (the so-called "NXX" portion) identifies the destination exchange. When a call picks up a telephone receiver, the caller is actively connected to a final office, as evidenced by a dial tone. After a caller dials a destination telephone number, the final office that receives the digits, ie the originating exchange, examines the dialed number to extract the destination exchange. If the destination exchange is different from the originating exchange, the call must be directed to the destination exchange on one of the many link groups connected to the originating exchange. In order to direct a call along an appropriate link group by driving to the correct destination exchange, an address table is configured within each switch. The address table contains a pre-set list of link groups belonging to each destination exchange. The address table is consulted to locate the logical attempt to reach the destination number through the physical reality of which the link lines are connected to other switches. Commonly, the address table contains an ordered list of preferred and alternative link groups of each destination exchange. For example, a preferred link group can be that directly connected to the destination exchange, while the alternative link groups can be connected indirectly via tandem switches. In the course of the direction of a call, a preferred link group will be searched first for an available line and channel. If there are no lines and channels available within the preferred link group, then an alternative link group will be searched for available lines. A fixed number of link groups is searched in the order of preference recorded in the address table. The contents of each address table and each switch in a network depend on the topology of the network and must be changed if nodes are added, deleted or logically redisposed. In addition, address tables are interpreted locally and populated differently for each switch. The changes must be coordinated between all the switches to maintain the proper functioning of the network. At any time that an NXX or switch or the telephone network is added in another way is logically redisposed, then the contents of each address table and each switch in each network must be updated in a coordinated manner. In the United States, a private sector entity maintains a local exchange management guide where all network owners base their address tables. Although the traditional address board appearance is sufficient for traditional telephone use under normal conditions, it has become inadequate to adapt new types of services and traffic. The traditional address table aspect is based on assumptions of slow change and network configuration and homogeneity between both types of traffic as network paths. More specifically, the traditional steering board appearance is inflexible. The traditional address table aspect is annoying to maintain and can not adapt fast changes in the network configuration, such as those that arise from the growth of a network, or sudden changes in traffic, such as those that arise in emergencies and the like. The traditional address table aspect does not provide an opportunity to perform an intelligent address on a per-call basis and can not take into account other factors such as the class of services, bandwidth, or priority associated with the originator, or the service network that is being invoked. Rather, the route selection algorithm is implicit in the address tables and is specified in a very restricted way by the organization of data in the tables. In addition, the traditional management board aspect by itself does not lead to a rapid implementation of new services. U.S. Patent No. 5,226,075 discloses a method and apparatus by which a telephone call is routed differently through an intracentral network based on a called number, a calling number and such origin data. as a requested class of service. A database is used to locate these parameters in a destination switch number. A call can be addressed differently, even to different termination switches, based on the dialed number or, at most, a bandwidth or quality level as inferred by a given call. The system of the '075 patent is directed by the relatively fixed contents of database tables. The database tables take into account only some source parameters, can select only from relatively few different paths, and can take actions only with those pre-planned by who fills in the database tables. Changes to the physical network may require an additional engineering design of the contents of the tables. The aspect of the '075 patent can not optimize the trajectory subject to instantaneous changes in the network or based on the cost per resource metric. More generally, the '075 patent continues to confuse the service and management functions within an individual database. As in traditional telephony, there is no recognition of the need to segregate logical service and address data. In addition, the aspect of the '075 patent can not effectively serve new types of traffic or services that may require the flexible distribution of intervention resources such as storage and advancement devices. There is a need for a flexible address technique in a telecommunications network that encompasses more than one fixed number map for link groups, or a fixed map of source information to network resources. A new management technique is required that takes into account many factors to direct a call and can be applied in a multi-purpose communications network, instead of only for telephony. The present invention provides a method and system for providing services in a telecommunications network. The system includes a service processing function, a universal directory function and a resource manager. The service processing function receives service requests, formulates requests for interoperable functions based on service requests and formulates requests for resources based on service requests and interoperable functions. The universal directory function receives logical addresses from the service processing function and returns interoperable functions based on addresses. The resource manager receives requests for resources and distributes resources to the service processing function in response to requests for resources. The resource manager accesses and updates a resource database that includes an entry that corresponds to each network resource managed by the resource manager. Each entry in the resource database includes a resource identifier, a group of static attributes, and a group of dynamic attributes. A resource identifier only identifies a resource. The static attributes are both relatively stable with respect to the type and configuration of the resource. Dynamic attributes are data that changes with respect to resources that are being tracked by the resource manager, including data such as whether the resource is being used, etc., by whom. If a resource is distributed, the dynamic attribute of the resources will include an indicator of how to find the priority of the distribution. This is because the priority of a distribution can be dynamic, that is, the function belonging to a resource can assign a variable priority during the duration of the distribution, or static, that is, the priority is determined at the moment of the distribution. distribution and fixed, so that it can be stored in the resource. A resource request includes a selection function. The resource manager uses the selection function to find the attributes of the resource database to locate a group of candidate resources. The selection function can be used to search both static attributes and dynamic attributes. A selection function preferably includes a priority criterion, which indicates the priority level assigned to the request or to the requestor. If the priority criterion of the requestor is greater than the priority attribute of a distributed resource, that resource is considered as unreadable for the selection. A resource request also includes an evaluation function. The resource manager uses the evaluation function to evaluate the attributes of the group of candidate resources to determine the best candidate resource. The resource manager massifies or evaluates the candidate resources according to the evaluation function. Resource management distributes the best candidate resource to the request service processing function and indicates the identity and priority of the request service processing function. The resource manager then sets up the best candidate in preparation for filling out the petition. Preferably, the evaluation function assesses unassigned candidate resources greater than the assigned candidate resources. However, occasionally the best candidate may already have been assigned to a lower priority service processing function. In those situations, the resource manager unassigns the best candidate resource and notifies the previous service processing function of its use of the resource has been acquired. Then, the resource manager reconfigures the resource and allocates the resource to the highest priority service processing function. Each resource manager has a domain, which is the group of resources managed by the resource manager. The domain of a nodal resource manager is the group of resources available to a network node, as the network is currently configured. The system of the present invention may include a network resource manager, whose domain is all the network connection resources. The network resource manager can reconfigure the network and assign additional network resources to a nodal resource manager. In the case where a nodal resource manager can not satisfy a resource request, the nodal resource manager may request additional resources from the network resource manager. Figure 1 is a block diagram of a communication network according to the present invention. Figure 2 is a block diagram of a network node according to the present invention. Figure 3 is a functional diagram of messaging between objects according to the present invention. Figures 4A and 4B are flow charts of service processing function originating an object and ending object processing, respectively, according to the present invention. Figure 5 is a flow diagram of the universal directory function processing according to the present invention. Figure 6 is a flow chart of the resource manager processing according to the present invention. Figure 7 is a flowchart of the resource request processing of Figure 6. Referring to the drawings, and first to Figure 1, a portion of a network is designated generally with the number 11. Network 11 includes a plurality of nodes 13 interconnected by links 15. As is well known to those skilled in the art, network services are provided, such as compliance of telephone calls, by switching traffic between nodes 13, on selected links 15. Network 11 it also includes a network resource manager 16 that can reconfigure the network 11 and allocate additional resources to the domain of each node 13, as will be described in detail later. Referring now to Figure 2, a node, according to the present invention, includes a switching fabric 17. A service processing function 19 is adapted to process requests for services, such as telephone calls and instruct the fabric of commutation 17 how to make the necessary connections to satisfy the request for service. A universal directory function 21, which can be located at the node or associated with the network resource manager 16, contains a group of maps of all types of logical addresses for physical elements within the network 11. For example, if the universal directory function 21 is requested half of a termination call and is given a telephone number, then a normal telephony interoperability function and a termination node address return; if the universal directory function 21 is given an IP address, then the universal directory function returns an interoperable IP telephony function and the configuration information to be the connection. When the service processing function 19 receives a request for services that require a connection, it queries the universal directory function 21 to obtain an important physical address as well as the necessary configuration information. The node 13 includes a nodal resource manager 23. Nodal resource manager 23 serves as the sole gatekeeper for all resources belonging to this particular domain. The domain of the nodal resource manager 23 is determined by the configuration of the network 11. In accordance with the present invention, the node resources include all communication ports, and devices, such as voice response units, storage devices and advance, multiplexers, modems and the like, which are used to provide network services. Network services are provided by assigning and configuring appropriate network resources. The domain resources managed by nodal resource manager 23 are tracked in a nodal resource database 25. Each resource within nodal resource manager domain 23 is identified by a resource identifier, which uniquely identifies an individual resource . The attributes of each resource include static attributes, which are relatively stable data with respect to the configuration of the resource, including the type of resource and the capabilities of the resource. The attributes of each resource also include dynamic attributes, which are change information with respect to the resource that is followed by the nodal resource manager, such as if the resource is in service or out of service, available for use, or in use , and by whom. In accordance with the present invention, the provision of network services, such as address, occurs in an interaction between the service processing function 19, the universal directory function 21 and the nodal resource manager 23. Instead of having the service and address mixed together and hard coded within the tables, the present invention provides services for allocating network resources in response to user requests. In the preferred embodiment, a prioritization scheme is applied to all network resources and to all user requests. The prioritization scheme allows the displacement of low priority requests in favor of high priority requests, only when they are guaranteed and with consideration for the collective costs involved. In this way, low priority traffic can be acquired by right in order to make available capacity for high priority traffic. The prioritization scheme of the present invention in this way allows the radical configuration of the network in the case of natural disasters, and the like. As shown in Figure 3, the system of the present invention is preferably implemented using an object oriented technology. When a source object 27 of the service processing function 19 receives a request for service and determines that it needs to correspond to another service of a particular type to perform the specified function, the source object 27 dispatches a request to the directory function universal 21 for a termination object of that particular type. The universal directory function 21 using an algorithm and stored data both locates and initiates a termination object 29 of that type and sends a configuration message for the termination object 29. The termination object 29 receives the configuration event and determines if you need any resources to perform your obligations. The termination object may not need resources if, for example, the service does not require connection to another node in the network. If the termination object 29 needs a resource or resources, then it synthesizes a resource request. A request for appeal can be either an individual appeal or a mixed appeal. An individual appeal request is made only when a single resource is necessary to provide the requested service. A mixed resource request is used when a group of resources is required to achieve the intended task. There are many situations where two or more resources are required to provide a particular service. Only one resource without the other is useless. The allocation of resources, one by one, can lead to stoppages and mixed requests for resources avoid the problem of unemployment by avoiding the containment between partially assigned requests. A resource request is composed of a number of parameters, some of which may be simple values and others of which may be algorithms. A resource request includes a selection function, which the node resource manager 23 uses to select a group of candidate resources. The selection function preferably includes a priority criterion so that the node resource manager 23 can select lower priority resources as candidate resources. A selection request also includes an evaluation function, which the nodal resource manager 23 uses to classify or assess the candidates to find a better candidate resource. The evaluation function may also include sufficient criteria, so that the resource manager does not continue to search after finding a candidate resource that is good enough to satisfy the request. A resource request finally includes the identity of the requestor and a duration in queue, which specifies how long the nodal resource manager can look for a better candidate resource.

The termination object 29 dispatches a resource request to the nodal resource manager 23. The node resource manager 23 performs the selection and evaluation functions and returns a result to the completion object 29. The result is either that of the resource or resources whether or not they were assigned. The termination object 29 completes its configuration based on the result received from the nodal resource manager 23. After configuration, the termination object 29 notifies the universal directory function 21 that it has completed the configuration, and the universal directory function 21 returns the identity of the termination object 29 to the source object 27. At this point, the source object 27 and the termination object 29 can initiate exchange events necessary to provide the requested service. Referring to Figures 4A and 4B, a high-level flow diagram of the service processing function processing is shown. The service processing function is preferably implemented in object-oriented technology. Referring first to Figure 4A, after receiving a request for services requiring a connection, the source object requests the universal directory function and waits for a response, in block 31. When the source object of the processing function service receives a response from the universal directory function, the source object exchanges events with the appropriate service operation termination object, the identity of which is returned from the universal directory function until the requested service is completed in the block 33. Referring now to Figure 4B, a flow chart of the processing of the termination object of the service processing function is shown. As will be explained in detail below, a service processing function termination object is located or exemplified by the universal directory function. After the exemplification, the termination object determines, in decision block 35, whether any resources are necessary to perform the requested service. If so, the termination object sends a resource request to the nodal resource manager and waits for a response, in block 37. If, in decision block 39, the resource is allocated, then the completion object completes the configuration and notifies the universal directory function that it is ready to exchange events with the source object, in block 43. If, in decision block 39, the requested resource is not assigned, then the termination object stores the failure of resource allocation in its object state, in block 41, and processing continues in block 43. Next, in block 45, the termination object exchanges events with the source object until release or acquisition. If, in decision block 47, a resource necessary for the acquired services, then the termination object stores the acquisition of resource in its object state, in block 49 and processing continues in block 45. Yes, in the block of decision 51, any resource needs to be released, then the termination object sends a resource release message to the nodal resource manager, in block 53, and the processing ends. If, in decision block 51, no resource is needed to be released, the processing of the completion object ends. Referring now to Figure 5, a high-level block diagram of the processing through the universal directory function is shown. The universal directory function waits for messages, in block 55. When, in block 57, the universal directory function receives an address from a function source object of service processing, the universal directory function calculates a function type interoperability and arguments associated with management, block 59. An interoperable function represents operational access to the actual physical resources in the network packaged and presented through a specific type of interface. Then, the universal directory function exemplifies the interoperable function with arguments with a service process operation terminating object in block 61. The universal directory function configures the termination object and waits for acknowledgment, in block 62. When the universal directory function receives the recognition of the termination object, the universal directory function "returns the identity of the terminating object to the originating object of the request service processing function, in block 63, and returns to block 55 for wait for messages Referring now to Figure 6, a high-level flow diagram of nodal resource manager processing according to the present invention is shown. The nodal resource manager waits for messages, in block 65. If, in decision block 67, a message is a resource request, the nodal resource manager performs resource request processing, as generally indicated in the block 69 and shown in detail with respect to Figure 7. If, in decision block 71, the message is a resource release, then the nodal resource manager returns the released resource to the idle state, in block 73 and unassigns the resource in block 75. The unassignment of a resource includes the step of setting the resources in a usage attribute to be made available. Referring now to Figure 7 there is shown a flow chart of the resource request processing of the nodal resource manager, which is generally indicated in block 69 in Figure 6. The nodal resource manager activates a stopwatch in accordance with the duration parameter on request of the resource request, in block 77. Next, the nodal resource manager applies the function of selecting the resource request to the attributes that can be searched in the resource database and applies the evaluation criteria of the resource request to the evaluable attributes of candidate resources to locate the best candidate resource before the stopwatch stops, in block 79.

In block 79, the processing can be performed in a series form where the selection function is applied to locate a group of all candidate resources and then the evaluation function is applied to the pool of candidate resources to locate the best resource candidate. Alternatively, the processing in block 79 may be performed in a parallel manner, wherein the evaluation function is applied as candidate resources that are localized according to the selection function. Preferably, the resource request includes a sufficiency criterion, which defines a minimum acceptable level for a better candidate. When the resource manager finds a candidate resource that satisfies the sufficiency criterion, that candidate resource is declared as the best candidate and the processing of block 79 ends. The processing in block 79 continues until a better candidate is found or when the timer stops. The nodal resource manager determines, in decision block 81, whether the best candidate has been located. If so, the nodal resource manager proves, in decision block 83, whether the best candidate is already assigned. If not, the nodal resource manager assigns and configures the best candidate resource and returns the resource to the request service processing function termination object in block 85. If, in decision block 83, the best candidate resource is already allocated, then the nodal resource manager sends an acquisition message to the applicable service processing function termination object and, unassigns and inactivates the best candidate resource in block 87. Afterwards, processing continues in the block 85. If, in decision block 81, the nodal resource manager does not locate a better candidate, then the nodal resource manager requests a new resource from the network resource manager and waits for a response, in block 89. Yes, in decision block 91, a new resource is received, then processing continues in decision block 83. If, in decision block 91, a decision is not received new resource, then the nodal resource manager sends a message that there is no available resource to the applicable service processing function termination object, in block 93. From the foregoing, it can be seen that the method and system of the present invention are well adapted to overcome the disadvantages of the prior art. Additional resources can be added to the network without having to re-encode the address tables. A service architect can design and implement a new service by writing a new service processing function that specifies the necessary resources, without knowing the identity of specific resources. In this way, the present invention allows new services to be provided quickly with a minimum of registration, for example, new services can be created based on different priorities. The prioritization scheme of the present invention allows network resources to be dynamically reserved.

Claims (33)

1. A system for providing services in a communication network, which comprises: a service processing function, the service processing function having means to receive service requests, formulate requests for interoperable functions based on service requests, and formulate requests of resource based on service requests and interoperable functions; a universal directory function, said universal directory function having means to receive addresses and return interoperable functions based on addresses; a nodal resource manager having means to receive resource requests and allocate resources to the service processing function in response to resource requests; and a resource data structure accessible by the nodal resource manager, said resource data structure including an entry corresponding to each network resource available to the nodal resource manager.

The system according to claim 1, wherein each entry of said resource data structure includes a resource identifier, a group of static attributes and a group of dynamic attributes.

3. The system according to claim 2, wherein said resource request includes: a selection function, said selection function being used by the nodal resource manager to search the attributes of the resource data structure to locate a group of resources. candidate resources.

4. The system according to claim 3, wherein the dynamic attributes include a free / in use attribute.

The system according to claim 4, wherein said attribute in use includes a priority identifier.

The system according to claim 5, wherein the priority identifier is a reference to a priority attribute.

The system according to claim 5, wherein the priority identifier is a priority attribute.

The system according to claim 5, wherein the selection function includes a priority designation, whereby resources with a priority attribute identified by said priority identifier are smaller than the priority designation of said selection function They are selectable.

The system according to claim 8, wherein the resource request includes: an evaluation function, said evaluation function being used by the nodal resource manager to evaluate the attributes of said group of candidate resources to determine a better candidate resource.

The system according to claim 9, wherein the nodal resource manager includes means for unassigning a better candidate resource with a priority attribute smaller than the priority designation of said selection function.

The system according to claim 9, wherein the nodal resource manager includes means for setting the priority attribute of a resource assigned to the priority designation of the resource request that the resource is allocated in response to same.

The system according to claim 3, wherein the resource request includes: an evaluation function, said evaluation function being used by the nodal resource manager to evaluate the attributes of the group of candidate resources to determine a better resource candidate.

The system according to claim 1, wherein the nodal resource manager includes means for configuring an allocated resource.

The system according to claim 1, wherein: the service processing function includes means for sending a release message to the node resource manager; and said nodal resource manager includes means for unassigning a resource allocated in response to a release message.

15. The system according to claim 13, where the nodal resource manager includes means to activate a de-allocated resource.

The system according to claim 1, including a network resource manager, said network resource manager including means for allocating additional network resources to the nodal resource manager, and wherein the nodal resource manager includes means to request additional resources in the event that no resource is available in the resource data structure to satisfy a resource request.

17. A method for providing services in a communications network, which comprises the steps of: receiving a request for a service; determine criteria for a resource necessary to provide the requested service; search a resource data structure for a group of candidate resources that meet these criteria; evaluate the group of candidate resources to find the best candidate resource; and assigning the best candidate resource to satisfy the service request.

The method according to claim 17, wherein each resource of said resource data structure includes a resource identifier, a group of static attributes, and a group of dynamic attributes.

The method according to claim 18, wherein the step of allocating a resource includes the step of setting a dynamic attribute of the assigned resource to indicate that said allocated resource is in use.

20. The method according to claim 18, wherein said dynamic attributes includes a free / in use attribute.

21. The method according to claim 20, wherein said attribute in use includes a priority identifier.

22. The method according to claim 21, which includes the step of setting a priority criterion, and wherein the step of searching a resource data structure for a group of candidate resources that satisfy said criteria, includes the steps of select candidate resources with a priority attribute identified by the priority identifier smaller than the priority criterion.

The method according to claim 22, which includes the step of unassigning a best candidate resource currently in use with a priority attribute less than the priority criterion.

The method according to claim 21, wherein the step of assigning the best candidate resource includes the step of setting the priority attribute of the best candidate resource for the priority criterion.

25. The method according to claim 17, which includes the step of configuring an assigned resource.

26. The method according to claim 17, which includes the step of unassigning an assigned resource when the requested service is completed.

27. The method according to claim 26, which includes the step of inactivating an unassigned resource.

28. A system for providing services in a communication network, which comprises: a service processing function, said service processing function having means for receiving service requests, means for formulating requests for non-operational functions based on requests for service, said requests for non-operational functions including addresses, and means for formulating resource requests based on service requests and interoperable functions, each resource request including a selection function to select a group of candidate resources and an evaluation function to select a better candidate resource; a universal directory function, said universal directory function having means to receive requests for interoperable functions and return interoperable functions based on addresses; a nodal resource manager having means to receive resource requests and allocate resources to the service processing function in response to resource requests; and a resource data structure accessible by the nodal resource manager, said resource data structure including an entry corresponding to each network resource available to the nodal resource manager, each entry including a resource identifier, a group of resources, static attributes and a group of dynamic attributes.

29. The system according to claim 28, wherein the dynamic attributes include a free / in use attribute.

30. The system according to claim 29, wherein the attribute in use includes a priority identifier.

The system according to claim 30, wherein the selection function includes a priority designation, so that resources with a priority attribute identified by the priority identifier that is less than the priority designation of said selection function, are selectable.

32. The system according to claim 31, wherein the nodal resource manager includes means for unassigning a better candidate resource with a priority attribute smaller than the priority designation of the selection function.

33. A system for providing services in a communication network, which comprises: a service processing function, said service processing function having means to receive service requests, and formulating resource requests based on service requests; a nodal resource manager having the means to receive requests for resources and allocate resources to the service processing function in response to requests for resources; and a resource data structure accessible by the nodal resource manager, said resource data structure includes an entry corresponding to each network resource available to said nodal resource manager.