WO2001035228A2 - Stable operation of media gateway - Google Patents
Stable operation of media gateway Download PDFInfo
- Publication number
- WO2001035228A2 WO2001035228A2 PCT/IL2000/000733 IL0000733W WO0135228A2 WO 2001035228 A2 WO2001035228 A2 WO 2001035228A2 IL 0000733 W IL0000733 W IL 0000733W WO 0135228 A2 WO0135228 A2 WO 0135228A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- processing
- connections
- session
- cycle
- receive
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/823—Prediction of resource usage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/828—Allocation of resources per group of connections, e.g. per group of users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/83—Admission control; Resource allocation based on usage prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/15—Interconnection of switching modules
- H04L49/1515—Non-blocking multistage, e.g. Clos
- H04L49/1523—Parallel switch fabric planes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/15—Interconnection of switching modules
- H04L49/1515—Non-blocking multistage, e.g. Clos
- H04L49/153—ATM switching fabrics having parallel switch planes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/504—Resource capping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5625—Operations, administration and maintenance [OAM]
- H04L2012/5627—Fault tolerance and recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/55—Prevention, detection or correction of errors
- H04L49/557—Error correction, e.g. fault recovery or fault tolerance
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Definitions
- the present invention relates to communication systems and in particular to soft modems.
- MCPU which includes, for example, a plurality of remote-access servers, such as modems, Fax handlers and voice Internet Protocol (VoIP) services connected to telephone switches.
- Some multi channel processing unit (MCPU) such as the Surf Multi-access Pool (SMP) available from Surf Communication Solutions Ltd., and servers of 3Com, Ascend, ADI, Connexent, Telogy, and Hothaus, are multi-channel software servers which have a capacity to handle concurrently, on a single processor, a plurality of connections.
- SMP Surf Multi-access Pool
- ADI Connexent
- Telogy Telology
- Hothaus are multi-channel software servers which have a capacity to handle concurrently, on a single processor, a plurality of connections.
- the MCPU runs a plurality of modules which perform the various tasks of handling the connection.
- the handling of each connection requires an amount of processing power which generally depends on the type of the connection handled (e.g., modem, fax, voice).
- the amount of processing power required by a specific connection may vary over time due to changes in the signal transmission rate or voice coder used on the connection, changes in the specific types of the connections handled by the MCPU and/or transient conditions such as the specific data sequence being transmitted. Since, it is generally not possible to predict the exact amount of processing power required on a specific connection, a commonly employed practice is to set for each processor a maximal number of connections it can handle based on a maximal processing power which may be required by each connection. This, however, results in a waste of processing power as at most times the utilization of the processor is much lower than its maximal capacity.
- An aspect of some embodiments of the present invention relates to assigning, to a single processor of a multi channel processing unit (MCPU), a number of connections to be handled, which number is beyond the operation capacity of the processor if all the connections require their maximal processing power consumption.
- MCPU multi channel processing unit
- the number of the connections and/or the types of the connections handled by the processor is chosen such that on the average the processing power utilization of the connections may be handled by the processor.
- the processing power utilization of one or more of the connections is reduced at the initiative of the MCPU.
- the processing power utilization is reduced, for example, by temporarily shutting down, by-passing and/or simplifying, for one or more of the connections, the operation of one or more of the modules generally used in handling the connection.
- the processing power reduction is performed such that ideally, the utilized processing power is within the capabilities of the processor.
- the shut down, by-pass and/or simplification of the one or more modules is performed in a manner which does not cause the connection to be terminated.
- the shut down, by-pass and/or simplification are chosen in a manner which minimizes the time and/or extent of the reduction in the quality of the connection.
- a method of scheduling a processor to handle a plurality of connections with respective processing cycles including estimating, for at least one of the connections, whether the connection will receive a processing session during its current respective processing cycle if each of the connections which did not yet receive a processing session during its current processing cycle receives, during its current processing cycle, an unlimited processing session, and scheduling one or more of the connections that did not yet receive a processing session in their respective processing cycle, to perform a limited processing session, responsive to results of the estimation.
- estimating whether a connection will receive a processing session during its current respective processing cycle includes estimating a processing time required in a single session during a current respective processing cycle, for each of the connections which did not yet receive a processing session.
- estimating the processing time required for each of the connections includes estimating responsive to types of the connections.
- the scheduling of one or more of the connections to perform a limited processing session is performed such that the at least one of the connections will receive a processing session during its current respective processing cycle.
- estimating the processing time required for each of the connections includes estimating responsive to an actual time consumed by the connection in a previous processing cycle.
- substantially all the connections have a common processing cycle.
- the method includes managing a processor time cycle which is an integer multiple of the processing cycles of the connections.
- estimating whether the connections will receive a processing session during their current respective processing cycle includes comparing a time remaining to the end of the current processor time cycle to a sum of estimated times required for unlimited processing sessions of the connections which still require service during the current processor time cycle.
- comparing the time remaining to the end of the current processor time cycle to the sum of required estimated times includes determining whether remaining time if greater, by at least a given safety margin, than the sum of required estimated times.
- the given safety margin is a function of the remaining time until the end of the current processor time cycle.
- scheduling one or more of the connections to perform a limited processing session includes selecting the one or more sessions to perform a limited processing session responsive to a quality of service indication of the connections and/or responsive to which connections, if any, received a limited processing session during a previous processing cycle.
- selecting the one or more sessions to perform a limited processing session includes selecting a connection which received a limited processing session during a previous processing cycle.
- selecting the one or more sessions to perform a limited processing session includes selecting a connection which did not receive a limited processmg session during a previous processing cycle.
- the method includes setting an order in which the connections receive processing sessions.
- the method includes changing the order in which the connections receive processing sessions so that a single connection will not receive more than a predetermined number of limited processing sessions within a predetermined period.
- scheduling one or more of the connections to perform a limited processing session includes scheduling one or more of the connections to perform a processing session in which one or more of the tasks normally performed in an unlimited processing session of the connection is not performed.
- the one or more tasks not performed during the limited processing session include a task related to signal transmission, a task related to signal reception, a task of a data pump, a task of a decoding layer of a data pump and/or a task of an ECDC layer.
- not performing one or more tasks during the limited processing session includes ignoring a percentage of received signals.
- scheduling one or more of the connections to perform a limited processing session includes adjusting one or more parameters of the process handling.
- adjusting one or more parameters includes reducing the length of a filter used in the processing.
- a soft- modem software for running on a processor which handles a plurality of connections which have respective processing cycles, including one or more modules which perform processing sessions of the plurality of connections, a session being performed for each connection once during a respective processing cycle of the connection, and a scheduler which determines an order in which the connections are handled by the processor, estimates one or more times whether the connections will receive a processing session during their current respective processing cycle and, if necessary, schedules one or more of the connections to perform a limited processing session, such that substantially all the connections will receive a processing session during their current respective processing cycle.
- the scheduler estimates whether the connections will receive a processing session during their current respective processing cycle each time a different connection is processed by the processor. Alternatively or additionally, the scheduler estimates whether the connections will receive a processing session during their current respective processing cycle at lest once in each processing cycle. Possibly, the scheduler changes the order in which the connections receive processing sessions responsive to the scheduling of a limited processing session.
- a method of assigning a processor to handle a plurality of connections including determining a maximal processing power required for handling each of a plurality of connections, and assigning the processor to handle a group of connections for which the sum of maximal processing power required is above a processing power ability of the processor.
- assigning the processor to handle a group of connections includes assigning a group of which the total average required processing power of the connections in the group is lower than the processing power ability of the processing power.
- Fig. 1 is a schematic illustration of a multi-channel processing unit, in accordance with an exemplary embodiment of the present invention
- Fig. 2 is a schematic time diagram of an exemplary scheduling of the utilization of a processor of a remote access server, in accordance with an embodiment of the present invention
- Fig. 3 is a flowchart of the acts performed by a scheduler of a multi-channel processing unit, in accordance with an exemplary embodiment of the present invention
- Fig. 4 is a schematic time diagram of an exemplary scheduling of the utilization of a processor, in accordance with an embodiment of the present invention
- Fig. 5 is a schematic time diagram of an exemplary scheduling of the utilization of a processor, in accordance with an embodiment of the present invention.
- Fig. 1 is a schematic illustration of a multi-channel processing unit (MCPU) 20, in accordance with an exemplary embodiment of the present invention.
- MCPU 20 is connected to a plurality of links 22 on which it receives connections which are to be handled by the MCPU.
- MCPU 20 generally converts signals (e.g., voice, fax, modem) received on the connections into packets. Optionally, MCPU 20 also convert packets for transmission on the connection into appropriate signals. For each received connection, MCPU 20 manages a handling process
- MCPU 20 comprises a processor 28, for example a digital signal processor (DSP) which executes the handling processes 24 of the received connections.
- DSP digital signal processor
- a scheduler 26 sets the processing order of the handling processes 24 on processor 28.
- the number of connections handled by MCPU 20 is chosen such that, on the average, processor 28 will have sufficient processing power to handle all the tasks of all the handled connections. However, if all the connections require a maximal handling processing power, the processor will not be able to handle all the connections.
- the maximal required processing power is determined for each candidate connection and the group assigned to the MCPU is selected accordingly.
- the average required processing power is determined for some or all of the candidate connections.
- the assigning of the connections also takes into account QoS considerations. For example, when only a small amount of processing power is unused on processor 28, only urgent connections and/or connections which may receive low QoS are assigned to the processor.
- the assigning of the connections to MCPU 20 is performed in accordance with the description in an Israel patent application entitled “Channel Load Balancing” filed on November 11, 1999 and assigned serial number 132888 and/or PCT application PCT/ILOO/00703 filed November 1, 2000, the disclosures of which documents is incorporated herein by reference.
- Fig. 2 is a schematic time diagram 40 of an exemplary scheduling of the utilization of processor 28, in accordance with an embodiment of the present invention.
- each of the handling processes 24 of the connections currently handled by MCPU 20 receives a processing session 42.
- different connections may require processing sessions 42 of different lengths.
- the length of the processing session 42 may depend, for example, on the type of the connection (e.g., voice, modem, fax) and or on the signal rate of the connection.
- the length of processing session 42 of a specific connection may change between time cycles 44, for example, due to changes in the types and/or rates of the connections and/or temporary changes of the specific data transmitted.
- the length of the processing sessions 42 depend on which tasks are performed in handling the connection, i.e., whether all the required tasks are performed or one or more of the tasks are not performed due to a lack of processing time as described hereinbelow.
- the length of the time cycles is sufficient to provide all the connections handled by MCPU 20 with processing sessions 42 of unlimited lengths, i.e., in which processor 28 handles the connections without limitations on the processing power utilized in the handling.
- processor 28 performs the usual tasks of MCPU 20 in handling connections without shutting down, by-passing and/or simplifying, the operation of one or more of the modules normally performed in handling the connection.
- time cycle 44C in some cases, for example due to a momentary increase in the power utilization of one or more of the connections, the power utilization of one or more of the connections is limited so as to shorten one or more processing sessions 42 (labeled 42A) and thus ensure that the processing sessions 42 of all the connections handled by MCPU 20 are handled within time cycle 44. It is noted, that the prior art prevents such occurrences from happening by limiting the number of connections handled by MCPU 20, for example, for the setup of Fig. 2 only three connections (1, 2, 3) would be handled by MCPU 20.
- Fig. 3 is a flowchart of the acts performed by scheduler 26 during a time cycle 44, in accordance with an exemplary embodiment of the present invention.
- scheduler 26 selects (50) a next connection to have a processing session 42.
- the selection of the next connection to receive a processing session 42 may be performed after the previous processing session is completed, during the previous processing session and/or one or more processing sessions 42 before the selected connection receives the processing session 42.
- scheduler 26 generally selects the connections according to a predetermined order, for example, according to the order in which the connections were established.
- Fig. 4 is a schematic time diagram 80 of an exemplary scheduling of the utilization of processor 28, in accordance with an embodiment of the present invention.
- scheduler 26 estimates (52) the required time 82 of the processing sessions 42 of all the connections which did not receive a processing session 42 in the current time cycle 44, assuming that all the connections receive an unlimited processing session.
- scheduler 26 determines (54) the time 84 remaining to the end of the current time cycle 44. If (56) the estimated required time 82 together with a safety margin 47 is greater than the remaining time, scheduler 26 selects (58) one or more connections to receive a limited processing session 42A, as described hereinbelow.
- scheduler 26 also determines (62) the extent of the limitation of the processing session, e.g., the number of tasks not performed, the method of time reduction and/or the maximal time which the processing should take. If (60) the connection currently receiving a processing session was selected (58) to receive a limited processing session, the connection is scheduled (64) with instructions in accordance with the extent of the limitation of its processing session. In some embodiments of the invention, the limited processing does not cause the other end of the connection to disconnect the connection. Alternatively or additionally, the limited processing is not noticed by the other end apparatus of the connection, except possibly due to a retrain or retransmission request initiated by MCPU 20. If (60) the connection currently receiving a processing session was not selected (58) to receive a limited processing session, or the required time is lower than the sum of the remaining time and the safety margin, the current connection is scheduled (66) for processing with an unlimited processmg session.
- the connection currently receiving a processing session was not selected (58) to receive a limited processing session, or the required time is lower
- the procedure of Fig. 3 is repeated each time a connection is selected for processing.
- the procedure of Fig. 3 is performed only for some of the connections scheduled during a current time cycle 44.
- the procedure of Fig. 3 is performed periodically every few processing sessions 42 and/or according to a predetermined determination scheme.
- the procedure of Fig. 3 is performed only after half (or any other percentage) of the connections were handled during each time cycle 44.
- the procedure of Fig. 3 is not performed toward the end of time cycles 44 when it is clear the remaining time 84 is sufficient to handle all the remaining connections without assigning limited processing sessions, e.g., the remaining time 84 is sufficient for the maximal required time of all the remaining connections.
- Fig. 5 is a schematic time diagram 100 of an exemplary scheduling of the utilization of processor 28, in accordance with an embodiment of the present invention.
- scheduler 26 rearranges (68) the order of scheduling of the connections, such that if scheduling of a limited processing session to one or more of the connections is required, it is possible to distribute the inconvenience of such scheduling over a larger number of connections.
- scheduler 26 determines which connections should receive limited processing sessions, if necessary, and accordingly the connections are ordered by scheduler 26. As is shown in Fig.
- connection 4 receives a limited processing session 42A. Thereafter, scheduler 26 rearranges (68, Fig. 3) the connections, such that in a next cycle 44E, the order of the connections is 4, 2, 3 and 1. Due to lack of processing power, connection 1 receives a limited processing session 42 A.
- safety margin 47 (Fig. 4) is a small time period which compensates for inaccuracies in the estimation (52, Fig. 3).
- safety margin 47 is determined as a function of the quality of the estimation (52) of the required time, such that the probability that the processing sessions 42 of a time cycle 44 require more time than the length of the cycle is substantially zero.
- the quality of the estimation is determined based on a comparison of previous estimations to the respective actual times of the processing sessions.
- the length of safety margin 47 may be configured by a system manager of MCPU 20.
- safety margin 47 changes over cycles 44 and/or during a single cycle 44.
- the length of margin 47 is decreased as the point of decision progresses over each cycle 44.
- safety margin 47 is set to zero, i.e., not used.
- the time required to handle each connection is estimated based on records of the time required to handle the connection during one or more previous time cycles 44. Alternatively or additionally, the estimation is performed based on general information on the type of the connection, the transmission rate of the connection and/or other specifics of the connections, e.g. the type of vocoder used on a voice connection. Optionally, the estimation is perfected based on a comparison of previous estimations and the actual time utilized.
- each of the connections is assigned a quality of service (QoS) value, and the selection is optionally performed based on the QoS values of the connections.
- QoS quality of service
- the selection (58) is performed according to the type of the connection such that the damage caused to the connection is minimal. Further optionally alternatively or additionally, the selection (58) is performed responsive to the difference between the required processing time and the remaining time to the end of the current time cycle 44.
- scheduler 26 selects (58) a connection which can stand a large decrease in handling time without disconnecting or severely deteriorating the channel quality, while if there is only a small difference a connection which can stand only a small decrease in processing time, is selected.
- the selection (58) is performed responsive to selections of previous time cycles 44.
- the selection (58) is performed in a manner which distributes the damage suffered by connections due to the limitation on the length of their processing session, between as many as possible connections.
- the same connection is selected, if further processing power limitations are required, over a plurality of consecutive time cycles 44.
- the determination is performed using the same considerations as described above for selecting the connection to receive a limited processing session.
- limiting the processing session of a connection comprises reducing the processing power utilization of the reception portion of the connection.
- limiting the processing session of a connection comprises reducing the processing power utilization of the transmission portion of the connection.
- the limiting of the processing session comprises not performing one or more tasks performed in unlimited sessions of the connection.
- limiting the processing session of a modem connection comprises not performing one or more of the tasks of the decoding layer of the data pump (for example, in the V.34 the Viterbi decoder, shell dewrapper, deprecoder, non- linear decoder and/or descrambler).
- limiting the processing session of a modem connection comprises not performing the tasks of the datapump and or the ECDC layers.
- limiting the processing session of a fax connection comprises not performing the tasks of the data pump and/or protocol layers.
- limiting the processing session of a voice connection comprises ignoring a certain percentage of received signals and/or not performing the tasks of the vocoder.
- limiting of the processing session comprises changing one or more parameters of the handling, for example, reducing the length of a filter used and/or changing from soft decision to hard decision.
- limiting the processing session is performed in accordance with any of the methods described in U.S. patent 5,995,540 to Draganic and/or in U.S. patent application 08/969,981 to Abraham Fisher et al, filed November 13, 1997, the disclosures of which documents is incorporated herein by reference.
- scheduler 26 attempts to reduce the processing load of MCPU 20.
- scheduler 26 attempts to reduce the number of connections handled by MCPU 20.
- MCPU 20 renegotiates the transmission rate on one or more of the connections handled in order to reduce the transmission rate.
- voice connections MCPU 20 renegotiates the voice coder used to one which is less processing power demanding.
- scheduler 26 estimates for each of the connections whether the connection will receive a processing session during its respective current processing cycle.
- a processor time cycle which is an integer multiple of the processing cycles of the connections is managed and each specific processing cycle ends at the end of the processor time cycle.
- the order of scheduling of the connections is performed as described in US patent application titled "Scheduling in a Remote-Access Server, filed February 9, 2000 and awarded serial number 09/501,078, the disclosure of which is incorporated herein by reference.
- the above described access control methods may be used for substantially any types of connections, such as voice, fax and modem connections.
- the modem connections may be of any type known in the art, including but not limited to, point to point connections, connections of clients to an Internet service provider (ISP), connections of clients to a banking remote server, or connections of workers from their homes to a computer at their workplace.
- ISP Internet service provider
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Telephonic Communication Services (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP00974758A EP1230596B1 (en) | 1999-11-11 | 2000-11-09 | Stable operation of media gateway |
DE2000610114 DE60010114T2 (en) | 1999-11-11 | 2000-11-09 | STABLE OPERATION OF A MEDIA GATEWAY |
US10/129,772 US7200168B1 (en) | 1997-11-13 | 2000-11-09 | Stable operation of media gateway |
AU12969/01A AU1296901A (en) | 1999-11-11 | 2000-11-09 | Stable operation of media gateway |
EP01904298A EP1258124A2 (en) | 2000-02-09 | 2001-02-08 | Scheduling in a remote-access server |
US10/203,304 US20030014484A1 (en) | 2000-11-09 | 2001-02-08 | Scheduling in a remote-access server |
PCT/IL2001/000132 WO2001060008A2 (en) | 2000-02-09 | 2001-02-08 | Scheduling in a remote-access server |
AU2001232210A AU2001232210A1 (en) | 2000-02-09 | 2001-02-08 | Scheduling in a remote-access server |
Applications Claiming Priority (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/969,981 US6792039B1 (en) | 1997-11-13 | 1997-11-13 | Method for controlled reducing of processor utilization by a soft modem and a soft modem with controlled different processor utilization modes |
IL13288899A IL132888A0 (en) | 1999-11-11 | 1999-11-11 | Channel load balancing |
IL132888 | 1999-11-11 | ||
ILPCT/IL00/00266 | 2000-05-09 | ||
PCT/IL2000/000266 WO2001035625A2 (en) | 1999-11-11 | 2000-05-09 | Always-on access server pool |
ILPCT/IL00/00703 | 2000-11-01 | ||
PCT/IL2000/000703 WO2001035575A2 (en) | 1999-11-11 | 2000-11-01 | Channel load balancing |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001035228A2 true WO2001035228A2 (en) | 2001-05-17 |
WO2001035228A3 WO2001035228A3 (en) | 2002-01-17 |
Family
ID=37897649
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IL2000/000733 WO2001035228A2 (en) | 1997-11-13 | 2000-11-09 | Stable operation of media gateway |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2001035228A2 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2001097499A1 (en) | 2000-06-14 | 2001-12-20 | Surf Communication Solutions, Ltd. | Distributed modem |
US7230977B1 (en) | 2000-05-21 | 2007-06-12 | Surf Communication Solutions Ltd. | Back-to-back modem repeater |
US7355735B1 (en) | 2000-06-14 | 2008-04-08 | Yona Sivan | Real time fax over packet based network |
US7406072B1 (en) | 2000-05-21 | 2008-07-29 | Surf Communication Solutions | Modem relay over packet based network |
US7420960B2 (en) | 2000-05-21 | 2008-09-02 | Surf Communication Solutions Ltd. | Modem relay over packet based network |
US7424003B2 (en) | 2004-03-08 | 2008-09-09 | Surf Communication Solutions | Multi-parameter scheduling in communication systems |
US7440446B2 (en) | 2003-12-26 | 2008-10-21 | Electronics And Telecommunications Research Institute | Voice over packet system using a plurality of digital signal processors and speech processing method therein |
US7529228B2 (en) | 2003-09-02 | 2009-05-05 | Electronics And Telecommunications Research Institute | Scheduling method for multi-channel DSP (Digital signal Processor) algorithm, VoP (Voice over Packet) system, and recording medium |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0913770A2 (en) * | 1997-10-31 | 1999-05-06 | Sun Microsystems, Inc. | Method and apparatus for sharing a time quantum |
-
2000
- 2000-11-09 WO PCT/IL2000/000733 patent/WO2001035228A2/en active IP Right Grant
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0913770A2 (en) * | 1997-10-31 | 1999-05-06 | Sun Microsystems, Inc. | Method and apparatus for sharing a time quantum |
Non-Patent Citations (1)
Title |
---|
GOPALAKRISHNAN R ET AL: "EFFICIENT USER-SPACE PROTOCOL IMPLEMENTATIONS WITH QOS GUARANTEES USING REAL-TIME UPCALLS" IEEE / ACM TRANSACTIONS ON NETWORKING,US,IEEE INC. NEW YORK, vol. 6, no. 4, 1 August 1998 (1998-08-01), pages 374-388, XP000771968 ISSN: 1063-6692 * |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7230977B1 (en) | 2000-05-21 | 2007-06-12 | Surf Communication Solutions Ltd. | Back-to-back modem repeater |
US7406072B1 (en) | 2000-05-21 | 2008-07-29 | Surf Communication Solutions | Modem relay over packet based network |
US7420960B2 (en) | 2000-05-21 | 2008-09-02 | Surf Communication Solutions Ltd. | Modem relay over packet based network |
WO2001097499A1 (en) | 2000-06-14 | 2001-12-20 | Surf Communication Solutions, Ltd. | Distributed modem |
US7355735B1 (en) | 2000-06-14 | 2008-04-08 | Yona Sivan | Real time fax over packet based network |
US7420961B2 (en) | 2000-06-14 | 2008-09-02 | Abraham Fisher | Distributed modem |
US7529228B2 (en) | 2003-09-02 | 2009-05-05 | Electronics And Telecommunications Research Institute | Scheduling method for multi-channel DSP (Digital signal Processor) algorithm, VoP (Voice over Packet) system, and recording medium |
US7440446B2 (en) | 2003-12-26 | 2008-10-21 | Electronics And Telecommunications Research Institute | Voice over packet system using a plurality of digital signal processors and speech processing method therein |
US7424003B2 (en) | 2004-03-08 | 2008-09-09 | Surf Communication Solutions | Multi-parameter scheduling in communication systems |
Also Published As
Publication number | Publication date |
---|---|
WO2001035228A3 (en) | 2002-01-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1230596B1 (en) | Stable operation of media gateway | |
AU737040B2 (en) | Method and apparatus for reducing signal processing requirements for transmitting packet-based data with a modem | |
US6098091A (en) | Method and system including a central computer that assigns tasks to idle workstations using availability schedules and computational capabilities | |
US6285748B1 (en) | Network traffic controller | |
EP0605349B1 (en) | Switched circuit connection management over public data networks for wide area networks | |
US20080235689A1 (en) | Scheduling in a communication server | |
US20080037475A1 (en) | Data rate controller | |
US6766516B1 (en) | Processor sharing technique for communications and other data processing on a same processor | |
EP1011228A2 (en) | Dynamic variation of class of service in a communication network based on network resources | |
US20060029048A1 (en) | Method to optimally select bandwidth and priority for voice message packets in a voice over IP network | |
US20060187833A1 (en) | Systems and methods for upload bandwidth management | |
JP2007174708A (en) | Method and apparatus for dynamically allocating bandwidth utilization in packet telephony system | |
JPH07123174A (en) | Communication method for line exchange network and communication controller | |
US20020049746A1 (en) | Method of transmitting real-time data from a network element to an application server | |
WO2001035228A2 (en) | Stable operation of media gateway | |
CN114071168A (en) | Mixed-flow direct-broadcast stream scheduling method and device | |
US7200168B1 (en) | Stable operation of media gateway | |
US6834305B1 (en) | System and method for automatically connecting local and remote data processing systems | |
JP2005522145A (en) | Method and system for allocating resources dedicated to non-voice data traffic processing | |
US20030014484A1 (en) | Scheduling in a remote-access server | |
US7292584B1 (en) | Effective multilink flow handling | |
Chou et al. | System support for dynamic QOS control of continuous media communication | |
JPH08191308A (en) | Communication path selection method | |
US7424003B2 (en) | Multi-parameter scheduling in communication systems | |
US20030079009A1 (en) | Gatekeeper apparatus and communication system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
AK | Designated states |
Kind code of ref document: A3 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2000974758 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10129772 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2000974758 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWG | Wipo information: grant in national office |
Ref document number: 2000974758 Country of ref document: EP |