Method and system for functional redundancy based quality of service

• US 20070294393A1
• Filed: 05/18/2006
• Published: 12/20/2007
• Est. Priority Date: 05/18/2006
• Status: Active Grant

• Current Assignee: Harris Corporation (L3Harris Technologies, Inc.)
• Original Assignee: Harris Corporation (L3Harris Technologies, Inc.)
• Inventors: Galluscio, Anthony P., Smith, Donald L., Knazik, Robert J.
• Granted Patent: US 7,894,509 B2
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/19 at layers above the network layer network arrangements for networked applications for scheduling or organising the servicing of application requests H04L67/60
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames

Abstract

Certain embodiments of the present invention provide for a system and method for preserving bandwidth in data networks. The method includes determining whether to perform functional redundancy processing for a current data set. Determining whether to perform functional redundancy processing for a current data set may be conducted according to redundancy rules. In performing functional redundancy processing, the method includes searching at least one queue for a data set that is functionally redundant to the current data set. The searching may be conducted according to redundancy rules. If a queued data set is found to be functionally redundant to the current data set, the queued data set may be dropped from the queue and the current data set added to the queue. In such a manner, functionally redundant messages are dropped prior to transmission and bandwidth is optimized.

Claims

1. A method for data communication, the method comprising:

receiving a first data set;

storing said first data set in a queue;

receiving a second data set;

determining whether to perform functional redundancy processing for said second data set based on redundancy rules, said redundancy rules being controlled by a selected mode;

searching said queue for said first data set and determining whether said first data set is functionally redundant to said second data set based on said redundancy rules; and

,

if said first data set is functionally redundant to said second data set, dropping said first data set from said queue and adding said second data set to said queue.

2. The method of claim 1, wherein said selected mode is selected by a user.

3. The method of claim 1, wherein said selected mode is selected dynamically based on network conditions.

4. The method of claim 1, wherein said redundancy rules determine whether to perform functional redundancy processing based on information contained in the header of data in the second data set.

5. The method of claim 1, wherein said redundancy rules determine whether to perform functional redundancy processing based on the source node of the second data set.

6. The method of claim 1, wherein said redundancy rules determine that the first data set is functionally redundant to said second data set if said second data set and said first data set originate from the same source node.

7. The method of claim 1, wherein said redundancy rules determine that the first data set is functionally redundant to said second data set if the time between the time stamp of said second data set and the time stamp of said first data set is below a predetermined time period.

8. The method of claim 1, wherein said step of adding said second data set to said queue includes adding said second data set to said queue in a first-in-first-out protocol.

9. The method of claim 1, wherein said step of adding said second data set to said queue includes replacing said first data set with said second data set such that the order of transmission of the queue is unchanged.

10. The method of claim 1, wherein said second data set is received later in time than said first data set.

11. A computer-readable medium having a set of instructions for execution on a processing device, said set of instructions comprising:

a receiving routine for receiving a first data set and a second data set;

a storing routine for storing said first data set in a queue;

a determining routine for determining whether to perform functional redundancy processing for said second data set based on redundancy rules, said redundancy rules being controlled by a selected mode; and

,

a searching routine for searching said queue for said first data set and determining whether said first data set is functionally redundant to said second data set based on said redundancy rules, wherein if said first data set is functionally redundant to said second data set, dropping said first data set from said queue and adding said second data set to said queue.

12. The set of instructions of claim 11, wherein said selected mode being selected by a selected mode routine, said selected mode routine being controlled by a user.

13. The set of instructions of claim 11, wherein said selected mode being selected by a selected mode routine, said selected mode routine being dynamically selected based on network conditions.

14. The set of instructions of claim 11, wherein said redundancy rules include a first redundancy routine to determine that the first data set is functionally redundant to said second data set if said second data set and said first data set originate from the same source node.

15. The set of instructions of claim 11, wherein said redundancy rules include a second redundancy routine to determine that the first data set is functionally redundant to said second data set if the time between the time stamp of said second data set and the time stamp of said first data set is below a predetermined time period.

16. The set of instructions of claim 11, wherein said step of adding said second data set to said queue includes replacing said first data set with said second data set such that the order of transmission of the queue is unchanged.

17. A method for data communication, the method comprising:

receiving a first data set;

receiving a second data set;

reviewing a selected mode to determine whether to perform functional redundancy processing on said second data set, said selected mode having a set of redundancy rules for determining whether to perform functional redundancy processing;

performing functional redundancy processing by determining whether said second data set is functionally redundant to said first data set, said second data set being functionally redundant to said first data set according to said set of redundancy rules; and

,

if said first data set is functionally redundant to said second data set, dropping said first data set from a queue and adding said second data set to said queue.

18. The method of claim 17, wherein said redundancy rules determine whether to perform functional redundancy processing based on the source node of the second data set.

19. The method of claim 17, wherein said redundancy rules determine that the first data set is functionally redundant to said second data set if said second data set and said first data set originate from the same source node.

20. The method of claim 17, wherein said redundancy rules determine that the first data set is functionally redundant to said second data set if the time between the time stamp of said second data set and the time stamp of said first data set is below a predetermined time period.