Multi-protocol telecommunications routing optimization

Description: TECHNICAL FIELD [Detailed description of the invention]

Optimization of transfer of multiple protocol wireless communication Cross-reference to related applications This application was filed with the United States Patent and Trademark Office on October 31, 1996. The above priority is claimed based on the priority of application 08 / 741,130. Technical field The present invention relates to wireless communication, in particular statically and dynamically changing variables, and you. The best route from multiple available routes, according to both of the priorities Concerning methods and devices for dynamic selection. Background technology In recent years, the wireless communication industry has been data from simple analog connections of telephones for voice communication. , Facsimile, email, video, audio and (hereafter collectively data) Called), by both analog and digital formats , Has rapidly changed to the current system for sending and receiving voice. Data is, Data files, data packets, packets with cub cells, or (hereafter , Called data files) in various formats such as data streams It can be sent in any format inside. Various types of wireless communication systems The system has been installed and is still installed, but such a system Is a backbone system for transmitting data through multiple media Functions as. For example, POTS (conventional telephone system), leased line, mobile Cellular networks, digital links, fiber optics, satellite links, and i From one user to another through private and public packet-switched networks such as the Internet Can be sent to users of. In addition, service providers using these different types of transmit media There is fierce price competition between them. For example, AT & T and MCI Well, so-called long-distance service providers are consumers, businesses, and nonprofits. Compete with each other to gain greater market share for body and government users It offers a low price. Many types of wireless communication services are available and these There is competition among service providers, so for users, it s their own. It is difficult to choose the most valuable service. Often selected by the user as the carrier of the data to be transmitted at a given time Only one wireless communication service provider can be used to Not only. For example, a user may have two or more long-distance service professionals. You can join the bidder and first get the service provider code Dial, then dial the destination phone number, at the given time, either Can be accessed. In addition, the user can use it for selection You can have different types of media that you can, i.e. the internet , Can be connected through satellites, etc. This is an economic consideration Especially in a business environment where a large number of wireless communication resources can be used Is Rukoto. Conventional technology is usually cheaper for transmitting data based on it. I knew that it was an element in which the transfer decision was made. Therefore, the so-called "cost" "Cheapest Transfer" facility grows exponentially, offering the cheapest cost at a given time Calls can be made through the service provider. PBX (private branch exchange) The system routes the caller to the destination number along the cheapest route available. You can use the lowest cost transfer facility as described above, which connects automatically. The present invention must have the highest value for wireless communication media at a given time. We also realize that it is not the cheapest choice available. sand That is, optimization of transfer selection not only involves low cost, but also its mede The transmission bandwidth of the ear, the utilization at a specific time when the user wants to use it, and its utilization. Other factors such as confidentiality and its reliability are also taken into account. In addition, you The priority can change from moment to moment, sending a single data file The requirements for communication may differ from those for other data files. That's right By the way, users send urgent files at the fastest speed, no matter how expensive it is. You may want to. Other files have a high level of security from illegal eavesdropping May require, and other files can be as slow as you like I don't have it, so I'd like to send it at the cheapest cost because it doesn't matter at any time in the near future. In some cases. Therefore, the present invention selects the optimal route for transmitting data at a predetermined time. What you do is a dynamic analysis that must be done in real time and is available Various factors related to media, and the priority of users and files to be sent. We recognize that the rank must also be taken into consideration. U.S. Pat. No. 5,337,352 is a PBX that serves multiple tenants. The system is disclosed. In the case of this patent, each tenant is in multiple routes Specify which of the above should be selected as the highest priority, then second You can specify the one with the highest priority. This route selection is for that tenant Each tenant decides in advance according to requirements and available resources, and the above choices are Stored in a table in the PBX. If the tenant wants to make a call, that particular In order to determine the highest priority route to the tenant, the PBX will use the above test. Refer to Nantes and connect the call accordingly. Where the route is not available In that case, the next priority route is connected by the predetermined tenant table. Is done. Therefore, each table determines a predetermined pecking order and stores it in the PBX. To do. This system is static and cannot be changed in real time. Because each table does not predetermine the priority of the specific provider to use Because it has to be. The system of the present invention is when the route is not available Check the utilization of the route with the highest predetermined priority, and then the priority Use the higher ones, but such an analysis is an individual yes / no question hand, Current traffic on the route to analyze the relative utilization of the route Does not take into account the amount of. Therefore, one object of the present invention overcomes the above-mentioned drawbacks of the above-mentioned prior art system. It is to be. One object of the present invention is to analyze a set of multiplex protocols in real time. Connects the call to a remote location to transfer data files through it Provide systems and methods for selecting the optimal wireless communication path for That is. Another object of the present invention is specific data in determining the optimal route for a call. -Multiple protocol route analysis that analyzes the user's priority regarding file transmission To provide systems and methods for optimization. Yet another object of the present invention is real in determining the optimal route for a call. For multi-protocol route optimization that analyzes various factors related to the route in time Is to provide the system and method of. Yet another object of the present invention is file-based and preset by the user. You can override the default value and specify important transfer parameters, It is to provide a system and a method for multi-protocol route optimization. Disclosure of invention For the above and other purposes, the present invention presents a data fab for forwarding to a remote destination. A first memory for storing the file and a plurality of connected to the first memory Provide a wireless communication exchange system equipped with an interface. In this case, the above Each interface can transfer data files to remote destinations It is interconnected with the related wireless communication path. The above exchange system is a wireless communication system. A second memory for storing predetermined parameters related to the road, and each wireless communication It is provided with a means for measuring the numerical value of the variable parameter related to the communication path. Third Memory remembers a set of user priorities related to sending data files To do. The processor means is a set of user priorities, a predetermined wireless communication path para. Transfer data files according to meters and measured variable parameters Therefore, in order to decide which of the multiple wireless communication paths should be used, a second message is used. Regarding the operation of the Mori and the third memory, and the variable parameter measuring means It is connected. The above exchange system also provides before the user sends the file. , A means of input is provided so that the priority of the user of the third memory can be changed. For example, the variable parameter measuring means can be used by, for example, a so-called ping test. Measure the data transfer rate of the wireless communication path. Pre-stored in the second memory The defined parameters include the cost per unit usage time of each wireless communication path, This cost may be a function of the time of day / or the current day of the week. Second me The predetermined parameters stored in the Mori are also the reliability of the data transfer of each route. It also includes a means for measuring sex and a means for measuring the data transfer bandwidth of each route. Exchange above The system also allows the interface to transfer data files at specific times. Provide a means to check if it can be used to send. In certain methods, the aspect of using the exchange system of the present invention is prioritized by a set of users. In order to transfer data files in multiple wireless communication paths It's a way to decide which one to use. This method is paired with each of the above routes. Measure the steps to measure the variable parameters to be performed and the user's priority. Steps to analyze variable parameters and predetermined parameters, and which route However, the user needs to transfer the files according to the user's priority. Includes steps to determine whether to provide the property. A brief description of the drawing FIG. 1 shows the switching system of the present invention using multiple protocol routing optimization. It is a functional block diagram. FIG. 2 is a flowchart of the main route executed by the present invention. FIG. 3 shows the interface analysis subroutine executed by the present invention. It is a flowchart. Best mode for carrying out the invention Figure 1 shows a personal computer platform, personal digital assistance like a PBX ( PDA) The wireless communication exchange system of the present invention that can be executed for a dedicated system or the like. It is a block diagram of a stem 10. The above exchange system 10 is a resource of the user. Therefore, it is connected to various wireless communication media. More specifically, exchange System 10 is connected to a high-speed digital link through T1 interface 12. And; through LAN interface 14, local area network As (LAN); wide area network (via WAN interface 16) As WAN); as a conventional telephone system (POTS) through POTS; Configuring as a wireless communication network through wireless interface 20 Can be done. Interfaces 12, 14, 16, 18 and 20 above are exemplary. This is for explaining a preferred embodiment of the present invention. So Therefore, in practice, any number of the above interfaces can be used alone or by the user. It can be used in any combination required. For example, the multiplex described below Take advantage of the relative benefits of each carrier through protocol routing optimization To be able to do a number of regular keys like MCI, AT & T and SPRINT The carrier can be configured as a replacement system 10. In addition, wireless inter Face 20 with various types of electromagnetic means such as infrared, radio frequency, etc. It can be configured to communicate with it. Each wireless communication medium connected to the various interfaces of FIG. 1 is the present invention. Has some parameters related to it, which are executed by the route selection method of .. These parameters may be as predetermined (fixed) or It is classified as measurable (variable) by the above route selection method. Predetermined The data related to the parameters are stored in the memory 22 of the exchange system 10. The data on measurable parameters correctly analyze the route selection method. For Each interface in real time, at or near the time of data file transfer It must be collected from the face by path analysis block 24. The predetermined parameters stored in the memory 32 include the following, but Not limited to this. Table A $ maxbandwidth (i): Maximum bandwidth that interface (i) can use width. For example, a 28.8kbs modem is set to 28.8 for $ maxb It has an andwidth variable. $ reliabillity (i): Displaying the reliability of interface (i) by the following scale .. 10 = Transfer is unreliable (wireless) 50 = Medium reliability (eg modem) 75 = fairly reliable (eg T1, WAN) 100 = Very reliable (eg Ethernet, LAN ) $ economy (i): Positive for costly interfaces to be economical Interface for a regulated length of time (i ) Expenses. $ availability (i): Utilization of interface (i) for a specific user. Sith All users of the system have access to each interface It doesn't mean that. For example, in a shared PBX environment , Only a few subscribers have access to the T1 interface Just do it. $ availability = 0 Cannot be used. $ availability = 1 can be used. $ security (i): For example, the bit of the encryption key (for example, 1024) Confidentiality of relative data of routes, which may be a function of numbers Mamoru display. Measurable parameters include, but are not limited to: Table B $ presentstate (i) Indicates whether the wireless communication path is currently operating, a. The current state of the interface (i). $ presentstate (i) = 0 Not working. $ presentstate (i) = 0 is working. $ avgstate (i) The average of $ presentstate (i) on the window for the previous 5 minutes. $ datasize (i) The size of the data file to send in KB $ latency (i) Measured millisecond delay due to path (i). This measurement The value is so-called ping to a remote host Real-time trial on an interface like Based on trials. $ time: Time / day of the week: This is for all interfaces Is the same. $ availability width (i) Interface at a given time for file transfer (i) Available bandwidth. Because it relies only on pre-programmed "cheapest cost" route selection criteria Instead, the present invention determines the route for the data file to be transmitted. All subsets of the variables listed in Tables A and / or B above, or Use a logical subset. That is, the multiple protocol route selection optimum of the present invention. The route chosen to send the data file by using Take into account parameters that change in real time. Therefore, like the prior art In a simple pre-programmed reference table of a cheap provider Does not depend on. In addition, the user sends a specific file when deciding the route. Important parameters when doing: cheap cost, high speed, reliability, confidentiality, etc. Seki You can specify your own priority. The method used by the present invention (which can be performed on a microprocessor), Processed by the route selection optimization block 26, in various combinations, the above table A and And use two main components, including the parameters described in B. First configuration The element is an inherent measure of efficiency and the suitability of a particular wireless communication path. This first One component is represented by the following formula. (1) $ prevalue (i) = $ maxbandwidth (i) + $ reliability (i) + $ economy (i) + $ security (i) The variable $ prevalue is the wide bandwidth, high reliability, and economic efficiency of a particular path ( High numbers (cheap cost) and / or primary increasing with a high degree of security It is a numerical value. This number has a $ economy parameter that is real-time $ Time variable from CK 28 (Route cost is related to time and / or day of the week Except for the fact that it is partly based on (the number), it is essentially a given course. Does not change with respect to the road. The second component used by the route selection method of the present invention is that some of them are used. Real-time that can vary from one to another for a number of reasons out of control Partially based on the parameters of. (2) $ currentvalue (i) = $ economy (i) × $ speed (i) + $ avgstate (i) × 10 However, $ speed (i) = 10,000-($ datasize (i) x latency (i) x 100) Therefore, $ currentvalue (i) = $ economy (i) × (10,000-($ datasize (i) × $ latency (i) × 100) + $ avgstate (i) × 10 Therefore, $ currentvalue (i) for a given route is (i). Economical (low cost), small data file size, and / Or higher for routes with shorter (faster) latency in the route. Therefore, the selection of the optimum route for use is calculated by Eqs. (1) and (2). It is performed by a combination of the above numerical values. (3) $ finalvalue (i) = $ pevalue (i) + $ currentvalue (i) = $ maxbandwidth (i) + $ reliability (i) + $ economy (i) + $ security (i) + ($ economy (i) × (10,000-($ datasize (i) ×) $ latency (i) x 100) + $ avgstate (i) × 10) After that, the route selection optimization method block 26 can be used and is in operation. Yes, the area value ($ avstate × 10) 2 shown in the flowchart described below Highest $ finalvalue for each path in the system that fits 5 or higher Take (i). Using this method, simply determine the cheapest route Optimal selection, not based on analysis of the multiple protocols used by the above system You can make a choice. The route analysis function block 24 is a well-known software unit called "ping". In order to obtain the waiting time of the route that can be IP-addressed by the utility, The numerical value $ latency for each route (i) is calculated by a well-known means if it is a trader. Obtain. Ping routines send packets over the network to their destinations. Get the number of average packet delays when returning. The system is the route Other techniques for obtaining numerical values of waiting time are also included in the present invention. The user follows his specific requirements stored in the user priority memory 32. And the relative weights given to each variable listed in Tables A and B Can be adapted to the intended use. These fixed weights are the memory of the exchange system. A transfer method for all files stored in and transferred by the present invention. Used for the beginning. The above weighted value can be calculated by the user according to his / her own needs. To the variables of this algorithm so that you can adapt Used as a multiplier. For example, the user can use $ security (i) para The $ security (i) parameter unless the meter changes at the default value. The $ security (i) parameter during the analysis so that the parameter is double weighted. You can emphasize the data and specify a weighted multiplier of 2 (for example). In addition, the user can be assigned by typing into user interface 34. Pre-programmed fixed parameters in memory to perform the desired file transfer The meter weight can be replaced with a temporary number. User interface As a key, users can enter data such as keyboards, mice, etc. Any type of device that can be used can be used. For other methods of parameter weighting, the user also, when determining the route, Force the program to ignore certain parameters and focus on just one parameter Can be guessed. For example, the user can factor in cost and any other factors Ignored and sent data file 30 to a remote location through the fastest route If not, the user can meet this requirement through interface 34 for route optimization. Designated in conversion block 26. The route optimization block 26 is then $ laten All variables except cy are predetermined elements, resulting in the smallest number Route with $ latency (ie, the route with the least delay) Is selected as the fastest route by the route optimization block 26. If you are a person skilled in the art, the user forcibly checks, for example, any two variables. As for the data transfer of files at any time when the analysis can be done Easily replace the above example with another so that you can specify your own priorities You can understand that you can do and change things U. In addition, the user has several sets of parameters for use in different situations. You can memorize the weight and select it if needed. In addition, some weight Program to automatically apply the tuple as a function of the data type Can be configured. For example, users can use high economic efficiency for all faxes. All videos with a low level of security, while giving a re-message -Can be specified to be given to a file. 2 and 3 show the data file from among the plurality of available routes of the present invention. Floaters of the method used by the present invention in making the best choice for transferring It is First, as shown in Figure 2, the user's priority is retrieved and its As a result, the parameters used in the analysis are weighted accordingly. Then the user Enter the overridden number of your temporary priority in the file transfer Can be done. In this example, a fixed weighted value or a temporary overwrite value is entered. Assuming that it did not exist, the following method was used to enter each path (i) of the exchange system 10. The $ finalvalue parameter for it is determined. To explain FIG. 3, first, the route optimization block 6 is an interface. User checking variable $ availability (i) To determine if it is programmed to be used by Check Mori 2. For example, exchange system 10 runs on a PBX system If so, all users, due to their financial resources, all Access route (i). This information is stored in memory 22 and is stored in the process of FIG. Checked as the first step during the process. $ finalvalue if $ availability (i) = 0 (i) is set to zero and exits the routine. But the interface ( $ availability (i) is set to 1 if i) is available , The process goes on. The routine then takes route (i) at that point. Check if it can work and according to it $ pres Whether the entstate variable is returning from $ interface (i) Check. $ presentstate (i) = 0 (path cannot work In case of (or out of order), $ finalvalue (i) is set to zero , Get out of the routine. $ presentstate (i) = 1 (path moves If it can be created or is running), the routine proceeds. Then, for example, in the case of $ avgstatc × 10> 25, the variable $ a Check to confirm that vgstate is larger than the predetermined range value Will be done. If so, the interface (i) is essentially in action. It is considered to be ready. If not, the interface (i ) Indicates that $ presentstate is operational at that particular time Even if shown, this interface is considered inoperable. The routine then goes through $ latency (i) through route analysis block 24. ) Go ahead to get the value. Shown in the flow chart and as already explained , $ Latency (i) is used to calculate the variable $ speed (i). $ Economy (i), a function of the variable $ time, is obtained from memory 22 Can be Then $ currentvaltle (i) becomes $ econ As a function of omy (i), $ speed (i) and $ avgstate (i) Is calculated. After that, the variable $ prevalue (i) can be obtained from memory 26. Variables that can be $ maxbandwidth (i), $ reliability (i) And as a function of $ security (i), and $ eco already determined Calculated as a function of nomy (i). Finally, as shown in the routine, variables $ finalvalue is obtained and the rest of the interface is shown, as shown in Figure 2. It is stored in a register during the calculation of $ finalvalue for the computer. Route optimization block after analyzing all interfaces by the above method 26 is which i according to the highest number for $ finalvalue (i) Determine if the interface (i) should be selected. Then the data fa The file is transferred from memory 30 to the selected interface for transmission. .. The above user priority overwrite function is added to the routines shown in FIGS. 2 and 3. Can be This feature allows users to get the fastest route, the cheapest You can specify the route, the most reliable route, and so on. The measurable parameter $ availbandwidth (i) is a given time A real-time display of the suitability of selecting a specific interface (i) To do so, the algorithms described herein can also be used. Fixed The parameter $ maxbandwidth (i) is used by the given interface Provides the maximum bandwidth available, but if required, the above bandwidth Try this interface to see what part of the width is actually available You can try it. One test well known to those skilled in the art to make this measurement Is an "interface continuous zero display" test. This test lasts 5 seconds The amount of packets received in, and how many packets were sent within that time It can be done by measuring. Therefore, this internal analysis was done Therefore, instead of or with the measured parameter $ latency , The parameter $ availbandwidth can be used. In addition, the systems and methods of the invention are described in one (as described herein). I've described it in relation to sending data files, but if necessary, the algorithm Serial or parallel (interly) by modifying the rhythm and routine It can be applied when sending multiple data files. Wear. The selection of specific variables and parameters used in the present invention is a preferred embodiment. To. Other variables are also used with the present invention to find the optimal route in a given situation. It is expected that it can be used. Furthermore, in order to make the optimum route selection, Perform the required relative weighting of fixed and measured variables according to user requirements Other algorithms determined for this can be added.