# US 2001/0027494 A1 · Method and apparatus for bundling messages at the expiration of a time-limit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2001/0027494 A1
- Document ID: US20010027494A1
- Status: Published application
- Kind: A1
- Application number: 09/872,654
- Filed: 2001-06-01
- Published: 2001-10-04
- Earliest claimed: 1998-09-22
- Assignees: Microsoft Corporation
- Inventors: Vinay Deo; Don Kadyk; Michael J. O'Leary
- Web page: https://patentgrep.com/patent/US20010027494A1

## CPC

- H04L 69/04: Protocols for data compression, e.g. ROHC
- H04L 67/02: based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L 67/55: Push-based network services
- H04L 69/329: in the application layer [OSI layer 7]
- H04L 2212/00: Encapsulation of packets
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A computer readable medium in a computer system has instructions for storing a first and second data packet destined for the same address. The first and second data packets are appended together to produce a merged data packet that is then compressed to produce a compressed data packet. The compressed data packet is then sent to the common address.

## Claims

### Claim 1

In a computer system, a computer readable medium having computer executable instructions for performing steps comprising:
storing a first data packet destined for a first destination;
storing a second data packet destined for the first destination;
appending the second data packet to the first data packet to produce a merged data packet;
compressing the merged data packet to produce a compressed packet; and
sending the compressed packet to the first destination.

### Claim 2 (depends on 1)

The computer systems of claim 1 having further computer executable instructions for performing a further step of pre-pending a header to the merged data packet before compressing the header and merged data packet to form the compressed packet.

### Claim 3 (depends on 2)

The computer system of claim 2 wherein the header comprises a destination identifier that identifies at least part of the first destination's address.

### Claim 4 (depends on 3)

The computer system of claim 3 wherein the header comprises the length of each individual data packet in the merged data packet.

### Claim 5 (depends on 4)

The computer system of claim 4 wherein the header further comprises a title for each data packet in the merged data packet.

### Claim 6 (depends on 5)

The computer system of claim 5 wherein the titles and lengths of the data packets are arranged in the same order as the data packets are arranged in the merged data packet.

### Claim 7 (depends on 6)

The computer system of claim 6 wherein the header further comprises an offset value located between the destination identifier and a length of a data packet in the header, the offset describing the location of the first data packet in the merged data packet relative to the destination identifier.

### Claim 8 (depends on 2)

The computer system of claim 2 wherein the computer readable medium has further computer executable instructions for performing a further step of pre-pending a routing tag to the compressed packet before sending the compressed packet to the first destination, the routing tag being capable of indicating that the compressed packet comprises a merged data packet.

### Claim 9 (depends on 8)

The computer system of claim 8 having further computer readable media having computer readable instructions for performing steps of:
receiving the compressed packet at a receiver associated with the first destination;
based on the routing list, routing the compressed packet to a decompression module to produce a decompressed packet; and
based on the routing list, routing the decompressed packet to an exploder to produce individual data packets.

### Claim 10 (depends on 1)

The computer system of claim 1 wherein the computer readable medium comprises further computer executable instructions for performing a further step of storing a plurality of additional data packets before appending the second data packet to the first data packet.

### Claim 11 (depends on 10)

The computer system of claim 10 wherein the computer readable medium comprises further computer executable instructions for appending the plurality of data packets to the merged data packet before compressing the merged data packet.

### Claim 12 (depends on 1)

The computer system of claim 1 wherein the second data packet is appended to the first data packet only if the first data packet is of a length that does not provide a reduction in size if the first data packet is compressed by itself.

### Claim 13

A mobile device having a computer-readable medium having computer-executable instructions for performing steps comprising:
receiving an input data packet from a remote source;
decompressing the input data packet based on compression information in the input data packet to produce a decompressed packet;
identifying a plurality of individual data packets in the decompressed packet; and
storing each of the individual data packets based on destination addresses for the individual data packets.

### Claim 14 (depends on 13)

The mobile device of claim 13 wherein each of the individual data packets has the same destination address.

### Claim 15 (depends on 14)

The mobile device of claim 14 wherein the input data packet comprises a destination identifier that identifies the destination address of the individual data packets.

### Claim 16 (depends on 15)

The mobile device of claim 15 wherein the computer readable medium has further computer executable instructions for performing a step of determining whether to discard the input data packet based on the destination identifier before decompressing the input data packet.

### Claim 17 (depends on 16)

The mobile device of claim 16 wherein the mobile device determines whether to discard the input data packet while in a partial wake-up mode.

### Claim 18

A computer readable medium having computer executable instructions for performing steps comprising:
storing a first data packet having a destination;
setting a time period by which the first data packet will be sent to the destination;
determining if other data packets are to be sent to the destination before the time period expires;
appending the other data packets that are to be sent to the destination to the first data packet to produce a combined packet;
compressing the combined packet to produce a compressed packet; and
sending the compressed packet to the destination.

### Claim 19 (depends on 18)

The computer readable medium of claim 18 wherein the other data packets, if present, are appended to the first data packet when the time period expires.

### Claim 20 (depends on 19)

The computer readable medium of claim 19 wherein the other data packets, if present, are appended to the first data packet before the time period expires if the combined size of the other data packets and the first data packet is larger than a threshold size.
