Multi-protocol telecommunications routing optimization
Abstract
A telecommunications switching system employing multi-protocol routing optimization which utilizes predetermined and measured parameters in accordance with a set of user priorities in determining the selection of a telecommunications path to be utilized for transmitting a data file to a remote destination. The switching system has a first memory for storing the data file to be transferred, a second memory for storing predetermined parameters such as cost data associated with each of the telecommunications paths, a third memory for storing a set of user priorities regarding the transmission of data files, and means for measuring the value of variable parameters such as file transfer speed associated with each of the telecommunications paths. Processor means are operatively associated with the second and third memories and the variable parameter measuring means for determining which of the plurality of telecommunications paths should be utilized for transferring the data file in accordance with the set of user priorities, the predetermined telecommunications path parameters, and the measured variable parameters. The switching system further comprises input means for allowing a user to change the user priorities in the third memory prior to transmitting a file.

Term
Term ended
Projected expiry passed 30 October 2017, 8.9 years ago.
- Priority
- Filed
- Projected expiry
- Today
22 claims: 7 independent, 15 dependent
- 1REIVINDICAÇÕES • · · · · « ·· ·· • · · · ] . Sistema de comutação de te1ecomunicaçôes, CARACTERIZADO pelo fato de compreender uma pluralidade de interfaces, sendo que cada uma das ditas interfaces é 5 iti ter conectada a um caminho de telecomunicações associado capaz de transferir um arquivo de dados para um dest i no remoto, sendo que cada um dos ditos caminhos de telecomunicações têm parâmetros predeterminados associados a ele armazenados em uma memória no dito sistema de comutação e parâmetros variáveis associados a ele, um método de determinação de qual dentre a dita plural idade de caminhos de telecomunicações deve ser utilizado para a transferência de um arquivo de dados, sendo que o dito método compreende as etapas de:]5 a) medir os ditos parâmetros variáveis para cada um dos ditos caminhos;b) analisar os ditos parâmetros variáveis medidos e os ditos parâmetros predeterminados;e c) determinar qual dos ditos caminhos 20 proporciona um conjunto ótimo de características para a transferência do arquivo para o destino remoto.
- 22, Método, de acordo com a reivindicação 1, CARACTERIZADO pelo fato de que a dita etapa de determinação analisa um conjunto de prioridades de usuário programadas na 25 determinação de qual dos ditos caminhos proporciona o caminho ótimo de características para a transferência do arquivo para o destino remoto. .·. ··; ··:.·· ·j rfcixfin{I\4Ía,í*p? : íj, ··* · ·· ··· · ·· ··
- 3CARACTERIZADO predef i nidas comutação. Mé t odo, de a corda coro pelo fato de que as prioridades do usuário são e armazenadas na dita memória de sistema de
- 45 4. Método, de acordo coin a reivindicação 3, CARACTERIZADO pelo fato de que as ditas prioridades do usuário predefinidas podem ser mudadas pelo dito usuário antes da dita etapa de análise. 5. Método, de acordo com a reivindicação 2, 10 CARACTERIZADO pelo fato de que os parâmetros variáveis do caminho de telecomunicações compreende a velocidade de transferência de dados do dito caminho em um dado ponto no L empo.
- 56. Método, de acordo com a reivindicação ?, is CARACTERIZADO pelo fato de que os ditos parâmetros predeterminados de caminho de telecomunicações compreendem o custo por unidade de tempo de utilização do dito caminho.
- 67. Método, de acordo com a reivindicação 6, CARACTERIZADO pelo fato de que o dito custo por unidade de 20 tempo é uma função da hora atual do dia.
- 78. Método, de acordo com a reivindicação 6, CARACTERIZADO pelo fato de que o dito custo por unidade de tempo é uma função do dia atual da semana.
- 89. Método, de acordo com a reivindicação 1, ?5 CARACTERIZADO pelo fato de que os ditos parâmetros predeterminados de caminho de telecomunicações compreendem uma medi da da confiabilidade de transáeránCkia·* cte 'Aatád^ ‘4a :! ·.* : ··· ........ di ta trajetória.
- 910. Método, de acordo com a reivindi cação 1, CARACTERIZADO pelo fato de que os ditos parâmetros predeterminados de caminho de telecomunicações compreendem uma medida da largura de banda de transferência de dados do dito caminho.
- 1011. Método, de acordo com a reivindicação 2, CARACTERIZADO pelo fato de compreender ainda a etapa de 10 analisar o tamanho do arquivo a ser enviado em relação às ditas prioridades do usuário.
- 1112. Método, de acordo com a reivindicação 1, CARACTERIZADO pelo fato de compreender a etapa adicional de primeiro apurar se uma interface está disponível antes de 15 executar a dita análise.
- 1213. Método, de acordo com a reivindicação 3, CARACTERIZADO pelo fato de que cada um dos ditos parâmetros predeterminados e medidos têm um peso com relação às ditas prioridades do usuário na execução da dita etapa de análise. 20
- 1314. Sistema de comutação de telecomunicações, CARACTERIZADO pelo fato de compreender:a) uma primeira memória fiara manter um arquivo de dados a ser transferido para um destino remoto;b) uma plural idade de interfaces acopladas à 25 dita primeira memória, sendo que cada uma das ditas interfaces é interconectada a um caminho de telecomunicações associado capaz de transferir o arquMo B ··· · · ·· 0« 0 00 · · · · · tife: e d$dp /:c ipi •0 000 0 00 ?η destino remoto;c) uma segunda memória para armazenar parâmetros predeterminados associados a cada um dos ditos caminhos de telecomunicações;d) um meio para medir o valor de um parâmetro variável associado a cada um dos ditos caminhos de telecomunicações,;e e) um meio de processamento associado operativamente às ditas segunda e terceira memórias e dito meio de medição de parâmetro variável para determinar qual da dita pluralidade de caminhos de telecomunicações deve ser utilizado para a transferência do arquivo de dados de acordo com os ditos parâmetros de caminho de telecomunicações predeterminados e ditos parâmetros variáveis medidos.
- 1415. Sistema, de acordo com a reivindicação 34, CARACTERIZADO ainda pelo fato de compreender uma terceira memória para armazenar um conjunto de prioridades de usuário que dizem respeito à transmissão de arquivos de dados e em que o dito meio de processamento determina qual dentre a dita pluralidade de caminhos de telecomunicações deve ser utilizado para a transferência do arquivo de dados de acordo com as ditas prioridades do usuário.
- 1516. Si st ema de comu tação, de acordo com a reivindicação 15, CARACTERIZADO pelo fato de compreender ainda um meio de entrada para permitir que um usuário mude as dilas prioridades de usuário na dita terceira memória.
- 1617. Sistema de comutação, í.Uá :.kdôrídQ·* /qóitj *··θ • s ··* · ··· ··· · ·· ·· reivindicação 15, CARACTERIZADO pelo fato de que o dito meio de medição de parâmetro variável executa uma medição da velocidade de transferência de dados de cada um dos ditos 5 caminhos de telecomunicações.
- 1718. Sistema de comutação, de acordo com a reivindicação 16, CARACTERIZADO pelo falo de que a dita medição de velocidade de transferência de dados é executada por um teste ping. io
- 1819. Sistema de comutação, de acordo com a reivindicação 15, CARACTERIZADO pelo fato de que os parâmetros predeterminados armazenados na dita segunda memória compreendem o custo por unidade de tempo de utilização dos caminhos de telecomunicações. 15 20. Sistema de comutação, de acordo com a reivindicação 3 9, CARACTERIZADO pelo fato de que o custo por unidade de tempo é uma função da hora atual do dia. 21. Sistema de comutação, de acordo com a reivindicação 19, CARACTERIZADO pelo fato de que o custo por
- 1920 unidade de tempo é uma função do dia atual da semana.
- 2022. Si stema de comutação, de acordo com a reivindicação 15, CARACTERIZADO pelo fato de que os parâmetros predeterminados armazenados ria dita segunda memória compreendem uma medida da confiabilidade de 25 transferência de dados de cada um dos ditos caminhos.
- 2123. Sistema de comutação, de acordo com a reivindicação 15, CARACTERIZADO pelo fato de que os parâmetros predeterminados armazenados, 5 3iã.5 .di' ta'. :! ! ,·* · ··· ··· · ·· memória compreendem uma medida da largura de banda de transferência de dados de cada um dos ditos caminhos.
- 2224. Sistema de comutação, de acordo com a 5 reivindicação 15, CARACTERIZADO pelo falo de compreender ainda um meio para apurar se uma interface está disponível para a transferência de arquivo de dados. 1/3 2/3 • '* .·
Independent claims22
91 paragraphs in 1 section, as filed
(54) Title Optimization of the telecommunications route in multiple protocols (30) Unionist Pnondity 3i / io / i996usoe / 74i 130 (71) Department of Connect One (US) (72) Inventor (s) Allen D Kaplan William F McCadhy (74) Attorney Daniel 6 Cia (86) International Order pci us97 / iôg24 of 10/30/1997 (87) International Publication WO98'19439 of 07/05/1998 (57) Summary optimization in the telecommunications route IN MULTIPLE PROTOCOLS using a telecommunications switching system (10) that employs route optimization with multiple protocols and using predetermined parameters and measured according to a set of user priorities in determining the selection of a telecommunications path to be used for the transmission of a data file to a remote destination The switching system (10) has a first memory (30) to store the data file and a second memory (22) to store predetermined parameters, a third memona to store a set of user requirements (32), a means (24) to measure the value of the viable parameters associated with each of the telecommunication paths and a processing means (26) and operatively associated with the second and third memories (22 and 23) and the feasible parameters to determine which among and plurality of telecommunication paths should be used
<img file="BR9712399A_D0001.tif" />
OPTIMIZATION ON THE ROUTE OF: ': TfLJsÇÍMuKT <AÍWS SJ IN
MULTIPLE PROTOCOLS
Cross-Reference to Related Order
This request is based on and claims the priority of the <sup>F</sup>* copendenLe patent application filed with the Fie
United States Patents, on October 31, 199C and was assigned the N of Senate 06 / 741,130.
Technique Field
This invention relates to telecommunications and, in particular, a method and apparatus for dynamically selecting an optimal telecommunications path from a plurality of available paths according to an analysis of both the statically and dynamically changing variables and priorities of the user.
Prior Art
The telecommunications industry has changed rapidly in recent times, from the simple analog connection of telephones for voice communications to current systems for the transmission and reception of data, facsimile, e-mai1, video, audio, as well as voice in both format. both analog and digital format (hereinafter collectively referred to as data). The data can be transmitted in any of several formats, such as a data file, data packets, encapsulated packets, or data streams (hereinafter referred to as a data file). Several types of telecommunication systems have been and continue to be installed that function as the main systems for transmission: give s ^ HõcS in '/ uivA the
4 · II 4 III ll 4 ·
II II ····· «• I 44 I 444 II · I · 4« means. For example, data can be transferred from a user to a gold by POTS (old flat phone system), 1 rented lines, mobile cellular networks, digital links, optical fibers, satellite links and packet switched networks public and private sectors such as the Internet.
In addition, there is a lot of competition in terms of price between service providers that employ different types of transmission media. For example, so-called long-distance service providers such as AT&T and MCI offer rates that compete with each other in order to gain greater market share from consumers, businesses, unprofitable organizations and government users. As a result of the numerous types of telecommunications services available, as well as the competition between providers of these services, users are always faced with difficult choices when it comes to selecting a service that will provide them with the best value.
Often, more than one telecommunications service provider is available at any given time to a user as a carrier of the data to be transmitted. For example, a user can subscribe to two or more long distance service providers, and can access or one at any given time by first dialing the service provider's code? 5 and then dialing the destination phone number. In addition, a user can have several types of media available for selection, that is, have several types of media available for selection; that is, the connection: ροϋς: SM -'fe ^ tià:: 'yia ·· · 0 «0 0 0 00 00 0 0 00 0 1 0 0 0 0« 0 0 «1 000 000 0 00 00
Internet, satellite, etc. This is especially true in a commercial environment, where economic considerations allow numerous telecommunications resources to be available for use.
The prior art generally recognizes low cost as the factor on the basis of which route decisions are made for data transmission. As such, so-called lower-cost route resources proliferate, allowing a call to be placed with a service provider that provides the lowest cost at any given time. PBX (Private Branch Exchange) systems can employ such a resource. lowest cost route that automatically connects the outgoing call to the destination number along the cheapest available route.
The present invention recognizes that the best value for a telecommunications mix at any given time is not necessarily the lowest cost of the choices available. That is, the optimization of the route selection covers not only the low cost, but also takes into account other factors such as medium transmission bandwidth, its availability at the specific moment when the user needs to use it, its security and your reliability. In addition, a user's priorities may change from time to time, and requirements regarding the transmission of a data file may differ from the requirements of another file. That is, a user may want to transmit a file in an emergency situation c'β '^ unia' 'tèSqtsülude * * ·· · ·· fl flfl fl flfl flfl • fl fl · flfl flflflfl fl fl flfl · flflfl flflfl fl flfl flfl major, despite its cost. Other files may need high security against illicit interception and still other files may only need to be transmitted at the lowest cost at any time in the near future without concern for speed.
Thus, the present invention recognizes that the selection of the optimal route for data transmission at a given moment is a dynamic analysis that has to be done in real time and has to take into account several factors with regard to the available medium as well as the priorities of the user and the file to be transmitted.
The US patent N<sup>1</sup>'5,337,352 describes a PBX system that serves a plurality of tenants, in which each tenant can specify which of a plurality of routes should be selected as having the highest priority, then the second highest priority, etc. Route selections are predetermined by each tenant according to their needs and available resources and the selections are stored in a table on the PBX. Once a tenant wishes to make a call, the PBX looks at the table to determine the highest priority route for the particular tenant and connects the call accordingly. If that route is not available, then the next priority route, according to the predetermined tenant table, is connected. Thus, a certain package order is established by each tenant and stored in the
PBX. This system is static and not mirtáVelí '«go real time since each tenant has to predetermine the priority of specific providers to use, although the system of this patent checks the availability of the highest predetermined priority route and uses the next priority roll higher if it is not available, The] analysis is just a discrete yes / no inquiry and does not take into account the current amount of traffic on the route to analyze the route's availability on a relative basis.
Therefore, it is an objective of the present invention to overcome the drawbacks of prior art systems as described above.
It is an objective of the present invention to provide a system and method for selecting an optimal telecommunications path to connect a call to a remote location for the transfer of a data file by analyzing a set of protocols on a real time basis. multiple.
It is another objective of the present invention to provide such a system and method for optimizing the multiple protocol route that analyzes the priorities of a user with respect to the transmission of a particular data file in determining the optimal route for the call.
It is another objective of the present invention to provide such a system and method for route optimization of multiple protocols that analyze several factors with regard to the • II III II II GfetierAiiiaeçÊDS regarding the route on a time basis ££ * 1
I roll great for the call.
It is another objective of the present invention to provide such a system and method for multi-protocol route optimization that allows a user to override pre-defined default values and specify critical transfer parameters on a file-by-file basis.
Description of the Invention
In accordance with these and other objectives, a system of communication systems is proposed which comprises a first memory to maintain a data file to be transferred to a remote destination and a plurality of interfaces coupled to the first memory, in which each of the interfaces is interconnected to an associated telecommunications path capable of transferring the data file to the remote destination. 0 The switching system comprises a second memory for storing predetermined parameters associated with each of the telecommunications paths and a means for measuring the value of the variable parameters associated with each of the telecommunications paths. A third memory stores a set of user priorities regarding the transmission of data files. A processing medium is operatively associated with the second and third memories and the variable parameter measuring medium to determine which path, among the plurality of paths, should be used for the transformation of the data file according to the user's set of priorities , the parameters: He: cenífiihc:<sup>-</sup>: in
0 00 0 0 0 0 00 00 0 · 00 «00000 0 0 00 0 000 000 · 00 00 teJunications predetermined and measured variable parameters. The switching system further comprises an input medium that allows a user to change user priorities in the third memory before a file is transmitted.
For example, the variable parameter measurement medium performs a measurement of the data transfer speed of each of the telecommunications paths, for example, by a so-called ping protocol test. The predetermined parameters stored in the second memory comprise the cost per unit of time of use of each of the telecommunication paths, which can be a function of the current time of the day and / or the current day of the week. The predetermined parameters stored in the second memory also comprise a measurement of data transfer reliability for each of the paths as well as a measurement of the data transfer bandwidth for each of the paths. The switching system may also comprise a means of ascertaining whether an interface is available for transferring data files at a particular time.
In one aspect of the method using the switching system of the present invention, a method of determining which of a plurality of telecommunication paths should be used for the transfer of data files according to a set of user priorities is provided, the method comprising: as: sbsptíss da'irepfeif: the «•« • air aaaa »at • · · · aaaaaa aa aa aa aaa iaa aa aa aa variable parameters for each of said paths, analyze the measured variable parameters and the predetermined parameters in relation to the user's priorities; and determining which path provides the characteristics desired by the user for the transfer of the file according to the user's priorities.
Brief Description of Drawings
Figure 1 is a functional block diagram of the
0 switching system of the present invention that uses multiple protocol route optimization.
Figure 2 is a flow chart of the main routine performed by the present invention; and
Figure 3 is a flowchart of the interface analysis subroutine performed by the present invention.
Best Mode for Carrying Out the Invention Figure 1 illustrates a block diagram of the telecommunications switching system 10 of the present invention that can be implemented for example on a platform of? N personal computer, personal digital assistant (PDA), dedicated system such such as a PBX or similar. The switching system 10 is connected to various telecommunications means according to the user's resources. In particular, switching system 10 can be configured for a high-speed digital link via an interface
TI 12, for a local area network (LAN) via LAN interface
14, for a wide area network (WAN) via a WAN interface
16, for a local loop in a tl ^ eíctrsi system '<; õ': an)! Içtap: fpno ·· β 0 · φ 0 0 0 »r 00 0 0 00 00 000 0 • 0 00 0 000 000 0 00 00 (POTS) via POTS interface 18 and for a wireless communication network via wireless interface 20. Interfaces 12, 14, 16, and 20 are exemplary and are provided for the purpose of illustrating the preferred embodiment of the present invention. Thus, in practice, any number of the interfaces mentioned above can be used alone or in any combination, as needed by the user. For example, a series of common carriers such as MCI, AT&T and SPRINT can be configured for switching system 10 such that the user can take advantage of the relative benefits of each carrier via the multiple protocol route optimization to be described here. In addition, the wireless interface 20 can be configured for communications by any of several types of electromagnetic means, such as infrared, radio frequency and the like.
Each of the telecommunications means connected to the various interfaces of Figure 1 has certain parameters associated with them that are implemented by the path methodology of the present invention. These parameters are classified by the path methodology as being either predetermined (fixed) or measurable (variable). The data related to the predetermined parameters are stored in a memory 22 in the switching system 10, while the data related to the measurable parameters have to be collected by the path analysis block 24 of each interface in real time at or around the moment when the data file is transferred so that the metEtiãloqíS <sup>and</sup>6le? ': N & fcS f <sup>J</sup> ·· 4 ti t · · ia ia 4 » <sup>9</sup> · 44 44 4444 • 4 44 4 444 444 4 44 44 an appropriate analysis.
Predetermined parameters stored in memory
3? include, but are not limited to, the following:
TABLE A $ maxbandwidth (i): maximum amount of bandwidth available for interface (i). For example, a 28.8 kbs modem will have a $ maxbandwjdtb variable set to 28.8.
Sreliability (i) $ economy (1) an indication of the reliability of the interface (i) according to the following scale:
= unreliable transfer (wireless) 50 = moderately reliable (eg modem) “very reliable (eg Tl, WAN) 100 ~ ultra reliable (eg ?,
Ethernet LAN)
The currency expenditure of the interface (i) for a period of time, normalized in such a way that a high-cost interface gives a low measure of savings:
$ economy (i) = 100 - cost / minute $ ava i labi1ity (i) the availability of the interface (i) for a particular user. Not all system users will have access to each interface; for example, in a shared PBX environment only certain subscribers can access the Tl interface.
$ Availability - 0 not available $ availability - 1 available $ securj ty an indication of the security of the relative path data, which can, for example, be a function of the number of bits in an encryption key (for example 1024)
Measurable parameters include, but are not limited to, the following:
<td>TABLE B</td><td>10 ί • 0</td><td>f — m— 0 0 · 00 0 0 0</td><td> -0-»»0-0-0 | 0 0 0 0 0 0 0 0 00 00 0 0 0 0 0</td>
$ presentstate (ι) $ avgstate (i) $ datasize (i) $ latency (i) $ time the present interface state (i), which indicates whether the telecommunications path is currently operational.
$ Presentstate = 0 non-operational $ presentstale = 1 average operational of Spresentstate (i) in the five-minute window before the size, in KB, of the data file to be transmitted measured in msec of the delay through path (i). This is based on a real-time test on the interface such as the so-called ping with the remote host.
hour of the day / day of the week; this is the same for all interfaces.
$ avai lbandwi dt li (i) available bandwidth of the interface (i) at a given time of the file transfer
Rather than simply relying on the pre-programmed least cost route criteria, the present invention uses all or a logical subset of the variables set out in Tables A and B above to arrive at a route decision for a data file to be transmitted. In other words, using the route optimization of multiple protocols of the present invention, the path chosen for transmission of a data file takes into account parameters that vary in real time, thus not relying on a simple pre-defined table. -programmed of low cost providers as in the prior art. In addition, the user can specify his priorities as to the parameters that are critical in the transmission of a particular file, that is, low cost, high speedi GÕrçfigtírljíflefçle,
0 00 0 0 0 0 00 00 • · 0 »000000 • 0 00 0 000 000 0 00 00 security, etc., when making the route determination.
The methodology employed by the present invention is processed by the route optimization block 26 (which can be implemented in a microprocessor) and uses two main components that comprise the parameters established in Tables A and B above in varying combinations. The first component is a measure of an inherent efficiency and desire for a particular telecommunications path, and is given by the following equation:
(1) íprevalue (i) = $ maxbandwidth {i) + Çreliability (í) + Çeconomy (i) + $ secunty (i Ϊ
The variable $ prevue is a linear value that increases with a high bandwidth, a high reliability, a high measure of savings (low cost) and / or a high degree of security of a particular path. This variable is essentially immutable for a given path, except that the Çeconomy parameter is based in part on the variable $ t ime (path cost is a function of the
2n dja / day of the week) which is derived from a real time clock 28.
second component used by the path methodology of the present invention is based in part on real time parameters that can exhibit a wide range due to numerous reasons, as follows: * jc £ uV • 0 0 0 • 00001 which may be beyond the control of user.
a-íuiimsa: 'das • 0 0 · 00 • «0 0 0» · Μ 0 00 00 (?) $ rurrentvalue (i) ~ $ economy (i) x $ speed (i) + $ avgstat <? (i) x 10 where $ speed (i) = (10,000 - ($ datasize (i) x $ latency (i) x 100) + $ avgstate (i) x 10 such that:
Snvirrentvalue (í) = $ economy (i) x (10,000 - ($ datasize (í) x $ latency (j) x 100) -I $ avgstate (i) x 10
Thus, $ currentvalue (i) for a given path (i) 10 will be higher for the path that has the most savings (low cost), low data file size and / or little latency across the path (high speed) .
The selection of the optimal route to use is then a combination of the values calculated above in equations (1) and (2):
(3) $ finalvalue (ι) = $ prevue (i) + Çcurrentvalue (í) = $ maxbandwidth (i) + $ reliability (i) + $ economy (i) + Çsecurity (i) ($ economy (i) x ( 10,000 - ($ datasize (i) x? 0 $ latency (i) x 100) + Savgstate (i) x 10) block of route optimization methodology? 6 then takes the highest $ finalvalue (i) for each path in the system that is available, operational, and meets a threshold value ($ avgstate x 10) of 2á's dufíaetitiaf: cLríóime · * »* · * ·· A /
I Al · »+« «!
I · ·· P llt «fl · t« fl pp shown in the flowcharts to be described below. This methodology allows, therefore, the optimal selection based on an analysis of multiple protocols used by the system, instead of simply a lower cost route decision.
The path analysis function block 24 obtains the value $ latency (i) for each path (ι) by any means known in the art to obtain the latency of an TP addressable path, such as by means of a software known as ping , The ping routine sends a packet to the network and obtains a value of the average delay found by that packet when reaching the destination and returning. Other techniques that allow the system to obtain a measure of the path latency are also covered by the present invention.
A user can customize the relative weights given to each of the variables set out in Tables A, b according to their specific requirements as stored in the user's priority memory 32. These fixed weighted values are stored in a memory in the switching system and used in conjunction with the route methodology for all files transferred in accordance with the agreement. The weighted values are used as multipliers for the variables in the algorithm in order to allow the user to customize the algorithm as desired. For example, a user may want to emphasize the $ security (i) parameter in the analysis and can then specify a multiplier weight of (for example) two such that the $ security (i) parameter has an ianta weight. sst: the 4! ί 4 í · - 5 · • · ·· * · ι · laa aa aa aa $ security (i) parameter was left in the default state.
In addition, a user can cancel, via entry in a user interface 34, the parameter weights pre-programmed in memory for any file transfer given with temporary values. The user interface can be any type of device that allows the user to enter data, such as a keyboard, mouse, etc.
In another way of weighting parameters, the user can also force the program to ignore certain parameters and focus on a parameter only when arriving at a route decision. For example, if a user wants to transmit a data file 30 to a remote location via the fastest path, regardless of cost or any other factor, then the user specifies this requirement for route optimization block 26 via the interface 34. The route optimization block 26 will then cause all variables, except $ latency, to a predetermined factor, in such a way that the path with the lowest value for $ latency (that is, the route with the least delay) is chosen by the route optimization block 26 as the fastest route.
Other permutations and variations of the example above can be easily derived by those skilled in the art to allow the user to specify his priorities regarding the transfer of data from a file at any point in time, for example> Ioj * ja<sup>5</sup> * ánalí ^ Q * | Bqde} 5 »2 ·! J<sub>t</sub> u. ·, *, * · ·· be forced to look at any two variables, etc.
In addition, a user can store certain weighting sets of parameters to be used in different situations and then select the set when desired. The set of weights would then be applied as described above. In addition, the program can be configured to automatically apply certain weight sets as a function of the data type. For example, the user can specify that all facsimile messages be given a high saving factor, while all video files receive a low security factor, etc.
Figures 2 and 3 illustrate the flowcharts of the methodology employed by the present invention when reaching the optimal choice to route a data file among a plurality of paths available in accordance with the present invention. First, as shown in Figure 2, fixed user priorities are extracted, such that the parameters used in the analysis can be weighted. Then, the user is allowed to enter their temporary priority cancellation values for file transfer. Assumed for this example that no weighted or temporary cancellation value is entered, then the parameter $ fITialvalue is determined for each of the paths (i) in switching system 10 as follows.
First, with reference to f *> giinât * £, ·· o * jftfa £ pi * jde • ·· · · * ·· • ·· · · i ·· · ·· · * route optimization 26 check with memory 22 to determine whether that interface (í) has been programmed to be available for use by that user, is looking at the $ availability (i) variable. For example, if switching system 10 is incorporated into a PBX system, then not all users will have access to all paths (i) due to their economic resources. This information is contained in memory 22 and verified as a first step
Ί0 in the process of Figure 3.
If $ availability (i) = 0, then $ finalvalue (i) is set to zero and the routine exits. If, however, the interface (i) is available, Çavailability (í) is set to 1 and the process continues. The routine then checks for] 5 to see if path (i) is operable at that time, and the $ presentstate variable is returned from $ interface (i). If Spresentstate (í) = 0 (path not operable or lowered), then $ finalvalue (i) is set to zero and the routine is output. If $ presentState (í) = 1 (operable or elevated path), then the routine continues.
The $ avgstate variable is then checked to ensure that it is greater than a predetermined value 1 j in j, for example, if $ avgstate x 10> 25. If this is true, then the interface (i) is considered to be essentially in operable condition. If it is false, then the interface (i) is considered to be essentially in non-operable condition, despite the fact that $ presentstate indicates operability.<sup>s</sup>iatjufele 'rflpfoçn ^ o: ϊ; ··· ........
parii cular.
The routine then proceeds to obtain the value $ latency (i) via path analysis block 24. Using $ latency (i), the variable $ speed (i) is calculated, as shown in the flowchart and explained above. The variable $ eeonomy (i), which is a function of the variable $ time, is taken from memory 22. Then, the variable $ currentvalue (i) is calculated as a function of $ economy (i), $ speed (i) and $ avgstate (í).
ίο The variable $ prevue (i) is then calculated as a function of the variables $ maxbandwidth (i), $ reliability (i) and $ securily (j), which are obtained from memory 26, as well as $ economy (i), which was previously determined.
Finally, the variable $ finalvalue is obtained, is as shown in the routine and this is stored in a pending register calculation of $ finalvalue (í) for the remaining interfaces, as shown in Figure 2.
After all Lerem interfaces have been analyzed in the above manner, then routine optimization block 26 makes a determination as to which interface (i) should be selected according to the highest value for $ finalvalue (i). The data file then takes the route from memory 30 to the interface selected for transmission.
The routines shown in Figures 2 and 3 can be supplemented by the user priority override characteristics described above, which allows the: ·. :. ·. ··:.: ··: · '· ·' · user specify the fastest route .. · a .: r * otfe. «Âç * · foçnqr i ΐ · * · ··· ·· · ·· · cost , the most reliable route, etc.
The measurable parameter $ availbandwidth (i) lick can be used in the algorithms presented here to provide a real-time indication of the desire to select a particular interface (i) at any given time, although the fixed parameter $ maxbandwidth (i) provides a A measure of the maximum bandwidth that can be available for a given interface, the interface can be tested if desired to determine what part of that bandwidth is actually available for use. A known test The technique to achieve this measurement is the so-called test showing zero serial interface, which can be performed by measuring the number of packets received in the last n seconds as well as how many packets were transmitted on the interface at that time. Thus, the $ availbandwidth parameter can be used instead of, or in conjunction with, the measured $ latency parameter to perform the analysis here.
In addition, although the system and method of the present invention have been shown in conjunction with the transmission of a data file (as defined here), they can also be applicable to the transmission of multiple data files on a serial or parallel basis ( interspersed), by modifying the algorithm and routines, as may be appropriate.
The choice of variables and pariâTnátMa 'nferfi j: », * s ··· ··· * ·· ·· used here is the preferred modality; it is anticipated that other variables can be used in conjunction with the present invention to arrive at optimal routes in a given situation.
In addition, the particular algorithm, although determined to provide a relative requirement weight of the fixed and measured variables, can also be supplemented according to the user's requirements in order to arrive at the optimal route choice.
4 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4
36 members in 13 offices
Priority claims8
| Document | Office | Kind | Date |
|---|---|---|---|
| 74113096 | United States of America | A | |
| 74113096 | United States of America | A | |
| 9719624 | United States of America | W | |
| 9719624 | United States of America | W | |
| 08741130 | – | – | – |
| 9719624 | – | – | – |
| US19960741130 | – | – | – |
| WO1997US19624 | – | – | – |
Members36
| Document | Office | Kind | |
|---|---|---|---|
| CA2263099A1 | Canada | A1 | |
| WO9819439A1 | World Intellectual Property Organization (WIPO) | A1 | |
| EP0931408A1 | European Patent Office (EPO) | A1 | |
| BR9712399AThis record | Brazil | A | |
| BR9712399AThis record | Brazil | A | |
| EA199900396A1 | Eurasian Patent Organization (EAPO) | A1 | |
| CN1235729A | China | A | |
| US6016307A | United States of America | A | |
| IL129537A0 | Israel | A0 | |
| IL129537D0 | Israel | D0 | |
| YU21299A | Yugoslavia, later Serbia and Montenegro (until 2006) | A | |
| KR20000052946A | Republic of Korea | A | |
| US6144641A | United States of America | A | |
| JP2001503578A | Japan | A | |
| EA001507B1 | Eurasian Patent Organization (EAPO) | B1 | |
| EP0931408A4 | European Patent Office (EPO) | A4 | |
| US6456594B1 | United States of America | B1 | |
| US6473404B1 | United States of America | B1 | |
| CA2263099C | Canada | C | |
| US2002186701A1 | United States of America | A1 | |
| IL129537A | Israel | A | |
| YU49151B | Yugoslavia, later Serbia and Montenegro (until 2006) | B | |
| CN1166159C | China | C | |
| KR100506244B1 | Republic of Korea | B1 | |
| JP2006157939A | Japan | A | |
| US7307956B2 | United States of America | B2 | |
| US2008225832A1 | United States of America | A1 | |
| EP0931408B1 | European Patent Office (EPO) | B1 | |
| AT426995T | Austria | T | |
| ATE426995T1 | Austria | T1 | |
| DE69739324D1 | Germany | D1 | |
| US8400926B2 | United States of America | B2 | |
| US2013272299A1 | United States of America | A1 | |
| US9036499B2 | United States of America | B2 | |
| US2015256444A1 | United States of America | A1 | |
| US9806988B2 | United States of America | B2 |
2 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]LapsedREFERENTE AO DESPACHO 8.6 DA RPI 1986 DE 27/03/2009.B08K | B08K | |
| Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]REFERENTE A 11A ANUIDADEB08F | B08F |
Numbers
- Publication, EPODOC
- BR9712399
- Application
- 97123994
- Application, DOCDB
- 9712399
- Application, EPODOC
- BR19979712399
Titles2
- Portuguese
- Otimização na rota das telecomunicações em m·ltiplos protocolos
- English
- Optimization of the telecommunications route in multiple protocols
Classification
- CPC, 9
- H04L45/123
- H04M7/00
- H04L12/5692
- H04L43/0852
- H04L45/124
- H04L69/18
- H04L9/40
- H04L41/08
- H04L12/64
- IPC, 10
- H04M3 42
- H04L12 28
- H04L29 06
- H04M3 00
- H04M7 00
- H04M11 00
- H04W28 00
- H04W48 16
- H04W48 18
- H04W88 14