Apparatus and methods for optimizing traffic volume in wireless email communications

• US 20010042099A1
• Filed: 02/01/2001
• Published: 11/15/2001
• Est. Priority Date: 02/02/2000
• Status: Abandoned Application

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Doongo Technologies, Inc. (Qualcomm, Inc.)
• Inventors: Peng, Luosheng
• Application Number:
  US09/776,165
• Publication Number:
  US 20010042099A1
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06F 12/121 using replacement algorithms
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 51/06 Message adaptation to terminal or network requirements
• CPC Class Codes: H04L 51/58 Message adaptation for wireless communication
• CPC Class Codes: H04L 67/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/288 Distributed intermediate devices, i.e. intermediate devices for interaction with other intermediate devices on the same level
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal
• CPC Class Codes: H04L 67/561 Adding application-functional data or data for application control, e.g. adding metadata
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 : Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 : Pattern matching access
• CPC Class Codes: Y10S 707/99945 : Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 : Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

An exemplary method for optimizing traffic volume in a communications network comprises the steps of receiving a first file, parsing a header portion of the file to find a reference header, extracting an identifier of a second file in the reference header, determining a nearest location to retrieve the second file based on the identifier, and retrieving the second file based on the determining. In one embodiment, the extracting step includes the step of determining a tag associated with the reference header; the tag including the identifier and an address to download the second file.

Claims

1. A method for optimizing traffic volume in a communications network, comprising the steps of:

receiving a first file;

parsing a header portion of said file to find a reference header;

extracting an identifier of a second file in said reference header;

determining a nearest location to retrieve said second file based on said identifier; and

retrieving said second file based on said determining.

2. The method of

claim 1

, wherein said extracting step includes the step of:

determining a tag associated with said reference header;

said tag including said identifier and an address to download said second file.

3. The method of

claim 1

, wherein said determining a nearest location includes the steps of:

examining a local cache for a copy of said second file;

examining said reference header for a server address to download said second file if said local cache does not include said second file; and

extracting an address of a sender of said first file if said reference header does not include said server address.

4. A method for optimizing traffic volume in a communication network, comprising the steps of:

receiving a first file having a first identifier;

generating a tag for said first file based on said first identifier;

embedding said tag in a second file;

creating an association to said tag in a reference header of said second file;

assigning a second identifier to said second file; and

sending said second file.

5. The method of

claim 4

, further comprising the steps of:

determining a nearest address to download said first file; and

including said nearest address in said tag.

6. A method for optimizing traffic volume in a communication network, comprising the steps of:

receiving a first file;

parsing a header portion of said first file for a reference header;

extracting an identifier to a second file based on said reference header;

examining a local cache for a copy of said second file; and

updating said reference header to include an address to said local cache if said copy of said second file is in said local cache.

7. The method of

claim 6

, wherein said extracting step includes the step of:

determining a tag associated with said reference header;

said tag including said identifier.

8. A computer program product for optimizing traffic volume in a communications network, comprising:

logic code for receiving a first file;

logic code for parsing a header portion of said file to find a reference header;

logic code for extracting an identifier of a second file in said reference header;

logic code for determining a nearest location to retrieve said second file based on said identifier; and

logic code for retrieving said second file based on said determining.

9. The computer program product of

claim 8

, wherein said logic code for extracting includes:

logic code for determining a tag associated with said reference header;

said tag including said identifier and an address to download said second file.

10. The computer program product of

claim 8

, wherein said logic code for determining a nearest location includes:

logic code for examining a local cache for a copy of said second file;

logic code for examining said reference header for a server address to download said second file if said local cache does not include said second file; and

logic code for extracting an address of a sender of said first file if said reference header does not include said server address.

11. A computer program product for optimizing traffic volume in a communication network, comprising:

logic code for receiving a first file having a first identifier;

logic code for generating a tag for said first file based on said first identifier;

logic code for embedding said tag in a second file;

logic code for creating an association to said tag in a reference header of said second file;

logic code for assigning a second identifier to said second file; and

logic code for sending said second file.

12. The computer program product of

claim 11

, further comprising:

logic code for determining a nearest address to download said first file; and

logic code for including said nearest address in said tag.

13. A computer program product for optimizing traffic volume in a communication network, comprising:

logic code for receiving a first file;

logic code for parsing a header portion of said first file for a reference header;

logic code for extracting an identifier to a second file based on said reference header;

logic code for examining a local cache for a copy of said second file; and

logic code for updating said reference header to include an address to said local cache if said copy of said second file is in said local cache.

14. The computer program product of

claim 13

, wherein said logic code for extracting includes:

logic code for determining a tag associated with said reference header;

said tag including said identifier.