Multi-protocol telecommunications routing optimization

Multi-protocol telecommunication routing optimization {MULTI-PROTOCOL TELECOMMUNICATIONS ROUTING OPTIMIZATION}

The present invention relates to telecommunication, and more specifically, according to an analysis of statically and dynamically changing variables and user priorities, etc., among a number of available paths A method and apparatus for dynamically selecting an optimal telecommunication path.

These days, in the telecommunication industry, for voice communication, from simple analog connections of telephones to data, facsimile, e-mail, video, audio, and voice in analog and digital formats (herein collectively treated as data), etc. Even the current system for transmitting and receiving is rapidly changing. Data may be transmitted in a variety of formats, such as data files, data packets, packets by encapsulation, or data streams (herein treated as data files). BACKGROUND OF THE INVENTION Various types of telecommunication systems are installed, and continue to be installed, and these telecommunication systems function as centrally located systems for the transmission of data over various media. Examples include POTS (a plain old telephone system carrying analog voice signals), leased lines, mobile cellular networks, digital links, fiber optics, satellite links, and proprietary packets such as the Internet. By a switching network and a public packet switching network, data can be transmitted from one user to another user.

In addition, there are various price competitions between service providers using various types of these transmission media. Speeding up competition among consumers, businesses, non-profit organizations and government users against each other, for example by long-distance service providers such as AT&T and MCI, for the purpose of gaining greater market share. As a result of the various types of telecommunication services available, as well as competition among the providers of these services, users sometimes face difficult choices regarding the selection of services that can provide users with the highest quality.

Occasionally, more than one telecommunications service provider is available to a user at a given time for selection as a carrier of the transmitted data. For example, a user may subscribe to more than one long-distance provider and access different providers at any given time by dialing a service provider code and then dialing a destination phone number. Additionally, users may have various types of media available for selection; That is, the connection may be made through the Internet, satellite, or the like. This is particularly true in a business environment, where, for economic considerations, a variety of telecommunication resources are available.

In general, in the prior art, a low price is included as a factor for making a routing decision for data transmission. As such, the so-called "least cost routing" Facilities are growing rapidly, and these facilities call the service provider that offers the lowest cost at a given time. By means of a private branch exchange system (PBX system), you can use the lowest cost routing facility that automatically routes the calling party to the destination number along the lowest cost path available. have.

In the present invention, it is recognized that the highest quality for a telecommunication medium at any given time does not necessarily have to be the lowest cost of the available options. That is, the optimized routing selection not only includes low cost, but also the transmission bandwidth of the telecommunication medium, the availability of the medium at special times when the user needs to use the medium, the stability of the medium, and the reliability of the medium. Consider other factors, such as In addition, the user's priorities may change from time to time, and the requirements for the transfer of one data file are different from those of another. That is, a user may want to transfer a single file in an emergency at the fastest speed regardless of the cost of the telecommunications medium. Other files may require high reliability against illegally waterproofing, but only other files need to be transferred at any time in the near future at any time in the near future and at the lowest cost.

Therefore, in the present invention, the selection of the optimal path for data transmission at a given time is a dynamic analysis that must be performed in real time, and the user's priority, the priority of the file to be transmitted, and the usage Include the fact that it is a dynamic analysis that must take into account various factors on possible media, etc.

U.S. Patent No. 5,337,352 discloses a dedicated PBX system that provides services to multiple tenants, with the highest priority by each tenant, followed by the second highest priority, and then It is characterized in that it is possible to classify which path can be selected from among a plurality of paths having the following priority or the like. In the routing selection, it is predetermined by each tenant according to the requirements or available resources for this, and this selection is stored in a table in a dedicated private branch exchange (PBX). Once the tenant wants to make a call, the PBX looks at the table for the purpose of determining the highest priority for this particular tenant, and connects the call accordingly. If these routes are not available, the following priorities are linked according to the determined tenant table. Therefore, the predetermined packet order is established by each lessee and stored in the PBX. These systems are static and not changeable on a real-time basis, as each tenant must pre-determine a particular supplier's priorities for use. The system at 5,337,352 checks the availability of the highest predetermined priority path, but uses the next highest priority if no such path is available, but this analysis implies only separate yes/no questions, The current traffic volume is not taken into account in the route analysis of availability in relative terms.

It is therefore an object of the present invention to overcome the drawbacks of the prior art systems described above.

SUMMARY OF THE INVENTION It is an object of the present invention to provide an optimal remote method to connect a call to a remote location in order to transmit a data file over a telecommunication path, by analyzing a set of multiple protocols on a real-time basis. To provide a method and apparatus for selecting an optimal telecommunication path.

Another object of the present invention is to provide said system and said method for multi-protocol route optimization, by means of which special data in determining the optimal route for a call. Analyze the user's priorities with respect to file transfer.

Another object of the present invention is to provide the system and the method for multi-protocol route optimization, whereby real-time in determining the optimal route for a call is achieved. Based on this, various factors are analyzed with respect to the path.

Another object of the present invention is to provide said system and said method for multi-protocol route optimization, by which the user overrides a preset default value. and classify critical transfer parameters on a file-by-file basis.

In accordance with these and other purposes, a first memory comprising a data file transmitted to a remote destination, and a plurality of interfaces coupled to the first memory, each of these interfaces coupled to an associated remote communication path, comprising: It provides a telecommunication switching system equipped with - capable of transferring data files to the destination. In such a switching system, a second memory for storing predetermined parameters associated with each of the remote communication paths, and a value of a variable parameter associated with each of the remote communication paths Measuring means and the like. A third memory stores a set of user priorities with respect to the transfer of the data file. by operation, the second and third memories; and transmitting a data file according to a set of user's priorities, the predetermined telecommunication path parameter and the measured variable parameter, etc., among the plurality of telecommunication paths. the variable parameter measuring means for determining which path to use in ; etc. and processor means are related. In such a switching system, an input means for enabling a user to change the user priority in the third memory before transferring a file is additionally included.

For example, by means of the variable parameter measuring means, the measurement of the respective data transfer rate of the telecommunication path is carried out, for example by means of a ping test. The predetermined parameter stored in the second memory includes a cost per unit time of using each of the telecommunication paths, the cost per unit time being a function of the current time of day and per unit time. () cost is a function of the current day of the week. The predetermined parameter stored in the second memory includes a measure of data transmission reliability of each of the paths and a measure of a data transmission bandwidth of each of the paths. Such a switching system additionally includes means for ensuring that the interface at a particular time is available for data file transfer.

In a method of using the switching system of the present invention, a method is provided for determining which of a plurality of telecommunication paths to use for transferring a data file according to a set of user priorities, each measuring a variable parameter for the path; analyzing the measured changeable parameter and the predetermined parameter in relation to user priority; And it transmits the file according to the user's priority, and some of the remote communication paths provide features required by the user.

1 shows a functional block diagram of a switching system of the present invention using multi-protocol routing optimization;

Figure 2 shows a flowchart of a main routine performed by the present invention; and

3 shows a flowchart of an interface analysis sub-routine performed according to the present invention.

*Reference No. Description

10 : telecommunication switching system

22 : Second memory

24 : path analysis block

26 : routing optimization block

30 : first memory

32 : User priority (memory)

1 shows a block diagram of a telecommunication switching system 10 of the present invention, for example, a personal computer platform, a personal digital assistant (PDA), The system 10 may be implemented in a dedicated system such as a PBX (Private Branch Exchange), or a similar device. The switching system 10 is connected to various telecommunication media according to the user's resources. More specifically, via the T1 interface 12 via a high digital link, via the LAN interface 14 to a local area network (LAN), and to a wide area network (WAN) Through the WAN interface 16, through the POTS (conventional telephone system carrying analog voice signals, plain old telephone system) to the local loop, and to the wireless communication network, the air interface 20 Through , the switching system 10 can be configured. Interfaces 12, 14, 16, 18, and 20 are by way of example, and for the purpose of illustrating preferred embodiments of the present invention, these interfaces 12, 14, 16, 18, and 20 are present. Therefore, in practice, the multiple interfaces mentioned above can be used alone or in any combination as required by the user. Through the multi-protocol routing optimization described herein, users can take advantage of the relative advantages of each carrier, for example, MCI, AT&T, And a number of common carriers, such as SPRINT, can be configured for the switching system (10). Additionally, the wireless interface 20 may be configured for communication by any of various types of electromagnetic means, such as infrared, radio frequency, and similar means.

Each telecommunication media connected to the various interfaces in FIG. 1 has certain parameters related to these telecommunication media implemented by the routing method of the present invention. The parameters are classified according to a predetermined (fixed) routing methodology, or a measurable (variable) routing methodology, or the like. Data relating to the predetermined parameters are stored in the memory 22 of the switching system 10, and the data relating to the measurable parameters are stored at each interface in real time or at the time of transferring the data file to make the routing method into a suitable analysis. It should be controlled by the path analysis block 24 (path analysis block).

Predetermined parameters stored in memory 22 include, but are not limited to the table below: Table A

$maxbandwidth(i) : The maximum available bandwidth for interface (i). For example, set the $maxbandwidth variable up to 28.8 by 28.8 kbs modem.

$reliabililty(i) : 10 = unreliable transmission (wireless) ; 50 = Somewhat reliable (eg modem); 75 = very reliable (eg, T1, WAN); 100 = Most reliable (eg Ethernet LAN) ; Indicates the reliability of the interface (i) according to a measurement measure such as, etc.

$economy(i) : Current consumption for interface(i) over a period of time, where a high cost interface is standardized to produce a low measurable savings ($economy(i) = 100 - cost/min).

$availability(i) : Availability of interface(i) for a particular user. Not all users of the system have access to their respective interfaces; For example, in a shared PBX environment, only certain subscribers have access to the T1 interface. $availability = 0 - not available; $availability = 1 - available;

$security(i) : Points to the relative data security of the path, which can be a function of, for example, the number of bits in the cryptographic key (eg 1024).

Although not limited to the table below, measurable parameters include: Table B

$presentstate(i) : The current state of the interface (i) indicating whether the remote communication path is currently up. $presentstate = 0 - working state; $presentstate = 1 - not working state;

$avgstate(i) : First, the state of $presentstate(i) in the 5-minute window.

$datasize(i) : The size of the data file to be transferred (KB)

$latency(i) : Delay measurement (msec) through path (i). It is based on real-time inspection of the interface, by so-called ping to the remote host.

$time : time of day/day of week ; This is the same for all interfaces.

$availbandwidth(i) : Available bandwidth of interface (i) at a given time of file transfer.

pre-programmed "least cost" In order to arrive at a routing decision to transmit a data file, rather than simply responding to a routing decision criterion, according to the present invention, all variables or logical sub-sets of variables announced in Tables A and B, etc. use it That is, by using the multi-protocol routing optimization of the present invention, the path selected for the transmission of the data file takes into account parameters, these parameters being varied in real time, and therefore the lower level of the prior art. It does not rely on simple pre-programmed look-up tables by cost providers. Additionally, in making routing decisions, the user can classify the user's priorities with respect to parameters important to transferring a particular file, such as low cost, high speed, reliability, and stability.

The method used by the present invention is processed by a routing optimization block 26 (which may be implemented in a microprocessor), and by varying combinations of the parameters announced in Tables A and B, etc. It uses two elements that contain The first factor is a measure of the inherent efficiency and desirability of a particular telecommunication path, and is given by the following equation.

<maths id="1" align="center">$prevalue(i) = $maxbandwidth(i) + $reliability(i) + $economy(i) + $security(i)</maths>

The variable $prevalue is a value with a high bandwidth, high reliability, a high measure of savings (low cost), and a high degree of stability for a particular path, or a value with an increasing linearity in either one. Based in part on the $time variable (the cost of the route represents a function of hours in days/days in weeks) taken from a real-time clock Except for the fact that , the variable does not substantially change for a given path.

The second element used by the routing methodology of the present invention is based in part on real-time parameters that can exhibit various changes due to various causes. Among the real-time parameters, some parameters are controlled by the user. can exceed

When $speed(i) = 10000 - ($datasize(i) x $latency(i) x 100) ,

If $currentvalue(i) = $economy(i) x $speed(i) + $avgstate(i) x 10, then we get

<maths id="2" align="center">$currentvalue(i) = $economy(i) x (10000 - $datasize(i) x $latency(i) x 100) + ($avgstate(i) x 10)</maths>

Therefore, $currentvalue(i) for a given path (i) has higher savings (lower cost), smaller data file size, and lower rotation latency (by higher speed) through the path, or either will be greater for paths with .

Then, the selection using the optimal path is a combination of the above calculated values such as Equations 1 and 2:

<maths id="3" align="center">$finalvalue(i) = $prevalue(i) + $currentvalue(i)</maths>

= $maxbandwidth(i) + $reliability(i) + $economy(i)

+ $security(i)

+ ($economy(i) x (10000 - $datasize(i) x

$latency(i) x 100)

+ ($avgstate(i) x 10)

Then, according to the routing optimization methodology block, a threshold of 25 or greater ($avgstate x 10 ), take the highest $finalvalue(i) for each path. Rather than simply determining the lowest cost routing, using this method allows an optimal choice based on analysis of the multiple protocols used by the system.

By means of a path analysis function block 24 (path analysis function block), for example, "ping ( ping)" By a known software utility known as , the value of $latency(i) for each path (i) is taken. A ping routine sends packets to the network and takes the average delay encountered by these packets in arriving at and returning to their destination. Other techniques for obtaining a measure of the rotational latency of a path by the system are also included in the present invention.

Characterize according to the user the relative weights given to each of the variables published in tables A, B, etc. according to the user's special requirements, stored in the user priority memory 32 . These fixed weights may be stored in the memory of the switching system, and these fixed weights may be used in connection with the routing method for all files transferred according to the present invention. Weights are used as multipliers for variables in the algorithm, allowing the user to characterize the algorithm as required. For example, if the user wants to highlight the $security(i) parameter in the analysis, then double the $security(i) parameter ( For weighting, the user can classify (for example) two weighting multipliers ().

Additionally, the user may prioritize programmatically processed fixed parameter weights to temporarily stored values via input to the user interface 34 for any given file transfer. A user interface means any type of device that enables data input by a user, such as a keyboard, a mouse, and the like.

In another form of weighting parameters, we also focus on programs that ignore certain parameters by the user, and focus on only one parameter in arriving at a routing decision. For example, if the user wishes to transfer the data file 31 to a remote location via the fastest route, regardless of cost or any other factor, the user may A routing optimization block 26 classifies these requirements. Then, by treating all variables except $latency as predetermined factors by the routing optimization block 26, the path with the smallest value for $latency (ie, the smallest routing delay) is the fastest The route is selected by the routing optimization block 26 .

Other substitutions and other variations on the above examples, etc., to the person skilled in the art, so that the user can classify the user priorities with respect to the data transfer of the file at any given point at any time. can be easily taken by means of an analysis, for example, the analysis calls attention to some two variables.

Additionally, the user can store any set of weighting parameters to be used in different situations, and then select the set when required. The set of weights can then be applied in the manner described above. In addition, the program can be configured to automatically apply a set of weights as a function of the data type. For example, the user can classify all facsimile messages with a high saving factor and all video files with a low stability factor.

2 and 3 and the like show a flow chart of the method used by the present invention when an optimal choice of routing a data file among a plurality of available paths is reached in accordance with the present invention. First, as shown in FIG. 2 , a fixed user priority can be called up so that the parameters used in the analysis can be weighted accordingly. Then, it is possible by the user to enter the user's temporary priority override value for file transfer. Assuming the above example of not importing fixed weighting values or temporary override values, etc., the $finalvalue parameter is set to each of the paths i in the switching system 10 in the following way. is decided on

First, with reference to FIG. 3 , for the purpose of determining whether the user has programmed the interface (i) to be available by observing the variable $availability(i), the routing optimization block 26 is stored in the memory 22 check For example, if the switching system 10 is implemented in a dedicated private branch exchange system (PBX system), all users will benefit from these PBX system saving resources so that all users can access all paths (i). can't access This information is stored in memory 22 and can be checked as a first step in the sequence of FIG. 3 .

If $availability(i) = 0, then $finalvalue(i) is set to 0 and exits the routine. However, if interface(i) is available, $availability(i) is set to 1, and the procedure proceeds. The routine then checks to see if path (i) is operational at that time, and the $presentstate variable returns from $interface(i) accordingly. If $presentstate(i) is 0 (path is disabled or down), $finalvalue is set to 0 and exits the routine. If $presentstate(i) is 1 (if the path is enabled or up), the routine proceeds.

Then, to check whether it is greater than a predetermined threshold, for example, $avgstate x 10 &gt; Check the variable $avgstate to see if it is 25. If this is true, interface i is considered to be in a substantially operable condition. If this is false, interface(i) is considered to be in a condition that is not actually operable, even if $presentstate indicates operability at this particular time.

The routine then proceeds via path analysis block 24 to take the value of $latency(i). Using $latency(i), the variable $speed(i) is computed, as shown in the flowchart, and as described above. As a function of the $time variable, the variable $economy(i) is obtained from the memory 22 . Then, the variable $currentvalue(i) is evaluated as a function of $economy(i), $speed(i), and $avgstate(i).

Then, as a function of the variable $maxbandwidth(i), $reliability(i), and $security(i) obtained from the memory 26, as well as the previously predetermined $economy(i) variable, $ prevalue(i) is computed. Finally, the variable $finalvalue is obtained as shown in the routine, and the variable $finalvalue is stored in a register during the computation of $finalvalue(i) to remain in the interface as shown in FIG. 2 .

Although the interface has been analyzed in the above manner, a decision is then made to select the interface (i) according to the highest value for $finalvalue(i) by the routing optimization block 26 . The data file is then routed from memory 30 to the selected interface for transfer.

The routines shown in Figs. 2 and 3 can be supplemented by the user priorities override feature described above, whereby the fastest path, the lowest cost path, and the most reliable It is possible to classify routes and the like.

The measurable parameter $availbandwidth(i) in the algorithm presented here is also available to provide a real-time indication of the request to select a particular interface(i) at any given time. It provides a measure of the maximum bandwidth that may be available for a given interface by the fixed parameter $maxbandwidth(i), but may examine the interface if desired to determine which part of this bandwidth is actually available. A test known in the art for carrying out such a measurement is the so-called "show interface serial zero" It means checking, by measuring the amount of packets received in the last n seconds, and by measuring how many packets the interface has sent in these times, "show interface serial zero" ; You can run the test. Therefore, instead of, or in connection with, the already measured parameter $latency, the parameter $availbandwidth may be used to perform the analysis herein.

Additionally, the systems, methods and the like of the present invention are shown in connection with the transfer of a single data file (as defined herein), but multiple data files on a serial or otherwise parallel (insertion) basis by modification of suitable algorithms and routines. The present invention is applicable to the transmission of

The selection of particular parameters and parameters used herein is shown in the preferred embodiment; It is contemplated that other variables may be used in connection with the present invention to arrive at an optimal path in a given situation. In addition, special algorithms that are determined to supply the necessary relative weights for fixed and measured variables, etc., can also be supplemented to achieve optimal routing selection.