AU6575500A - Method for distributing the load of a communication channel - Google Patents
Method for distributing the load of a communication channel Download PDFInfo
- Publication number
- AU6575500A AU6575500A AU65755/00A AU6575500A AU6575500A AU 6575500 A AU6575500 A AU 6575500A AU 65755/00 A AU65755/00 A AU 65755/00A AU 6575500 A AU6575500 A AU 6575500A AU 6575500 A AU6575500 A AU 6575500A
- Authority
- AU
- Australia
- Prior art keywords
- channel
- transactions
- communication
- suppliers
- distributing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/10015—Access to distributed or replicated servers, e.g. using brokers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/14—Multichannel or multilink protocols
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Crystals, And After-Treatments Of Crystals (AREA)
- Amplifiers (AREA)
- Computer And Data Communications (AREA)
- Communication Control (AREA)
Abstract
The invention concerns a method for distributing the load of a communication channel (4) in a transaction exchange between two communication channels, in conformity with the transactions between the providers (2, 7) and the channel and the transactions between the channel and the consumers (6), comprising steps which consist in: creating a twin communication channel; transferring part of the data providers on the twin channel, when their current transactions (3, 13) with the initial channel are completed.
Description
ATOMIC SWITCHING OF THE DESTINATION OBJECT BETWEEN TWO TRANSACTIONAL INVOCATIONS The field of the invention is that of transactional communications between objects that supply data and 5 objects that consume the data, such communication using communication channels and internal or external managers of the various relations between the aforementioned objects. The mechanism is implemented by an intermediate object, namely the communication channel. 10 Suppliers can overload a channel if they transfer too great a quantity of data or if a large number of suppliers are connected to the channel. In the art, one known way of limiting overload consists of providing the communication channel with an 15 activity limit threshold from which it refuses any new transaction until the transactions in progress have terminated. However, that solution is too costly in terms of execution time. The slightest overrun entails the risk of blocking an entire channel, even if the 20 overrun is only temporary. It is possible to improve the above solution by implementing a dynamic system for determining overruns which takes account of their context. The above solution necessarily reduces the reaction time of the system as a whole. 25 A transaction must satisfy four properties grouped together under the acronym ACID signifying: Atomicity, Consistency, Isolation, and Durability. The four properties are closely interrelated. The objective of restart and competition control mechanisms used by a 30 transactional engine is to ensure conformance to them. Atomicity guarantees that either all the updates of a transaction are effected or none of them. Non conformance to this property can change the set of data from the initial consistent state to an inconsistent 35 state. In order to conform to this property, any series of actions constituting a transaction is marked by a start 2 and an end. The start of a transaction signals the start event of a transaction to the transactional engine. Two instructions are provided for marking the end of a transaction: "Commit" enables the transaction to signal 5 to the transactional monitor that from the isolated point of the transaction all its actions have been completed successfully and "Abort" enables the transaction to signal to the transactional monitor that one or more of its actions have failed and that it does not wish to be 10 validated (the data modified by the transaction must be returned to its preceding state). Depending on the end of transaction event received by the transactional monitor and on its overview of the system (interaction between transactions), the transactional monitor decides 15 whether or not to validate the transaction, i.e. whether or not to make the modifications effected by it permanent. If a system fault occurs before the end of a transaction, then the transaction is considered to be aborted. One mechanism for conforming to the atomicity 20 property entails retaining the preceding image of any data updated for each transaction in progress. If a transaction is aborted, it is possible to undo the transaction by applying all the preceding images of the transaction. 25 The consistency property concerns the semantic consistency of a set of data. It can be maintained partly by mechanisms assuring integrity constraint control and by maintaining the property of the transactions. Isolation is indispensable in a 30 multitasking environment, to guarantee that each transaction sees a consistent state of the set of data. Isolation entails guaranteeing that, if the transaction executes in parallel with other transactions accessing a common set of data, then serial execution of the same 35 transactions would produce the same changes on the set of data accessed by the transactions. In this case, the isolation property is satisfied for that set of 3 transactions. Durability guarantees that the updates of a validated transaction are permanent. The only action that should enable the updates of a validated transaction to be undone is executing a compensation transaction. 5 This property goes hand in hand with the atomicity property stipulating that the updates of a transaction form a consistent whole which is either aborted entirely or validated permanently. One way to deal with a memory or hard disc failure leading to loss of information from 10 the database is to provide a restart mechanism to recover the lost information. The object of the invention is to propose a solution which reduces the overloading of a communication channel, conforms to reliability ACID properties and does not 15 degrade the capacities of the system. To reduce the overload, an additional twin channel is created and some of the data is directed onto the new channel. The invention provides a method of distributing the 20 load of a communication channel in transactional communication between two communication channels conforming to transactions between suppliers and the channel and transactions between the channel and consumers. The method includes the following steps: 25 - a twin communication channel is created; - some data suppliers are transferred to the twin channel as soon as their transactions in progress with the original channel have terminated. The invention also relates to the disconnection 30 mechanism. It provides a method of distributing the load of a communication channel in transactional communication between two communication channels conforming to transactions between suppliers and the channel and transactions between the channel and consumers. The 35 method including the following steps: - a twin communication channel is created; - some data suppliers are transferred to the twin 4 channel as soon as their transactions in progress with the original channel have terminated. The method preferably includes a step of identifying suppliers to be transferred to the twin channel. No new 5 transaction is undertaken between the suppliers so identified and the original channel after the step of identifying those suppliers. The invention also relates to the disconnection mechanism. It provides a method of distributing the load 10 of two communication channels conforming to transactions between suppliers and the channels and transactions between the channels and consumers, said method including the following steps: - a main channel and a secondary channel are 15 defined; - the data suppliers are transferred from the secondary channel to the main channel as soon as their transactions in progress with the secondary channel have terminated. 20 The consumers are advantageously disconnected from the secondary channel when all the transactions involving said secondary channel have been effected. The secondary channel can be determined by a minimum traffic threshold. In one variant, whether the main 25 channel is managing traffic below a predetermined threshold is tested beforehand. To guarantee reliable delivery of data between a supplier and one or more consumers, the data can propagate between two contiguous objects under the 30 control of a transaction. In this case a supplier initiates a transaction in order to ensure transfer with the communication channel is reliable. The supplier is released when the channel supplier transaction has terminated correctly. A second 35 transaction is initiated by the channel for reliable transfer to the consumer. The second transaction, which makes the propagation between the channel and the 5 consumer reliable, is terminated when the client has received the data correctly. An empty copy of the communication channel is created when the channel is overloaded. The copy is 5 connected to all the clients connected to the original channel. A supplier is not switched to the new channel unless its transactions in progress on the original channel have terminated. 10 To distribute the load some suppliers are disconnected from the original channel one by one and connected to the twin channel. The supplier has a field that can be interrogated and that indicates whether it can be disconnected or not, 15 i.e. whether the supplier has a transaction in progress or not. When the load decreases, a similar mechanism switches the suppliers back to the original channel and destroys the twin channel, which is no longer of any 20 utility. A supplier is not switched until there is no transaction in progress. To prevent the supplier from beginning new transactions indefinitely, new transactions are prohibited for the supplier. When migration becomes 25 possible, the supplier is given the reference of the new channel so that it can connect. It can then begin new transactions on the original channel. All the clients are connected to the new channel before a supplier migrates in order to ensure that no 30 data is lost and that no data is transmitted more than once. The converse operation is similar: all the suppliers must be moved from the twin channel to the original channel before the clients are disconnected. Also, all 35 the transactions in progress must terminate before an object migrates. Figure 1 shows the overloaded system before the twin 6 channel starts to operate. The suppliers (1 and 7) each have a specific interface (1) that the communication managers interrogate to find out if transactions are in progress. The 5 supplier (1) has a transaction (3) with the communication channel (4) in progress but the supplier (7) is not doing anything and can be transferred to a twin channel. The consumers (6) are in constant communication (5) with the communication channel. 10 Figure 2 shows a twin channel after it has been set up. The twin channel (12) has transactions (13) with the supplier (7) in progress. The consumers (6) are in communication with all the communication channels (11).
Claims (6)
1. A method of distributing the load of a communication channel (4) in transactional communication between two communication channels conforming to transactions between 5 suppliers (2,7) and the channel and transactions between the channel and consumers (6), said method including the following steps: - a twin communication channel (12) is created; - some data suppliers are transferred to the twin 10 channel as soon as their transactions in progress with the original channel have terminated.
2. A method according to claim 1 of distributing the load of a communication channel, including a step of identifying suppliers (7) to be transferred to the twin 15 channel, and characterized in that no new transaction is undertaken between the suppliers (7) so identified and the original channel (4) after the step of identifying those suppliers.
3. A method of distributing the load of two 20 communication channels conforming to transactions between suppliers and the channels and transactions between the channels and consumers, said method including the following steps: - a main channel and a secondary channel are 25 defined; - the data suppliers are transferred from the secondary channel to the main channel as soon as their transactions in progress with the secondary channel have terminated. 30
4. A method according to claim 3 of distributing the loads of two communication channels, characterized in that the consumers are disconnected from the secondary channel when all the transactions involving said secondary channel have been effected. 8
5. A method in accordance with claim 3 or claim 4 of distributing the load of two communication channels, characterized in that the secondary channel is determined by a minimum traffic threshold. 5
6. A method according to claim 5 of distributing the load of two communication channels, characterized in that whether the main channel is managing traffic below a predetermined threshold is tested beforehand.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9909193 | 1999-07-15 | ||
FR9909193 | 1999-07-15 | ||
PCT/FR2000/002033 WO2001006730A1 (en) | 1999-07-15 | 2000-07-13 | Method for distributing the load of a communication channel |
Publications (1)
Publication Number | Publication Date |
---|---|
AU6575500A true AU6575500A (en) | 2001-02-05 |
Family
ID=9548141
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
AU65755/00A Abandoned AU6575500A (en) | 1999-07-15 | 2000-07-13 | Method for distributing the load of a communication channel |
Country Status (7)
Country | Link |
---|---|
EP (1) | EP1114544B1 (en) |
JP (1) | JP2003505935A (en) |
AT (1) | ATE330407T1 (en) |
AU (1) | AU6575500A (en) |
DE (1) | DE60028715T2 (en) |
ES (1) | ES2265961T3 (en) |
WO (1) | WO2001006730A1 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102007046512A1 (en) * | 2007-09-28 | 2009-04-09 | Siemens Ag | Switching unit for mechanical connection with actuator in emergency stop-control unit, has switching mechanism for opening and closing of current circuit in housing, and locking mechanism arranged in inner side of housing |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2172471B (en) * | 1985-03-16 | 1988-12-14 | Stc Plc | Packet switching system |
US5481738A (en) * | 1992-02-20 | 1996-01-02 | International Business Machines Corporation | Apparatus and method for communicating a quiesce and unquiesce state between elements of a data processing complex |
US5781598A (en) * | 1996-08-14 | 1998-07-14 | Hardy, Iii; Harmon S. | System and method of asynchronous data transfer through a plurality of modems |
-
2000
- 2000-07-13 DE DE60028715T patent/DE60028715T2/en not_active Expired - Lifetime
- 2000-07-13 AU AU65755/00A patent/AU6575500A/en not_active Abandoned
- 2000-07-13 AT AT00953229T patent/ATE330407T1/en not_active IP Right Cessation
- 2000-07-13 WO PCT/FR2000/002033 patent/WO2001006730A1/en active IP Right Grant
- 2000-07-13 ES ES00953229T patent/ES2265961T3/en not_active Expired - Lifetime
- 2000-07-13 JP JP2001511053A patent/JP2003505935A/en not_active Withdrawn
- 2000-07-13 EP EP00953229A patent/EP1114544B1/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
EP1114544B1 (en) | 2006-06-14 |
ES2265961T3 (en) | 2007-03-01 |
DE60028715T2 (en) | 2007-06-14 |
EP1114544A1 (en) | 2001-07-11 |
ATE330407T1 (en) | 2006-07-15 |
DE60028715D1 (en) | 2006-07-27 |
JP2003505935A (en) | 2003-02-12 |
WO2001006730A1 (en) | 2001-01-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4241940B2 (en) | A method for doing transactions in a distributed database. | |
CN1648867B (en) | Data processing system | |
US6769003B2 (en) | Parallel logging method for transaction processing system | |
JP2002522845A (en) | Fault tolerant computer system | |
CN113641511B (en) | Message communication method and device | |
US5657474A (en) | Transactional protocol and system for implementing it | |
US20070118840A1 (en) | Remote copy storage device system and a remote copy method | |
JPH10308755A (en) | System equipped with data receiving station installed in network | |
CN105656947B (en) | A kind of methods, devices and systems that transaction middleware is interacted with third party system | |
US20110185360A1 (en) | Multiprocessing transaction recovery manager | |
US8725686B2 (en) | Method and program for creating determinate backup data in a database backup system | |
JPH06243072A (en) | Distributed transaction commitment control system for distributed processing system | |
CN112925614A (en) | Distributed transaction processing method, device, medium and equipment | |
US11030219B1 (en) | Method for replacing a currently operating data replication engine with a new data replication engine without application downtime and while preserving target database consistency, and by using audit trail tokens | |
AU2291701A (en) | Preserving consistency of passively-replicated non-deterministic objects | |
EP0770242A2 (en) | Method for warming up a spare process in a replicated real-time system, in particular in a telephone exchange | |
US20100020678A1 (en) | Switching program, switching method and full duplex system | |
AU6575500A (en) | Method for distributing the load of a communication channel | |
US10303699B1 (en) | Method for replacing a currently operating data replication engine with a new data replication engine without application downtime and while preserving target database consistency | |
CN114064810B (en) | Method and device for processing transaction | |
US7171465B1 (en) | Method for determining a server computer which carried out a process most recently, and high availability computer system | |
US8359602B2 (en) | Method and system for task switching with inline execution | |
Guerraoui et al. | The collective memory of amnesic processes | |
CN113342483B (en) | Raft-based distributed task scheduling system | |
CN101488134A (en) | Method and system for high-performance affair modification in copying surroundings of database system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
MK1 | Application lapsed section 142(2)(a) - no request for examination in relevant period |