MXPA98007651A - Method and system to optimize the redirecc - Google Patents

Abstract

The present invention relates to a method and system for optimizing the redirection of a telecommunications network including a Data Granulator (104) that accesses the data of the network (102) and builds switching data and the Redirection Circuit Group ( GCR) in a database (106), and a Redirect optimizer (108) that uses the database (106) as input. Optimal configurations are determined according to the automatically derived attributes associated with the granulations of the elements of the network called redirection circuit groups (GCRs), which are automatically derived from the network. The redirection circuit groups can be defined as a set that redirects one or more circuits in the network. The optimal configurations satisfy the specified limitations, and are calculated according to the cost objectives. The limitations include redirecting redirection circuit groups based on the criteria of having a relationship with other groups of redirection circuits in the network, and how to deal with certain groups of redirection circuits in the redirection process.

Description

METHOD AND SYSTEM TO OPTIMIZE REDIRECTION Technical Field of the Invention The present invention relates generally to telecommunication networks having a plurality of nodes, such as switches, and in particular, to a method and system for optimizing the telecommunications topology. In a still more particular way, the present invention relates to a method and system for determining an optimal configuration of a telecommunications network. Background of the Invention As a part of the planning and provisioning activity of a telecommunications network, administrators have to make decisions about setting up resources in a targeted geographic area for change, improvements, or new facilities. The term redirect or redirect, used as a name, refers to a network change that involves moving the telephone service traffic from a switching center to a different switching center. In the same way, the term redirect or redirection used as a verb, refers to making the network change to move the telephone service traffic from a switching center to a different switching center. For example, traffic on a first trunk between a first switch and a second switch can be redirected on a second trunk between the first switch and a third switch. The need to redirect can result from the breakdown or failure of the switch, the optimization of the network, switch improvements, new installations, migration, such as from a hierarchical network to a flat network, the removal of equipment, or the like. When network traffic is not properly balanced, switches can become overloaded, calls are blocked (for example, fast noisy signal) and revenue is lost. Currently, administrators make important network decisions that involve redirecting mostly manual methods, using traffic information and resources from different systems. This takes a lot of time. Some systems have Graphical User Interfaces (GUI) but provide little redirection calculation and functionality. For example, U.S. Patent No. 5,270,919, entitled "Network Planning Tool", describes a novel graphical user interface (GUI), but provides little redirection optimization. The creation of a user interface is direct. The implementation of valuable functionality for the interface is challenging. It is difficult to minimize the cost of a redirection solution, while maximizing traffic efficiency. In conventional network configuration environments, there are interfaces with digital switches. Operators can reconfigure these digital switches through software applications. Network fault alarms can guarantee redirection. Many restoration methods, such as centralized restoration, dynamic restoration, and self-healing networks, restore priority communications for a minimized restoration time. Consequently, these techniques may not achieve the best solution for the entire network. Therefore, redirections are essential during the planning and growth of the network, the maintenance of the network, and in the situations of failure. Configuration or reconfiguration often requires the redirection of traffic from one switch to another switch. SUMMARY OF THE INVENTION The present invention provides the ability to distribute telecommunications traffic appropriately over a switched network, through automatic analysis of network data, calculation of optimal network configurations according to the network data, and the presentation of recommendations for redirection configurations. In the preferred embodiment, the network data is automatically collected from the telecommunications network by means of a Data Granulator process. The data characterizes the current state of the resources of the network currently deployed, including the production of traffic and the availability of resources. The switch information is collected, such as the specifications and the distances between switches for a network topology. The circuit information is also collected. A circuit is a minimum network granulation, a medium on which a single telephone call is incorporated. The circuit can be incorporated as a single analog session between the users of the telephone or a single time slot dedicated to a single telephone session between users over a digital network connection. The logical groups of circuits, referred to herein as "Redirect Circuit Groups" (RCGs), are collected for the switches. The traffic information is associated with the redirection circuit groups. A group of redirection circuits is a group of circuits that are considered an indivisible logical entity in the redirection process. The real circuits that are members of a group of redirection circuits are automatically determined. A group of redirection circuits can be any set of circuits that can be an object for redirection. This includes a single circuit or a group of circuits that have a switch as a control end, such as a trunk or multiple trunks. A Redirection Opti-izer process analyzes the collected data, calculates the candidate redirection solutions, and produces a report that is easily read by a human being. The report provides candidate redirection solutions according to the cost objectives and the ^ limitations specified by the human being. The redirect optimizer Includes a user interface that allows an administrator to specify the limitations and cost objectives that should be used when calculating redirection solutions. In the calculations the knowledge of the network by the administrator can be factored, and the specific requirements of the network. An administrator specifies the cost objectives through the selection of weighting coefficients for particular characteristics of the network, for example, the traffic quantities in the Inter-machine Trunks (IMT), the distances between the switches, and the balance ports of the switches. The weighting coefficients are used by the redirection optimizer to associate the costs with the candidate solutions. The administrator can also specify a cost limit to which all candidate solutions must adhere.

An administrator specifies limitations through the selection or specification of limitations of switch capacity, distance limit limitations, and network configuration limitations. The limitations provide information to focus the redirection optimizing solutions, and therefore, limit the set of candidate solutions. The limitations are described in greater detail later in this specification. An advantage of the present invention is to provide an improved method and system for redirection optimization, for the purpose of strategic planning, the maintenance of a network, and the deployment of network resources. The delayed manual processes are eliminated. The determination of precise solutions of the network is automated. The efficiency of the network is guaranteed. Another advantage is that the present invention is conveniently flexible by allowing a user, such as an administrator, to specify limitations and criteria for calculations. Important variables for a redirection process can be provided as a user input. Therefore, trial and error attempts in a solution are minimized. Another advantage of the present invention is that inter-switch traffic can be minimized (or intra-switch traffic can be maximized), subject to resource limitations. Intra-switch traffic is a numerical representation of a factor of a Community of Interest (COI). A community of interest refers to the grouping of telephone users who call each other with a high degree of frequency. Communities of interest affect plans for the deployment of new switches and other resources that are associated with the community of interest. Still another advantage of the present invention is the calculation of redirection optimization solutions according to the cost objectives. A cost function is used that considers appropriate factors of the community of interest, including inter-machine trunks, distances between network resources, such as between local rows and switches, and port balance. It is another advantage of the present invention to allow a user, for example an administrator, to define a scope of a network problem in terms of groups of redirection circuits a minimum and computable granulation of network resources that are appropriately subject to the redirection Any subset of network circuits that make a group of redirection circuits, is processed in a generic and accurate manner. Another advantage of the present invention is that it provides an improved method and system for redirection optimization in response to a network alarm, such as a traffic threshold exceeded, or a failure detected in a switch. In addition, the present invention can validate that the restoration processes have worked properly. A precise redirection is achieved from the point of view of the entire network. The present invention provides a data processing system that can be driven by a user through an arbitrary type of End User Interface (EUI). Another advantage of the present invention is the improvement of the integrity of the data used by the redirection calculation process. An automated data collection subsystem is provided, in order to remove the entry of data by human beings. Now the way in which the above advantages are achieved is described. A method and system for optimizing redirection are disclosed. The present invention allows to determine the optimal configurations of the telecommunications network according to the automatically derived attributes associated with the optimal granulations called Redirection Circuit Groups (RCGs) of a "telecommunications network." The above, as well as objects, features, and further advantages of the present invention will become clearer in the following detailed description Brief Description of the Drawings Figure 1 illustrates a high level design representation of a preferred embodiment of the present invention Figure 2A illustrates a representation of a preferred embodiment of the present invention, used as an independent network planning tool, Figure 2B illustrates a design representation of a preferred embodiment of the present invention, in conjunction with the processing of an alarm condition. Figure 3 illustrates one represents of a data processing system that can be used to implement the method and system of the present invention. Figure 4 illustrates a representation of a telecommunications network where, or for which, the present invention can be used. Figure 5 illustrates a subset topology of a telecommunications network to facilitate demonstration of the redirection circuit groups that may be associated with it. Figure 6 illustrates a table with example of groups of redirection circuits that can be presented as the result of the topology described by Figure 5. Figures 7 to 26, and Figures 27A to 27F, illustrate an example mode of an interface of the end user, i.e., a graphical user interface (GUI) for the present invention. Figures 28 to 31 illustrate tables describing a preferred mode of data collected and calculated from different resources of the telecommunications network. Figures 32 to 34 illustrate a high level design of a preferred embodiment for the automated data collection aspect of the present invention. Figures 35 to 51 illustrate flowcharts of a preferred embodiment for the automated data collection aspect of the present invention. Figure 52 illustrates a flow chart demonstrating the end-user interface unit and the associated data preparation aspects of the present invention. Figures 53 to 56 illustrate flow charts demonstrating the appearance of the Redirection Determiner of the present invention. Figure 57 illustrates an example of programming C to implement the enumeration method (p, k) of the present invention. Figure 58 illustrates a flow chart demonstrating the alarm processing aspect of the network of the present invention. Detailed Description of the Invention Figure 1 illustrates a high level design representation of a preferred embodiment of the present invention. This embodiment includes a Data Granulator 104 that has access to the data of the network 102, and builds the switch and data of the redirection circuit group in a Database 106, and a Redirect Optimizer, 108 that uses the base of data 106 as input. The redirect optimizer 108 is interfaced with a user through an end-user interface. The user specifies cost targets and limitations to focus the calculations of the redirect optimizer. The redirect optimizer 108 uses the user's input data, along with data from the database 106 to calculate redirection solutions for optimal network configurations. Then the solutions are presented, and they are administered through the end-user interface of the redirect optimizer. The data granulator 104 and the redirection optimizer 108 are independent processes, each of which may or may not execute with knowledge of what the other is executing. In a preferred embodiment, the data granulator 104 and the redirect optimizer 108 can be synchronized with established copies of data in the database 106. The preferred embodiment of the present invention executes the data granulator 104 such that the base The data 106 will contain a substantially recent snapshot of data to be used by the redirect optimizer 108. Now with reference to FIG. 2A, a design representation of a preferred embodiment of the present invention, used as a planning tool of the invention, is illustrated. independent network. The data granulator 104 has access to different data repositories from a telecommunications network, and derives a database 106 that is used as input to the redirect optimizer 108. In a preferred embodiment, the accessed data repositories are the data MECCA (Activity of the Multiplex Engineering Control Center) 122, NTAS data (Network Traffic Analysis System) 124, SCOTS data (Commuted Circuit Command and Tracking System) 126, DPUR data (Port Utilization Report) Digital) 128, and RTE7 data (Route 7) 130, all of which are data repositories maintained by their respective systems in an MCI telecommunications network (MCI is a registered trademark of MCI Corporation). This modality is described in terms of these sample data repositories to facilitate discussion. After reading this description, it will become clear to a person skilled in the relevant art how to implement this modality using other data sources in alternative telecommunication networks. The activity of the multiplex engineering control center 122 is an integrated automated data processing system that supports the commercial functions of managing and expanding the MCI multiplexing network. The traffic analysis system of network 124 is a system that provides traffic information for switches, trunk groups, end offices, service areas, and address statistics. The command and trace system of the switched circuit 126 is an automated system that creates all the shared circuit circuit commands, and allows to maintain data related to the provisioning of the circuit. A digital port utilization report 128 shows the port and the usage extension against the installed port base for switches in the MCI network. Route 7 data provides address information in the MCI network. Those skilled in the art will appreciate that substantially the same data can be obtained from other systems without departing from the spirit and scope of the invention. The redirect optimizer 108 includes a redirection determiner 110, which calculates optimal network solutions, an End User Interface Unit (EUI) 114 that drives a user interface that prepares data for the redirection determiner 110, and a Formatator Hard Copy 112, which can print network solutions and associated data on a printer 132. Data from the database 106 can be collected from an operational network, or can be data created by a human being ( for example, user / administrator) for a future planned network. A user is interconnected with the redirect optimizer 108 in the User Graphic Interface (GUI) 116 through a user interface architecture, for example Microsoft Windows 3.1 (Microsoft Windows is a registered trademark of Microsoft Corporation), or the IBM Operating System / 2 Presentation Manager (OS / 2) (IBM and OS / 2 are registered trademarks of International Business Machines Corporation). You can use a graphical user interface, a full screen interface, a line oriented inferium, or any user interface. Referring now to Figure 2B, a design representation of a preferred embodiment of the present invention is illustrated, in conjunction with the processing of an alarm condition. Figure 2B corresponds to Figure 2A, and highlights that the redirect optimizer 108 can interface with a user through a network operator console 118. At any time, a user can execute the redirect optimizer 108 to provide solutions to any problem, be it a solution for a past, current, or future situation. In one embodiment, the operator console 118 is a user interface appearing on a monitor of a data processing system, which executes the redirect optimizer. The operator console 118 contains access to the Network Administration 120, through an interface of the end user. Experts in this field are aware of the many network management interfaces that exist for use in a telecommunications network. For example, in the preferred embodiment, the administration of the network 120 is interconnected with a plurality of digital switches that support real-time configuration of their matrixes for port resignations, as well as support real-time reallocation of time slots through of the Time Slot Exchange (TSI). The address optimizer 108 is automatically invoked for some alarm, by the Alarm Notification of Switch 134, in which case, the user in the operator console 118 is notified, and the redirection optimizer 108 executes asynchronously from user interaction to provide network solutions in response to the failure. The alarm notification of switch 134 may result from a failure in the operation of the switch, or may result in an exceeded traffic tolerance. When searching for available network solutions in response to the failure, the user can use the administration of the network 120 to manage changes in the network according to the solutions provided. Referring now to Figure 3 there is illustrated a representation of a data processing system 200 that can be used to implement the method and system of the present invention. The data processing system 200 includes a processor 202, which includes at least one central processing unit (CPU) 204, and a memory 206. Additional memory can be connected, in the form of a disk storage device. hard 208, and a flexible disk device 210, to the processor 202. The flexible disk device 210 can receive a diskette 212 having a programming implementation of the data processing system registered therein, which implements the data processing system 210. data in accordance with the present invention. The data processing system 200 may include the user's interface hardware, including a mouse 214, a keyboard 216, and a monitor 218 for displaying visual data to the user. The data processing system may also include ports 220 (for receiving cables) and slots 222 (for receiving interface cards), to receive hardware interface adapters. Ports 220 and slots 222 provide elements for communicating with a network or other data processing systems, as well as many types of peripherals.

Experts in this field will appreciate that the redirect optimizer 108, the data granulator 104, the alarm notification of the switch 134, and the administration of the network 120, as described above, can each execute in the data processing system. 200, or can run in a similar data processing system connected to the data processing system 200, through a port of the ports 220 and / or of a slot in the slots 222. The hardware mode of the processing system data 200 may be a main frame, a minicomputer, a personal computer, a telecommunications switch, or the like. Peripherals, such as printers, scanners, microphones, sound cards, fax machines, monitors, or the like, can additionally complement the data processing system. Although the hardware landscape has been shown and described in particular with reference to a preferred embodiment, it will be understood by those skilled in the art that different changes in form and detail can be made, without departing from the spirit and scope of the invention. invention. Referring now to Figure 4, a telecommunications network 300 is illustrated, where, or for which, the present invention can be used. The same icons and the same shapes in the figure represent the same type of system. The telecommunications network can be integrated with Local Area Networks (LANs), including local area network (LAN) 230, main frame systems, including the main frame 232, personal computers (PCs) including the personal computer (PC) 236 , varieties of digital telecommunications cross-connect switches (DXC), including the class 3 switch, 238, and the class 1 switch, 240, simulated terminals (DTs), such as the Terminal Muda (DT) 250, and other varieties systems, often referred to as nodes in the network. The term "network", as used herein, refers to a collection of two or more nodes linked together, with communications functionality. In fact, any subset of nodes in Figure 4, including two or more nodes that can communicate with each other, is also a network. Figure 4 can also be a set of a larger network. The lines shown between the nodes in Figure 4 demonstrate communication lines, links, or extensions. For example, a Direct Access Line (DAL) extension 280 is at least one trunk between the switch 238 and a directly connected Private Branch Exchange (PBX) 252. The Point of Presence (POP) 254 is connected to a Local Row 256 and a Final Office 258. The Final Office (EO) 258 is the Commutation Center of the Company of Local Exchange (LEC), which provides the dial tone and local service to end users using the equipment, such as a telephone 242, a personal computer connected to an internal modem 282, a personal computer 260 that connects to a external modem 244, a fax machine 246, or the like. The extensions 262, 264, and 266 include at least one trunk. An end user of the Final Office 268 can communicate with an end user of the Final Office 258 through a single circuit via a link of extension 270. The Final Office 268 and the Final Office 258 can be a great distance apart. of the other. Extensions 270, 264, and 266 could be made with microwave via satellite or fiber optics. A telecommunications network, such as that shown in Figure 4, is normally interconnected with other systems, such as a personal computer 236 or a main frame 232. These systems can be interconnected with local area network cables, telephone wires , wireless radio waves or similar. There are many varieties of protocols available to facilitate communications about these media. These are interconnected to facilitate the administration of the network through the applications implemented in it. An end-user personal computer 282 may contain access to a network administration application. The personal computer 236 can be enabled for direct communications with a central 232, a switch 238, a switch 240, a silent terminal 250 through the central 232, a personal computer connected to the local area network 272, a remote local area network personal computer 274 by means of a server bridge 248, or a switch 276 by means of a gateway server personal computer 278. In fact, users of any system of Figure 4 can communicate with users of any other system of Figure 4, by means of a line methodology of Communications well known to experts in this field. The term "network node" refers to a point of accumulation and distribution of traffic in a network, such as switch 238 and switch 240, which serves a number of sub-nodes. A sub-tenant node is a point of origin or termination of traffic, such as the Final Office 258. The data for the telecommunications network is normally maintained in data storage devices in a switch, personal computer, main frame, or any set of these systems. A user can access network management applications that use this data. A data processing system can be incorporated over more than one hardware entity. A data processing system can be incorporated into a single system as illustrated in Figure 3, or as a coordinated and integrated implementation across many systems, including switches, personal computers, and master frames, as shown in Figure 4. Referring now to Figure 5, a subset topology of a telecommunications network is illustrated to facilitate the demonstration of groups of redirection circuits that may be associated with it. Figure 5 illustrates a subset of a telecommunications network that is similar to telecommunication network 300. A legend 306 is provided to define the graphic objects illustrated in Figure 5. A legend 308 is provided to define the types of trunk groups. The terminology of the legends, as well as the spirit of the discussions in Figure 5, are from a perspective of the Inter-Interchange Carrier.

(IXC). An Inter-Exchange Carrier (IXC). An Inter-Exchange Carrier provides long distance telephone services. All the lines drawn between the objects represent a set of trunks, at least one trunk in each set. It is understood that each set of trunks 310 is connected to another switch. A Service Area (SA) is a telephone service area. A Row Service area (TSA) is a service area connected to a single local row. The service areas (SAs) of Figure 5 are considered Row Service Areas (TSAs). A row service area is identified by a local row and a Point of Presence (POP). A point of presence is a point in a telecommunications network where an interchange carrier sends or receives traffic to / from a service area. A row service area comprises a set of trunks in a row and End Offices (EOs) whose traffic is subtended to these trunks in a row. Each final office in the row service area can be connected to the local row, or directly to the switch of a home through a point of presence. A final office provides local telephone services. A home switch is an inter-exchange carrier switch, such as the SI switch, serving a service area in a row. The local row identifier is available for applications on all nodes in the row service area. The local row connects to the household switch through the point of presence. In the case of a sectorization, it is possible that a physical row service area is divided into two or more Logical Row Service Areas (TSAs) in this case, a logical row service area will have its own point of presence, home switch, and its own set of end offices. A local row can have more than one household switch. Also as shown in Figure 5, the local circuits are access circuits (traffic flows from the service area in a row to the household switch), from egress, (traffic flows from the home switch to the home area). row service), and bidirectional, between a home switch and other entities, such as a local row, a final office, and directly connected clients. A directly connected client is connected through a dedicated access line (DAL), hereinafter referred to as Hardwire (HW) circuits. A Redirect Circuit Group (RCG) can be defined as a group of local circuits that can be considered as an indivisible entity in the redirection process. For example, from an access perspective, a group of redirection circuits can be directed from the service area in a row to a given household switch SI, or it can be redirected from the switch SI to the switch S2. Each local circuit can belong to one, and only to a group of redirection circuits. Inter-machine trunks (IMTs), for example trunk set 304, are not included for local redirection circuits. As a result, the entire set of local circuits is divided into groups of mutually non-overlapped redirection circuits, referred to as divisions of redirection circuit groups. Depending on the level of granularity, a different set of divisions of groups of redirection circuits can be defined. Although the redirection determiner of the present invention supports minimal granulation of a single circuit to define a group of redirection circuits, the practical redirection problems of the network are better treated by defining both circuits and reasonable (maximized) in any group of redirects. redirection circuits. In an extreme case, a group of redirection circuits may consist of all circuits between an interchange exchange carrier switch and a given point of presence., but the diversity of access and egress, as well as the redirection within the service area, would not be weighted by the redirection determiner. In another extreme case, a group of redirection circuits contains a single circuit. However, this is not practical from a maintenance and provisioning point of view. Also, groups of single-path redirection circuits would cause large amounts of execution time of the redirection determiner. In one modality, an overview of the problem can best be defined with groups of redirection circuits that have any of the following basic levels of granularity: SWITCH: typically the highest level of granularity, because all the circuits that belong to any group of given redirection circuits must have the same control end. SWITCH - PRESENCE UNIT: all circuits that have a household switch given as a control end, and pass through a given presence point (they can have intermediate presence points included in the line). TYPE OF SWITCH: all circuits that have a household switch given as a control end, and have a given type. The type can be defined as: TA (Access in Row) DA (Direct Access) TB (Row Termination and Bidirectional). DB (Direct and Bidirectional Termination). H (Hardwire); Dedicated access lines, such as the customer site 302 that contains a Private Branch Exchange. FGC (Characteristics Group C) CCFGB (Calling Card Characteristics Group) B). In an example, all circuits that are not of the row or hardwire access types are combined into a single group of redirection circuits called All Other (AO). TYPE OF SWITCH - UNIT OF PRESENCE: all circuits of a particular type that have a household switch given as a control end, and pass through a given point of presence. See SWITCH-POINT OF PRESENCE and TYPE OF SWITCH previously. SWITCH- SERVICE AREA IPO? all circuits of a particular type having a home switch given as a control end, and which are contained within a service area. A service area is represented by a CLLI (Common Language Location Identification) code in row, or a HW string identifier (for example, xxxxDALTERM, where xxxx is the name of a switch.) In a diversity mode of preferred redirection optimization access, the granularity levels are further maximized in a group of redirection circuits, thus defining three types of redirection circuit groups as follows: HW RCG = dedicated access line trunks having a switch of home as a control end (one HW per switch) TA RCG = row access trunks that have a home switch as a control end, and a local row given as a far end AO RCG = all trunks between a given switch and the service area not belonging to HW RCG and TA RCG A group of redirection circuits is identified exclusively by the triple [switch, area service (ie, common language location identification code or HW cord identification), type of redirection circuit group]. A switch is referenced by a Field Switch Identifier (FSID). A common language location identification code is a string of 11 characters as follows: Characters 1-4 = City Characters 5-6 = State Characters 7-8 = Building (where the equipment is located). Characters 9-11 = Type of Equipment Some examples of groups of redirection circuits are: DNG1: DNG1DALTERM: HW DNG1 is the identifier of the field switch, DNG1DALTERM is an identifier of the HW chain, Hardwire type. DNG1: D0CSNY11111: AO DNG1 is the identifier of the field switch, DOCSNYlllll is the local language location identification code of the local row, Type of All Others. DNG1: MRSBlLDNG01: TA DNG1 is the identifier of the field switch, MRSBILDNG01 is the common language location identification code of the local row, Access Type in Row. Referring now to Figure 6, there is shown a table containing the groups of redirection circuits that can be obtained from Figure 5 for the preferred access diversity mode. The enumeration is an identifier of the group of redirection circuits generated exclusively. The service area identifier will actually be a common language location identification code of a particular row, or a well-known identifier for the group of HW circuits. The table of the Figure 6 simply refers to the objects found in Figure 5. The data controller 104 constructs objects of the redirection circuit group according to the desired metaphor, and can be incorporated in a different manner without departing from the spirit and scope of the invention. . The data granulator 104, through the automatically accessed and constructed data has service area identified with surrounding dotted lines, as shown in Figure 5. Any diversity and granulation of the redirection circuit group is appropriately handled by the present invention . Reasonable network configurations are supported, including features such as multiple addresses, sec.torización, diversity of access, and diversity of exit. A user of the present invention may prefer certain groups of redirection circuits manufactured from data collected by the data granulator, suitable for the user's problem. One of the purposes of redirection is to solve a problem of the Communication of Interest, such as minimizing inter-switch traffic, or maximizing intra-switch traffic, therefore, it is a goal to redirect the groups of redirection circuits with a strong community of interest to the same household switches. In any division mode of the redirection circuit group, the traffic information is considered for the pairs of redirection circuit groups (A and B). Traffic that originates from A and ends in B, is denoted as Traf (A, B). The total traffic between A and B in both directions is denoted as (Traf (A, B) + Traf (B, A)). This characterizes the Community of Interest between A and B. In theory, all groups of redirection circuits can be redirected to a single household switch, to eliminate all inter-switch traffic; however, the capabilities of the switch have limitations, such as the number of ports, the limitations of Call Attempts in Occupied Hours (BHCA), Transactions per Second (TPS), and distance limitations. Survival characteristics and cost objectives, as well as the community of interest, should be factorized. For example, reconfiguration is undesirable by doubling the length of the line for only a minimum gain in the Community of Interest. A cost function allows factoring not only a Community of Interest, but also the balance of distance and port. The distance component of the cost function can include not only the distance between the point of presence and the candidate household switches, but also other parameters, such as the cost of the additional equipment (eg, echo cancellers), the type of transmission medium, the geographical region, and so on. The balance of the port can be used to balance the use of the port. For example, two switches with a port utilization of 45 percent and 55 percent are better balanced than two switches with port utilization of 1 percent and 99 percent. The cost function of the present invention is a weighted sum of the components: Cost = W1 * Cl + w2 * C2 + ... + Wn * Cn where w- are the weighting coefficients > = 0, normally S w, - = 1, and C- are the components of the cost function. An illustrative embodiment of the present invention uses a cost function, such as: Cost (x) = w ^ lMT Traffic ixJ / IMT Traffic iXo)) + w2 * (Dist (x) / Dist (x0)) + w3 * (PB (x) / PB (x0)) I where x is a common allocation (ie, an allocation vector that is described in detail in the descriptions in Figure 53), x0 is an original assignment, w1f w2, w3 are user-selected weighting coefficients (usually w1 + w2 + w3 = 1), IMT_traffic is a component of inter-machine trunk traffic, Dist is a component of Distance, and PB is a component of Port Balance. Each component is a value for a given assignment x, divided by the corresponding values for an original assignment x0. This normalization appropriately equates values of a different kind in a single formula. As a result, the cost value for the original assignment Cost (x0) = 1. The user can select wi values of the weights, depending on the priorities. The system itself can provide default values for these. The most important samples (from a user's point of view) are some particular component, the greater weight this component has in the cost function. For example, if an important priority is the Community of Interest, then a 1 (or close to l) a and a 0 (or close to 0) are assigned to another j. There may be other components for the cost function in the alternative modalities without departing from the spirit and scope of the invention. In summary, the present invention defines three groups of limitations: limitations of switch capacity, distance, and configuration. With respect to the capacity limitations of the switch, there is a limited number of ports (ports, as used herein, refers to the number of circuits supported by a physical port of the switch) designated for the local circuits. This number must not be less than the total number of lines (circuits) for all groups of redirection circuits that are directed towards a given switch. Each switch also has a limitation of the Central Processing Unit, in terms of Call Attempts in Occupied Hours (BHCA). Call attempts in busy hours for each group of redirection circuits are used to calculate a number of call attempts in total busy hours common for a given switch. This number of call attempts in busy hours should not exceed a switch limit on call attempts in busy hours. Each switch also has a limit of Transactions per Second. Some types of calls (for example, 800) require access to a centralized database for the translation of the telephone number that has an impact on transactions per second. The transactions per second for each group of redirection circuits are used to calculate a common number of transactions per second total for a given switch. This number of transactions per second should not exceed a limit of the switch on transactions per second. <; With respect to distance limitations, if the distance of a route between a Final Office and an Inter-Interchange Carrier Switch is large, the undesirable echo effects must be considered. The redirection of a group of redirection circuits to a new switch is limited to some distance limitation. For example, a non-microwave path distance between a group of redirection circuits and an interchange exchange carrier switch should not exceed a reasonable limit, such as 965.4 kilometers. The distance of the circuits in a particular group of redirection circuits includes adding the distance between the switch and the point of presence, the distance from the point of presence to the most remote final office. However, if an echo canceller (or an echo suppressor) is used, the distance limit is extendable. In the case of a community of strong interest between a group of redirection circuits A and a group of redirection circuits B that is directed towards a remote switch S there is a decompensation between the community of interest and the cost of redirecting A towards the switch S remote with echo cancellers. With regard to configuration limitations, specifications are made for diversity, addresses to be avoided, and groups of circuits that are not going to be redirected. The configuration limitations are discussed in the descriptions of the user interface mode below. . Now, referring to Figures 7 to 26, and to Figures 27A to 27F, there is illustrated an example mode of an End User Interface, i.e., a Graphical User Interface (GUI) for the present invention. The standard controls of the graphical user interface, as designed by an OS / 2 Presentation Manager or an MS Windows user interface, are applicable to the Figures. All the windows and small windows can be dimensioned according to the dimensions preferred by the user. Although a preferred embodiment of the user's graphical interface is shown, different changes can be made in the alternative embodiments without departing from the spirit and scope of the invention. A preferred embodiment for displaying a group of redirection circuits through the user interface includes three times the corresponding information (ie, switch, service area identification, group type of redirection circuits). In another embodiment, the redirection circuit groups may simply be an enumeration identifier generated by the determinable system. In any case, the groups of redirection circuits are 'displayed at the user interface as some group identifier of redirection circuits. The user can invoke (for example, with a double click of the mouse) a group of redirection circuits to obtain more detailed information of any reference of the user interface of the same. Referring now to Figure 7 in particular, a main window 400 is shown to interact with the redirect optimizer 108. It is assumed that the data granulator 104 has constructed the database 106 (from the data of the network 102). ), which is used by the redirect optimizer 108. The main window 400 can be presented to a user, the result of the invocation (for example, double click of the mouse) of an appropriate icon, button, list annotation, or Similary. The main window 400 can also be presented to a user in response to a network alarm. In an alarm invocation, a previously created session is started automatically and asynchronously. The window 416 of the main window 400 indicates which sessions are being executed by displaying the inverse video session line. The session line (not shown) contains at least one unique identifier for the session, and a corresponding plan name. There may be a plurality of sessions running with their own instance of the redirection determiner. A preferred embodiment may display additional information, such as a plan description, with the name of the plan on a line in window 416. The horizontal or vertical scroll bars are automatically displayed for window 416 where appropriate. The list of Algorithms 414 can be used to control the execution of the sessions appearing in the window 416. The session list 402 administers the sessions. Only the sessions that are administered during the common invocation of the redirect optimizer 108 appear in the window 416. The selection of the New option 404 allows a user to define a new session. The selection of the option Old 406 allows to use previously created or maintained sessions. The Exit 408 option allows you to terminate the redirect optimizer 108. The Help list 410 provides a help facility, and the Profile option 412 provides parameters that can be used to refine any default parameters, as well as the optimizer memory. redirection, operation, and the possibility of using the user interface.

Referring now to Figure 8, the window produced in response to the invocation of the New 404 option of Figure 7 is displayed. The user enters a plan name in the entry field of Plan Name 420, and enters a description optional in the entry field of Description of Plan 422. It is validated that the plan names are unique. Each session has a corresponding unique plan name. The successful completion of the window of Figure 8 produces Figure 9. Referring now to Figure 9, a labeled window is shown. The front label is highlighted, indicating which page is currently being viewed. At the beginning of each session, only the Problem Panorama label is enabled. All other tags are disabled. After the user successfully specifies an overview of the problem, the Problem Panorama tag is disabled, and other tags are enabled. The front label of Figure 9 is the Panorama label of Problem 424. Within a scrolling window 434, regions, divisions, and switches of a network appear. All this data is available from the switch data (Figure 28). The database 106 produced by the data granulator 104 is accessed. A region is a geographical set of the highest level of Divisions. A Division is a geographical set of switches. For example, a division may be the "Southeast" chain, which defines the switch division for the Southeast division of the United States in this way. In the same way, a region can be the "East" chain, which defines the eastern region of the United States in this way. A switch is preferably displayed as a string for its FSID (Field Switch Identifier), such as "DNG1". The user can select (ie, highlight) any items from the list in window 434, and keep them in a list in the scrollable window 436 with Add and Delete buttons. The insert and delete keys operate in an analogous manner. The selections of a division or region apply to all the switches of the same. The invocation (for example, double click of the mouse) of an item of the list in the sale 434, provides an extracted window (not shown), of additional details with respect to that article, for example, an associated location map. All the redirection circuit groups, which are manufactured by the data granulator 104 for all the switches that appear in the window 436, are displayed in the scrollable window 438. The list of redirection circuit group identifiers is available from of the redirection circuit group data (Figure 29). The selection of a switch in the list (mutually exclusive selection) of the window 436, automatically selects (enhances) all the redirection circuit groups of the window 438 that are associated with that switch. The invocation (for example, double click of the mouse) of an input of the window 436, refreshes all the groups of redirection circuits for that switch selected for the window 438 (the user may have deleted groups of redirection circuits from the window 438 ). The invoke of the Cancel button 439 goes back to the main window 400 of Figure 7, and no session is created. The invocation of the OK button 437 completes the specification of the problem panorama. The Delete button or the delete key can be used to remove the selected redirection circuit groups from window 438. Accordingly, a user has the ability to select groups of individual redirection circuits that will participate in the optimization of redirection The selection of the tag 426 produces Figure 10. Referring now to Figure 10, the main window for tailored entry of the redirection determiner is displayed. The user can specify the weighting coefficients of the cost function as a real number between 0 and 1, including for each Erlang of traffic in the window 500, and for each 1.6 kilometers of physical communication means between the switches and the points of presence in the window 502. The arrows up and down for the weighting coefficients of the function of the cost increase or decrease the value (for example, by .01), respectively. The user can enter a real number manually. At any time, the user can place or remove check marks, indicating in this way the use or non-use of the corresponding parameters. The labels of the base of the window are invokable for a particular subset window of input parameters. The labels 442, 444, 446, and 448 are enabled only when the corresponding verification mark is present. Subsequent removal of a check mark only disables the use of any associated data, but does not remove that data from the database 106. The 440 label demonstrates that the window of the General input parameters is displayed. A check mark in the Distance check mark box enables the Distance label 442, and enables the data for the Distance label 442. In a similar way, the check mark boxes for Diversity, address to avoid, and no redirection, enable the corresponding labels and window data for Diversity labels 444, and address to avoid 446, and not redirect 448, respectively. The small window 452 is activated by a Permutation Limit check mark, and provides a means for a maximum number of redirected circuit groups redirected for any particular solution by the redirection determiner 110. The small window 452 allows to press an arrow up or down to affect the value of it. Referring now to Figure 11, the distance parameters can be enabled. The scrolling window 454 exhibits the switches. Each field switch identifier is displayed with its corresponding maximum distance value. The user can specify a maximum distance for which the communications medium of the redirection group of circuits (for example, optical fiber) should not be exceeded if it were redirected to that switch. The user overwrites a value in the entry in the list, or you can blank it so that no limit is specified. The entry field 456 allows a user to specify a maximum distance of the physical medium for all the switches that have been selected in the window 454. The modified values are reflected in the window 454, when the user presses the ENTER key, while the 456 window has the focus. Invocation of an item from the list in window 454 provides an extracted window (not shown) for additional details of the switch that the communications means of the switch may include.

Referring now to Figure 12, the diversity parameters can be enabled. A user can click the Create New Diversity Group button 464, to create a named diversity group, keeping a name string for the group in an extracted window (not shown) that contains an entry field. Validation is performed so that the name is unique. When creating the name of the diversity group, the name appears in the list of names (created up to then) in the scrollable window 460. The redirection circuit groups are available in the scrolling window 458 to be added to a diversity group in the window 460. A diversity group name selected in the 460 window for the Add button press (or insert key), when the redirection circuit groups are selected in window 458, will receive the selected redirection circuit groups as members in that diversity group. These members will then appear in the scrollable window 462. The button Press or the delete key allows any selected entry to be deleted in windows 460 or 462. Different modalities allow a local copy to the redirect optimizer 108 to be deleted from a list of the circuit group of redirection displayed in window 458, or merely delete the group of redirection circuits from the choices of window 458. A group of specific diversity that each group of redirection circuits of the group must be redirected to different (mutually exclusive) switches . Referring now to Figure 13, the addresses to be avoided can be enabled. The redirection circuit groups are originally displayed in the scrollable window 466. The switches appear in the scrollable window 468. The user can specify the groups of redirection circuits that should not be redirected to a particular switch, by selecting a switch in the window 468, the selection of one or more redirection circuit groups in window 466, and pressing the Add button (or insert key). The groups of redirection circuits that are going to redirect to a particular switch will appear in the scrollable window 470. The window 470 will display all the redirection circuit groups that should not be redirected to a switch selected in a mutually exclusive way in the window 468. The press button or the delete key is used to delete the selected redirection circuit groups from window 470. Referring now to Figure 14, a user can select the groups of redirection circuits that should not be redirected. The redirection circuit groups appear in the scrolling window 472. The redirection circuit groups selected in the window 472 can be added (with the Add button or the insert key) to the list of the scrolling window 474 containing the groups of redirection circuits that should not be redirected. The groups of redirection circuits selected in window 474 can be suppressed (with the Delete button or the delete key) of those that are not going to be redirected. Referring now to Figure 15, the first window associated with the Network Information label / Switch 428 is displayed. The labels at the bottom of the window provide navigation to the windows to search subsets of parameters thereof. Figure 15 shows the group traffic data from redirection circuit to redirection circuit group originally maintained by data granulator 104. The data is presented to the user in a scrollable two-dimensional matrix spreadsheet inside the scrolling window, wherein the redirection circuit group group traffic data is displayed to redirection circuit group in each cell for a group stack of address and column circuits of particular redirection circuit groups. This data is available from the group traffic of redirection circuits to a group of redirection circuits (Figure 30). The data of the cells can be edited for the current session, since each session can keep its own snapshot of the database 106 about the creation of the plan. An alternative mode allows the data of the database 106 to be edited. The redirection circuit groups head the columns and rows of the array. Referring now to Figure 16, the distance data is shown in scrollable window 476. The data is presented to the user in a scrollable two-dimensional array spreadsheet form, which exhibits a value of address distance in each cell. Each distance value is the distance between a switch and the point of presence for a particular group of redirection circuits. These data are available from the Distance data (Figure 31). Each cell can be identified by the group row of redirection circuits and particular switch column. The data of the cells can be edited for the current session, since each session can keep its own snapshot of the database 106 about the creation of the session. An alternative embodiment allows the database 106 to be edited. The invocation of the Distance button exhibits a route map (not shown) between a given switch and the point of presence, which is associated with a given group of redirection circuits, as shown in FIG. identifies by the position of a cursor inside the window 476. Referring now to Figure 17, the data of Call Attempts in Occupied Hours (BHCA) are shown. The data is presented to the user in scrollable window 478 as a form of a dimensional matrix worksheet, where a value of Call Attempts in Occupied Hours is displayed in each cell for a group row of redirection and column circuits. group of particular redirection circuits. This data is available from the group traffic of redirection circuits to a group of redirection circuits (Figure 30). The data of the cells can be edited for the current session, since each session can keep its own snapshot of the database 106 about the creation of the session. An alternative mode allows the database 106 to be edited. The redirection circuit groups head the columns and rows of the array. As is true for all small windows, the small window 478 can be sized by a user to accommodate the desired viewing area within the dimensionable window of Figure 17. The scrolling window 480 provides the list of switches along with its limit of Call Attempts in corresponding Occupied Hours. These data are available from the data of the Switch (Figure 28). Referring now to Figure 18, the port data is displayed. The scrollable window 482 contains the redirection circuit groups with their corresponding number of circuits (ie, referred to as "lines" in the user interface). These data are available from the data of the redirection circuit group (Figure 29). The scrollable window 484 displays the switches with their corresponding number of ports. These data are available from the data of the Switch (Figure 28). The number of circuits and the number of ports can be editable values in different modalities. Another coefficient of the cost function, that is, a port equilibrium coefficient, is incorporated as a slide bar 504, where the user simply slides the bar to determine the coefficient of the appropriate real number. The actual value derived from the bar is displayed in the small input field window 506, which can also be modified directly or reflected according to the same in the bar. Referring now to Figure 19, a window is displayed to display the Transaction By Second data.

(TPS) of the redirection circuit group. The transaction data per second is presented to the user in a scrollable list window 486, where the transaction data per second is displayed on each line for a particular redirection group of circuits row. These data are available from the data of the redirection circuit group (Figure 29). The transaction data per second can be edited for the current session, since each session can maintain its own snapshot of the database 106 on the creation of the session. An alternative mode allows the database 106 to be edited. The scrolling window 488 provides the list of switches together with their corresponding transactions per second. These data are available from the data of the Switch (Figure 28). The values of the transactions per second can be edited to affect the data for the current session. An alternative mode allows the database 106 to be edited. Referring now to Figure 20 and Figure 21, the performance limitation parameters are enabled. The execution limitation parameters affect the execution of the redirection determiner 108, and include variables such as number of solutions, print detail, time out, checkpoint, performance statistics, depth of search, infeasibility and impatient logic, as described later herein. Referring in particular to the window of Figure 20, the output parameters of the redirection determiner 110 are maintained in it. The Algorithm Output Parameter tag 430 makes the user navigate to the window of Figure 20. Each window girl is an input field whose value can be affected by pressing a mouse button, an arrow up and down as shown. The Number of Solutions set in window 490 allows a user to specify how many solutions to calculate. For example, if the value of the 490 window is set to 5, then the best 5 solutions are presented to the user, with the best ones minimizing the cost of the redirection according to the function of the cost (subject to limitations). . The Detailed Level for Printing set in window 492, allows you to set a verbosity level of solution printing. The Time Out Parameter set in window 494 allows a user to specify in seconds a maximum time value for which the user is willing to tolerate the execution of redirection determiner 110. A user may have specified an overview of the problem that takes a long time. time to perform the calculations. A stopwatch thread is stretched according to the above, and asynchronously with, and at the beginning of, the processing of the redirection determiner 110. The expiration of the stopwatch thread after the redirection determiner 108 terminates does not cause any action . The expiration of the stopwatch thread before the redirection determiner 110 terminates causes the stopwatch thread to terminate prematurely the execution of the redirection determiner 110. The checkpoint time set in the window 496 allows to establish a renewed value for which the file of a resulting solution will be refreshed by the redirection determiner 110. Referring now to Figure 21, a window is displayed that appears as the result of selecting the Algorithm Control Parameters tag 432. The check mark box 498 indicates that the statistical performance data for this particular session will be appended to a special functioning statistical file. Here start / end timestamp of the logical points are produced in the redirecting determiner 110. A search depth data value can be provided to the window 508. This limits the number of combination permutations that can be performed. a first search for a deep solution. The Type of Standard for the Infeasibility Estimate specified in window 510, identifies the numerical code of the infeasibility calculation method. There are two kinds. MAX_N0RM (that is, code 1) calculates the global infeasibility as a maximum deficit for all limitations. SUM_NORM (that is, code 2) calculates the global infeasibility as a sum of all deficits for all limitations. The check mark box 512 having a check mark indicates that the enumeration procedure (p, k) (described below) must be completed, and the next attempted iteration, as soon as the cost of a feasible solution is lower than the cost of the best solution until then. Windows 508 and 510 have associated up and down arrows to affect any value in their corresponding windows. Referring again to Figure 7, if a user invokes the Old action 406, then Figure 22 results. Referring now to Figure 22, a window with a scrolling window containing information for all previously known known sessions is shown. till the date. The line entries contained in the preference window appear in an order selected by date / time with the most recent session at the top. In an alternative mode, the name of a single plan can appear multiple times for sessions executed multiple times with different limitations. The columns of Password, Date / Time, Program Code, Session Status, Plan Name, and Number are defined as the following: the unique enumeration automatically generated for a session (a handle for the session), the stamp of date / time for the execution time of the session, any error code associated with the execution of the session, a state indicating the state of the session, such as if the redirection determiner 110 is still running or not, the name of the plan, and the number of solutions, respectively. The Key column, as shown, is preferably a stable column continuously displayed for all data displaced in the other columns. You can also display other criteria (in the scrolling area) about the sessions. The data fields in Figure 22 are protected from the user's edition. Suppress Session 522 button, will delete any selected sessions. If the Display Entry 518 button is pressed for a selected session that was previously running, it is allowed to transpose to a corresponding search mode (read only) of Figure 9, and the subsequent processing as described above in this . The button Press Visual Display Entry 518 for a selected session that was not previously running allows transposing to a corresponding vision mode of Figure 9, and the subsequent processing. A copy operator, implemented with an immediate key recognized by the processing of the Figure 22, is provided to copy a session to a new session. When invoking the copying of a selected session, the user is presented with the window of Figure 8, and the subsequent processing of the window as described above. The data enters by default in the windows of the user interface according to the data of the session from which it was copied. The invocation of a session entry (for example double click of the mouse) in the list of Figure 22 activates a search window for an intermediate form of input data, which is transported to the redirection determiner 108, and is maintained in memory and / or in the file for the session. An immediate key is provided to return from the search mode back to Figure 22. The intermediate entry form of preference is a flat file manufactured from the data specified in the user interface windows as described above. '.e in the present. Figures 23 to 25 represent a listing of three contiguous pages, in order of respective page, of a real example of the intermediate form of entry from a particular session. The intermediate input data is easily recognizable by a user familiar with the operation and the internal parts of the redirecting determiner 110. The Exiibir Solutions button 520, for a selected session, produces the "entana of Figure 27A. key support to the window of Figure 22, so that you can start (Run) a selected session, and finish (Stop) it. Referring now to Figure 26, the main window 400 is displayed with the list exposed for the Algorithm option The selections of Display Entry and Display Solutions are equivalent to buttons 518, and 520, respectively, of Figure 22, when applied to the selection d * any session done inside the window 416. The Execute and Stop options applied to the selections within window 416 behave in a similar way: On Use Run or Stop, Figure 22 is displayed for the session. with the corresponding state displayed on it. The Execute dt option will start the redirection determiner 110, and the Stop option will terminate the redirection determiner 110 at the next iteration. The redirection determiner 110 will end by itself at the normal termination, and a state is found in the window shown < -n Figure 22. Referring now to Figure 27A, a list of solutions for a session is displayed. Figure 27A is displayed as the result of pressing the button 520 for a selected terp session selected in Figure 22. All fields in Figure 27A are read only, and an active cursor in one field allows horizontal scrolling. The field of Title 530 is equal to the Key data of Figure 22. The name box of Plan 532 is equal to the name of Plan 420 of Figure 8. The field of Description 534 is equal to The Description of the Plan 422 of Figure 8. The Program field 525 is the name of the executable program line of the redirection detergent 110. The Date / Time field 538 is a date / time stamp of when the scenario was presented of the problem i for its execution (that is, Execute). The State field 540 is equal to the State of the Session of Figure 22. The field of Number of Solutions 542, is the number of solutions that appear in window 546. The Total Traffic field 544, or the total traffic for the panorama of the problem. All the solutions appear as individual rows in the scrollable window 546. "Each row contains at least 5 columns of data: Solution Number, Cost, Inter-machine trunk traffic, intra-switch traffic, and permutations are defined as: a unique enumeration generated by the system for the particular solution, the cost according to the cost function, the total inter-machine trunk traffic, e ?. total traffic intra-switches, and the number of redirects used by the solution, respectively. Immediate keys are provided for selecting rows in window 546. A selection can be made on any column of window 546. The Apply 550 button allows a user to automatically execute a selected plan for a connected network. Immediate key support is provided to print a selected solution in window 546, with the use of the hard copy formatter. The invocation of the Visual Display button 548 for a solution selected in window 546, produces a detailed description of the solution. In one mode, a searchable plain file listing (read only) is produced. For example, invoking button 548 on a selected session produces a search mode on the plain file, such as that described in Figures 27B to 27F. An immediate key is provided to return from the search mode back to Figure 27A. Now with reference to Figures 27B to 27F, a real solution detail search format is shown. Figures 27B to 27F comprise a single listing of information on a contiguous page, respectively. Turning to a particular to Figure 27B, a list of field switch identifier 552, of the switches involved in the problem overview, is displayed. Subsequently, a list of redirection 554 circuit groups involved in the problem scenario is also displayed. Each triple redirection circuit group is displayed in the list of redirection circuit groups 554, followed by the number of circuits contained therein. The list of redirection circuit groups 554 goes ahead in Figure 27C. Turning now to Figure 27C, the cost function weighting coefficients 556 are displayed. With them, the original cost value 558 is displayed, which represents the cost of the original allocation vector. Turning now to Figure 27D, the current redirection assignment solution values (before redirection optimization) are displayed, including a total traffic value of service area in row to service area in row 560, a total value of inter-machine trunk traffic 562 (traffic expressed in Central Call Sends) for all inter-machine trunk traffic, a total intra-switch 564 traffic value, and the interrupt traffic value line by switches 566 for each switch in the problem scenario, a number of ports and the utilization percentage values of ports 568 for each switch in the problem scenario, the average (average) port utilization value 570 for port utilization, and the dispersion measurement value 572, which is a numerical characteristic of the manner in which the use of ports is distributed evenly between the switches. Solution number 574 is equal to the data value of the Solution Number column in window 546 of Figure 27A. A list of redirection circuit groups 576 (see Figures 27D and 27E) provides the solution redirection information. The first three columns of the list (Field Switch Identifier, Service area, and Type) form a group of redirection circuits. The next column is a number of circuits per group of redirection circuits. The last column indicates (if necessary) whether a group of redirection circuits will be redirected to a particular switch, for the particular solution. For example, instruction 578 indicates that the group of redirection circuits DNG2-DESMIADT18T-AO must be redirected to a switch DNG1. Turning now to Figure 27F, the main parameters of this solution are displayed: the standard cost value 580, the cost gain 582 with respect to an original assignment (the standardized cost of the original assignment 1), the number of redirects 584, a total traffic value of inter-machine trunks 588, a total intra-switch traffic value 590, intra-switch traffic values 592 for each switch, a number of ports, and the percentage values of use of port 594 for each switch, average (average) port usage 596, and dispersion measurement of port 598 usage. The 598 and 590 values are aggregated to a total traffic value from service area to service area 586. The graphical user interface data and the raw data are merged into the intermediate input data before the execution of the redirection determiner 110. Different modalities will save the data on the disk at appropriate times throughout the interaction of the user interface. The data manufactured by the data granulator 104 is raw data to be filled in the user's graphical interface. In one mode, the graphical user interface can be used to affect your own local copy of the data. In an alternative embodiment, the graphical interface of the user ee may be used to affect the copy maintained in the database 106. Referring now to Figures 28 to 31, the results produced by a preferred mode of the data granulator 104 are shown as table. The data granulator 104 creates at least four database tables, the Switch data, the Redirection Circuit Group data, the Redirect Circuit Group Traffic data to the Redirect Circuit Group, and the data from Distance, tables can be incorporated as plain files, or as standardized Standard Question Language (SQL) database tables. Referring to the Switch data of Figure 28, each record contains eight primary fields. The fields are explained by themselves. The 599E field is formed of 24 records for each hour of the day. Referring to the data of the redirection circuit group of Figure 29, each record contains seven primary fields. The fields are explained by themselves. Field 599A is formed of 24 records for each hour of daily traffic (three fields each). Referring to the group traffic data of redirection circuits to redirection circuit group of Figure 30, each record contains six primary fields.

A redirection circuit group identifier is the unique identifier generated by the system for a particular redirection circuit group. The identification of the redirection circuit group is attached to a record in the redirection circuit group data of Figure 29. Those skilled in the art will appreciate other methods for normalizing the data in the 106 database. The fields are explained for themselves. CCS is an acronym for Central Call Seconds. Specifically, a CCS is equivalent to one hundred seconds of telephone conversation. Field 599B is formed of 24 registers for each hour of daily traffic (three fields each). Referring to the Distance data of Figure 31, each record contains three fields. The fields are explained by themselves. A working implementation of a preferred mode of data granulator 104 has shown that, for the entire current MCI network, the switch file is approximately 100 records, the redirection circuit group file is between 3,000 and 4,000 records, the distance file is between 300,000 and 400,000 records, and the Redirection Circuit Group Traffic data to Redirect Circuit Group is around 2 to 3 million records. Referring now to Figures 32 to 34, data flow diagrams are shown. Figures 32 to 34 demonstrate a preferred embodiment of the data granulator 104 for the automatic production of data in the database 106 of Figures 1 and 2, as well as the data of Figures 28 to 31. In this particular embodiment, the data are manufactured from an authentic MCI network according to the redirection circuit group division example, as described hereinabove. The disk icons in Figures 32 through 34 represent data files or databases. The rectangular icons of Figures 32 to 34 contain step numbers therein, and represent the processing streams. The lines between the icons show a direction of the data flow. The enumeration of the steps indicates an order in which the data granulator 104 operates. The data granulator can be a single spun data processing system, wherein the steps are presented in a synchronized manner, one after the other . The data granulator can also be multi-threaded, where there are a plurality of threads running simultaneously for each step. Each thread is easily synchronized in an appropriate way with traffic lights to enforce the correct order of processing. A thread can be a process in itself, or it can arise from a process. The data granulator wires 104 may be executed on the same hardware, or on hardware connected to the communication network. This allows to distribute the data processing system of the data granulator 104 through as many machines as required to maximize the operation. The number of steps indicates the interface to synchronize the independent execution threads, in which case the order of execution may not be important, except at the interfaces of the steps. Temporary files shown in the Figures can be incorporated as data written to a persistent storage device, such as a hard disk drive, or the data can be written to the processor memory. Referring now to all of the flow chart figures, from Figure 35 onwards, the flow diagrams of the process of the present invention. Processing error is assumed in order to focus on the important aspects of the present invention. Referring again to Figure 32, the steps involved in the manufacture of data of redirection circuit groups 820J (Figure 29), and in the group traffic of redirection circuit group to redirection circuit group 820M ( Figure 30). In accordance with the present invention, the data collection shown in Figure 32 uses the following information sources from an actual MCI network: File Descriptor of Trunk Group 820A (TGDF) - is used to recover the directionality and the TUI (Identifier of Use of Trunk) of a trunk, Fields accessed from there include: Position Field Name Length Representation Description 001 FSID 4 Character Switch identifier 005 TRK Character Trunk Number 017 TRKCLASS 1 Character Trunk class 020 TRAF_DIR 1 Character D i r e c c t i n e Traffic 234 TUI 4 Character Trunk usage identifier Final Office Data RTE7, 820B (R7 EO) - is used to retrieve a service area identification for a given final office. The file for the final route office 7 provides information about the address relationships on the traffic origin side. The field that can be accessed from there include: Position Field Name Length Representation Description 001 ENDOFC 1 1 Character Identification of common language location of Final Office 015 SERVAREA 1 1 Character Identification of common language location of Service Area Data of service area RTE7 820C (R7 SA) - is used to recover a Switch, where termination traffic travels for a given termination service area and an originating Switch. The field that is accessible from there include: P Poossiicciioonn Noommbbrree ddeell CCaammppoo LLoonnggiittuudd Representation Description 001 SERVAREA 1 1 CCaarráácctteerr Identification of common language location of service area (SA) 020 FORSWIT 4 Character Source switch 024 HOMESWIT 4 Character Address switch in this service area. Point-to-Point Data NTAS, 820D (PTP) - contains traffic information between local trunks routed to a particular switch, and the service area on the terminating side. Fields accessed from there include: Position Field Name Length Representation Description 005 SWITCH Character Switch identifier 009 TRK 3 DDeecciimmaall eemmppaaccaaddoo Trunk number 012 SERVAREA 1 1 CCaarráácctteerr Identification of location of common language of service area 050 TRKCLS 1 Numeric Trunk class 0 05533 ((BB11 - BB2244)) ((PPDD44 .. ++ 99)) D Deecciimmaall eemmppaaccaa-Attempts to do so called blocked 057 (01 -024) (PD4. +9) Decimal packs Sado call as a whole lida by pulses Attempts 061 (C 1 -C24) (PD5.2 + 9) Decimal packs- Seconds of do together call central 371 TOT_CCS PD7.2 Packed decimal S e g u n d s of total central calls. SCOTS circuit data, 820E (Circuits), and data from SCOTS Node, 820F (Nodes) - are used to retrieve the distant-end common language location identification code for a given Switch trunk. Fields accessed from there include: Circuit Data SCOT 820E: Position Field Name Length Representation Description 001 CCT_NBR 12 Character Identification of the MCI Circuit ' 073 TERMINAL D2 3 Character Point of Presence 076 CNTL_TRUNK_NBR 4 Character Trunk number 132 SWITCH 4 Character Switch identifier Node Data SCOT 820F Position Field Name Length Representation Description 001 NTWK_NODE_ID 3 Character Node of the network 082 CLLI CD 1 1 Character C or d i g or d identification of common language localization of this node 093 Division Character Division identifier 094 Retention Character Identifier 097 TERM ID DEF Terminal Character DPUR 820L data - contains the number of circuits per trunk of the Switch. Fields accessed from there include: Position Canine Name Length Renresent; Iition Description 001 SWITCH 4 Character Switch identifier 006 TRUNK 4 Character Trunk number 014 #_of_ckt 5 Character # of circuits Other telecommunication networks will contain similar data that may be used by the present invention to build redirection circuit group data 820J (FIG. 29) and redirection circuit group traffic data to redirection circuit group 820M (FIG. 30) . Referring now to Figure 35 in association with step 1 of Figure 32, ee creates a table with the fields: Switch, Trunk, Circuit prefix, and Identification Code for the Common Language Localization of Distant End. Processing begins with block 600, and continues to block 602, where SCOTs 82OE circuit data is accessed. Subsequently, block 604 selects the registers with the field: Switch, CNTL_TRUNK_NBR, circuit prefix (1-2 bytee of CCT_NBR), and node identification (6-8 bytee of CCT_NBR). CNTL_TRUNK_NBR is the identifier of the trunk. CCT_NBR is the identifier of the circuit. Block 604 flows to block 606, where all registers are selected using the [Switch, CNTL_TRUNK_NBR, circuit prefix, node identifier] key, and then block 608, where all duplicate registers are removed. A key in the form [Kl, K2, ... Kn] implies that Ki is more primary than Kj for i <; j. Processing continues until block 610, where Switch and CNTL_TRUNK_NBR are validated to uniquely identify the circuit prefix and the node identifier. If the validation shows that this is not true. it's true, the data granulator 104 will report the error and it will end. Block 610 continues to block 612, where registers are selected by node identifier, and maintained as an accessible table. Subsequently, block 614 gives access to the data of the SCOTS node 820F, and block 616 selects the records thereof with the fields NTWK_NODE_ID and CLLI_CD. NTWK_NODE_ID is an identifier of the node of the network, for example, the location of the switch, row, final office, and so on. CLLI_CD is the common language location identifier code for the equipment. Block 616 flows to block 618, where registers are selected by NTWK_NODE_ID. Subsequently, block 620 complements this accessible table with CLLI_CD using the identifier of the node as a key, and leaving the field of the identifier of the node. The result is a table from step 1 with the fields Switch, Trunk, circuit prefix, and CLLI__CD. Block 620 continues to block 622, which selects the records in the table in step 1 with the key [Switch, Trunk], and terminates processing in block 624. Referring now to Figure 36 in association with the pao 2 of Figure 32, the processing of step 2 begins at block 630, and continues to block 632, which has access to a Descriptor File of Trunk Group 820A (TGDF) from the system of traffic analysis of the network . The Trunk Group Descriptor File provides directionality and the TUI for a trunk. Block 634 selects the records there, with the fields FSID (Switch), TRK (Trunk), TRKCLASS, TRAF_DIR and TUI. FSID is the identifier of the switch. TRK is the identifier of the trunk. TRKCLASS is defined as: 1 = IMT 2 = FX (Feature Group Trunk) 3 = WATS 4 = DAL (Hardwire) 5 = FXI (International Trunks) TRAF_DIR is the traffic direction ('A' for access, 'T 'for the termination,' B 'for bidirectional). Block 634 continues to block 636, which selects records with the key [FSID, TRK] and keeps the records as a table from step 2. Processing ends block 638.

Referring now to Figure 37 in association with pause 3 of Figure 32, the processing of step 3 begins at block 640, continues to block 642 that merges the table from step 1 with the table from step 2 by coupling Switch and Trunk, and terminates in block 644. The result is a table from step 3 with records that have the fields Switch, Trunk, Circuit Prefix, Identification Code for Distant-End Common Language Location, TRKCLS, DIR, and TUI. Referring now to FIG. 38 in association with step 4 of FIG. 32, the pairing table 3 is supplemented with the identification of the service area and the type of redirection circuit group. The identification of the service area is the common language location identification code of the local row that represents the Service Area, or the identifier of the HW chain. The result of step 4 is a temporary 1 82OG file, with the fields Switch, Trunk, Circuit Prefix, Identification Code for Common-End Location Language, TRKCLS, DIR, TUI, Service Area identifier, and type of group of redirection circuits. The processing of step 4 starts in block 650, and continues to block 652, which gives access to a record from the table in step 3. Block 652 defines the upper part of an iterative cycle described later herein. If in block 654 it is determined that the last record has been processed, then processing ends in block 676. If in block 654 there is a remaining record to be processed, block 656 verifies the current record, to determine ei ee a trunk of group of characteristics. If in block 656 the record is not a feature group trunk, block 658 checks the current record to determine if it is a direct access trunk. If in block 658 the trunk is not a direct access trunk trunk, the processing flows back to block 652 for another iteration. Referring again to block 656, if the current region is a trunk of a character group, then processing continues to block 664. If in block 664, the far end of the register is a local row (ie, the second byte) of the circuit prefix = 'T'), then the table in step 3 is complemented in block 666 with a service area identification field equal to the CLLI remote end code. Subsequently, if in block 670, the Distant End is a local row, and the traffic direction is the access (A) and the TUI is DT or DTCP (DT and DTCP identify the trunks in row of the Characteristic Group D. Lae DT trunks go through a regular MCI terminal, and the DTCP trunks go through a closed presence point), then the group type of redirection circuits = Row Access (TA) in block 672, and processing it continues back to block 652. If in block 670, the condition is not true, then the group type of redirection circuits = All Others (AO) in block 674 and processing continues to block 652. Doing again reference to block 664, if the far end is not a local row, then block 668 has access to the final office data of Route 7 820B (R7 EO). Data from the Final Office of Route 7 820B of interest include ENDOFC (CLLI Code of the Final Office), and SERVAREA (CLLI Code of Service Area). Block 668 complements the table in step 3 with the identification of the service area, matching the CLLI code of the far end of the current record. Subsequently, block 668 flows to block 670 that was described. Referring again to block 658, if the record of the table in current step 3 is a DAL trunk, then block 660 complements the table in step 3 with the identification of the service area established in the string "xxxxDALTERM", such that "xxxx" is the identifier of the Switch. Subsequently, block 662 establishes the type of redirection circuit group in the hard wire (HW), and the processing flows back to block 652 for another iteration. Referring now to Figure 39 in association with step 5 of Figure 32, he has access to the NTAS 820D Point-to-Point data (PTP). The processing of step 5 starts at block 680, and continues to block 682, which selects the records from the point-to-point data that the fields have (Switch, Trunk, TRKCLS on the origin side, Service area). on the termination side, and Traffic (Traffic is really set of 24 CCS members, blocked call attempt and pushed out, as well as total CCS.) Block 682 continues to block 684, where records are selected by Switch and Trunk to a table of step 5. The processing of step 5 then terminates block 686. Referring now to Figure 40 in association with step 6 of Figure 32, the table in step 5 is supplemented with the identification of the service area and Redirecting Group Type on the originating side (FX and DAL trunks), and the Redirecting Circuit Group Type and Switch on the terminating side.The process of step 6 begins at the block 690. Block 690 flows to block 691, which verifies the registers to determine a trunk of the group of characteristics. If block 691 a register is not a feature group trunk, block 691 continues to block 693. If block 693 the trunk is not a DAL trunk, processing flows to block 694, which retrieves the switch in the termination side from the data Service Area of Route 7 820C (R7 S) using the identification of the service area on the termination side, and the Switch on the originating side (foreign exchange) as a key. Subsequently, the processing continues to block 696. If block 696, the identification of the service area on the terminating side is not equal to xxxxDALTERM, then block 697 sets the type of redirection circuit group on the terminating side in AO, and block 699 ends processing. If block 696 the identification of the service area on the termination side is equal to xxxxDALTERM, then block 698 sets the type of redirection circuit group on the termination side for HW, and blog 699 terminates processing. Referring again to block 691, if a region is a trunk of feature group, then processing continues to block 692 to retrieve the identification of the service area and the type of redirection circuit group on the originating side from the temporary file 1, using the Switch and Trunk as the key. Block 692 flows to block 694 that has already been described. Referring again to block 693, if a register is a DAL trunk, then block 695 establishes the identification of the service area in xxxxDALTERM and sets the type of redirection circuit group in HW. Processing continues from there to block 694, which has already been described. The result of step 6 is a temporary file 2 820H, with the fields Switch, Trunk, Service Area Identification, Group Type of Redirecting Circuits, TRKCLS on the originating side, switch, service area identification, type of group of redirection circuits on the termination side, and traffic data. Each record of the temporary file 2 820H includes information about the traffic between the redirection circuit groups on the origin and termination sides. The summary procedures in the temporary file 2 820H allow to create data of the group of redirection circuits and traffic data of redirection circuit group and group of redirection circuits. Referring now to Figure 41 in connection with paragraph 7 of Figure 32, the temporary file 2 820H is to be summarized at a granularity level of the group of redirection circuits in order to create the data of the group of redirection circuits 820J. The processing of step 7 begins in block 700, which proceeds to block 702 to select records from temporary file 2, 820H with the identification of the non-empty service area. Processing continues until block 704, which then selects the Switch, Trunk, Service Area Identification fields, Redirect Circuit Group type on the source side from these registers, and then to block 706 for storage the four field records, respectively, using the four fields as a key. Subsequently, the block >; e 708 eliminates duplicate records. The processing continued until block 710, where each record of four fields obtained until then is complemented with the number < circuits from the DPUR data, using the Trigger and the Trunk as the key. Block 710 flows to block 712, which selects registers per switch-service area and redirect circuit group type. Then, block 714 summarizes the circuit number for all registers having the same triple redirect circuit group (ie, [Switch, Service Area, Redirect Circuit Group Type]). Block 714 continues to block 716 to supplement each register with a redirection circuit group code (i.e., identifier), using the sequence number of each register as the numerical identifier of the redirection circuit group. Then processing stops block 718. At this point, the creation of the redirection circuit group data 820J is almost complete. The data for the remaining fields will be determined in step 9. Referring now to Figure 42 in association with step 8 of Figure 32, the traffic information from the temporary file 2 820H is summarized on a group granularity level from redirection circuit to group of redirection circuits. The processing of step 8 begins in block 720, and continues until block 722, which selects the records of the temporary file 2 820H by groups of redirection circuits of origin and termination. Block 722 continues to block 724, which summarizes the traffic data for all registers having the same pair of source and terminating redirection circuit groups. As a result, a temporary 3 820K file is created with the fields Switch, Service Area Identification, Type of Redirection Circuit Group on the originating side, Switch, Service Area Identification, Group Type of Redirection Circuits in the termination side, and traffic. The processing then ends in block 726. Referring now to Figure 43 in association with step 9 of Figure 32, calculations are made for each group of redirection circuits, i.e., an amount of access and call attempts of exit, and CCS for each hour of a 24-hour day, and TPS. The list of redirection circuit groups in step 7 is supplemented. Block 730 begins processing for step 9, and flows to block 732, where outward impulse call attempts are summarized (sets O1-024 , prefix O for outward impulse) (Outpulsed, for its acronym in English), and CCS (set C1-C24, prefix C for CCS) for all records of the temporary file 3, with a group of redirection circuits of origin . This obtains a number of access call attempts (x24 hours) and CCS (x24 hours) for a given group of redirection circuits. Block 732 continues to block 734, where the summary is made for the attempts to call the output pulse not blocked (difference of the vector between 01-024 and B1-B24, prefix B for blocked call attempts) for all records of the temporary file 3 82OK with a group of redirection circuits of termination given (the termination redirection group of circuits is identified by Switch, Service Area Identification, and Type of Redirection Circuit Group on the termination side) . This obtains a total egress traffic for a group of given redirection circuits. Then block 736 calculates the TPS resource using the formula: TPS = (BHCA * 0.70 * 1.5) /3.600 where BHCA is a maximum over 24 hours of access call attempts, 0.70 = percentage of calls contributing to the TPS (Access BHCA), 1.5 = Peak Factor. Finally, the processing of step 9 terminates block 738. As a result, the data of redirection circuit group 820J has been created (Figure 29).

Referring now to Figure 44 in association with pairing 10 of Figure 32, the redirection group of circuits group traffic data is created to 820M redirection circuit group. The processing of step 10 begins at block 740, and flows to block 742 to complement the records of temporary file 3 820K from step 8 with the code of the redirection source group and the redirection group of circuits. of termination, using the list of redirection circuit groups from step 7, and the Switch-Service Area-Type of Redirect Circuit Group as a key. Block 742 then continues to block 744 to select the registers having both originating and terminating redirection circuit group codes, and calculates an average CCS per hour (the sum of all CCS of the set divided by 24). The processing of step 10 ends with block 746. As a result, the Group Traffic Data of Redirection Circuits to 820M Redirection Circuit Groups has been created (Figure 30). With reference to Figure 33, they are demonstrated in the steps involved in the fabrication of data from the 820N Switch (Figure 28). In accordance with the present invention, the data collection shown in Figure 33 uses the following information sources from a real MCI network.

The NTAS 82OP Trunk Group Statistics File (TGSF) - contains the traffic information for each Switch and Trunk, and is used to estimate a total number of call attempts per Switch. Fields accessed from there include: Position Field Name Length Representation Description 005 SWITCH Character Switch Identification 009 TRK Decimal packed Trunk number 012 DIR Character D i r e c ction of Traffic 063 (VC 1-VC24) (PD4.0 + 22) Decimal packed Attempts to set valid call 067 (BC 1 -BC24) (PD4.0 + 22) Decimal packed Attempts to set call blocked. The switch data of the 820Q-ee switch is used as a source of switch resource information, including the number of ports, BHCA, and TPS limits. Fields accessed from there include Switch Identification, Switch Type, BHCA Limits, TPS Limits, and Port Limits. Other telecommunication networks will contain similar data that can be used by the present invention to build the data of the 820N switch (Figure 28). Referring now to Figure 45 in association with step 1 of Figure 33, block 750 initiates the processing of step 1, block 752 summarizes the number of circuits from DPUR 82OL data at the level of a switch. Subsequently, block 753 retrieves the division information and the switch region from the data of the SCOTS 82OF node. The switches can be identified as belonging to these geographic organizations. The actual MCI data in the data of the SCOTS 820F node currently includes 8 divisions (NE - Northeast, MA - Middle Atlantic, MW - Midwest, SE - Southeast, SW - Southwest, WE - West, PA - Pacific, IT - International) and 3 regions (E - East, C - Central, W - West). Block 753 continues to block 754 which terminates the processing of step 1. Referring now to 46 in association with step 2 of Figure 33, block 756 initiates processing of step 2, and block 758 summarizes the number of circuits and the total number of call attempts (access and egress) for each hour of a 24-hour day, from the data of the group of redirection circuits 820J to the level of a switch, taking into account that all attempts Calling intra-switches are counted twice. Then blog 754 ends the processing of step 2. Referring now to Figure 47 in connection with step 3 of Figure 33, blog 762 initiates the processing of step 3, and block 764 estimates for each switch a number of intra-switch call attempts, which involves selecting the traffic data records of the redirection circuit group to the circuit group of 820M redirect that have a given switch, both on the source and termination side, and then call attempts for these registers are summarized. Then block 766 terminates the processing of step 3. Referring now to Figure 48 in association with step 4 of Figure 33, block 768 initiates the processing of step 4 and block 770 estimates a number of call attempts of group of redirection circuits to group of redirection circuits that originates and / or ends in a given commutator. This includes subtracting from the number of call attempts that we calculated in step 2, a number of call attempts that we computed in step 3. Therefore, a number of call attempts are obtained from group circuits from redirection to group of redirection circuits (for 24 hours) that originated and / or ended at a given switch. Then block 772 ends the processing of step 4. Referring now to Figure 49 in association with step 5 of Figure 33, block 774 initiates processing of step 5, and block 776 selects a list of identification snapshots. of switches and resource limits (number of ports, BHCA and TPS) from the 82OQ Switch Limits data. Then block 778 ends the processing of step 5. Referring now to Figure 50 in association with step 6 of Figure 33, the records from step 5 are supplemented by information about resources (Number of ports and BHCA) available for traffic related to the group of redirection circuits. The processing of step 6 starts in block 780, and continues to block 782, where the number of ports available for the group of redirection circuits is calculated with the following procedure: Estimation for any given switch: A = total number of circuits in use for a given switch (step 1 of Figure 33); B = number of circuits of all redirecting circuit groups for a given switch (step 2 of Figure 33); C = the difference A-B ee the number of ports used by trunks that are not FX and are not DAL; D = total number of ports (from the Switch Limits file); D-C = number of ports available for redirection circuit groups (FX and DAL traffic). Block 782 flows to block 784, where processing begins to calculate the available BHCA resources for the traffic of the redirection circuit groups, taking into account not only the access traffic originating from a given switch, but also the egress traffic for any given switch (both the BHCA resources for access traffic and for egress). For any given switch, traffic can be subdivided into four parts: Inter-Traffic Access Switches - traffic that is originated from a given switch, and ends at another switch; Inter-Traffic Exit Switches - traffic that originates from another switch, and ends in the service area that goes to a given switch; Intra-Switch Traffic - traffic that originates from the service area that is routed to a given switch, and that ends in the service area that goes to the same switch; and Traffic IMT Traffic (for a given switch) -traffic that originates and terminates in the service areas that are not routed to the given switch. These types of traffic use a BHCA switch resource. The example of a group of redirection circuits of three types described involves focusing on Inter-Switch and Intra-Switch traffic. This characterizes the traffic that originates and / or terminates in the groups of redirection circuits. Block 784 selects those TGSF registers (820P) having a given Switch and DIR = 1. Then, block 786 summarizes the call attempts for each hour of a 24-hour day. Subsequently, block 788 subtracts from the number of calls attempts a number of call attempts related to the redirection circuit groups that we calculated in step 4. The difference will be a quantity of traffic that is not redirection circuit groups ( set x24 hours). Then blog 788 flows to block 790 to estimate a BHCA resource available for group redirection circuit traffic (set x24 hours) as a difference between a switch resource limit on BHCA (from step 5), and Call attempts other than from the redirection circuit group (from block 788). Then the processing of step 6 in block 792 ends. As a result, the data of Switch 820N has been created (Figure 28). Referring now to Figure 34, the step involved in making the Distance data of Figure 31 is demonstrated. In accordance with the present invention, the data collection shown in Figure 34 uses the following sources of information from of a real MCI network: Distance data MECCA 820R - used to recover the mileage of the shortest route between any given pair Position Field Name Length Representation Description 001 STN1 6 Character Identification of station 1 007 STN2 Character Identification of the station 2. 013 MILEAGE 5. 1 Numeric Mileage Other telecommunication networks will contain similar data that can be used by the present invention to construct the distance data (Figure 31). Referring now to Figure 51 in association with step 1 of Figure 34, relevant information is removed from the switch and the circuit from SCOTS for a given switch name (FSID) and redirection circuit group identification. You have access to the data of the MECCA 820R distance to find a shorter mileage in any given city pair. Block 800 initiates processing in step 1, and continues to block 802, which has access to the data of the SCOTS node 820F to retrieve a station identification (terminal) for a given switch name, and an identification of the node. Network for a CLLI code in a row for a group of given redirection circuits. Subsequently, block 804 has access to the SCOTS 820E circuit data to find all the circuits that use the node identification as a distant end, and selects the point of presence information (identification of the station where the point of contact is located). presence). Then, block 806 creates a list of city pairs (terminal-Point of Presence) for a given switch and group of redirection circuits. Block 806 also attaches this information with the mileage data from the MECCA mileage data. Block 806 continues to block 808, where the record with the shortest mileage is recovered. Block 810 terminates processing, and as a result, the distance data has been created (Figure 31) for a given switch and group of redirection circuits. Turning now to Figure 52, the flow chart for the EUI unit 114 is demonstrated. Due to the general nature of the Redirection Determinator (RR) 110, as will be described in Figures 53 to 55A-D, any type of net. The EUI and the associated data preparation processing is the specific area for a particular application. Block 830 starts processing for the unit EUI 110, and the preparation of associated data for a telecommunications network, as described hereinabove. Block 830 continues to block 832, where the graphical interface of the user is invoked, and to block 848. Block 848 initializes the administration variables of EUI, and any values that may be defaulted in different windows of the interface of the user. Block 848 also constructs tables that map switch names and redirection circuit groups into internalized numeric reference numbers, which are used in an input structure of the Redirection Determinator and vector assignments. Subsequently, block 866 waits for the user's action on the real property of the user's graphical interface, as described in Figures 7 to 27F. The obvious processing for navigation and error handling associated with FIGS. 7 to 27F is omitted, instead of focusing on the important elements of the present invention. When the action of the user is detected, processing continues to block 849. If in block 849, the user has already executed the Redirection Determinator, and selects to apply a solution found, for example, by invoking the Apply 550 button of the Figure 27A, then processing continues to block 867, where the solution is automatically applied to the telecommunication network administration interfaces. Then block 867 flows back to block 866. If in block 849, the user did not choose to apply an optimized redirection solution, processing flows to block 850. If block 850 is selected a New Session option, such like that found in the list in Figure 7, block 834 asks the user for a valid plan name. Block 834 corresponds to the processing of Figure 8. Then block 834 continues to block 836, where an input structure of Redirection Determinator is initialized. The input structure of the Redirection Determinator contains all the information necessary to redirect the calculation of the optimization. The intermediate input data shown in Figures 23 to 25 is a simulation of an input structure of the Redirection Determinator. Then, block 838 appropriately updates the resources of the user's graphical interface, for an appropriate user interface according to the input structure of the Redirection Determinator. The processing flows back to block 866 for processing as described above. Referring again to block 850, if the user did not select the action for a new session, processing continues until block 852. If block 852, the Old Session option, such as that found in the Figure 7, the user selects, in block 842, a session to administer, for example, of Figure 22. Then block 842 continues to block 840, where the input structure of the Redirection Determiner is initialized according to with the selected session. Block 840 preferably retrieves the information from the old session, which includes the data of the input structure of the Redirection Determinator, from a shared data base deposit accessible to multiple users in a network. Then, the processing flows to block 838 as described above. Referring again to block 852, if the user did not select the action for an old section, the processing proceeds to block 854. If in block 854, the user has selected Exit, for example, from the Exit option, such as that which is in the list in Figure 7, block 868, saves, in a shared database repository, all the Redirect Deposit entry structures for all sessions held during the current invocation of the interface processing of the user of the present invention, of Figure 52. Subsequently, block 870 releases resources, such as dynamically allocated memory for the input structure of Redirection Repositories, and block 872 terminates the process, which includes terminating the user interface. user. With reference again to block 854, if the user did not select Exit, then processing continues until block 856. If in block 858 the user opted to modify the limitations or visual display input, for example, by invoking button 518 of Figure 22, or invoking the option of the Visual Display Entry list of Figure 26, then block 874 is interconnected with the user by means of Figures 9 to 21. Then processing flows back to blog 866 as ee described earlier. If in block 856 the ueuario did not choose to modify the limitations or the visual display input, the procedure flows to blog 858. If in blog 858, the user chose Execute a session, for example, of Figure 26, or with an immediate key of Figure 22, then block 876 extends an asynchronous execution thread of the Redirect Deposit incorporated by Figure 53 and the following Figures. Processing continues from there to block 884, which notifies the user appropriately that a session is running. Then the processing flows back to block 866. If in block 858, the user did not choose to execute a session, the processing continues to block 860. If in block 860, the user opted to stop a session that was running currently, then block 878 ends the session if it is running, and block 886 indicates termination appropriately at the user interface. Processing flows back to block 866. Referring again to block 860, if the user did not choose to end a session, then processing continues until block 862. If in block 862, the user opted to display the intermediate entry. , the plain file form is presented to the user in a search engine in block 880, and processing continues back to block 866. In the processing of Figure 52, an immediate key is assumed from the search and return mode to block 866. If in block 862 the user did not choose to display the intermediate entry, processing continues until block 864. If in block 864 the user chose to display the solutions for a session previously executed, for example, * by button means 520 of Figure 22, block 882 presents the user with the solutions calculated by the Redirection Determinator, and processing continues back to block 866. Block 882 presents to the user solutions in a form, for example, of Figure 27A. The processing for Figures 27A to 27F is assumed in block 882 of Figure 52. If in block 864, the user did not choose to display the solutions, the processing continues until block 844. If in block 844 the user opted by modifying the profile information, for example, by means of the list in Figure 7, the user modifies the profile parameters in block 846, and processing continues back to block 866. If in block 844 the user does not opted to modify the parameters of the profile, the processing continues back to block 866, as described above. Referring now to Figure 53, processing for the Redirecting Determinator (RR) 110 is demonstrated. Typical optimization problems relate to linear programming, non-linear programming, and integer programming. Linear programming problems are solved, for example, by simplex and limit methods. Non-linear programming problems are solved, for example, by gradient methods. Integer programming problems are solved, for example, by enumeration methods and implicit heuristics by derivation and bounce. The present invention uses a combination approach of k exchange heuristics and stochastic enumeration. It is important to understand first the generic nature of the Redirection Determinator, and some basic concepts used in its processing. A node in the network, such as an IXC switch, is a point of accumulation and distribution of traffic in the network. Each node in the network can serve any number of subtending nodes. Numeric codes are used to internally identify the nodes of the network in the redirection determiner, for example, 1, 2, ..., S, where S is a total number of nodes in the network. The redirection determiner considers that a sub-tenant node is a point of origin or termination of traffic. Traffic from several subtendientee nodes is accumulated in the node of the network to which the subtending nodes are directed. The redirection determiner assumes that a sub-node (direct) node can be assigned to no more than one node in the network, and a sub-node node can change its network node address. These euposiciones allow to do a direct handling of the groups of circuits of redirección, and many other types of entities of the network. Although groups of redirection circuits are certainly not node or node sub-tenants, the Redirection Determinator can operate with a mathematical model as if the groups of redirection circuits were logically sub-tendent nodes from a node of the particular network (ie, switch) . The redirection circuit groups are also identified with internal numerical codes, that is, the enumeration attribute described in Figure 6. This allows a repreeentation of the abetracta address of a node, and that eubgrouping of redirecting circuits is proposed as an R-dimensional allocation vector, where R is a total number of subtending nodes (ie, group of redirection circuits). For example, consider a subnet of five switches and ten groups of redirection circuits, where the code numbers 1, 2, 3, 4, and 5 identify switches 1, 2, ..., 10 identify the circuit groups of redirection If, for example, RCG # 1 is directed to the MCI # 3 switch ,. RCG # 2 goes to MCI switch # 4, RCG # 3 goes to MCI switch # 5, RCG # 4 goes to MCI switch # 3, RCG # 5 goes to MCI switch # 1, RCG # 6 goes to the MCI # 1 switch, the RCG # 7 goes to the MCI # 2 switch, the RCG # 8 goes to the MCI # 5 switch, the RCG # 9 goes to the MCI # 3 switch, the RCG # 10 it goes to the MCI switch # 4, then this address relationship is represented by the following assignment vector: 3 4 5 3 1 1 2 5 3 4 Accordingly, there is a vector of 10 dimensions (10 is a numbers of groups of circuits of redirection), and each coordinate of the vector represents a numerical code of the switch (1 to 5) to which the corresponding redirection circuit group is addressed (assigned). If the group of redirection circuits # 2 is redirected from switch # 4 to switch # 1, the result is the following allocation vector: 3 1 5 3 1 1 2 5 3 4 In general terms, the redirection determiner treats with the vector set (S, R) of all the R-dimensional assignment vectors, whose coordinates are integers from 1 to S. The total number of different assignment vectors in the vector set (S, R) ( that is, the number of assignments for the nodes of the network S and the subtending nodes R) ee equal to SR. From the perspective of the redirection determiner, redirection is a process when a sub-sender node (for example, the group of redirection circuits) changes its address network node (for example, Switch). In terms of allocation, this includes a transition from one allocation vector to another allocation vector in the vector set (S, R). The cost function, Cost (x), is a function of the R-dimensional assignment vector x = (x x2, ... xR) which represents an assignment quality x in numerical terms. The cost function is a weighted sum of various cost components. As described above, a cost function of the preferred mode is: Cost (x) = w ^ IMT Traffic (x) / IMT_Tric (x0)) + w2 * (Dist (x) / Dist (x0)) + w3 * (PB (x) / PB (x0)) The goal of the redirection determiner is to find assignments with a minimum cost value, where x is a feasible assignment. The limitations are additional commercial conditions that must satisfy the feasible allocation x. In mathematical terms, limitations are presented with a set of equalities and / or inequalities: g2 (x) <; = g2 gn (x) < = gn The assignment x is called feasible if all these inequalities are true; otherwise, the assignment x is called infeasible. All limitation provided through the graphical user interface are expressed as an equality / inequality. For example: Switch Capacity Limitations; # of ports, BHCA and TPS (for each AAAA Switch): # total circuits of redirection circuit groups directed towards AAAA (ie, from the assignment vector and field 599C, Figure 29) < = available number of ports in AAAA (ie, from field 599D, Figure 28); Total amount of Call Attempt proceeded by AAAA (ie, from the allocation vector and field 599A, Figure 29) < = BHCA limit available for YYYY (ie, from field 599E, Figure 28); Total amount of TPS processed by YYYY (ie, from the allocation vector and field 599F, Figure 29) < = TPS limit for YYYY (ie, from field 599G, Figure 28); Limitation of the Dietary Limit; for each Switch AAAA and redirection circuit group BBBB: There is a predefined limit D (YYYY) on the distance between the AAAA switch and any group of redirection circuits that is directed towards AAAA. If the redirection circuit group BBBB is directed to a AAAA Switch, then the distance between the AAAA Switch and the redirection circuit group BBBB (ie, from the field 599H, FIG. 31) < = D (YYYY) (that is, from window 454, Figure 11). The distance actually refers to the distance between the switch and the opposite termination end (usually the point of presence) of the particular redirection circuit group. Configuration limitations; they are expressed in terms of allocation vectors as inequalities and / or equalities. Directions to avoid; If, for example, the redirection circuit group 5 should not be directed towards a switch 2, this limitation is expressed as the inequality x5? 2. Diversity, If, for example, groups of redirection circuits 3, 7, and 11 belong to the same diversity group, the coordinates x3, x7, and x of the assignment vector must be different. It Will not Redirect; if, for example, the group of redirection circuits 5 should not be redirected from a switch 2, this limitation is expressed as the equality x5 = 2. Limit on the Number of Redirections; represents a limit on the number of redirects (that is, the number of permutations between the original assignment and the optimal allocation). This inequality is expressed as: Number of redirects for a given assignment < = limit on the Redirect Number (ie, from field 452, Figure 10). With respect to limitations, a deficit is a numerical value that measures a violation of limitation. If, for example, g | - (?) < = 9k is an ^ e - * - a? limitations for assignment A (denoted as (A)), and this limitation is not true for an assignment x, so x has a deficit for this limitation, and the value of this deficit is a negative value gk- gk (x). For example, if a limitation: "# total circuits of all the groups of redirection circuits that are routed to the switch AAAA < = number of ports in AAAA" is not true for an assignment x, then the assignment x has a deficit for the number of ports in AAAA, and this deficit is equal to a value (negative): (number of ports in AAAA) - (Total number of circuits of all redirection circuit groups that are chosen towards the AAAA switch) . A feasibility function F (x) gives a numerical estimate of the feasibility for a given assignment x. If the assignment x is feasible (that is, all constraints are true), F (x) = 0. Otherwise, F (x) = sum or maximum (depending on the value of the type of feasibility rule specified in the field 510 of Figure 21) of all the deficit for all limitations. The processing of the redirection determiner (RR) 110 starts in block 888, and flows to block 890, which has access to the input structure of the redirection determiner for the session that was invoked for execution. Figure 53 ee can execute in a simultaneous and independent manner for a plurality of sessions. The data of the input structure of the redirection determiner are easily accessible in the memory. Subsequently, block 892 calculates a feasibility of an Original Assignment (OA) vector. The feasibility calculation is described in Figure 54. The original assignment is an original configuration (address relationship) of a network before applying an optimal solution. If you do not know a reasonable original configuration, you can select the original assignment with a random number generator method. Processing continues until block 894. If the original assignment in block 894 is not feasible, then subsequent processing will try to find a workable solution. Block 896 establishes a Current Assignment (CA) vector variable for the original assignment. Subsequently, block 898 initializes a cycle index k to 1, and block 900 determines whether an iteration of the current cycle completes processing for the cycle. If in block 900, the variable k is greater than the search depth specified by the user (Figure 21, window 508), block 936 prepares the user interface values by mapping internal numerical identifiers for the switches and groups of redirection circuits back to their names, using the tables integrated in block 848 of Figure 52. The fact that block 936 was reached through block 900 implies that no solutions were found. You can also reach block 936 and subsequent processing, after successfully finding solutions. Block 936 continues to block 938, which indicates a termination state at the user interface for the particular session, and continues to block 940, which displays the solution results to the user, for example, using Figures 27A to 27F, and the associated functionality. Block 940 flows back to block 866 of Figure 52 via the off-page 2000 connector. Referring again to block 900, if k is less than or equal to the search depth, block 902 generates a random permutation p of the set (1, ..., R), where R is a number of sub-teniente nodes (per example, groups of redirection circuits) the panorama of the problem. A permutation p of the R-dimensional vector (1, 2, 3, ..., R) is another R-dimensional vector (p (1), p (2), p (3), ..., p (R )) whose coordinates are reconfigurations of the integers 1 to R. The R-dimensional vector has R! = lx2x3x ... xR permutations. For example, the vector (1,2,3) has 31 = 1x2x3 = 6 permutations: (1,2,3), (1,3,2), (2,1,3) (2,3,1) , (3,1,2) and (3,2,1). A random permutation of an R-dimensional vector is a permutation that is randomly selected with a probability 1 / R! from the set of all R! Differentiate permutacionee of the R-dimeneional vector (1, 2, 3, ... R). Block 902 flows to block 904 for a processing cycle, in order to verify a feasibility value F for all assignments from a k neighborhood of CA, using an enumeration method (p, k), where p is a permutation of block 902. The enumeration method (p, k) defines the order in which all the R-dimensional assignment vectors are processed. For a given neighborhood k, all assignments are verified to determine its feasibility, and if the next assignment NA is better than a previous assignment CA. Referring now to Figure 57, a preferred embodiment for implementing an enumeration method (p, k) is shown. Figure 57 shows with a C, an example of programming. Those skilled in the art will appreciate different modalities for implementing the enumeration method (p., k) without departing from the spirit and scope of the invention. Figure 57 is provided as an accurate reference. An assignment with a better feasibility value is sought. The term neighborhood k, as used herein, is with respect to an assignment k in the vector set (S, R), and is an establishment of all allocation vectors and from the same vector set (S, R) that differs from x when much in k coordinates. For example, consider three switches and six groups of redirection circuits (S = 3, R = 6), and an allocation vector (2,2,1,3,1,1) from the vector set (3, 6). Neighborhood 1 of this vector consists of the allocation vectors (1,2,1,3,1,1), (3,2,1,3,1,1), (2,1,1,3,1 , 1), (2,3,1,3,1,1), (2,2,2,3,1,1), (2,2,3,3,1,1), (2,2 , 1,1,1,1), (2,2,1,2,1,1), (2,2,2,3,2,1), (2,2,3,3,3,1 ), (2, 2, 1, 1, 1, 2), and (2,2,1,2,1,3). Referring again to Figure 53, if in block 904 all assignments are still not processed from neighborhood k of CA, block 906 establishes a vector variable of Next Assignment (NA), by selecting from neighborhood k of the CA, using an enumeration method (p, k), where p is a permutation generated by block 902. Block 906 flows to block 908. If in block 908, NA is not feasible (ie, F (NA) is not equal to 0), then processing continues until block 914. If in block 914, NA is better than CA (ie, F (NA) > F (CA)) , CA is set to NA in block 912, which then flows to block 898 for processing as described above. If in block 914 NA it is not better than CA, block 916 increases the variable k by 1, and the processing of the cycle continues back to block 900. Referring again to block 904, if all the assignments of the neighborhood are processed k , then the proceeding continues haeta to block 916, which has already been decreed. Referring again to block 908, NA being feasible, the variable of the Start Assignment (SA) vector is set to NA in block 910. Subsequently, block 920 establishes in the Start Assignment. Referring again to block 894, if OA were feasible, the start assignment is set to OA in block 918, and the processing continues until block 920. Block 920 is reached only when there is at least one feasible solution that has been determined by all the process now defined for Figure 53. Subsequent processing until block 920 collects all optimized redirection solutions. Block 920 flows to block 922, where the variable k is initialized to 1, and to block 924. If block 924 k is less than, or equal to, the search depth specified by the user, the block 926 generates a random permutation p of the set. { 1, ..., R} , where R is a number of sub-tenant numbers (for example, groups of redirection circuits) in the problem scenario. Block 926 operates in the same way as block 902.

Block 926 continues to block 928 for a processing cycle, in order to verify the cost value of all feasible assignments from neighborhood k of CA, using the enumeration method (p, k), wherein it is a permutation from block 926. The best feasible allocation of the cost value is sought. If in block 928, all assignments are still not processed from the CA neighborhood k, block 930 sets a vector variable of the Next Assignment (NA), by selection, from neighborhood k of CA, using the enumeration method (p, k), wherein p is a permutation generated by block 926. Blocks 928 and 930 operate in a manner similar to blocks 904 and 906, respectively. Block 930 flows to block 932. If block 932 is feasible NA (ie, F (NA) = 0), and has a better coefficient than CA (Cost (NA) < Cost (CA)), then block 942 establishes CA in NA, and block 943 updates the solution supply. The supply of solution includes until solution, where n is the number of solutions specified in window 490 of Figure 20. Block 943 will update the solution supply in an order of priority, appearing the best solutions (determined by the cost minimized) first in the supply. Block 943 continues to block 944. If in block 944, the time since the last update of the solution file is greater than the time of the verification point specified in window 496 of Figure 20, then the block 945 updates a solution file, as incorporated in Figures 27B through 27F. A contiguous file is maintained internally for all solutions, although the user has the perception that individual solution files are maintained. Then block 945 continues to block 927. If in block 927, user verification marked an impatient logic in checkmark box 512 of Figure 21, then block 927 continues to block 928 for processing as It was described. If in block 927, the user did not select the impatient logic, then block 927 continues to block 922 for processing as described. Referring again to block 944, if the time elapsed since the update of the solution file is no longer than the time of the specified checkpoint, then block 944 continues to block 927 for processing as described. Referring again to block 932, if NA is not feasible or cost better than CA, processing continues until block 934, where the variable k is increased by one, and processing of the cycle back to block 924 continues Referring again to block 928, if all assignments from neighborhood k of CA are processed, then processing continues until blog 934 for processing as described. Referring again to block 924, if k is greater than the specified search depth, block 924 s to block 936 for processing previously described. The solutions that are feasible and meet the cost objectives pertain to processing in block 936 and subsequent processing. The user may choose to automatically apply processing of a solution to a network management interface, as determined by block 849 of Figure 52, after Figure 53 s back to Figure 52 via the connector off page 2,000. The user can also search for solutions and manually use a management interface in accordance with the same. Referring now to Figure 54, the feasibility calculation is shown with respect to a feasibility value F (x) for an assignment x with a set of n constraints: g, (x) <; = g, g2 (x) < = g2 gn (?) < = gn Feasibility calculations are performed in blocks 894, 908, 914, and 932 of Figure 53. Processing begins in block 950, and flows to block 952, where the feasibility function F is initialized (x ) at 0. Subsequently, block 954 obtains the following limitation q. If in block 956, all constraints have not yet been processed, the current limitation for allocation x in block 958 is estimated. If block 958 is true for assignment x, processing flows back to the block 954 to process the next allocation limitation x. If in block 958 the limitation is not true for assignment x, then processing continues until block 960. If in block 960, the user selected a Feasibility Standard Type equal to SUM_N0RM in window 510 of Figure 21 , then block 962 increases the feasibility function with the deficit for limitation. Then block 962 continues back to block 954 for processing as described above. If in block 960 the user did not select SUM_NORM in the user interface, block 964 continues processing. If in block 964, the feasibility value F (x) is not less than the deficit for the ith limit, then block 966 establishes the feasibility function in the deficit for the i-th limitation, and the procedure flows from I return to blog 954. If in block 964, the feasibility factor F (x) is less than the deficit for the i-th limitation, then the processing continues back to block 954. Referring again to block 956, if processed all limitations, the processing ends block 968, and the feasibility factor F (x) has been evaluated. Referring now to Figures 55A to 55D, and to Figure 56, the determination of the cost function is further described, as used in block 932 of Figure 53. In a preferred embodiment, formal definitions for three components follow . IMT traffic (or intra-commuting traffic) is the total traffic between those pairs of redirection circuit groups that are routed, (according to the assignment x) to mutually different switches. The IMT traffic for the assignment x is calculated by the formula: IMT_Tráfico (x) =? Jj Traf (i, j): x¡? Xj, where Traf (i, j) is a quantity of traffic originating in the ith groups of redirection circuits, and ending in the jth groups of redirection circuits; the coordinates Xj and x- are numerical codes of the switches to which the i-th and j th groups of redirection circuits are assigned, respectively. The traffic data is available in field 599B, Figure 30. The total distance Dist (x) is a sum of all the distances between the groups of redirection circuits and the switches to which the redirection circuit groups are directed, according to the assignment x. The total distance is calculated by the formula: Dist (x) =? .D (ifx¡), where D (i, x¡) is a distance between the redirection circuit group i and the switch x¡ to which it is assigned the i-th group of redirection circuits. This data is available in field 599H, Figure 31. The PB port balance component is a dispersion of port utilization. This non-negative number estimates, in numerical terms, the way in which the uses of ports are uniformly distributed among all the switches in the panorama of the problem. The higher the PB value, the more dispersion there is between the use of the port for different switches. If PB = 0, all the switches have the same port utilization. The following statistical formula is used to calculate the equilibrium component of the PB port as a disperesion of the PU (i) port use: PB (x) = sqrt (S (PU (i) -AVG_PU) 2) / (S-) 1)), where sqrt is a square root symbol, S is a switching number, AVG_PU is an average port utilization calculated by the formula: AVG_PU = (SjPU (i)) / S. Port utilization for the i-th PU (i) switch ee is calculated by the formula: PU (i) = Port_used (i) / Switch_port (i), where switch_port (i) is a total number of ports on the i-th switch that is available for local circuits (from field 599D (Figure 28) ), and port_using (i) is a number of ports on the i-th switch used for local circuits: Port_used (i) = S; RCG_ckt (j) in such a way that x¡ = i, where RCG_ckt (j) is a number of circuits in the ith clusters of redirection circuits, where the sum is taken over all those groups of redirection circuits that are assigned to the ith switch. The data of RCG_ckt (j) is available from field 599C, Figure 29. With particular reference to Figure 55A, a preferred embodiment for calculating the IMT traffic component for a given assignment x is demonstrated. Processing begins in block 1,000, and flows to block 1.002. In block 1,002, an IMT_traffic (x) calculation is started with the initialization of the variables i and j (internal numbers for the pair of redirection circuit groups) in 1, and IMT_traffic (x) in 0. Subsequently, the 1,004 block determines if an iteration of the current main cycle completes the processing. If in block 1,004, variable i is not greater than the number of redirection circuit groups R, then processing continues until block 1.006. Block 1,006 determines if an iteration of the current internal cycle completes the procedure. If in block 1,006, the variable j is greater than the number of redirection circuit groups R, then the processing continues until block 1.008. Block 1,008 determines whether the i-th and j th groups of redirection circuits are directed towards the same switch. If in block 1,008, Xj is not equal to x (that is, the i-th and nth groups of redirection circuits are not directed towards the same switch), processing continues in block 1010. Block 1010 calculates IMT_Tráfico (x) (inter-commuting traffic) summarizing the amounts of traffic between all the i-th and n th groups of redirection circuits that are not directed towards the same switch. Block 1010 flows to block 1012, where variable j is incremented by 1, and processing of the internal cycle continues back to block 1.006. Referring again to block 1,008, if x- is equal to x, (ie, the i-th and j th groups of redirection circuits are directed towards the same switch), processing continues until block 1012, which is already he described. Referring again to block 1,006, if variable j is greater than the number of redirection circuit groups R, then processing continues to block 1014. Block 1014 initializes variable j into 1, increases variable i by 1, and Processing of the external cycle continues back to block 1.004. Referring again to block 1.004, if variable i is greater than the number of redirection circuit groups R, then processing ends at block 1.005 and the IMT traffic component for a particular assignment x has been calculated. Referring now to Figure 55B, a preferred embodiment for calculating the Distance component for a given assignment x is demonstrated. Processing begins at block 1015 and flows to block 1016. At block 1016, a calculation of the total distance Dist (x) between the redirection circuit groups and their respective address switches is initiated with the initialization of the variable i in 1 and Dist (x) in 0. Block 1016 flows to block 1018. Block 1018 determines the iteration of the cycle. If in block 1018 the variable i is not greater than the number of groups of redirection circuits R, then processing continues to block 1020. Block 1020 calculates Diet (x) summarizing the distances D (i, Xj) between the i-th redirection circuit group and the Xj switch to which the redirection circuit groups are directed. Block 1020 flows to block 1022, where variable i is incremented by 1, and processing of the cycle continues back to block 1018. Referring again to block 1018, if variable i is greater than the number of redirection circuit groups R, then processing terminates in block 1019, and the Distance component for a particular assignment x has been calculated. Referring now to Figure 55C, a preferred embodiment for calculating the Port Balance component for a given assignment x is demonstrated. Processing begins at block 1023, and flows to block 1024. At block 1024, a calculation of the average port utilization AVG_PU is initiated with the initialization of variable i at 1, and AVG_PU is 0. Block 1024 flows to block 1026. Block 1026 determines whether an iteration of the current cycle is completed. If in block 1026 the variable i is not greater than the number of switches S, then processing continues to block 1028. Block 1028 accumulates in AVG_PU a total amount of PU (i) port utilization for all switches. Block 1028 flows to block 1030, where variable i is incremented by 1, and cycle processing continues back to block 1026. Referring again to block 1026, ei variable i ee greater than the number of switches S , then the processing continues to block 1032. In block 1032, an average port utilization AVG_PU is calculated as a total port utilization amount for all switches (stored in AVG_PU), divided by the number of switches S. processing continues in block 1034. At this point, an average port utilization calculation AVG_PU is completed. In block 1034, a port balance calculation PB (x) is initiated with the initialization of variable i in 1 and PB (x) in 0. Block 1034 flows to block 1036. Block 1036 determines whether it is complete an iteration of the current cycle. If in block 1036 the variable i is not greater than the number of switches S, then the processing continues until block 1038. Block 1038 accumulates in PB (x) the square values of usage deviations from PU (i) port to from your average AVG_PU. Block 1038 flows to block 1040. Block 1038 flows to block 1040, where variable i is incremented by 1, and processing of the cycle continues back to block 1036. Referring again to block 1035, if the variable i is greater than the number of switches S, then the processing continues to block 1042. In block 1042, a port balance PB (x) is calculated as a square root of the total square deviations (stored in PB (x) ) divided by the quantity (S-1). Then the processing ends in block 1043, and the Port Balance component has been calculated for a particular x assignment. Now with reference to Figure 55D, a preferred embodiment for calculating the cost function is shown. Processing begins at block 1044, and block 1046 flows to haeta. At block 1046, a cost value Cost (x) is calculated for a given assignment x, and an original assignment x0, as a weighted sum as described until now. The components are derived according to Figures 55A to 55C. The weighting coefficients w1, w2, and w3 for the calculation of Cost (x) are specified by a user in Figure 10 as a Cost by Erlang of IMT traffic (window 500), Cost per kilometer of distance from the Point of Presence - switch (window 502), and in Figure 18 as a Port Balance coefficient (window 506). Subsequently, the processing ends in block 1048. Referring now to Figure 56, a preferred embodiment for calculating the PU port utilization set for an x assignment is shown. Loe blocks 1028 and 1038 of Figure 55C required this calculation. Processing begins in block 1100, and flows to block 1102. In blocks 1102 to 1108, the elements of set PUERT0_USAD0 (i) are initialized to 0. Block 1102 initializes a variable i to 1. Block 1102 flows to block 1104. Block 1104 determines whether a current cycle iteration completes processing for the cycle. If in block 1104 the variable i is not greater than the number of switches S, then processing continues to block 1106. Block 1106 initializes a value of PORT (i) to 0. Block 1106 flows to block 1108, in where the variable i is incremented by 1, and the processing of the cycle continues back to block 1104. Referring again to block 1104, and the variable i ee greater than the number of switches S, then the processing proceeds to block 1110. In block 1110, ee starts a calculation of set PUERT0_USAD0 with initialization of variable j at 1. Block 1110 flows to block 1112. Block 1112 determines whether a current cycle iteration completes processing for the cycle. If in block 1112, variable j is not greater than the number of groups of redirection circuits R, then processing continues until block 1114. Block 1114 accumulates in PUERTO_USADO (x¡), the number of circuits in j 9 groups of redirection circuits that goes towards the commutator x¡. Block 1114 flows to block 1116, where variable j is incremented by 1, and processing of the cycle continues back to block 1112. Referring again to block 1112, if variable j is greater than the number of groups of redirection circuits R, then processing continues until block 1118. At this point, a calculation of the set PUERTO_USADO is completed. In block 1118, a usage set calculation of the PU Port is initiated with the initialization of variable i at 1. Block 1118 flows to block 1120.

Block 1120 determines whether a current cycle iteration completes processing for the cycle. If in block 1120, variable i is not greater than the number of switches S, then processing continues until block 1122. Block 1122 calculates PU (I) as PORT JSADO (i), divided by the number switchport (i) ) of variable ports on the i2 switch. Block 1122 flows to block 1124, where the variable i is increased by 1, and the processing of the cycle continues to regress to block 1120. Referring again to block 1120, if variable i is greater than the number of switches S , then the processing in block 1126 ends. Referring now to Figure 58, the aspect of the alarm processing of the present invention is shown. The aspect of the alarm processing requires a session alarm configuration maintained separately, preferably incorporated as a Session Alarm table, which maps the alarm criteria for a previously created redirect optimizer session 108. The alarm criteria include the error code together with the switch identifier (FSID) with optional trunk identification, circuit identification, or combinations thereof. The key value of a previously administered domain is mapped to these criteria. The Session Alarm table will contain at least fields for an alarm code, an FSID, and an entry (the key) for a particular redirection optimizer session. A user can keep the Session Alarm table, with a plain file editor or with a database interface. The values stored there are converted appropriately to be compared with binary values for the alarm, session number, FSID, and so on. Block 1200 starts processing, and block 1202 produces an alarm. The alarm processing is well known to those skilled in the art, and can be caused by a variety of situations. Block 1202 flows to block 1204, where appropriate operator consoles are notified, with an appropriate message as in the current art. Subsequently, if in block 1206, the redirect optimizer 108 is configured to extend automatically, as determined by an environment variable or a profile configuration position (for example, in config.sys or win.ini), the block 1210 has access to the Session Alarm table preconfigured with the alarm criteria, and retrieves a matching entry session enumeration value. The enumeration value, as incorporated in the Key field of Figure 22, is the entry to the saved session in the shared database repository discussed for blocks 840 and 868 of Figure 52. Subsequently, if in block 1212 is matched, block 1214 extends redirect optimizer 108 with the matching session. The redirect optimizer 108 is initialized there in a manner such that processing of the blocks 852, 842, 840, and 838 of Figure 52 takes place, respectively. Processing continues from there to block 1216, where the session is automatically extended with the redirection determiner as described in blocks 858 and 876 respectively, of Figure 52. Block 1216 flows to block 1218, where appropriately updates the graphical user interface, as described in block 884 of Figure 52, to indicate that the Redirection Determinator is running. Then block 1218 flows to block 1220, where the operator console is notified that redirect optimizer 108 has been invoked. Further investigation by the user will provide whether redirect optimizer 108 is currently running or not to find optimal solutions. Subsequently, block 1220 flows to block 866 of Figure 52 for processing as described above., by means of the connector out of page 2,000. Referring again to block 1212, and no match was found according to the alarm, block 1222 extends redirect optimizer 108 without special initialization provisions. Then, block 1222 flows to block 1220 for processing already described. Referring again to block 1206, if the operator console system was not configured to automatically invoke redirect optimizer 108, processing ends in block 1208. Although the invention has been demonstrated and described particularly with reference to a preferred embodiment , it will be understood by experts in this field that different changes can be made in the form and detail thereof, without departing from the spirit and scope of the invention.

Claims (90)

1. NOVELTY OF THE INVENTION Having described the foregoing invention, it is considered as a novelty, and therefore, the content of the following is claimed as property: CLAIMS 1. A method in a data processing system for the optimization of redirection of a telecommunications network, this method comprising the steps of: constructing a set of redirection circuit groups and the associated data thereof; specify a panorama of the problem as a subset of the set of redirection circuit groups; specify the entry to preach the aforementioned redirection optimization; and calculate the redirection optimization solutions for the problem scenario according to said input.
2. 2. The method according to claim 1, characterized in that the step of constructing a redirection circuit group set and the associated data thereof, further comprises the steps of: collecting the network data from of the telecommunications network; and deriving the groups of redirection circuits and the associated data thereof, from the data of the network.
3. 3. The method according to claim 2, characterized in that the step of collecting the data from the network from the telecommunications network comprises the step of automatically recovering the network data from the network of telecommunications mentioned.
4. 4. The method according to claim 2, characterized in that the step of deriving the groups of redirection circuits and the associated data thereof from the data of the network, further comprises the step of automatically calculating the groups of redirection circuits mentioned.
5. 5. The method according to claim 1, characterized in that the step of constructing a set of redirection circuit groups and the associated data thereof, further comprises the step of automatically building a basic level of granularity.
6. 6. The method according to claim 1, characterized in that the step of constructing a set of * redirection circuit groups and the associated data thereof, further comprises the step of automatically constructing service areas.
7. The method according to claim 1, characterized in that the step of specifying a panorama of the problem as a subset of the set of redirection circuit groups, further comprises the step of selecting a switching set that is associated with the same to the subset of the set of redirection circuit groups mentioned.
8. 8. The method according to claim 7, characterized in that the step of selecting a set of switches that have associated therewith the subset of the redirection circuit group set, also comprises the selection of a geographical area. that it has associated with it to the mentioned set of switches.
9. 9. The method according to claim 1, characterized in that the step of specifying the entry to preach said redirection optimization further comprises the step of specifying the configuration limitation.
10. The method according to claim 9, characterized in that the step of specifying the configuration constraints further comprises the step of specifying a diversity group.
11. 11. The method according to claim 9, characterized by the step of specifying the configuration constraints further comprises the step of specifying a group of forbidden redirection circuits with a node to associate with it in order to prohibit the address of that group of prohibited redirection circuits towards said node.
12. 12. The method of compliance with the claim in claim 9, characterized in that the step of specifying the configuration limitations also comprises the step of specifying a group of redirection circuits that should not be redirected.
13. 13. The method according to claim 9, characterized in that the step of specifying the configuration constraints further comprises the step of specifying a maximum number of redirection circuit groups to be redirected in any of the redirection optimization solutions. mentioned.
14. 14. The method according to claim 1, characterized in that the step of specifying the input to preach the redirection optimization, further comprises the step of specifying the capacity limitations of the switch.
15. The method according to claim 1, characterized in that the step of specifying the entry to preach the redirection optimization further comprises the step of specifying the limitations of the distance limit.
16. 16. The method according to claim 1, characterized in that the step of specifying the entry to preach said redirection optimization further comprises the step of specifying the execution limitation parameters.
17. 17. The method according to claim 1, characterized in that the step of specifying the entry to preach said redirection optimization further comprises the step of specifying a cost function.
18. 18. The method according to claim 17, characterized in that the step of specifying a cost function further comprises the steps of: specifying the components of the cost function; specify a number of solutions to report the aforementioned redirection optimization solutions; calculate the redirection cost for each candidate redirection optimization solution according to the aforementioned cost function; and confining the report of the redirection optimization solutions with respect to the number of solutions and according to the aforementioned redirection cost for each candidate redirection optimization solution, in accordance with said cost function.
19. 19. The method according to claim 18, characterized in that the step of specifying the components of the cost function also includes the step of associating the weighting coefficient defined by the user with each of the components of the function of cost.
20. 20. The method according to claim 18, characterized in that the step of specifying the components of the coefficient function further comprises the step of specifying an inter-machine trunk traffic measurement component.
21. The method according to claim 18, characterized in that the step of specifying the components of the cost function further comprises the step of specifying a distance component.
22. 22. The method according to claim 18, characterized in that the step of specifying the components of the cost function further comprises the step of specifying a port balance component.
23. 23. The method according to claim 1, characterized in that the step of calculating redirection optimization solutions for the scenario of the problem according to the mentioned entry, further comprises the steps of: generating a unique enumeration of the group of redirection circuits for the mentioned redirection circuit groups; generating a unique switch enumeration for the switches for which the aforementioned redirection circuit groups can address; construct a set of allocation vectors according to the unique enumeration of the group of circuits and the unique enumeration of the switch; and select the vectors of the candidate candidate from the set of allocation vectors.
24. 24. The method according to claim 23, characterized in that it further comprises the steps of: associating the limitations with the candidate allocation vectors; associate a feasibility function with the candidate allocation vectors in accordance with the aforementioned limitations; evaluate the feasibility of the candidate allocation vectors according to the mentioned feasibility function; and selecting a feasible allocation vector from the candidate allocation vectors according to the mentioned feasibility function.
25. 25. The method according to claim 24, characterized in that it further comprises the steps of: associating a cost function with the set of allocation vectors; calculate a cost for the candidate allocation vectoree; and constructing the redirection optimization solution information for the set of allocation vectors from the candidate allocation vectors according to the said feasibility function and the cost function.
26. 26. The method according to claim 23, characterized in that the step of sequencing the candidate assignment vectors comprises the steps of: constructing a vector set (S, R) of said set of allocation vectors for a number S of switches, and an R number of redirection circuit groups; construct a neighborhood k from the vector set (S, R) for a search depth parameter k; construct a random permutation p for the R number of redirection circuit groups; perform the enumeration (p, k) of the set of allocation vectors in the neighborhood k; and sequencing the set of allocation vectors in the vector set (S, R), in the order of the enumeration (p, k) mentioned.
27. 27. The method according to claim 25, characterized in that it also includes the task of reporting the aforementioned redirection optimization solution information.
28. 28. The method according to claim 27, characterized in that the step of reporting the information of the redirection optimization solution also comprises the task of reporting the redirection optimization solutions in a priority order.
29. 29. The method according to claim 27, characterized in that the step of reporting the information of the redirection optimization solution also comprises the step of reporting the best redirection optimization solution.
30. 30. The method according to claim 1, characterized in that it also comprises the step of presenting said redirection optimization solutions to a user.
31. 31. The method according to claim 30, characterized in that it also comprises the step of accepting user input to initiate the automatic application of one of the mentioned redirection optimization solutions to the telecommunications network.
32. 32. The method according to claim 1, characterized in that it also comprises the step of accepting the entry of a user to initiate the automatic application of one of the redirection optimization solutions to the telecommunications network.
33. 33. The method according to claim 1, characterized in that it also comprises the step of presenting a user interface to navigate, and making it possible to specify a panorama of the problem as an eubset of the group of circuit groups of redirection mentioned.
34. 34. The method according to claim 1, characterized further comprises the step of presenting a user interface to navigate, and to be possible the step of specifying the entry to preach said redirection optimization.
35. 35. The method according to claim 1, characterized in that it further comprises the step of presenting a user interface to manage the groups of redirection circuits and the associated data of the same.
36. 36. A method in a data processing system for automatically creating logical data groups, for the purpose of optimizing redirection of a telecommunications network, this method comprising the steps of: automatically accessing a plurality of data warehouses. of the network system; compare the data found in the plurality of data deposits of the seventh of the network; complement the data found in the plurality of data repositories of the network system; and construct a set of redirection circuit groups and their associated data.
37. 37. The method according to claim 36, characterized in that it further comprises the step of presenting a user interface to a user, to administer the redirect circuit group set and the associated data thereof.
38. 38. The method according to claim 37, characterized in that the step of presenting a user interface to a user for managing the set of redirection circuit groups and the associated data thereof, also comprises the step of administer the associated data thereof in terms of the set of redirection circuit groups mentioned.
39. 39. The method according to claim 36, characterized in that it also comprises the steps of: creating a working copy of the set of redirection circuit groups and the associated data thereof; presenting a user interface to a user, to administer the working copy of the set of redirection circuit groups and the associated data thereof; and altering only the working copy of the set of redirection circuit groups and the associated data thereof.
40. 40. A method in a data processing system for the optimization of redirection of a telecommunications network, this method comprising the steps of: constructing a set of redirection circuit groups and the associated data thereof; present a user interface to manage a plurality of sessions; specifying the entry for each of the plurality of sessions, through the aforementioned user interface; and invoking a plurality of instances that are executed simultaneously to calculate the redirection optimization solutions for the plurality of sessions in the user interface, on which, a user of the aforementioned user interface designates the plurality of sessions.
41. 41. The method according to claim 40, characterized in that the step of presenting a user interface to administer a plurality of sessions also comprises the step of administering the old eeeionee.
42. 42. A method in a data processing system for the optimization of redirection of a network, this method comprising the steps of: automatically identifying the nodes within the network; automatically identify the subtending nodes for each of the mentioned nodes inside the network; automatically use the network data to evaluate the attributes associated with the nodes and the nodes eubtendientes within the network; and automatically calculate the optimized configurations of these nodes and sub-nodes within the network, according to the aforementioned network data.
43. 43. The method according to claim 42, characterized in that it also comprises the step of presenting a user interface to a user, to manage the input to be automatically used in the confining of the optimized configuration reports. the nodes and the sub-nodes within the network according to the aforementioned network data.
44. 44. A method in a data processing system for the optimization of redirection of a telecommunications network, upon detecting an alarm within said telecommunications network, this method comprising the steps of: coupling the data associated with the alarm, to a session alarm configuration; and automatically invoke the redirection optimization processing according to the aforementioned session alarm configuration.
45. 45. The method according to claim 44, characterized in that the step of automatically invoking the redirection optimization processing according to the aforementioned session alarm configuration, also comprises the steps of: initializing a user interface with the data for a given session from the session alarm configuration; execute the redirection calculations for this session; and present the results from the redirection calculations in execution to the user through a user interface.
46. 46. A data processing system for the optimization of redirection of a telecommunications network, said data processing system comprising: an element for constructing a set of groups of redirection circuits and the associated data thereof; an element for specifying a panorama of the problem as a subset of the set of redirection circuit groups; an element to specify the entry to preach redirection optimization; and an element to calculate the redirection optimization solutions for the panorama of the problem according to said input.
47. 47. The data processing system according to claim 46, characterized in that the element for constructing a set of redirection circuit groups and the associated data thereof, further comprises: an element for collecting the data of the network from the telecommunications network; and an element for deriving the redirection circuit groups and the associated data thereof from the data of the network.
48. 48. The data processing system according to claim 47, characterized in that the element for collecting the data of the network from the telecommunications network, includes an element to automatically recover this data from the network from of the aforementioned telecommunications network.
49. 49. The data processing system according to claim 47, characterized in that the element for deriving the groups of redirection circuits and the associated data thereof from the data of the network, also comprises an element to automatically calculate the groups of redirection circuits mentioned.
50. 50. The data processing system according to claim 46, characterized in that the element for constructing a set of redirection circuit groups and the associated data thereof, further comprises an element for automatically building a basic level of granularity.
51. 51. The data processing system according to claim 46, characterized in that the element for constructing a set of redirection circuit groups and the associated data thereof, further comprises an element for automatically building service areas.
52. 52. The data processing system as claimed in claim 46, characterized in that the element for specifying a panorama of the problem as a subset of the set of redirection circuit groups, further comprises an element for selecting a set of switches having associated therewith the subset of the set of redirection circuit groups mentioned.
53. 53. The data processing system according to claim 52, characterized in that the element for selecting a switchgear assembly associated with the subset of the aforementioned set of redirection circuit groups also comprises an element to select a geographic area associated with it to the subset of the set of redirection circuit groups.
54. 54. The data processing system according to claim 46, characterized in that the element for specifying the entry for preaching the redirection optimization further comprises an element for specifying the configuration limitations.
55. 55. The data processing system as claimed in claim 54, characterized in that the element for specifying the configuration constraints further comprises an element for specifying a diversity group.
56. 56. The data processing system as claimed in claim 54, characterized in that the element for specifying the configuration limitation further comprises an element for specifying a group of forbidden redirection circuits with a node for associating with it. in order to prohibit the address of the prohibited redirection circuit group to this node.
57. 57. The data processing system according to claim 54, characterized in that the element for specifying the configuration limitations also comprises an element for specifying a group of redirection circuits that should not be redirected.
58. 58. The data processing system according to claim 54, characterized in that the element for specifying the configuration constraints further comprises an element for specifying a maximum number of redirection circuit groups that are to be redirected in any of the mentioned redirection optimization solutions.
59. 59. The data processing system according to claim 46, characterized in that the element for specifying the input to preach the redirection optimization further comprises an element for specifying the capacity limitations of the switch.
60. 60. The data processing seventh according to claim 46, characterized in that the element for specifying the input to preach the redirection optimization, further comprises an element for specifying the limitations of the distance limit.
61. 61. The data processing system according to claim 46, characterized in that the element for specifying the input to preach said redirection optimization further comprises an element for specifying the execution limitation parameters.
62. 62. The data processing procedure according to claim 46, characterized in that the element for specifying the input for pre-ordering said redirection optimization also comprises an element for specifying a coefficient function.
63. 63. The data processing system as claimed in claim 62, characterized in that the element for specifying a cost function further comprises: an element for specifying the components of the cost function; an element to specify a number of solutions to report the aforementioned redirection optimization solutions; an element to calculate the redirection cost for each candidate redirection optimization solution according to the cost function; and an element to confine the report of the redirection optimization solutions mentioned with respect to the number of solutions, and in accordance with the redirection cost for each candidate redirection optimization solution, according to the cost function.
64. 64. The data processing system as claimed in claim 63, characterized in that the element for specifying the components of the cost function, further comprises an element for associating a weighting coefficient defined by the user with each of the components of the cost function mentioned.
65. 65. The data processing system according to claim 63, characterized in that the element for specifying the components of the cost function, further comprises an element for specifying an inter-machine trunk traffic measurement component.
66. 66. The data processing system as claimed in claim 63, characterized in that the element for specifying the components of the cost function comprises an element for specifying a distance component.
67. 67. The data processing sequence according to claim 63, characterized in that the element for specifying the components of the cost function, further comprises an element for specifying a port balance component.
68. 68. The data processing system according to claim 46, characterized in that the element for calculating the redirection optimization ef- fects for the scenario of the problem according to the mentioned entry, further comprises: an element for generating the enumeration of groups of single redirection circuits for the groups of redirection circuits mentioned; an element for generating the unique enumeration of switches for the switches for which the aforementioned redirection circuit groups can address; an element for constructing a set of allocation vectors according to the unique enumeration of groups of redirection circuits and with the unique enumeration of switches; and an element for sequencing the candidate allocation vectors of the aforementioned allocation vector set.
69. 69. The data processing system according to claim 68, characterized by further comprising: an element for associating constraints with the candidate eviction vector; an element for associating a feasibility function with the candidate allocation vectors according to the limitations mentioned; an element to evaluate the feasibility of the candidate allocation vectors according to the feasibility function; and an element for selecting a feasible allocation vector from the candidate allocation vectors, according to the mentioned feasibility function.
70. 70. The data processing system according to claim 69, characterized in that it further comprises: an element for associating a cost function with the set of allocation vectors; an element to calculate a cost for the mentioned candidate allocation vectors; and an element for constructing the redirection optimization solution information for the set of allocation vectors from the candidate allocation vectors, according to the aforementioned feasibility function and cost function.
71. 71. The data processing system according to claim 68, characterized in that the element for sequencing the candidate allocation vector of the set of vectors comprises: an element for constructing a vector set (S, R) of the aforementioned set of vectors for an S number of switches, and an R number of redirection circuit groups; an element for building a neighborhood k from the vector set (S, R) for a search depth parameter k; an element for building a random permutation p for the R number of redirection circuit groups; an element for carrying out the enumeration (p, k) of the set of allocation vectors in the neighborhood k; and an element for sequencing the set of allocation vectors in the vector set (S, R), in the order of the enumeration (p, k).
72. 72. The data processing system according to claim as claimed in claim 70, characterized in that it also comprises an element for reporting the information of the aforementioned redirection optimization solution.
73. 73. The data processing system according to claim 72, characterized in that the element for reporting the information of the redirection optimization solution also comprises an element for reporting redirection optimization solutions in an order of priority.
74. 74. The data processing system according to claim 72, characterized in that the element for reporting information of the redirection optimization solution also comprises an element for reporting the best redirection optimization solution.
75. 75. The data processing system according to claim 46, characterized in that it also comprises an element for presenting the redirection optimization solution to a user.
76. 76. The data processing system according to claim as claimed in claim 75, characterized in that it also comprises an element for accepting user input to initiate the automatic application of one of the aforementioned redirection optimization solutions to the telecommunications network. .
77. 77. The data processing system according to claim 46, characterized in that it also comprises an element for accepting the entry of a user to initiate the automatic application of one of the aforementioned redirection optimization solutions to the network. of telecommunications.
78. 78. The data processing system according to claim 46, characterized in that it also comprises an element to present a user interface to navigate, and make possible the element to specify a panorama of the problem as a subset of the mentioned set of groups of redirection circuits.
79. 79. The data processing system according to claim 46, characterized in that it also comprises an element for presenting a user inferred to navigate, and make possible the element to specify the entry to preach said redirection optimization.
80. 80. The data processing system as claimed in claim 46, characterized in that it further comprises an element for presenting a user interface to manage the redirection circuit groups and the associated data of the same.
81. 81. A data processing system for automatically creating data groups, for the purpose of optimizing redirection of a telecommunication network, this data processing system comprising: an element for automatically accessing a plurality of data warehouses. data from the network system; an element for comparing the data found in the plurality of data stores of the network system; an element to complement the data found in the plurality of data stores of the network system; and an element for constructing a set of redirection circuit groups and the associated data thereof.
82. 82. The data processing system according to claim 81, characterized in that it also comprises an element for presenting a user interface to a user, to manage the set of redirection circuit groups and their associated data.
83. 83. The data processing seventh according to claim 82, characterized in that the element for presenting a user interface to a user, for managing the set of redirection circuit groups and the associated data thereof, it further comprises an element for managing the associated data thereof in terms of the set of redirection circuit groups mentioned.
84. 84. The data processing system as claimed in claim 81, characterized in that it further comprises: an element for creating a working copy of the set of redirection circuit groups and the associated data of the same; an element for presenting a user inferred to a user, to administer the aforementioned working copy of the set of redirection circuit groups and the associated data thereof; and an element for altering only this working copy of the set of redirection circuit groups and the associated data thereof.
85. 85. A data processing system for the optimization of redirection of a telecommunications network, said data processing system comprising: an element for constructing a set of groups of redirection circuits and the associated data thereof; an element for presenting a user interface for managing a plurality of sessions; an element for specifying the entry for each of the plurality of sessions, through the aforementioned user interface; and an element for invoking a plurality of instances that are executed simultaneously, for calculating the redirection optimization solutions for the plurality of operations in the user's inferred, on which, a user of the aforementioned user interface, designates the plurality of sessions.
86. 86. The data processing system according to claim 85, characterized in that the element for presenting a user interface for administering a plurality of sessions, further comprises an element for administering the old sections.
87. 87. A data processing system for the optimization of redirection of a network, this data processing system comprising: an element for automatically identifying the nodes within the network; an element to automatically identify the eubtendientee nodes for each node in the network; an element to automatically use the data of the network to evaluate the attributes associated with the nodes and with the sub-nodes within the network; and an element to automatically calculate the optimized configurations of the nodes and of the sub-nodes within the network, according to the aforementioned network data.
88. 88. The data processing system as claimed in claim 87, characterized in that it also comprises an element to present a user interface to a user, to administer the entry, which will be used automatically in the confinement of the report of the aforementioned optimized configurations of the nodes and of the sub-nodes within the network according to the aforementioned network data.
89. 89. A data processing system for the optimization of redirection of a telecommunications network, when detecting an alarm inside this telecommunication network, comprising this data processing system: an element for coupling the data associated with the alarm, to a security alarm configuration; and an element for automatically invoking the redirection optimization processing according to the aforementioned session alarm configuration.
90. 90. The data processing system as claimed in claim 89, characterized in that the element for automatically invoking the redirection optimization processing according to the aforementioned session alarm configuration, further comprises an element for initializing an inferred of the user with data for a given session from the session alarm configuration; an element to execute the redirection calculations for said session; and an element to present the results from the execution of the redirection calculations to the user, through a user interface.