WO2001011473A1 - Transfer time optimization between handheld wireless devices - Google Patents

Transfer time optimization between handheld wireless devices Download PDF

Info

Publication number
WO2001011473A1
WO2001011473A1 PCT/US2000/021906 US0021906W WO0111473A1 WO 2001011473 A1 WO2001011473 A1 WO 2001011473A1 US 0021906 W US0021906 W US 0021906W WO 0111473 A1 WO0111473 A1 WO 0111473A1
Authority
WO
WIPO (PCT)
Prior art keywords
transaction
sender
receiver
transfer script
receipt
Prior art date
Application number
PCT/US2000/021906
Other languages
French (fr)
Inventor
Margaret M. Mahoney
Graham V. Poor
Original Assignee
Bonita Software, Inc.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Bonita Software, Inc. filed Critical Bonita Software, Inc.
Priority to AU66307/00A priority Critical patent/AU6630700A/en
Publication of WO2001011473A1 publication Critical patent/WO2001011473A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • H04L1/1635Cumulative acknowledgement, i.e. the acknowledgement message applying to all previous messages

Definitions

  • the present invention relates generally to wireless data communication networks and, more specifically, to improving the reliability and efficiency of data transfer for handheld wireless devices that communicate via a wide area network such as the Internet.
  • IT Information Technology
  • a wireline connection is typically made via serial port cable and/or via telephone land line. Data can be reliably transferred back and forth because the quality and reliability of the connection are relatively high.
  • HWCDs Handheld Wireless Communicating Devices
  • Communicating functionality means that the HWCD possesses some means of transferring data on-the-fly, i.e., while engaged in other computing processes, via a communications network, where the data transfer medium between the handheld device and the edge of the network is not physical, i.e. no cable or telephone lines are directly linked to the device.
  • Wireless connections are inherently unreliable due to the unpredictable nature of the medium and the limitations of radio transmitters and receivers. Connections are unstable, and can be terminated or "dropped" at any time. Connections are often unavailable altogether.
  • the sender maintains a change record that reflects any changes to data to be transferred that are made on the sender platform while no connection exists between the sender and receiver platforms.
  • the sender constructs a transfer script that groups the data packets into transactions.
  • the sender transmits to the receiver a skeletal transfer script that identifies the transactions to be transmitted but does not include the information data packets.
  • the receiver tracks the progress of the transfer by comparing received tokens to the skeletal transfer script.
  • the receiver creates and maintains a transfer record to track the progress of the transfers.
  • the receiver can use the transfer record to identify the last transaction that was completely received and roll back the transaction that was incompletely received. Not only do Transaction Begin and End tokens in the transmission identify the beginning and end of each transaction, but similar tokens identify the beginning and end of each packet and each transfer script.
  • the sender expects to receive an acknowledgement, in the form of an Acknowledgement (ACK) token, of each End token it sends. If the sender does not receive an expected ACK token from the receiver before a predetermined timeout interval has passed, the connection is deemed to have been dropped.
  • ACK Acknowledgement
  • the sender receives an ACK token in response to a transfer script End token, it removes from the transfer script and change record all transactions that have been successfully transferred. Those transactions that had not been successfully transferred remain in the transfer script and change record for retransmission after a connection is re-established.
  • Figure 3 A is a flow diagram illustrating the communication of information, tokens, and acknowledgements between the sender and receiver;
  • Figure 3B is a continuation sheet of Fig. 3 A;
  • Figure 3C is a continuation sheet of Fig. 3B;
  • Figure 4 illustrates an exemplary software structure of a sending system in accordance with one embodiment of the invention;
  • one or more handheld wireless communication devices (HWCDs) 10 can communicate bidirectionally via a wireless network 12 with each other as well as with one or more remote machines 14, i.e., computers, via a wired network 16.
  • HWCDs handheld wireless communication devices
  • Remote machines 14 can be servers on which information is stored that HWCDs 10 can access.
  • Wired network 16 can be any wide area computer network, such as the global super-network presently known as the Internet or a portion thereof.
  • HWCDs 10 and remote machines 14 can be configured with software in accordance with the present invention to provide a novel data transfer system and method, but the hardware aspects and general operation of HWCDs 10 are otherwise generally well-known in the art and therefore not described in detail in this patent specification.
  • HWCDs 10 can include general-purpose computing devices and similar intelligent electronic devices, such as those commonly referred to as personal digital assistants, phones, pagers, and devices that allow users to send and receive electronic mail. As illustrated in Fig.
  • the resulting bidirectional radio communications link thus serves the same purpose of facilitating communications with other computing and communicating devices as the network communications link in a wired computer network, such as a local area network or wide area network.
  • a wired computer network such as a local area network or wide area network.
  • Processor 18 of HWCD 10 operates in accordance with suitable programming.
  • the software elements effecting this programming conceptually include, among other elements, application software 26, operating system software 28, and data transfer software 30.
  • Application software 26 enables processor 18 to perform tasks commonly referred to as user applications, and may include, for example, a Web browser application, an electronic mail (e-mail) application, a time and schedule organizer, a word processor, and so forth. Note that many such applications commonly support communication with remote computers or servers.
  • Operating system software 28 represents the software elements that enable processor 18 to perform basic tasks such as accessing memory 20 and communicating data with user interface 24 and transceiver 22. Other software of types commonly included in devices of this type can also be included, but such other software is not specifically illustrated for purposes of clarity.
  • Data transfer software 30 enables processor 18 to effect the novel data transfer methods of the present invention and is described in further detail below.
  • elements 26, 28 and 30 are conceptually illustrated as software residing in memory 20, persons skilled in the art will understand that, because the resulting programming of processor 18 is nothing more than digital logic, in other embodiments of the invention any or all of elements 26, 28 and 30 can be implemented wholly in software, wholly in hardware, or in any suitable combination of software and hardware logic. Similarly, such persons will understand that these software elements may not reside in main memory in their entireties or simultaneously at any given point in time but rather are depicted that way for purposes of illustration only.
  • Figs. 3A-C The method for transferring data between a sender and receiver is illustrated in Figs. 3A-C.
  • At least one of the sender and receiver is a HWCD 10, and the other can be another HWCD 10, a remote machine 14, or any similar computing device or system that is accessible via the Wireless Internet.
  • the sender's actions are indicated in a left-hand column, and the receivers in a right-hand column.
  • a change record is an area of memory 20 that acts as temporary storage or a queue for information to be transmitted.
  • a client process under the control of application software 26 may attempt to transmit a request for information to a remote machine 14 that is acting as a server.
  • the method may include building the request in steps. As each step adds to the request, processor 18 stores the newly added information in the change record and also stores an indication of the relationship between the added information and any pre-existing information.
  • the sender attempts to initiate a network connection with the receiver in the conventional manner using a suitable protocol.
  • the method proceeds to step 36 when it is determined that the sender and receiver can communicate with one another.
  • the physical connection can include both wireless and wired links in the Wireless Internet.
  • the sender retrieves the information from the change record, groups the information into data packets, and groups the data packets into transactions.
  • transaction refers to a collection of packets, it is related to the term as commonly used in the context of transaction processing.
  • a transaction is a semantically intact or unitary group of data packets.
  • the selected packets together define the requisite properties of a "transaction,” as that term is used in the context of transaction processing.
  • a transaction refers to a set of procedures involving a system of two or more machines that has the following four properties, commonly referred to collectively by the acronym ACID: atomicity, consistency, isolation, and durability.
  • Atomicity means that the transaction should either be completed or all data rolled back in all machines to its state prior to initiation of the transaction.
  • Consistency means that a transaction should transform a system from one consistent state to another consistent state.
  • Isolation means that each transaction should happen independently of transactions occurring at the same time.
  • Durability means that completed transactions should remain permanent, even during system failure.
  • packets are grouped, if possible, in a manner that ensures ACID properties. Accordingly, when the receiver completely receives a transaction, it can immediately rely upon and use all of the received data because the data is semantically intact and not dependent upon any other data. Nevertheless, if the receiver does not completely receive a transaction due to disruption of the transfer or other undesirable condition, the transfer is rolled back, and the transaction must be re-transmitted, as described in further detail below.
  • the sender constructs an actual transfer script and, at step 40, constructs a skeletal transfer script.
  • the actual transfer script has the following format:
  • the transfer script includes m transactions, an exemplary one of which includes n data packets.
  • "Transfer Script Begin” is a token intended to indicate to the receiver that a transfer script is about to be sent.
  • Transfer Script End is a token intended to indicate to the receiver that the transfer script has been sent.
  • “Transaction x Begin,” where x is replaced by a number from one to m, is a token intended to indicate to the receiver that a transaction is about to be sent.
  • Transportaction x End is a token intended to indicate to the receiver that the transaction has been sent.
  • the skeletal transfer script mirrors the actual transfer script but does not include the data packets. Rather, it includes only the various Begin and End tokens.
  • the skeletal transfer script is intended to identify for the receiver the items to be sent in the forthcoming transmissions.
  • a skeletal transfer script therefore has the following format:
  • the sender transmits the skeletal transfer script. If the receiver received the entire skeletal transfer script, at step 44 the receiver transmits an acknowledgement back to the sender. At step 46 the sender indicates it is beginning to transmit the actual transfer script by transmitting a Transfer Script Begin token in response to the acknowledgement. If the receiver received this token, at step 48 it transmits an acknowledgement back to the sender.
  • the sender transmits a Packet y Begin token in response to the acknowledgement. If the receiver received this token, at step 56 it transmits an acknowledgement back to the sender. At step 58 the sender transmits the packet data (Dataset y) in response to the acknowledgement. At step 60 the sender transmits a Packet y End token. If the receiver received this token, at step 62 it transmits an acknowledgement back to the sender. If the transaction (Transaction x) includes more than one packet, steps 54-62 are repeated. Step 64 is reached when the last packet of Transaction x has been transmitted and acknowledged.
  • the sender transmits the Transfer Script End token in response to the acknowledgement of the Transaction m End token. If the receiver received this token, at step 70 it transmits an acknowledgement back to the sender. Step 72 is intended to indicate that steps 34-72 are repeated if the change record had again been updated since the time the changed data was transmitted. Note that even if the connection between the sender and receiver is dropped, processor 18, under control of application software 26 or other element of the sender, can continue to update the change record while no connection exists because any data that is changed during that time will be transmitted as soon as a connection is re-established. The intermittence of connections is therefore, in effect, transparent to the sender. In other words, application software 26 or other elements of the sender, can operate essentially independently of the network connection and need not be concerned with the reliability of the connection. Instead, data transfer software 30 is responsible for all aspects of data transfer, including taking into account potential intermittence of the connection.
  • an application logic module 74 defines the highest level of the sender software structure portion.
  • the following illustrates some exemplary pseudocode for module 74 relating to the functions of creating a new change record, deleting a change record, and updating a change record:
  • a change record module 76 defines the next level of the software structure. The following illustrates some exemplary pseudo-code for module 76:
  • Transaction createTransaction() TransactionList.Add(Transaction) Transaction.AddPacket(Packet) ELSE
  • RecordList Record.GetLinkedRecords() FOR EACH of RecordList
  • TransactionList. ClearListQ The next level of the sender software structure is defined by a data transfer module
  • modules 78, 80 and 82 The following illustrates some exemplary pseudo-code for modules 78, 80 and 82:
  • step 84 the sender creates the actual transfer script and, at step 86, the skeletal transfer script.
  • step 88 it attempts to establish a Wireless Internet connection with an intended receiver.
  • Step 90 indicates that if the connection is not successfully made, step 88 is repeated. If the connection is successfully made, at step 92 it is determined whether a transfer is already in progress. If not, then at step 94 a transfer is begun by sending the skeletal transfer script.
  • Step 96 indicates that if an acknowledgement token is received from the receiver, acknowledging receipt of the skeletal transfer script, a transfer is deemed to be in progress at step 98, an indication to that effect is saved or marked, and step 100 occurs next. If no acknowledgement token is received, then step 94 is repeated. At step 100 it is determined whether more items are to be transferred. Items can include both tokens and data packets. If there are more items to be transferred, the next item is sent at step 102. Step 104 indicates that if an acknowledgement is received from the receiver, acknowledging receipt of the item, step 100 is repeated.
  • connection is deemed to have been dropped, and at step 106 the sender deletes from the actual transfer script all items receipt of which has already been acknowledged. Then, at step 108 the connection is terminated and step 88 is repeated by attempting to renew the connection.
  • step 100 if it is determined at step 100 that there are no more items to be transferred, the transfer is deemed to be not in progress, and the indication is changed to reflect that state at step 110. Then, at step 112 the connection is terminated.
  • a data transfer module 114 defines the highest level of the receiver software structure portion.
  • Data transfer module 114 includes the following sub- modules: an application logic module 116, a user interface module 118, a rollback module 120, a transfer record module 122, a temporary storage module 124, and a data storage module 126.
  • the following illustrates some exemplary pseudo-code relating to the above- listed modules:
  • the method performed by the receiver in accordance with data transfer module 114 and its sub-modules is illustrated in further detail in Fig. 6.
  • the receiver clears the transfer record and saves an indication that a transfer is in progress.
  • the transfer record is an area of memory in which the receiver records by means of the Begin and End tokens indications of all items it receives. The following is an example of a transfer record: Transfer Script Begun
  • the receiver reads the received packet data, writes it to the temporary storage at step 148, and if it is determined at step 150 that the packet has more data, returns to step 146. Otherwise, it returns to step 132 to read the next received item.
  • step 152 If at step 152 it is determined that the item is a Packet End token, at step 154 the receiver transmits an acknowledgement token and records the event in the transfer record before returning to step 132. If at step 156 it is determined that the item is a Transaction End token, at step 158 the receiver transmits an acknowledgement token and records the event in the transfer record before proceeding to step 160. If the item is not a Transaction End token, the method proceeds to step 162.
  • the temporary storage data are copied to a main data storage area.
  • Data in the main data storage area are deemed reliable in the sense that they represent one or more transactions and are thus immediately usable by the receiver.
  • the data may, for example, represent a request for the receiver, acting as a server, to retrieve information from a database (not shown) and transmit it to the client (sender of the request).
  • application logic module 116 is notified, and the method returns to step 132.
  • step 162 If at step 162 it is determined that the item is a Transfer Script End token, at step 166 the receiver transmits an acknowledgement token and records the event in the transfer record before proceeding to step 168. If the item is not a Transfer Script End token, the transaction is rolled back at step 170. In other words, the receiver does not use the data that has been copied to the main data storage area and resets the area to its state prior to the beginning of the current transaction. At step 168 the receiver compares the transfer record to the skeletal transfer script.
  • step 172 indicates successful transfer in accordance with the script, and the method can begin again. If they do not match, the receiver rolls back the current transaction as described above with regard to step 170.

Abstract

A sender platform (10) and a receiver platform (14), at least one of which is a handheld wireless communicating device, communicate digital data packets that are grouped into sequentially transmitted transactions. The data packets include not only the information to be communicated but also tokens. Each transaction is encoded with Begin and End tokens such that the receiver (14) can detect when the transmission of a transaction has been successfully completed. If communication is undesirably interrupted during transaction, the sender (10) and the receiver (14) reconnect and resume the transfer at the point at which the last transaction failed to completely transfer. Any transaction that the receiver (14) did not receive completely is rolled back.

Description

TRANSFER TIME OPTIMIZATION BETWEEN HANDHELD WIRELESS DEVICES
CROSS-REFERENCE TO RELATED APPLICATION
The benefit of the filing date of U.S. Provisional Patent Application, Serial No. 60/148,161, entitled "MINIMIZATION AND OPTIMIZATION OF OVERALL DATA TRANSFER CONNECT TIME BETWEEN HANDHELD WIRELESS COMMUNICATING DEVICES AND REMOTE MACHINES," filed August 10, 1999, is hereby claimed, and the specification thereof is incorporated herein in its entirety by this reference.
BACKGROUND OF THE INVENTION
FIELD OF THE INVENTION
The present invention relates generally to wireless data communication networks and, more specifically, to improving the reliability and efficiency of data transfer for handheld wireless devices that communicate via a wide area network such as the Internet.
DESCRIPTION OF THE RELATED ART
While in most business organizations an Information Technology (IT) department is charged with procuring, managing, supporting and maintaining desktop, laptop and other computing systems used by individuals within the organization, handheld computing devices that such individuals may use are generally outside the auspices of the IT department and disconnected from the organization's computing infrastructure and the Internet, in effect acting as stand-alone units. To transfer data between two such devices or between such a device and one of the organization's other computing systems, a wireline connection is typically made via serial port cable and/or via telephone land line. Data can be reliably transferred back and forth because the quality and reliability of the connection are relatively high.
Computing devices are increasingly being developed with wireless data communication capability. Such devices can generally be referred to as Handheld Wireless Communicating Devices (HWCDs). HWCDs that go beyond simple data transfer capability have what is generally known as "communicating functionality." Communicating functionality means that the HWCD possesses some means of transferring data on-the-fly, i.e., while engaged in other computing processes, via a communications network, where the data transfer medium between the handheld device and the edge of the network is not physical, i.e. no cable or telephone lines are directly linked to the device. Wireless connections are inherently unreliable due to the unpredictable nature of the medium and the limitations of radio transmitters and receivers. Connections are unstable, and can be terminated or "dropped" at any time. Connections are often unavailable altogether. When data needs to be transferred from a HWCD to a remote computer, a wireless connection is made, data is transferred, and the connection is terminated. It is a common occurrence for the connection to drop during transmission because of the instability of wireless infrastructure. In the case of a dropped connection, a new connection must be made, and the entire data set must be transmitted again. This is a problem because of the typically slow speeds of wireless transmission.
It would be desirable to provide a method and system that optimizes data transfer in a wireless communication environment in which intermittent connections can be expected. The present invention addresses this problem and others in the manner described below.
SUMMARY OF THE INVENTION
The present invention relates to a method and system in which a sender platform and a receiver platform, at least one of which is a handheld wireless communicating device (HWCD), communicate digital data packets that are grouped into sequentially transmitted transactions. The data packets include not only the information to be communicated but also tokens. Each transaction is encoded with Begin and End tokens such that the receiver can detect when the transmission of a transaction has been successfully completed. If communication is undesirably interrupted during transmission, the sender and receiver reconnect and resume the transfer at the point at which the last transaction failed to completely transfer. Any transaction that the receiver did not receive completely is rolled back. In other words, that transaction is re-transmitted in its entirety. Nevertheless, any transactions that were received completely are released for immediate access by the processing elements of the receiver.
In an illustrative embodiment of the invention, the sender maintains a change record that reflects any changes to data to be transferred that are made on the sender platform while no connection exists between the sender and receiver platforms. When a connection is made between the sender and receiver, the sender constructs a transfer script that groups the data packets into transactions. Before beginning transmission of the actual transfer script, which includes the information (in data packet format) to be transferred, the sender transmits to the receiver a skeletal transfer script that identifies the transactions to be transmitted but does not include the information data packets. The receiver then tracks the progress of the transfer by comparing received tokens to the skeletal transfer script. The receiver creates and maintains a transfer record to track the progress of the transfers.
If a transaction was not completely received, the receiver can use the transfer record to identify the last transaction that was completely received and roll back the transaction that was incompletely received. Not only do Transaction Begin and End tokens in the transmission identify the beginning and end of each transaction, but similar tokens identify the beginning and end of each packet and each transfer script. The sender expects to receive an acknowledgement, in the form of an Acknowledgement (ACK) token, of each End token it sends. If the sender does not receive an expected ACK token from the receiver before a predetermined timeout interval has passed, the connection is deemed to have been dropped. When the sender receives an ACK token in response to a transfer script End token, it removes from the transfer script and change record all transactions that have been successfully transferred. Those transactions that had not been successfully transferred remain in the transfer script and change record for retransmission after a connection is re-established.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings illustrate one or more embodiments of the invention and, together with the written description, serve to explain the principles of the invention. Wherever possible, the same reference numbers are used throughout the drawings to refer to the same or like elements of an embodiment, and wherein: Figure 1 illustrates a handheld wireless communicating device; Figure 2 illustrates a network environment;
Figure 3 A is a flow diagram illustrating the communication of information, tokens, and acknowledgements between the sender and receiver; Figure 3B is a continuation sheet of Fig. 3 A; Figure 3C is a continuation sheet of Fig. 3B; Figure 4 illustrates an exemplary software structure of a sending system in accordance with one embodiment of the invention;
Figure 5 is a flow diagram illustrating a method for sending data; Figure 6 illustrates an exemplary software structure of a receiving system in accordance with one embodiment of the invention; and Figure 7 is a flow diagram illustrating a method for receiving data.
DETAILED DESCRIPTION
The following is a more detailed description of an exemplary embodiment of the invention. As illustrated in Fig. 1, in the exemplary embodiment one or more handheld wireless communication devices (HWCDs) 10 can communicate bidirectionally via a wireless network 12 with each other as well as with one or more remote machines 14, i.e., computers, via a wired network 16. (Note that in other embodiments of the invention, such as one in which the HWCD is a pager or other device that receives but cannot transmit information, communication may be unidirectional.) Remote machines 14 can be servers on which information is stored that HWCDs 10 can access. Wired network 16 can be any wide area computer network, such as the global super-network presently known as the Internet or a portion thereof. In accordance with terminology commonly used in the art, the combination of wireless network 12 and wired network 16 may be referred to as the "Wireless Internet." The structure and operation of the Wireless Internet is well-known in the art and therefore not described in detail in this patent specification. Any of HWCDs 10 and remote machines 14 can be configured with software in accordance with the present invention to provide a novel data transfer system and method, but the hardware aspects and general operation of HWCDs 10 are otherwise generally well-known in the art and therefore not described in detail in this patent specification. Generally speaking, HWCDs 10 can include general-purpose computing devices and similar intelligent electronic devices, such as those commonly referred to as personal digital assistants, phones, pagers, and devices that allow users to send and receive electronic mail. As illustrated in Fig. 2, HWCD 10 includes a processor 18, a memory 20, a radio transceiver 22 and a user interface 24. Depending upon the purpose of HWCD 10, user interface 24 may include a keyboard and a display, for example. If HWCD 10 is of the type known as a personal digital assistant, user interface 24 may include a pressure- sensitive tablet on which text and graphics can be entered using a stylus. In general, processor 18 operates upon information stored in memory 20 and communicates input and output data with user interface 24 and transceiver 22. Memory 20 can include any suitable combination of random-access memory, read-only memory or other types of volatile and non-volatile memory and data storage devices. Transceiver 22 can transmit and receive digital data by means of radio signals. The resulting bidirectional radio communications link thus serves the same purpose of facilitating communications with other computing and communicating devices as the network communications link in a wired computer network, such as a local area network or wide area network. As noted above, these aspects of HWCD 10 are well-understood by persons skilled in the art to which the present invention pertains and are therefore not described in further detail in this patent specification. Processor 18 of HWCD 10 operates in accordance with suitable programming. The software elements effecting this programming conceptually include, among other elements, application software 26, operating system software 28, and data transfer software 30. Application software 26 enables processor 18 to perform tasks commonly referred to as user applications, and may include, for example, a Web browser application, an electronic mail (e-mail) application, a time and schedule organizer, a word processor, and so forth. Note that many such applications commonly support communication with remote computers or servers. Operating system software 28 represents the software elements that enable processor 18 to perform basic tasks such as accessing memory 20 and communicating data with user interface 24 and transceiver 22. Other software of types commonly included in devices of this type can also be included, but such other software is not specifically illustrated for purposes of clarity. Data transfer software 30 enables processor 18 to effect the novel data transfer methods of the present invention and is described in further detail below. Although elements 26, 28 and 30 are conceptually illustrated as software residing in memory 20, persons skilled in the art will understand that, because the resulting programming of processor 18 is nothing more than digital logic, in other embodiments of the invention any or all of elements 26, 28 and 30 can be implemented wholly in software, wholly in hardware, or in any suitable combination of software and hardware logic. Similarly, such persons will understand that these software elements may not reside in main memory in their entireties or simultaneously at any given point in time but rather are depicted that way for purposes of illustration only.
The method for transferring data between a sender and receiver is illustrated in Figs. 3A-C. At least one of the sender and receiver is a HWCD 10, and the other can be another HWCD 10, a remote machine 14, or any similar computing device or system that is accessible via the Wireless Internet. In Figs. 3A-C, the sender's actions are indicated in a left-hand column, and the receivers in a right-hand column.
At step 32 the sender updates a change record. A change record is an area of memory 20 that acts as temporary storage or a queue for information to be transmitted. For example, a client process under the control of application software 26 may attempt to transmit a request for information to a remote machine 14 that is acting as a server. The method may include building the request in steps. As each step adds to the request, processor 18 stores the newly added information in the change record and also stores an indication of the relationship between the added information and any pre-existing information.
At step 34 the sender attempts to initiate a network connection with the receiver in the conventional manner using a suitable protocol. The method proceeds to step 36 when it is determined that the sender and receiver can communicate with one another. As indicated above, the physical connection can include both wireless and wired links in the Wireless Internet.
At step 36 the sender retrieves the information from the change record, groups the information into data packets, and groups the data packets into transactions. Although in the context of the present invention, the term "transaction" refers to a collection of packets, it is related to the term as commonly used in the context of transaction processing. In the context of the present invention, a transaction is a semantically intact or unitary group of data packets. In other words, the selected packets together define the requisite properties of a "transaction," as that term is used in the context of transaction processing. As the term is conventionally used in the art, a transaction refers to a set of procedures involving a system of two or more machines that has the following four properties, commonly referred to collectively by the acronym ACID: atomicity, consistency, isolation, and durability.
Atomicity means that the transaction should either be completed or all data rolled back in all machines to its state prior to initiation of the transaction. Consistency means that a transaction should transform a system from one consistent state to another consistent state.
Isolation means that each transaction should happen independently of transactions occurring at the same time. Durability means that completed transactions should remain permanent, even during system failure. In the present invention, packets are grouped, if possible, in a manner that ensures ACID properties. Accordingly, when the receiver completely receives a transaction, it can immediately rely upon and use all of the received data because the data is semantically intact and not dependent upon any other data. Nevertheless, if the receiver does not completely receive a transaction due to disruption of the transfer or other undesirable condition, the transfer is rolled back, and the transaction must be re-transmitted, as described in further detail below.
At step 38 the sender constructs an actual transfer script and, at step 40, constructs a skeletal transfer script. The actual transfer script has the following format:
Transfer Script Begin Transaction 1 Begin Packet 1 Begin Dataset 1 (information) Packet 1 End
Packet 2 Begin Dataset 2 (information) Packet 2 End
Packet n Begin
Dataset n (information)
Packet n End
Transaction 1 End
Transaction 2 Begin
Transaction 2 End
Transaction m Begin
Transaction m End
Transfer Script End
In the above example, the transfer script includes m transactions, an exemplary one of which includes n data packets. "Transfer Script Begin" is a token intended to indicate to the receiver that a transfer script is about to be sent. "Transfer Script End" is a token intended to indicate to the receiver that the transfer script has been sent. "Transaction x Begin," where x is replaced by a number from one to m, is a token intended to indicate to the receiver that a transaction is about to be sent. "Transaction x End" is a token intended to indicate to the receiver that the transaction has been sent. Similarly, "Packet y Begin," where y is replaced by a number from one to n, is a token intended to indicate to the receiver that a data packet is about to be sent. "Packet y End" is a token intended to indicate to the receiver that a data packet has been sent. "Dataset y" indicates the digital information itself that has been retrieved from the change record and packetized for transmission to the receiver.
The skeletal transfer script mirrors the actual transfer script but does not include the data packets. Rather, it includes only the various Begin and End tokens. The skeletal transfer script is intended to identify for the receiver the items to be sent in the forthcoming transmissions. A skeletal transfer script therefore has the following format:
Transfer Script Begin
Transaction 1 Begin Transaction 1 End
Transaction 2 Begin
Transaction 2 End
Transaction m Begin
Transaction m End Transfer Script End
At step 42 the sender transmits the skeletal transfer script. If the receiver received the entire skeletal transfer script, at step 44 the receiver transmits an acknowledgement back to the sender. At step 46 the sender indicates it is beginning to transmit the actual transfer script by transmitting a Transfer Script Begin token in response to the acknowledgement. If the receiver received this token, at step 48 it transmits an acknowledgement back to the sender.
At step 50 the sender transmits a Transaction x Begin token in response to the acknowledgement. If the receiver received this token, at step 52 it transmits an acknowledgement back to the sender.
At step 54 the sender transmits a Packet y Begin token in response to the acknowledgement. If the receiver received this token, at step 56 it transmits an acknowledgement back to the sender. At step 58 the sender transmits the packet data (Dataset y) in response to the acknowledgement. At step 60 the sender transmits a Packet y End token. If the receiver received this token, at step 62 it transmits an acknowledgement back to the sender. If the transaction (Transaction x) includes more than one packet, steps 54-62 are repeated. Step 64 is reached when the last packet of Transaction x has been transmitted and acknowledged.
At step 64 the sender transmits a Transaction x End token in response to the acknowledgement. If the receiver received this token, at step 66 it transmits an acknowledgement back to the sender. If the sender does not receive such an acknowledgement token within a predetermined timeout interval following transmission of the Transaction x End token, the transaction is rolled back. In other words, the sender re-transmits Transaction x in its entirety.
At step 68 the sender transmits the Transfer Script End token in response to the acknowledgement of the Transaction m End token. If the receiver received this token, at step 70 it transmits an acknowledgement back to the sender. Step 72 is intended to indicate that steps 34-72 are repeated if the change record had again been updated since the time the changed data was transmitted. Note that even if the connection between the sender and receiver is dropped, processor 18, under control of application software 26 or other element of the sender, can continue to update the change record while no connection exists because any data that is changed during that time will be transmitted as soon as a connection is re-established. The intermittence of connections is therefore, in effect, transparent to the sender. In other words, application software 26 or other elements of the sender, can operate essentially independently of the network connection and need not be concerned with the reliability of the connection. Instead, data transfer software 30 is responsible for all aspects of data transfer, including taking into account potential intermittence of the connection.
Figures 4 and 6 illustrate exemplary structures for data transfer software 30, with Fig. 4 illustrating the portion of software 30 that controls wireless data transmission and Fig. 6 illustrating the portion that controls wireless data reception. Although in the illustrated embodiment of the invention, HWCD 10 can act as both a sender and a receiver, note that in other embodiments a sender device may not be capable of reception, and a receiving device may not be capable of transmission.
As illustrated in Fig. 4, an application logic module 74 defines the highest level of the sender software structure portion. The following illustrates some exemplary pseudocode for module 74 relating to the functions of creating a new change record, deleting a change record, and updating a change record:
ApplicationLogicModule.NewRecord(Record. ChangeRecordModule.Append(Record, NEW)
ApplicationLogicModule.DeleteRecord(Record)
ChangeRecordModule.Append(Record, DELETE)
ApplicationLogicModule.UpdateRecord(Record)
ChangeRecordModule.Append(Record, UPDATE)
A change record module 76 defines the next level of the software structure. The following illustrates some exemplary pseudo-code for module 76:
ChangeRecordModule.Append(Record. Status // Status = (NEW, DELETE, UPDATE)
IF (TransactionList.RecordFound(Record) is FALSE) Packet = createPacket.Record,I)
1 = 1 + 1
Transaction = createTransaction() TransactionList.Add(Transaction) Transaction.AddPacket(Packet) ELSE
IF (Record.HasLinkedRecords() is TRUE)
RecordList = Record.GetLinkedRecords() FOR EACH of RecordList
LinkedPacket = createPacket(LinkedRecord,I) 1 = 1 + 1
Transaction.AddPacket(LinkedPacket) END FOR END IF END IF
ChangeRecordModule.ClearChangeRecordQ
TransactionList. ClearListQ The next level of the sender software structure is defined by a data transfer module
78, which includes an actual transfer script module 80 and a skeletal transfer script module
82. The following illustrates some exemplary pseudo-code for modules 78, 80 and 82:
TransferScriptModule.CreateTransferScriptO
TransferScript.Insert("Transfer Script Begin")
1 = 0
FOR EACH ChangeRecord.TransactionListElement
Transaction = ChangeRecord.TransactionList.GetTransaction(I) TransferScript.Insert("Transaction", I, "Begin")
J = 0 FOR EACH Transaction.GetPacket(j)
TransferScript.InsertC'Packet", j, "Begin") TransferScript.Insert(Packet.GetDataO) TransferScript.Insert("Packet", j, "End")
END FOR
TransferScript.Insert("Transaction", I, "End") END FOR TransferScript.Insert("Transfer Script End")
SkeletalTransferScriptModule.CreateTransferScriptQ
SkeletalTransferScript.Insert("Skeletal Transfer Script Begin") 1 = 0 FOR EACH ChangeRecord.TransactionListElement
Transaction = ChangeRecord.TransactionList.GetTransaction(I) SkeletalTransferScript.Insert("Transaction", I, "Begin") SkeletalTransferScript.Insert("Transaction", I, "End") END FOR SkeletalTransferScript.Insert("Skeletal Transfer Script End")
The method performed by the sender in accordance with data transfer module 78 and its sub-modules 80 and 82 is illustrated in further detail in Fig. 5. At step 84 the sender creates the actual transfer script and, at step 86, the skeletal transfer script. At step 88 it attempts to establish a Wireless Internet connection with an intended receiver. Step 90 indicates that if the connection is not successfully made, step 88 is repeated. If the connection is successfully made, at step 92 it is determined whether a transfer is already in progress. If not, then at step 94 a transfer is begun by sending the skeletal transfer script. Step 96 indicates that if an acknowledgement token is received from the receiver, acknowledging receipt of the skeletal transfer script, a transfer is deemed to be in progress at step 98, an indication to that effect is saved or marked, and step 100 occurs next. If no acknowledgement token is received, then step 94 is repeated. At step 100 it is determined whether more items are to be transferred. Items can include both tokens and data packets. If there are more items to be transferred, the next item is sent at step 102. Step 104 indicates that if an acknowledgement is received from the receiver, acknowledging receipt of the item, step 100 is repeated. If no acknowledgement is received within a predetermined time interval, the connection is deemed to have been dropped, and at step 106 the sender deletes from the actual transfer script all items receipt of which has already been acknowledged. Then, at step 108 the connection is terminated and step 88 is repeated by attempting to renew the connection.
Similarly, if it is determined at step 100 that there are no more items to be transferred, the transfer is deemed to be not in progress, and the indication is changed to reflect that state at step 110. Then, at step 112 the connection is terminated.
As illustrated in Fig. 6, a data transfer module 114 defines the highest level of the receiver software structure portion. Data transfer module 114 includes the following sub- modules: an application logic module 116, a user interface module 118, a rollback module 120, a transfer record module 122, a temporary storage module 124, and a data storage module 126. The following illustrates some exemplary pseudo-code relating to the above- listed modules:
TransferRecordModule.ClearQ TransferRecordModule.Insert(String) TransferRecordModule.ClearToLastGoodQ TransferRecordModule.CompareTo(SkeletalTransferScript)
TempStoreModule.ClearQ
TempStoreModule.AddRecord(Record)
TempStoreModule.GetNextRecordQ
DataStoreModule.CommitQ
FOR EACH Record in TempStore Record = TempStore.GetNextRecord() StoreRecord(Record) END FOR
ApplicationLogicModule.UponRefreshQ RefreshData() UIModule.UpdateQ
UserlnterfaceModule.UpdateO
RollbackModule.Rollbackn
TempStoreModule.Clear()
The method performed by the receiver in accordance with data transfer module 114 and its sub-modules is illustrated in further detail in Fig. 6. At step 128, in response to detection of a connection imtiated by the sender, the receiver clears the transfer record and saves an indication that a transfer is in progress. The transfer record is an area of memory in which the receiver records by means of the Begin and End tokens indications of all items it receives. The following is an example of a transfer record: Transfer Script Begun
Transaction 1 Begun Packet 1 Received Packet 2 Received
Packet n Received
Transaction 1 Received Transaction 2 Begun
Transaction 2 Received
Transaction m Begun
Transaction m Received Transfer Script Ended
At step 130 the receiver saves in memory the skeletal transfer script it receives and then transmits an acknowledgement token to the sender. At step 132 the receiver reads the next item it receives from the sender. If at step 134 it is determined that the item is a Transfer Script Begin token, at step 136 the receiver transmits an acknowledgement token and records the event in the transfer record before returning to step 132. If at step 138 it is determined that the item is a Transaction Begin token, at step 140 the receiver transmits an acknowledgement token and records the event in the transfer record before returning to step 132. If at step 142 it is determined that the item is a Packet Begin token, at step 144 the receiver transmits an acknowledgement token and records the event in the transfer record before proceeding to step 146.
At step 146 the receiver reads the received packet data, writes it to the temporary storage at step 148, and if it is determined at step 150 that the packet has more data, returns to step 146. Otherwise, it returns to step 132 to read the next received item.
If at step 152 it is determined that the item is a Packet End token, at step 154 the receiver transmits an acknowledgement token and records the event in the transfer record before returning to step 132. If at step 156 it is determined that the item is a Transaction End token, at step 158 the receiver transmits an acknowledgement token and records the event in the transfer record before proceeding to step 160. If the item is not a Transaction End token, the method proceeds to step 162.
At step 160 the temporary storage data are copied to a main data storage area. Data in the main data storage area are deemed reliable in the sense that they represent one or more transactions and are thus immediately usable by the receiver. The data may, for example, represent a request for the receiver, acting as a server, to retrieve information from a database (not shown) and transmit it to the client (sender of the request). At step 164 application logic module 116 is notified, and the method returns to step 132.
If at step 162 it is determined that the item is a Transfer Script End token, at step 166 the receiver transmits an acknowledgement token and records the event in the transfer record before proceeding to step 168. If the item is not a Transfer Script End token, the transaction is rolled back at step 170. In other words, the receiver does not use the data that has been copied to the main data storage area and resets the area to its state prior to the beginning of the current transaction. At step 168 the receiver compares the transfer record to the skeletal transfer script.
If they match, step 172 indicates successful transfer in accordance with the script, and the method can begin again. If they do not match, the receiver rolls back the current transaction as described above with regard to step 170. It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the scope or spirit of the invention. Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

Claims

WHAT IS CLAIMED IS:
1. A method for transmitting information from a handheld wireless sender to a remote receiver, comprising: entering said information into a change record in said sender; detecting in said sender an indication of a wireless connection between said sender and said receiver; grouping into packets information in said change record; grouping said packets in said sender into semantically unitary transactions having begin and end tokens delimiting each transaction; constructing an actual transfer script in said sender having at least one transaction and having begin and end tokens delimiting said transfer script; constructing a skeletal transfer script mirroring said actual transfer script but not having said packets, said skeletal transfer script having begin and end tokens delimiting said skeletal transfer script; wirelessly beginning transmitting said skeletal transfer script from said sender to said receiver; in response to receipt in said sender of an acknowledgement of receipt of said skeletal transfer script by said receiver, wirelessly beginning transmitting said actual transfer script from said sender to said receiver; in response to receipt of an acknowledgement of receipt of a transaction of said transfer script from said receiver, continuing transmitting said transfer script from said sender to said receiver by beginning transmitting a next transaction in said transfer script; and following detection of an indication of a renewed wireless connection between said sender and said receiver, rolling back or re-transmitting a transaction in its entirety from said sender to said receiver if an acknowledgement of receipt of said transaction is not received by said sender within a predetermined time interval after transmitting an end token indicating an end of said transaction.
2. The method claimed in claim 1, wherein: in response to receipt of an acknowledgement of receipt of a packet of a transaction from said receiver, continuing transmitting a transaction from said sender to said receiver by beginning transmitting a next packet in said transaction; and following detection of an indication of a renewed wireless connection between said sender and said receiver, said sender re-transmits a packet in its entirety if said sender does not receive an acknowledgement of receipt of said packet within a predetermined time interval after transmitting an end token indicating an end of said packet.
3. The method claimed in claim 1, wherein, in response to receipt of an acknowledgement of receipt of said transfer script from said receiver, said sender deletes said transactions from said actual transfer script and said change record.
4. A method for receiving information in a handheld wireless receiver device from a transmitter device, comprising: detecting an indication of a wireless connection between said sender and said receiver; wirelessly receiving a skeletal transfer script having begin and end tokens delimiting each transaction of an actual transfer script having at least one transaction; wirelessly transmitting to said sender an acknowledgement of receipt of said skeletal transfer script; wirelessly receiving said actual transfer script, said actual transfer script having begin and end tokens delimiting each transaction in said actual transfer script; building a transfer record having indications of receipt of each data packet of a transaction having at least one data packet and indications of receipt of each begin token and end token; in response to receipt of an end token following a received data packet, committing said received data packet to a local memory area; in response to receipt of a token indicating an end of an actual transfer script, comparing said transfer record to said skeletal transfer script; and wirelessly transmitting a token indicating receipt of said actual transfer script if said transfer record matches said skeletal transfer script.
5. A system for transmitting information in a handheld wireless sender device to a receiver device, comprising: a change record controller having means for defining a change record memory area in which said information is storable prior to transmission from said sender device; a data transfer controller grouping information in said change record memory area into packets, grouping said packets into semantically unitary transactions having begin and end tokens indicating a beginning and end of a transaction, constructing an actual transfer script having at least one transaction and having begin and end tokens indicating a beginning and end of said transfer script; a skeletal transfer script controller wirelessly transmitting a skeletal transfer script mirroring said actual transfer script but not having said packets, said skeletal transfer script having begin and end tokens indicating a beginning and end of said skeletal transfer script; and an actual transfer script controller wirelessly beginning transmitting said actual transfer script in response to receipt of an acknowledgement of receipt of said skeletal transfer script by said receiver, said actual transfer script controller continuing transmitting said transfer script by beginning transmitting a next transaction in said transfer script in response to receipt of an acknowledgement of receipt of a transaction of said transfer script from said receiver, said actual transfer script controller rolling back or re-transmitting a transaction in its entirety following detection of an indication of a renewed wireless connection between said sender and said receiver if an acknowledgement of receipt of said transaction is not received within a predetermined time interval after transmitting an end token indicating an end of said transaction.
6. The system claimed in claim 5, wherein: in response to receipt of an acknowledgement of receipt of a packet of a transaction from said receiver, said actual transfer script controller continues transmitting a transaction by beginning transmitting a next packet in said transaction; and following detection of an indication of a renewed wireless connection between said sender and said receiver, said actual transfer script controller re-transmits a packet in its entirety if said sender does not receive an acknowledgement of receipt of said packet within a predetermined time interval after transmitting an end token indicating an end of said packet.
7. The system claimed in claim 5, wherein, in response to receipt of an acknowledgement of receipt of said transfer script from said receiver, said actual transfer script controller deletes said transactions from said actual transfer script and said change record.
PCT/US2000/021906 1999-08-10 2000-08-10 Transfer time optimization between handheld wireless devices WO2001011473A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU66307/00A AU6630700A (en) 1999-08-10 2000-08-10 Transfer time optimization between handheld wireless devices

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14816199P 1999-08-10 1999-08-10
US60/148,161 1999-08-10

Publications (1)

Publication Number Publication Date
WO2001011473A1 true WO2001011473A1 (en) 2001-02-15

Family

ID=22524566

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/021906 WO2001011473A1 (en) 1999-08-10 2000-08-10 Transfer time optimization between handheld wireless devices

Country Status (2)

Country Link
AU (1) AU6630700A (en)
WO (1) WO2001011473A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1282265A2 (en) * 2001-07-26 2003-02-05 Allied Telesis Kabushiki Kaisha Media converter and transmission system using the same
EP1574016A2 (en) * 2002-01-09 2005-09-14 I.D. Systems, Inc. Robust wireless communications system architecture and asset management application performed thereon
US7876197B2 (en) 1999-05-19 2011-01-25 I.D. Systems, Inc. Mobile asset data management system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6014429A (en) * 1996-08-12 2000-01-11 Lucent Technologies, Inc. Two-way wireless messaging system with transaction server

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6014429A (en) * 1996-08-12 2000-01-11 Lucent Technologies, Inc. Two-way wireless messaging system with transaction server

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7876197B2 (en) 1999-05-19 2011-01-25 I.D. Systems, Inc. Mobile asset data management system
US7898388B2 (en) 1999-05-19 2011-03-01 I.D. Systems, Inc. Mobile asset data management system
US7911320B2 (en) 1999-05-19 2011-03-22 I.D. Systems, Inc. Mobile asset data management system
US8676670B2 (en) 1999-05-19 2014-03-18 I.D. Systems, Inc. Mobile asset data management system
US8725596B2 (en) 1999-05-19 2014-05-13 I.D. Systems, Inc. Mobile asset data management system
EP1282265A2 (en) * 2001-07-26 2003-02-05 Allied Telesis Kabushiki Kaisha Media converter and transmission system using the same
EP1282265A3 (en) * 2001-07-26 2003-06-18 Allied Telesis Kabushiki Kaisha Media converter and transmission system using the same
EP1574016A2 (en) * 2002-01-09 2005-09-14 I.D. Systems, Inc. Robust wireless communications system architecture and asset management application performed thereon
EP1574016A4 (en) * 2002-01-09 2010-04-28 I D Systems Inc Robust wireless communications system architecture and asset management application performed thereon

Also Published As

Publication number Publication date
AU6630700A (en) 2001-03-05

Similar Documents

Publication Publication Date Title
US6859462B1 (en) Minimization and optimization of overall data transfer connect time between handheld wireless communicating devices and remote machines
US6996583B2 (en) Real-time database update transaction with disconnected relational database clients
US7555303B2 (en) Synchronization of database data
US20170300549A1 (en) Synchronization methods and systems
US7778971B2 (en) Synchronization methods and systems
US8375112B2 (en) Synchronization methods and systems
US5274762A (en) Method for high speed data transfer
US6775298B1 (en) Data transfer mechanism for handheld devices over a wireless communication link
EP1271321A1 (en) System and method for recovering from a failed synchronization session
US8751444B2 (en) Synchronization of database changes among multiple devices
US20050278392A1 (en) System and method for synchronizing multiple database files
US20080168291A1 (en) Synchronization methods and systems
US20040139235A1 (en) Local intelligence, cache-ing and synchronization process
US20070179992A1 (en) Maintaining coherency in a symbiotic computing system and method of operation thereof
US20080163743A1 (en) Synchronization methods and systems
KR20080033407A (en) System and method for provisioning a user device
US7024428B1 (en) Reliable data synchronization over unreliable networks
CN101005505B (en) Systems and methods for communication with database client users
JP2001216187A (en) Method and device for making data coincident among devices
US7191356B2 (en) Method for asynchronous support of fault-tolerant and adaptive communication
US7178051B2 (en) Method for synchronous support of fault-tolerant and adaptive communication
US6941374B1 (en) Hidden agent transfer protocol
US6553406B1 (en) Process thread system receiving request packet from server thread, initiating process thread in response to request packet, synchronizing thread process between clients-servers.
US20050021778A1 (en) Delayed uploading of user registration data
WO2001011473A1 (en) Transfer time optimization between handheld wireless devices

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

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 UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

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 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)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP