US 7,769,028 B2Grant
Systems and methods for adaptive throughput management for event-driven message-based data
Issue Date:2010-08-03
•17 Claims
•9 Drawing Sheets
Abstract
Certain embodiments of the present invention provide a method for communicating data including prioritizing data by assigning a priority to the data, analyzing a network to determine a status of the network, and communicating the data based at least in part on the priority of the data and the status of the network. Certain embodiments of the present invention provide a system for communicating data including a data prioritization component, a network analysis component, and a data communications component. The data prioritization component is adapted to prioritize data by assigning a priority to the data. The network analysis component is adapted to analyze a network to determine a status of the network. The data communications component is adapted to communicate the data based at least in part on the priority of the data and the status of the network.
Metadata
Assignee
- Harris Corporation
Inventors
- David A. Boley
- Anthony P. Galluscio
- John C. Wise
- John M. Roche
Application Information
Application Number:US 11/471,923
Filing Date:2006-06-21
Priority Date:2006-06-21
Art Unit:2473
Classifications
IPC:
H04L12/56
Patent Drawings (9 sheets)
Description
Background of the Invention
[0001] The present invention generally relates to communications networks. More particularly, the present invention relates to systems and methods for adaptive throughput data management.
[0002] Communications networks are utilized in a variety of environments. Communications networks typically include two or more nodes connected by one or more links. Generally, a communications network is used to support communication between two or more participant nodes over the links and intermediate nodes in the communications network. There may be many kinds of nodes in the network. For example, a network may include nodes such as clients, servers, workstations, switches, and/or routers. Links may be, for example, modem connections over phone lines, wires, Ethernet links, Asynchronous Transfer Mode (ATM) circuits, satellite links, and/or fiber optic cables.
[0003] A communications network may actually be composed of one or more smaller communications networks. For example, the Internet is often described as network of interconnected computer networks. Each network may utilize a different architecture and/or topology. For example, one network may be a switched Ethernet network with a star topology and another network may be a Fiber-Distributed Data Interface (FDDI) ring.
[0004] Communications networks may carry a wide variety of data. For example, a network may carry bulk file transfers alongside data for interactive real-time conversations. The data sent on a network is often sent in packets, cells, or frames. Alternatively, data may be sent as a stream. In some instances, a stream or flow of data may actually be a sequence of packets. Networks such as the Internet provide general purpose data paths between a range of nodes and carrying a vast array of data with different requirements.
[0005] Communication over a network typically involves multiple levels of communication protocols. A protocol stack, also referred to as a networking stack or protocol suite, refers to a collection of protocols used for communication. Each protocol may be focused on a particular type of capability or form of communication. For example, one protocol may be concerned with the electrical signals needed to communicate with devices connected by a copper wire. Other protocols may address ordering and reliable transmission between two nodes separated by many intermediate nodes, for example.
[0006] Protocols in a protocol stack typically exist in a hierarchy. Often, protocols are classified into layers. One reference model for protocol layers is the Open Systems Interconnection (OSI) model. The OSI reference model includes seven layers: a physical layer, data link layer, network layer, transport layer, session layer, presentation layer, and application layer. The physical layer is the “lowest” layer, while the application layer is the “highest” layer. Two well-known transport layer protocols are the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). A well known network layer protocol is the Internet Protocol (IP).
[0007] At the transmitting node, data to be transmitted is passed down the layers of the protocol stack, from highest to lowest. Conversely, at the receiving node, the data is passed up the layers, from lowest to highest. At each layer, the data may be manipulated by the protocol handling communication at that layer. For example, a transport layer protocol may add a header to the data that allows for ordering of packets upon arrival at a destination node. Depending on the application, some layers may not be used, or even present, and data may just be passed through.
[0008] One kind of communications network is a tactical data network. A tactical data network may also be referred to as a tactical communications network. A tactical data network may be utilized by units within an organization such as a military (e.g., army, navy, and/or air force). Nodes within a tactical data network may include, for example, individual soldiers, aircraft, command units, satellites, and/or radios. A tactical data network may be used for communicating data such as voice, position telemetry, sensor data, and/or real-time video.
[0009] An example of how a tactical data network may be employed is as follows. A logistics convoy may be in-route to provide supplies for a combat unit in the field. Both the convoy and the combat unit may be providing position telemetry to a command post over satellite radio links. An unmanned aerial vehicle (UAV) may be patrolling along the road the convoy is taking and transmitting real-time video data to the command post over a satellite radio link also. At the command post, an analyst may be examining the video data while a controller is tasking the UAV to provide video for a specific section of road. The analyst may then spot an improvised explosive device (IED) that the convoy is approaching and send out an order over a direct radio link to the convoy for it to halt and alerting the convoy to the presence of the IED.
[0010] The various networks that may exist within a tactical data network may have many different architectures and characteristics. For example, a network in a command unit may include a gigabit Ethernet local area network (LAN) along with radio links to satellites and field units that operate with much lower throughput and higher latency. Field units may communicate both via satellite and via direct path radio frequency (RF). Data may be sent point-to-point, multicast, or broadcast, depending on the nature of the data and/or the specific physical characteristics of the network. A network may include radios, for example, set up to relay data. In addition, a network may include a high frequency (HF) network which allows long rang communication. A microwave network may also be used, for example. Due to the diversity of the types of links and nodes, among other reasons, tactical networks often have overly complex network addressing schemes and routing tables. In addition, some networks, such as radio-based networks, may operate using bursts. That is, rather than continuously transmitting data, they send periodic bursts of data. This is useful because the radios are broadcasting on a particular channel that must be shared by all participants, and only one radio may transmit at a time.
[0011] Tactical data networks are generally bandwidth-constrained. That is, there is typically more data to be communicated than bandwidth available at any given point in time. These constraints may be due to either the demand for bandwidth exceeding the supply, and/or the available communications technology not supplying enough bandwidth to meet the user's needs, for example. For example, between some nodes, bandwidth may be on the order of kilobits/sec. In bandwidth-constrained tactical data networks, less important data can clog the network, preventing more important data from getting through in a timely fashion, or even arriving at a receiving node at all. In addition, portions of the networks may include internal buffering to compensate for unreliable links. This may cause additional delays. Further, when the buffers get full, data may be dropped.
[0012] In many instances the bandwidth available to a network cannot be increased. For example, the bandwidth available over a satellite communications link may be fixed and cannot effectively be increased without deploying another satellite. In these situations, bandwidth must be managed rather than simply expanded to handle demand. In large systems, network bandwidth is a critical resource. It is desirable for applications to utilize bandwidth as efficiently as possible. In addition, it is desirable that applications avoid “clogging the pipe,” that is, overwhelming links with data, when bandwidth is limited. When bandwidth allocation changes, applications should preferably react. Bandwidth can change dynamically due to, for example, quality of service, jamming, signal obstruction, priority reallocation, and line-of-sight. Networks can be highly volatile and available bandwidth can change dramatically and without notice.
[0013] In addition to bandwidth constraints, tactical data networks may experience high latency. For example, a network involving communication over a satellite link may incur latency on the order of half a second or more. For some communications this may not be a problem, but for others, such as real-time, interactive communication (e.g., voice communications), it is highly desirable to minimize latency as much as possible.
[0014] Another characteristic common to many tactical data networks is data loss. Data may be lost due to a variety of reasons. For example, a node with data to send may be damaged or destroyed. As another example, a destination node may temporarily drop off of the network. This may occur because, for example, the node has moved out of range, the communication's link is obstructed, and/or the node is being jammed. Data may be lost because the destination node is not able to receive it and intermediate nodes lack sufficient capacity to buffer the data until the destination node becomes available. Additionally, intermediate nodes may not buffer the data at all, instead leaving it to the sending node to determine if the data ever actually arrived at the destination.
[0015] Often, applications in a tactical data network are unaware of and/or do not account for the particular characteristics of the network. For example, an application may simply assume it has as much bandwidth available to it as it needs. As another example, an application may assume that data will not be lost in the network. Applications which do not take into consideration the specific characteristics of the underlying communications network may behave in ways that actually exacerbate problems. For example, an application may continuously send a stream of data that could just as effectively be sent less frequently in larger bundles. The continuous stream may incur much greater overhead in, for example, a broadcast radio network that effectively starves other nodes from communicating, whereas less frequent bursts would allow the shared bandwidth to be used more effectively.
[0016] Certain protocols do not work well over tactical data networks. For example, a protocol such as TCP may not function well over a radio-based tactical network because of the high loss rates and latency such a network may encounter. TCP requires several forms of handshaking and acknowledgments to occur in order to send data. High latency and loss may result in TCP hitting time outs and not being able to send much, if any, meaningful data over such a network.
[0017] Information communicated with a tactical data network often has various levels of priority with respect to other data in the network. For example, threat warning receivers in an aircraft may have higher priority than position telemetry information for troops on the ground miles away. As another example, orders from headquarters regarding engagement may have higher priority than logistical communications behind friendly lines. The priority level may depend on the particular situation of the sender and/or receiver. For example, position telemetry data may be of much higher priority when a unit is actively engaged in combat as compared to when the unit is merely following a standard patrol route. Similarly, real-time video data from an UAV may have higher priority when it is over the target area as opposed to when it is merely in-route.
[0018] There are several approaches to delivering data over a network. One approach, used by many communications networks, is a “best effort” approach. That is, data being communicated will be handled as well as the network can, given other demands, with regard to capacity, latency, reliability, ordering, and errors. Thus, the network provides no guarantees that any given piece of data will reach its destination in a timely manner, or at all. Additionally, no guarantees are made that data will arrive in the order sent or even without transmission errors changing one or more bits in the data.
[0019] Another approach is Quality of Service (QoS). QoS refers to one or more capabilities of a network to provide various forms of guarantees with regard to data that is carried. For example, a network supporting QoS may guarantee a certain amount of bandwidth to a data stream. As another example, a network may guarantee that packets between two particular nodes have some maximum latency. Such a guarantee may be useful in the case of a voice communication where the two nodes are two people having a conversation over the network. Delays in data delivery in such a case may result in irritating gaps in communication and/or dead silence, for example.
[0020] QoS may be viewed as the capability of a network to provide better service to selected network traffic. The primary goal of QoS is to provide priority including dedicated bandwidth, controlled jitter and latency (required by some real-time and interactive traffic), and improved loss characteristics. Another important goal is making sure that providing priority for one flow does not make other flows fail. That is, guarantees made for subsequent flows must not break the guarantees made to existing flows.
[0021] Current approaches to QoS often require every node in a network to support QoS, or, at the very least, for every node in the network involved in a particular communication to support QoS. For example, in current systems, in order to provide a latency guarantee between two nodes, every node carrying the traffic between those two nodes must be aware of and agree to honor, and be capable of honoring, the guarantee.
[0022] There are several approaches to providing QoS. One approach is Integrated Services, or “IntServ.” IntServ provides a QoS system wherein every node in the network supports the services and those services are reserved when a connection is set up. IntServ does not scale well because of the large amount of state information that must be maintained at every node and the overhead associated with setting up such connections.
[0023] Another approach to providing QoS is Differentiated Services, or “DiffServ.” DiffServ is a class of service model that enhances the best-effort services of a network such as the Internet. DiffServ differentiates traffic by user, service requirements, and other criteria. Then, DiffServ marks packets so that network nodes can provide different levels of service via priority queuing or bandwidth allocation, or by choosing dedicated routes for specific traffic flows. Typically, a node has a variety of queues for each class of service. The node then selects the next packet to send from those queues based on the class categories.
[0024] Existing QoS solutions are often network specific and each network type or architecture may require a different QoS configuration. Due to the mechanisms existing QoS solutions utilize, messages that look the same to current QoS systems may actually have different priorities based on message content. However, data consumers may require access to high-priority data without being flooded by lower-priority data. Existing QoS systems cannot provide QoS based on message content at the transport layer.
[0025] As mentioned, existing QoS solutions require at least the nodes involved in a particular communication to support QoS. However, the nodes at the “edge” of network may be adapted to provide some improvement in QoS, even if they are incapable of making total guarantees. Nodes are considered to be at the edge of the network if they are the participating nodes in a communication (i.e., the transmitting and/or receiving nodes) and/or if they are located at chokepoints in the network. A chokepoint is a section of the network where all traffic must pass to another portion. For example, a router or gateway from a LAN to a satellite link would be a choke point, since all traffic from the LAN to any nodes not on the LAN must pass through the gateway to the satellite link.
[0026] Thus, there is a need for systems and methods providing QoS in a tactical data network. There is a need for systems and methods for providing QoS on the edge of a tactical data network. Additionally, there is a need for adaptive, configurable QoS systems and methods in a tactical data network.
Brief Summary of the Invention
[0027] Certain embodiments of the present invention provide a method for communicating data including prioritizing data by assigning a priority to the data, analyzing a network to determine a status of the network, and communicating the data based at least in part on the priority of the data and the status of the network.
[0028] Certain embodiments of the present invention provide a system for communicating data including a data prioritization component, a network analysis component, and a data communications component. The data prioritization component is adapted to prioritize data by assigning a priority to the data. The network analysis component is adapted to analyze a network to determine a status of the network. The data communications component is adapted to communicate the data based at least in part on the priority of the data and the status of the network.
[0029] Certain embodiments of the present invention provide a computer-readable medium including a set of instructions for execution on a computer, the set of instructions including a data prioritization routine, a network analysis routine, and a data communications routine. The data prioritization routine is configured to prioritize data by assigning a priority to the data. The network analysis routine is configured to analyze a network to determine a status of the network. The data communications routine is configured to communicate the data based at least in part on the priority of the data and the status of the network.
Brief Description of Several Views of the Drawings
[0030] FIG. 1 illustrates a tactical communications network environment operating with an embodiment of the present invention.
[0031] FIG. 2 shows the positioning of the data communications system in the seven layer OSI network model in accordance with an embodiment of the present invention.
[0032] FIG. 3 depicts an example of multiple networks facilitated using the data communications system in accordance with an embodiment of the present invention.
[0033] FIG. 4 depicts several examples of data priority and network status utilized by a data communications system in accordance with an embodiment of the present invention.
[0034] FIG. 5 illustrates a data communications system operating within a data communications environment according to an embodiment of the present invention.
[0035] FIG. 6 illustrates a flow diagram of a method for data communications in accordance with an embodiment of the present invention.
[0036] FIG. 7 illustrates a system for prioritizing data according to an embodiment of the present invention.
[0037] FIG. 8 illustrates a method for prioritizing data according to an embodiment of the present invention.
[0038] The foregoing summary, as well as the following detailed description of certain embodiments of the present invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, certain embodiments are shown in the drawings. It should be understood, however, that the present invention is not limited to the arrangements and instrumentality shown in the attached drawings.
Detailed Description of the Invention
[0039] FIG. 1 illustrates a tactical communications network environment 100 operating with an embodiment of the present invention. The network environment 100 includes a plurality of communication nodes 110, one or more networks 120, one or more links 130 connecting the nodes and network(s), and one or more communication systems 150 facilitating communication over the components of the network environment 100. The following discussion assumes a network environment 100 including more than one network 120 and more than one link 130, but it should be understood that other environments are possible and anticipated.
[0040] Communication nodes 110 may be and/or include radios, transmitters, satellites, receivers, workstations, servers, and/or other computing or processing devices, for example.
[0041] Network(s) 120 may be hardware and/or software for transmitting data between nodes 110, for example. Network(s) 120 may include one or more nodes 110, for example.
[0042] Link(s) 130 may be wired and/or wireless connections to allow transmissions between nodes 110 and/or network(s) 120.
[0043] The communications system 150 may include software, firmware, and/or hardware used to facilitate data transmission among the nodes 110, networks 120, and links 130, for example. As illustrated in FIG. 1 , communications system 150 may be implemented with respect to the nodes 110, network(s) 120, and/or links 130. In certain embodiments, every node 110 includes a communications system 150. In certain embodiments, one or more nodes 110 include a communications system 150. In certain embodiments, one or more nodes 110 may not include a communications system 150.
[0044] The communication system 150 provides dynamic management of data to help assure communications on a tactical communications network, such as the network environment 100. As shown in FIG. 2 , in certain embodiments, the system 150 operates as part of and/or at the top of the transport layer in the OSI seven layer protocol model. The system 150 may give precedence to higher priority data in the tactical network passed to the transport layer, for example. The system 150 may be used to facilitate communications in a single network, such as a local area network (LAN) or wide area network (WAN), or across multiple networks. An example of a multiple network system is shown in FIG. 3 . The system 150 may be used to manage available bandwidth rather than add additional bandwidth to the network, for example.
[0045] In certain embodiments, the system 150 is a software system, although the system 150 may include both hardware and software components in various embodiments. The system 150 may be network hardware independent, for example. That is, the system 150 may be adapted to function on a variety of hardware and software platforms. In certain embodiments, the system 150 operates on the edge of the network rather than on nodes in the interior of the network. However, the system 150 may operate in the interior of the network as well, such as at “choke points” in the network.
[0046] The system 150 may use rules and modes or profiles to perform throughput management functions such as optimizing available bandwidth, setting information priority, and managing data links in the network. By “optimizing” bandwidth, it is meant that the presently described technology can be employed to increase an efficiency of bandwidth use to communicate data in one or more networks. Optimizing bandwidth usage may include removing functionally redundant messages, message stream management or sequencing, and message compression, for example. Setting information priority may include differentiating message types at a finer granularity than Internet Protocol (IP) based techniques and sequencing messages onto a data stream via a selected rule-based sequencing algorithm, for example. Data link management may include rule-based analysis of network measurements to affect changes in rules, modes, and/or data transports, for example. A mode or profile may include a set of rules related to the operational needs for a particular network state of health or condition. The system 150 provides dynamic, “on-the-fly” reconfiguration of modes, including defining and switching to new modes on the fly.
[0047] The communication system 150 may be configured to accommodate changing priorities and grades of service, for example, in a volatile, bandwidth-limited network. The system 150 may be configured to manage information for improved data flow to help increase response capabilities in the network and reduce communications latency. Additionally, the system 150 may provide interoperability via a flexible architecture that is upgradeable and scalable to improve availability, survivability, and reliability of communications. The system 150 supports a data communications architecture that may be autonomously adaptable to dynamically changing environments while using predefined and predictable system resources and bandwidth, for example.
[0048] In certain embodiments, the system 150 provides throughput management to bandwidth-constrained tactical communications networks while remaining transparent to applications using the network. The system 150 provides throughput management across multiple users and environments at reduced complexity to the network. As mentioned above, in certain embodiments, the system 150 runs on a host node in and/or at the top of layer four (the transport layer) of the OSI seven layer model and does not require specialized network hardware. The system 150 may operate transparently to the layer four interface. That is, an application may utilize a standard interface for the transport layer and be unaware of the operation of the system 150. For example, when an application opens a socket, the system 150 may filter data at this point in the protocol stack. The system 150 achieves transparency by allowing applications to use, for example, the TCP/IP socket interface that is provided by an operating system at a communication device on the network rather than an interface specific to the system 150. System 150 rules may be written in extensible markup language (XML) and/or provided via custom dynamic link libraries (DLLs), for example.
[0049] In certain embodiments, the system 150 provides quality of service (QoS) on the edge of the network. The system's QoS capability offers content-based, rule-based data prioritization on the edge of the network, for example. Prioritization may include differentiation and/or sequencing, for example. The system 150 may differentiate messages into queues based on user-configurable differentiation rules, for example. The messages are sequenced into a data stream in an order dictated by the user-configured sequencing rule (e.g., starvation, round robin, relative frequency, etc.). Using QoS on the edge, data messages that are indistinguishable by traditional QoS approaches may be differentiated based on message content, for example. Rules may be implemented in XML, for example. In certain embodiments, to accommodate capabilities beyond XML and/or to support extremely low latency requirements, the system 150 allows dynamic link libraries to be provided with custom code, for example.
[0050] Inbound and/or outbound data on the network may be customized via the system 150. Prioritization protects client applications from high-volume, low-priority data, for example. The system 150 helps to ensure that applications receive data to support a particular operational scenario or constraint.
[0051] In certain embodiments, when a host is connected to a LAN that includes a router as an interface to a bandwidth-constrained tactical network, the system may operate in a configuration known as QoS by proxy. In this configuration, packets that are bound for the local LAN bypass the system and immediately go to the LAN. The system applies QoS on the edge of the network to packets bound for the bandwidth-constrained tactical link.
[0052] In certain embodiments, the system 150 offers dynamic support for multiple operational scenarios and/or network environments via commanded profile switching. A profile may include a name or other identifier that allows the user or system to change to the named profile. A profile may also include one or more identifiers, such as a functional redundancy rule identifier, a differentiation rule identifier, an archival interface identifier, a sequencing rule identifier, a pre-transmit interface identifier, a post-transmit interface identifier, a transport identifier, and/or other identifier, for example. A functional redundancy rule identifier specifies a rule that detects functional redundancy, such as from stale data or substantially similar data, for example. A differentiation rule identifier specifies a rule that differentiates messages into queues for processing, for example. An archival interface identifier specifies an interface to an archival system, for example. A sequencing rule identifier identifies a sequencing algorithm that controls samples of queue fronts and, therefore, the sequencing of the data on the data stream. A pre-transmit interface identifier specifies the interface for pre-transmit processing, which provides for special processing such as encryption and compression, for example. A post-transmit interface identifier identifies an interface for post-transmit processing, which provides for processing such as de-encryption and decompression, for example. A transport identifier specifies a network interface for the selected transport.
[0053] A profile may also include other information, such as queue sizing information, for example. Queue sizing information identifiers a number of queues and amount of memory and secondary storage dedicated to each queue, for example.
[0054] In certain embodiments, the system 150 provides a rules-based approach for optimizing bandwidth. For example, the system 150 may employ queue selection rules to differentiate messages into message queues so that messages may be assigned a priority and an appropriate relative frequency on the data stream. The system 150 may use functional redundancy rules to manage functionally redundant messages. A message is functionally redundant if it is not different enough (as defined by the rule) from a previous message that has not yet been sent on the network, for example. That is, if a new message is provided that is not sufficiently different from an older message that has already been scheduled to be sent, but has not yet been sent, the newer message may be dropped, since the older message will carry functionally equivalent information and is further ahead in the queue. In addition, functional redundancy many include actual duplicate messages and newer messages that arrive before an older message has been sent. For example, a node may receive identical copies of a particular message due to characteristics of the underlying network, such as a message that was sent by two different paths for fault tolerance reasons. As another example, a new message may contain data that supersedes an older message that has not yet been sent. In this situation, the system 150 may drop the older message and send only the new message. The system 150 may also include priority sequencing rules to determine a priority-based message sequence of the data stream. Additionally, the system 150 may include transmission processing rules to provide pre-transmission and post-transmission special processing, such as compression and/or encryption.
[0055] In certain embodiments, the system 150 provides fault tolerance capability to help protect data integrity and reliability. For example, the system 150 may use user-defined queue selection rules to differentiate messages into queues. The queues are sized according to a user-defined configuration, for example. The configuration specifies a maximum amount of memory a queue may consume, for example. Additionally, the configuration may allow the user to specify a location and amount of secondary storage that may be used for queue overflow. After the memory in the queues is filled, messages may be queued in secondary storage. When the secondary storage is also full, the system 150 may remove the oldest message in the queue, logs an error message, and queues the newest message. If archiving is enabled for the operational mode, then the de-queued message may be archived with an indicator that the message was not sent on the network.
[0056] Memory and secondary storage for queues in the system 150 may be configured on a per-link basis for a specific application, for example. A longer time between periods of network availability may correspond to more memory and secondary storage to support network outages. The system 150 may be integrated with network modeling and simulation applications, for example, to help identify sizing to help ensure that queues are sized appropriately and time between outages is sufficient to help achieve steady-state and help avoid eventual queue overflow.
[0057] Furthermore, in certain embodiments, the system 150 offers the capability to meter inbound (“shaping”) and outbound (“policing”) data. Policing and shaping capabilities help address mismatches in timing in the network. Shaping helps to prevent network buffers form flooding with high-priority data queued up behind lower-priority data. Policing helps to prevent application data consumers from being overrun by low-priority data. Policing and shaping are governed by two parameters: effective link speed and link proportion. The system 150 may form a data stream that is no more than the effective link speed multiplied by the link proportion, for example. The parameters may be modified dynamically as the network changes. The system may also provide access to detected link speed to support application level decisions on data metering. Information provided by the system 150 may be combined with other network operations information to help decide what link speed is appropriate for a given network scenario.
[0058] FIG. 4 depicts several examples of data priority and network status utilized by a data communications system, such as the data communications system 150 of FIG. 1 and/or the data communications system 550 of FIG. 5 , in accordance with an embodiment of the present invention. Although these examples are presented in the context of data communications between military aircraft over a low-bandwidth radio network, the data communications system may operate in a wide variety of data communications networks, such as the data communications network 120 and/or the data communications network 520, and/or data communications environments, such as the data communications environment 100 and/or the data communications environment 500.
[0059] Data may be assigned and/or associated with a priority. For example, the data priority may include “HIGH,” “MED HIGH,” “MED,” “MED LOW,” or “LOW,” as illustrated in FIG. 4 . As another example, the data priority may include “KEEP PILOT ALIVE,” “KILL ENEMY,” or “INFORMATIONAL,” also illustrated in FIG. 4 .
[0060] The data priority may be based at least in part on a type, category, and/or group of data. For example, types of data may include position data, emitter data for a near threat, next to shoot data, top-ten shoot list data, emitter data for a threat over one hundred miles away, situational awareness (SA) data from satellite communications (SATCOM), and general status data, as illustrated in FIG. 4 . Additionally, the data may be grouped into categories, such as “KEEP PILOT ALIVE,” “KILL ENEMY,” or “INFORMATIONAL,” also as illustrated in FIG. 4 . For example, “KEEP PILOT ALIVE” data, such as position data and emitter data for a near threat, may relate to the health and safety of a pilot. As another example, “KILL ENEMY” data, such as next to shoot data, top-ten shoot list data, and emitter data for a threat over one hundred miles away, may relate to combat systems. As another example, “INFORMATIONAL” data, such as SA data from SATCOM and general status data, may relate to non-combat systems.
[0061] As described above, the data type, category, and/or group may be the same as and/or similar to the data priority. For example, “KEEP PILOT ALIVE” data, such as position data and emitter data for a near threat, may be associated with a priority of “KEEP PILOT ALIVE,” which is more important than “KILL ENEMY” data, such as next to shoot data, top-ten shoot list data, and emitter data for a threat over one hundred miles away, associated with a priority of “KILL ENEMY.” As another example, “KILL ENEMY” data, such as next to shoot data, top-ten shoot list data, and emitter data for a threat over one hundred miles away, may be associated with a priority of “KILL ENEMY,” which is more important than “INFORMATIONAL” data, such as SA data from SATCOM and general status data, associated with a priority of “INFORMATIONAL.”
[0062] A status may be determined for a network. For example, the network status may include “BANDWIDTH CHALLENGED,” “BANDWIDTH CONSTRAINED,” “DESIGN POINT BANDWIDTH,” or “MAXIMUM BANDWIDTH.” These terms, in the order listed, indicate an increase in observed performance, which can be viewed as a decreasing amount of impairment in relation to an unimpaired link, a decreasing amount of shortfall due to substitution of less capable links, and/or a decreasing amount of shortfall in relation to a functional requirement. The network status may relate to the operating state or condition of the network. For example, a network status of “MAXIMUM BANDWIDTH” may indicate that all of the bandwidth is available for data transfer. As another example, a network status of “DESIGN POINT BANDWIDTH” may indicate that some bandwidth is being used, but the required amount of bandwidth to function normally is still available. As another example, “BANDWIDTH CHALLENGED” may indicate that there is more bandwidth being used than the system is designed. At this point, problems may begin to arise. As another example, “BANDWIDTH CONSTRAINED” may indicate that most of the bandwidth is being used and there is little or no bandwidth left. At this point, a system using a “BANDWIDTH CONSTRAINED” network begins to fall apart. Although these examples are presented in the context of bandwidth, the network status may include a wide variety of other network characteristics, such as latency and/or jitter.
[0063] The network status may change based at least in part on the network environment. For example, bandwidth may be affected by altitude, distance, and/or weather. If the aircraft are close together and the sky is clear, for example, then the network status may be “MAXIMUM BANDWIDTH” or “DESIGN POINT BANDWIDTH.” Conversely, if the aircraft are far apart and the sky is cloudy, for example, then the network status may be “BANDWIDTH CONSTRAINED” or “BANDWIDTH CHALLENGED.”
[0064] The data may be communicated over a network based at least in part on the data priority and/or the network status. For example, if the status of a network is “BANDWIDTH CHALLENGED,” then only data associated with a priority of “HIGH,” such as position data and emitter data for a near threat, may be communicated over the network.
[0065] As another example, if the status of a network is “BANDWIDTH CONSTRAINED,” then data associated with a priority of “MED HIGH,” such as next to shoot data, and “MED,” such as top-ten shoot list data, may also be communicated over the network. That is, data associated with a priority of “HIGH,” “MED HIGH,” and “MED” may be communicated over a network if the network status is “BANDWIDTH CONSTRAINED,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,” then “MED HIGH,” then “MED.”
[0066] As another example, if the status of a network is “DESIGN POINT BANDWIDTH,” then data with a priority of “MED LOW,” such as emitter data for a threat over one hundred miles away and SA data from SATCOM, may also be communicated over the network. That is, data associated with a priority of “HIGH,” “MED HIGH,” “MED,” and “MED LOW” may be communicated over a network if the network status is “DESIGN POINT BANDWIDTH,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,” then “MED HIGH,” then “MED,” then “MED LOW.”
[0067] As another example, if the status of a network is “MAXIMUM BANDWIDTH,” then data associated with a priority of “LOW,” such as general status data, may also be communicated over the network. That is, data associated with a priority of “HIGH,” “MED HIGH,” “MED,” “MED LOW,” and “LOW” may be communicated over the network if the network status is “MAXIMUM BANDWIDTH,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,” then “MED HIGH,” then “MED,” then “MED LOW,” then “LOW.”
[0068] FIG. 5 illustrates a data communications system 550 operating within a data communications environment 500 according to an embodiment of the present invention. The data communications environment 500, such as the data communications environment 100 of FIG. 1 , includes one or more nodes 510, such as the nodes 110, one or more networks 520, such as the networks 120, one or more links 530, such as the links 130, connecting the nodes 510 and the networks 520, and the data communications system 550, such as the data communications system 150, facilitating communication over the components of the data communications environment 500.
[0069] In certain embodiments, the data communications system 550 is adapted to receive, store, organize, prioritize, process, transmit, and/or communicate data. The data received, stored, organized, prioritized, processed, transmitted, and/or communicated by the data communications system 550 may include, for example, a block of data, such as a packet, cell, frame, and/or stream. For example, the data communications system 550 may receive packets of data from a node 510. As another example, the data communications system 550 may process a stream of data from a node 510.
[0070] The data communications system 550 includes a data prioritization component 560, a network analysis component 570, and a data communications component 580. In certain embodiments, the data prioritization component 560 may include a differentiation component 562, a sequencing component 566, and data organization component 568. The differentiation component 562 may include a differentiation rule identifier 563 and a functional redundancy rule set 565, as described above with respect to FIG. 1 . The sequencing component 566 may include a sequencing rule identifier 567, as described above with respect to FIG. 1 . In certain embodiments, the network analysis component 570 may include a network analysis rule identifier 572 and network analysis data 574.
[0071] The data prioritization component 560 prioritizes data for communications over the network 520. More particularly, the data prioritization component 560 may prioritize the data based at least in part on prioritization rules and/or algorithms, such as differentiation, sequencing, and/or functional redundancy. For example, as illustrated in FIG. 4 , position data and emitter data for a near threat may be associated with a priority of “HIGH,” next to shoot data may be associated with a priority of “MED HIGH,” top-ten shoot list data may be associated with a priority of “MED,” emitter data for a threat over one hundred miles away and SA data from SATCOM may be associated with a priority of “MED LOW,” and general status data may be assigned a priority of “LOW.”
[0072] In certain embodiments, the priority of the data may be based at least in part on message content. For example, the data priority may be based at least in part on type of data, such as video, audio, telemetry, and/or position data. As another example, the data priority may be based at least in part on the sending application and/or the sending user. For example, communications from a general may be assigned a higher priority than communications from a lower ranking officer.
[0073] In certain embodiments, the priority of the data is based at least in part on protocol information associated with and/or included in the data, such as a source address and/or a transport protocol. The protocol information may be similar to the protocol information described above, for example. For example, the data communications system 550 may determine a priority for a block of data based on the source address of the block of data. As another example, the data communications system 550 may determine a priority for a block of data based on the transport protocol used to communicate the block of data.
[0074] In certain embodiments, the data prioritization component 560 may include the differentiation component 562, the sequencing component 566, and the data organization component 568, which are described below.
[0075] The differentiation component 562 differentiates data. In certain embodiments, the differentiation component 562 may differentiate the data based at least in part on the differentiation rule identifier 563. In certain embodiments, the differentiation component 562 may add data to the data organization component 568 for communications over the network 520. For example, the differentiation component 562 may add the data to the data organization component 568 based at least in part on the differentiation rule identifier 563, as described above with respect to FIG. 1 .
[0076] In certain embodiments, the differentiation component 562 may differentiate the data based at least in part on message content and/or protocol information, as described above.
[0077] The differentiation rule identifier 563 identifies one or more differentiation rules and/or algorithms, such as queue selection, as described above with respect to FIG. 1 . In certain embodiments, the differentiation rules and/or algorithms may be user defined. In certain embodiments, the differentiation rules and/or algorithms may be written in XML or may be provided in one or more DLLs, as described above with respect to FIG. 1 .
[0078] In certain embodiments, the differentiation component 562 may remove and/or withhold data from the data organization component 568. For example, the differentiation component 562 may remove the data from the data organization component 568 based at least in part on the functional redundancy rule identifier 565, as described above with respect to FIG. 1 .
[0079] The functional redundancy rule identifier 565 identifies one or more functional redundancy rules and/or algorithms, as described above with respect to FIG. 1 . In certain embodiments, the functional redundancy rules and/or algorithms may be user defined. In certain embodiments, the functional redundancy rules and/or algorithms may be written in XML or may be provided in one or more DLLs, as described above with respect to FIG. 1 .
[0080] The sequencing component 566 sequences data. In certain embodiments, the sequencing component 566 may sequence the data based at least in part on the sequence rule identifier 567. In certain embodiments, the sequencing component 566 may select and/or remove the data from the data organization component 568 for communications over the network 520. For example, the sequencing component 566 may remove the data from the data organization component 568 based at least in part on the sequencing rule identifier 567, as described above with respect to FIG. 1 .
[0081] The sequencing rule identifier 567 identifies one or more sequencing rules and/or algorithms, such as starvation, round robin, and relative frequency, as described above with respect to FIG. 1 . In certain embodiments, the sequencing rules and/or algorithms may be user defined. In certain embodiments, the sequencing rules and/or algorithms may be written in XML or may be provided in one or more DLLs, as described above with respect to FIG. 1 .
[0082] The data organization component 568 stores and/or organizes data. In certain embodiments, the data organization component 568 may store and/or organize the data based at least in part on priority, such as “KEEP PILOT ALIVE,” “KILL ENEMY,” and “INFORMATIONAL.” The data organization component 568 may include, for example, one or more queues, such as Q1, Q2, Q3, Q4, and Q5. For example, data associated with a priority of “HIGH,” such as position data and emitter data for a near threat, may be stored in Q1, data associated with a priority of “MED HIGH,” such as next to shoot data, may be stored in Q2, data associated with a priority of “MED,” such as top-ten shoot list data, may be stored in Q3, data associated with a priority of “MED LOW,” such as emitter data for a threat over one hundred miles away and SA data from SATCOM, may be stored in Q4, and data associated with a priority of “LOW,” such as general status data, may be stored in Q5. Alternatively, the data organization component 568 may include, for example, one or more trees, tables, linked lists, and/or other data structures for storing and/or organizing data.
[0083] The network analysis component 570 analyzes the network 520. In certain embodiments, the network analysis component 570 analyzes the network 520 based at least in part on the network analysis rule identifier 572.
[0084] The network analysis rule identifier 572 identifies one or more network analysis rules and/or algorithms, such as a round-trip-ping, peer-to-peer analysis, and/or measured throughput. For example, round-trip-ping may analyze network latency by timing how long it takes for a ping to go to an end-node and back. As another example, peer-to-peer analysis may assume that the slowest links are the first and last one. Consequently, network performance may be evaluated by sending a message to the far-end requesting link speed data, and then using this data and the knowledge of present link speed to evaluate current throughput or performance. As another example, measured throughput may segment blocks of data and send them to the far end of the network. The far end tracks each block of data that it receives. Using this timing information and knowing the size of the block of data that was sent, the network throughput can be approximated over time.
[0085] In certain embodiments, the one or more network analysis rules and/or algorithms may determine the state of health of the network on a rule-driven time interval with a rule-driven reaction to that state. For example, an analysis rule looking at network stability may turn off outbound data when data drop exceeds a reasonable level or an analysis rule may meter the data to a lower rate if round-trip packet times exceed a reasonable level.
[0086] In certain embodiments, the network analysis rules and/or algorithms may be user defined. In certain embodiments, the network analysis rules and/or algorithms may be written in XML or may be provided in one or more DLLs.
[0087] In certain embodiments, the network analysis component 570 determines a status of the network 520. More particularly, the network analysis component 570 may determine the status of the network 520 based at least in part on one or more characteristics of the network 520, such as bandwidth, latency, and/or jitter. For example, as illustrated in FIG. 4 , the network analysis component 570 may determine that the status of the network 520 is “MAXIMUM BANDWIDTH,” “DESIGN POINT BANDWIDTH,” “BANDWIDTH CONSTRAINED,” or “BANDWIDTH CHALLENGED.”
[0088] In certain embodiments, the network analysis component 570 analyzes one or more paths in the network 520, such as the path between two nodes.
[0089] The network analysis component 570 at NODE A generates the network analysis data. More particularly, the network analysis component 570 at NODE A generates the network analysis data based at least in part on the network analysis rule identifier 572. The network analysis data may include a block of data, such as a packet, cell, frame, and/or stream. NODE A transmits the network analysis data to NODE B over the network 520.
[0090] NODE B receives the network analysis data from NODE A. The network analysis component 570 at NODE B processes the network analysis data from NODE A. More particularly, the network analysis component 570 at NODE B processes the network analysis data based at least in part on network analysis rule identifier 572. For example, the network analysis component at NODE B may add a time stamp to the network analysis data. NODE B transmits the processed network analysis data to NODE A over the network 520.
[0091] NODE A receives the processed network analysis data from NODE B. The network analysis component 570 at NODE A analyzes the network 520 based at least in part on the network analysis rule identifier 572.
[0092] In certain embodiments, the network analysis component 570 at NODE A determines a status of the network 520. More particularly, the network analysis component 570 at NODE A may determine the status of the network 520 based at least in part on one or more characteristics of the network 520, such as bandwidth, latency, and/or jitter. For example, as illustrated in FIG. 4 , the network analysis component 570 at NODE A may determine that the status of the network 520 is “MAXIMUM BANDWIDTH,” “DESIGN POINT BANDWIDTH,” “BANDWIDTH CONSTRAINED,” or “BANDWIDTH CHALLENGED.”
[0093] In certain embodiments, the network analysis component 570 at NODE A analyzes one or more paths in the network 520, such as the path from NODE A to NODE B.
[0094] The data communications component 580 communicates data. In certain embodiments, the data communications component 580 receives the data, for example, from a node 510 and/or an application running on the node 510, or over a network 520 and/or over a link connecting the node 510 to the network 520. In certain embodiments, the data communications component 580 transmits data, for example, to a node 510 and/or an application running on the node 510, or over a network 520 and/or over a link connecting the node 510 to the network 520.
[0095] In certain embodiments, the data communications component 580 communicates with the data prioritization component 560. More particularly, the data communications component 580 transmits data to the differentiation component 562 and receives data from the sequencing component 566. Alternatively, the data communications component 580 may communicate with the data organization component 568. In certain embodiments, the data communications component 580 communicates with the network analysis component 570. In certain embodiments, the data prioritization component 560 and/or the network analysis component 570 may perform one or more of the functions of the data communications component 580.
[0096] In certain embodiments, the data communications component 580 may communicate data based at least in part on data priority and/or network status.
[0097] In operation, data is received by the data communications system 550. More particularly, the data may be received by the data communications component 580 of the data communications system 550. The data may be received, for example, from a node 510 and/or an application running on the node 510. The data may be received, for example, over a network 520 and/or over a link connecting the node 510 and the network 520. For example, data may be received at the data communications system 550 from a radio over a tactical data network. As another example, data may be provided to the data communications system 550 by an application running on the same system by an inter-process communication mechanism. As discussed above, the data may include, for example, a block of data, such as a packet, a cell, a frame, and/or a stream of data.
[0098] In certain embodiments, the data communication system 550 may not receive all of the data. For example, some of the data may be stored in a buffer and the data communication system 550 may receive only header information and a pointer to the buffer. As another example, the data communication system 550 may be hooked into the protocol stack of an operating system and when an application passes data to the operating system through a transport layer interface (e.g., sockets), the operating system may then provide access to the data to the data communication system 550.
[0099] The data is prioritized by the data communications system 550. In certain embodiments, the data may be prioritized by the data prioritization component 560 of the data communications system 550 based at least in part on data prioritization rules.
[0100] In certain embodiments, the data may be differentiated by the differentiation component 562. For example, the data may be added to and/or removed and/or withheld from the data organization component 568 based at least in part on queue selection rules and/or functional redundancy rules. As another example, the data may be differentiated by the differentiation component 562 based at least in part on message content and/or protocol information, as described above.
[0101] In certain embodiments, the data may be sequenced by the sequencing component 566. For example, the data may be removed and/or withheld from the data organization component 568 based at least in part on sequencing rules, such as starvation, round robin, and relative frequency.
[0102] In certain embodiments, the data may be stored, organized, and/or prioritized in the data organization component 568. In certain embodiments, the data organization component 568 may include queues, trees, tables, linked lists, and/or other data structures for storing, organizing, and/or prioritizing data.
[0103] In certain embodiments, the data communications system 550 may prioritize the data. In certain embodiments, the data communications system 550 may determine a priority for a block of data. For example, when a block of data is received by the data communications system 550, the data prioritization component 560 of the data communications system 550 may determine a priority for that block of data. As another example, a block of data may be stored in a queue in the data communications system 550 and the data prioritization component 560 may extract the block of data from the queue based on a priority determined for the block of data and/or for the queue.
[0104] In certain embodiments, the priority of the block of data may be based at least in part on message content. For example, the data priority may be based at least in part on type of data, such as video, audio, telemetry, and/or position data. As another example, the data priority may be based at least in part on the sending application and/or the sending user. For example, communications from a general may be assigned a higher priority than communications from a lower ranking officer.
[0105] In certain embodiments, the priority of the block of data may be based at least in part on protocol information associated with and/or included in the data, such as a source address and/or a transport protocol. The protocol information may be similar to the protocol information described above, for example. For example, the data communications system 550 may determine a priority for a block of data based on the source address of the block of data. As another example, the data communications system 550 may determine a priority for a block of data based on the transport protocol used to communicate the block of data.
[0106] The prioritization of data by the data communications system 550 may be used to provide QoS, for example. For example, the data communications system 550 may determine a priority for data received over a tactical data network. The priority may be based on the source address of the data, for example. For example, a source IP address for the data from a radio of a member of the same platoon as the platoon the data communications system 550 belongs to may be given a higher priority than data originating from a unit in a different division in a different area of operations. The priority may be used to determine which of a plurality of queues the data should be placed into for subsequent communication by the data communications system 550. For example, higher priority data may be placed in a queue intended to hold higher priority data, and in turn, the data communications system 550, in determining what data to next communicate, may look first to the higher priority queue.
[0107] The data may be prioritized based at least in part on one or more rules. As discussed above, the rules may be user defined. In certain embodiments, rules may be written in XML and/or provided via custom DLLs, for example. A rule may specify, for example, that data received using one protocol be favored over data utilizing another protocol. For example, command data may utilize a particular protocol that is given priority, via a rule, over position telemetry data sent using another protocol As another example, a rule may specify that position telemetry data coming from a first range of addresses may be given priority over position telemetry data coming from a second range of addresses. The first range of addresses may represent IP addresses of other aircraft in the same squadron as the aircraft with the data communications system 550 running on it, for example. The second range of addresses may then represent, for example, IP addresses for other aircraft that are in a different area of operations, and therefore of less interest to the aircraft on which the data communications system 550 is running.
[0108] In certain embodiments, the data communications system 550 does not drop data. That is, although the data may be lower priority, it is not dropped by the data communications system 550. Rather, the data may be delayed for a period of time, potentially dependent on the amount of higher priority data that is received.
[0109] In certain embodiments, the data communications system 550 includes a mode or profile indicator. The mode or profile indicator may represent, for example, the current mode or profile of the data communications system 550. As discussed above, the data communications system 550 may use rules and modes or profiles to perform throughput management functions, such as optimizing available bandwidth, setting information priority, and managing data links 530 in a network 520. The different modes may, for example, affect changes in rules, algorithms, modes, and/or data transports, for example. A mode or profile may include a set of rules related to the operational needs for a particular network state of health or condition. The data communications system 550 may provide dynamic reconfiguration of modes, including defining and switching to new modes “on-the-fly,” for example.
[0110] In certain embodiments, the data communications system 550 is transparent to other applications. For example, the processing, organizing, and/or prioritization performed by the data communications system 550 may be transparent to one or more nodes 510 or other applications or data sources. As another example, an application running on the same system as the data communications system 550, or on a node 510 connected to the data communications system 550, may be unaware of the prioritization of data performed by the data communications system 550.
[0111] The network 520 is analyzed by the data communications system 550. More particularly, the network 520 may be analyzed by the network analysis component 570 of the data communications system 550 based at least in part on the network analysis rules.
[0112] In certain embodiments, the network analysis component 570 determines a status of the network 520. More particularly, the network analysis component 570 may determine the status of the network 520 based at least in part on one or more characteristics of the network 520, such as bandwidth, latency, and/or jitter. For example, as illustrated in FIG. 4 , the network analysis component 570 may determine that the status of the network 520 is “MAXIMUM BANDWIDTH,” “DESIGN POINT BANDWIDTH,” “BANDWIDTH CONSTRAINED,” and/or “BANDWIDTH CHALLENGED.”
[0113] In certain embodiments, the network analysis component 570 analyzes one or more paths in the network 520, such as the path from NODE A to NODE B.
[0114] The data is communicated by the data communications system 550. More particularly, the data may be communicated by the data communications component 580 of the data communications system 550. The data may be communicated, for example, to a node 510 and/or an application running on the node 510. The data may be communicated, for example, over a network 520 and/or over a link connecting the node 510 and the network 520. For example, data may be communicated by the data communications system 550 over a tactical data network to a radio. As another example, data may be provided by the data communications system 550 to an application running on the same system by an inter-process communication mechanism. As discussed above, the data may include, for example, a block of data, such as a packet, a cell, a frame, and/or a stream of data.
[0115] In certain embodiments, the data is communicated by the data communications system 550 based at least in part on the data priority and/or the network status. For example, as illustrated in FIG. 4 , if the status of a network 520 is “BANDWIDTH CHALLENGED,” then only data associated with a priority of “HIGH,” such as position data and emitter data for a near threat, may be communicated over the network 520.
[0116] As another example, if the status of a network 520 is “BANDWIDTH CONSTRAINED,” then data associated with a priority of “MED HIGH,” such as next to shoot data, and “MED,” such as top-ten shoot list data, may also be communicated over the network 520. That is, data associated with a priority of “HIGH,” “MED HIGH,” and “MED” may be communicated over a network 520 if the network status is “BANDWIDTH CONSTRAINED,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,”, then “MED HIGH,” then “MED.”
[0117] As another example, if the status of a network 520 is “DESIGN POINT BANDWIDTH,” then data associated with a priority of “MED LOW,” such as emitter data for a threat over one hundred miles away and SA data from SATCOM, may also be communicated over the network 520. That is, data associated with a priority of “HIGH,” “MED HIGH,” “MED,” and “MED LOW” may be communicated over a network 520 if the network status is “DESIGN POINT BANDWIDTH,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,” then “MED HIGH,” then “MED,” then “MED LOW.”
[0118] As another example, if the status of a network 520 is “MAXIMUM BANDWIDTH,” then data associated with a priority of “LOW,” such as general status data, may also be communicated over the network 520. That is, data associated with a priority of “HIGH,” “MED HIGH,” “MED,” “MED LOW,” and “LOW” may be communicated over the network 520 if the network status is “MAXIMUM BANDWIDTH,” as illustrated in FIG. 4 . In certain embodiments, the data may also be communicated in order of priority, for example, “HIGH,” then “MED HIGH,” then “MED,” then “MED LOW,” then “LOW.”
[0119] As discussed above, the components, elements, and/or functionality of the data communication system 550 may be implemented alone or in combination in various forms in hardware, firmware, and/or as a set of instructions in software, for example. Certain embodiments may be provided as a set of instructions residing on a computer-readable medium, such as a memory, hard disk, DVD, or CD, for execution on a general purpose computer or other processing device.
[0120] FIG. 6 illustrates a flow diagram of a method 600 for data communications in accordance with an embodiment of the present invention. The method 600 includes the following steps, which will be described below in more detail. At step 610, data is received. At step 620, the data is prioritized. At step 630, a network is analyzed. At step 640, the data is communicated. The method 600 is described with reference to elements of systems described above, but it should be understood that other implementations are possible.
[0121] At step 610, data is received. The data may be received, for example, by the data communications system 550 of FIG. 5 , as described above. As another example, the data may be received from a node 510 and/or an application running on the node 510. As another example, the data may be received, for example, over a network 520 and/or over a link connecting the node 510 and the network 520. The data may include, for example, a block of data, such as a packet, a cell, a frame, and/or a stream of data. In certain embodiments, the data communication system 550 may not receive all of the data.
[0122] At step 620, data is prioritized. The data to be prioritized may be the data that is received at step 610, for example. The data may be prioritized, for example, by the data communications system 550 of FIG. 5 , as described above. As another example, the data may be prioritized by the data prioritization component 560 of the data communications system 550 based at least in part on data prioritization rules.
[0123] In certain embodiments, the data priority may be based at least in part on message content, such as data type, sending application, and/or sending user. In certain embodiments, the data priority may based at least in part on protocol information associated with and/or included in the data, such as a source address and/or a transport protocol. In certain embodiments, the data prioritization component 560 may be used to provide QoS, for example. In certain embodiments, the prioritization of data is transparent to other applications.
[0124] At step 630, a network is analyzed. The network may be analyzed, for example, by the data communications system 550 of FIG. 5 , as described above. As another example, the network may be analyzed by the network analysis component 570 of the data communications system 550 based at least in part on network analysis rules.
[0125] In certain embodiments, the network analysis component 570 determines a status of the network 520. More particularly, the network analysis component 570 may determine the status of the network 520 based at least in part on one or more characteristics of the network 520, such as bandwidth, latency, and/or jitter.
[0126] In certain embodiments, the network analysis component 570 analyzes one or more paths in the network 520, such as the path from NODE A to NODE B.
[0127] At step 640, data is communicated. The data communicated may be the data received at step 610, for example. The data communicated may be the data prioritized at step 620, for example. The data may be communicated, for example, by the data communications system 550 of FIG. 5 , for example, as described above. As another example, the data may be communicated to a node 510 and/or an application running on the node 510. As another example, the data may be communicated over a network 520 and/or over a link connecting the node 510 and the network 520.
[0128] In certain embodiments, the data may be communicated based at least in part on data priority and/or network status, as described above. The data priority may be the data priority determined at step 620, for example. The network status may be the network status determined at step 630, for example.
[0129] One or more of the steps of the method 600 may be implemented alone or in combination in hardware, firmware, and/or as a set of instructions in software, for example. Certain embodiments may be provided as a set of instructions residing on a computer-readable medium, such as a memory, hard disk, DVD, or CD, for execution on a general purpose computer or other processing device.
[0130] Certain embodiments of the present invention may omit one or more of these steps and/or perform the steps in a different order than the order listed. For example, some steps may not be performed in certain embodiments of the present invention. As a further example, certain steps may be performed in a different temporal order, including simultaneously, than listed above.
[0131] FIG. 7 illustrates a system 700 for prioritizing data according to an embodiment of the present invention. The system 700 includes a differentiation component 710, a sequencing component 720, and a data organization component 730. The differentiation component 710 may include differentiation rules 715, such as queue selection rules and/or functional redundancy rules. The sequencing component 720 includes sequencing rules 725, such as starvation, round robin, and/or relative frequency. The data organization component 730 includes, for example, queues, trees, tables, lists, and/or other data structures for storing and/or organizing data. The components of the system 700 may be referred to collectively as a data prioritization component 760, and may be similar to the components of the data prioritization component 560 of FIG. 5 , as described above, for example.
[0132] Data is received at the data prioritization component 760. The data may be received over a network, such as a tactical data network, and/or from an application program, for example. As another example, the data may be received from the data communications component 580 of FIG. 5 , as described above. The data may include, for example, a block of data, such as a cell, a frame, a packet, and/or a stream. The data prioritization component 760 prioritizes the data. In certain embodiments, the data prioritization component 760 may prioritize the data based at least in part on data prioritization rules, such as the differentiation rules 715 and/or the sequencing rules 725, for example.
[0133] In certain embodiments, the data is received at the differentiation component 710 of the data prioritization component 760. The differentiation component 710 differentiates the data. In certain embodiments, the differentiation component 710 may differentiate the data based at least in part on the differentiation rules 715, such as queue selection rules, and/or functional redundancy rules 765. In certain embodiments, the differentiation rules and/or functional redundancy rules may be defined by a user. In certain embodiments, the differentiation component 710 may differentiate the data based at least in part on message content, such as data type, sending address, and/or sending application, and/or protocol information, such as source address and/or transport protocol. In certain embodiments, the differentiation component 710 may add data to the data organization component 730, for example, based at least in part on the queue selection rules. For example, the differentiation component 710 may add video data to a first queue, audio data to second queue, telemetry data to a third queue, and position data to a fourth queue. In certain embodiments, the differentiation component 710 may remove and/or withhold data from the data organization component 730, for example, based at least in part on the functional redundancy rules. For example, the differentiation component 710 may remove stale and/or redundant position data from the fourth queue.
[0134] In certain embodiments, the differentiated data may be communicated. For example, the differentiated data may be transmitted to the data communications component 580 of FIG. 5 , as described above. As another example, the differentiated data may be communicated over a network, such as a tactical data network, and/or to an application program.
[0135] In certain embodiments, the data is received at the sequencing component 720 of the data prioritization component 760. The sequencing component 720 sequences the data. In certain embodiments, the sequencing component 720 may sequence the data based at least in part on the sequencing rules 725, such as starvation, round robin, and/or relative frequency. In certain embodiments, the sequencing rules 725 may be defined by a user. In certain embodiments, the sequencing component 720 selects and/or removes the data from the data organization component 730, for example, based at least in part on the sequencing rules 735. For example, the sequencing component 720 may remove the position data from the fourth queue, then the audio data from the second queue, then the telemetry data from the third queue, and then the video data from the first queue.
[0136] In certain embodiments, the sequenced data may be communicated. For example, the sequenced data may be transmitted to the data communications component 580 of FIG. 5 , as described above. As another example, the sequenced data may be communicated over a network, such as a tactical data network, and/or to an application program.
[0137] In certain embodiments, the data prioritization component 700, including the differentiation component 710, the sequencing component 720, and/or the data organization component 730, may be used to provide QoS, as described above. In certain embodiments, the data prioritization component 700, including the differentiation component 710, the sequencing component 720, and/or the data organization component 730, may be transparent to other applications, also as described above.
[0138] As discussed above, the components, elements, and/or functionality of the data prioritization component 700 may be implemented alone or in combination in various forms in hardware, firmware, and/or as a set of instructions in software, for example. Certain embodiments may be provided as a set of instructions residing on a computer-readable medium, such as a memory, hard disk, DVD, or CD, for execution on a general purpose computer or other processing device.
[0139] FIG. 8 illustrates a flow diagram of method 800 for prioritizing data according to an embodiment of the present invention. The method 800 includes the following steps, which will be described below in more detail. At step 810, data is received. At step 820, the data is prioritized. At step 830, the data is communicated. The method 800 is described with reference to elements of systems described above, but it should be understood that other implementations are possible.
[0140] At step 810, the data is received. As described above, the data may be received over a network, such as a tactical data network, and/or from an application program, for example. As another example, the data may be received from the data communications component 580 of FIG. 5 , as described above.
[0141] At step 820, the data is differentiated. The data to be differentiated may be the data received at step 810, for example. The data may be differentiated, for example, by the differentiation component 710 of FIG. 7 , as described above.
[0142] At step 830, the data is sequenced. The data to be sequenced may be the data received at step 810 and/or the data differentiated at step 820, for example. The data may be sequenced, for example, by the sequencing component 720 of FIG. 7 , as described above.
[0143] At step 840, the data is communicated. The data to be communicated may be the data received at step 810, the data differentiated at step 820, and/or the data sequenced at step 830, for example. The data may be communicated over a network, such as a tactical data network, and/or to an application program, for example. As another example, the data may be communicated to the data communications component 580 of FIG. 5 , as described above.
[0144] One or more of the steps of the method 800 may be implemented alone or in combination in hardware, firmware, and/or as a set of instructions in software, for example. Certain embodiments may be provided as a set of instructions residing on a computer-readable medium, such as a memory, hard disk, DVD, or CD, for execution on a general purpose computer or other processing device.
[0145] Certain embodiments of the present invention may omit one or more of these steps and/or perform the steps in a different order than the order listed. For example, some steps may not be performed in certain embodiments of the present invention. As a further example, certain steps may be performed in a different temporal order, including simultaneously, than listed above.
[0146] In one embodiment of the present invention, a method for communicating data includes prioritizing data by assigning a priority to the data, analyzing a network to determine a status of the network, and communicating the data based at least in part on the priority of the data and the status of the network.
[0147] In one embodiment of the present invention, a system for communicating data includes a data prioritization component, a network analysis component, and a data communications component. The data prioritization component is adapted to prioritize data by assigning a priority to the data. The network analysis component is adapted to analyze a network to determine a status of the network. The data communications component is adapted to communicate the data based at least in part on the priority of the data and the status of the network.
[0148] In one embodiment of the present invention, a computer-readable medium includes a set of instructions for execution on a computer. The set of instructions includes a data prioritization routine, a network analysis routine, and a data communications routine. The data prioritization routine is configured to prioritize data by assigning a priority to the data. The network analysis routine is configured to analyze a network to determine a status of the network. The data communications routine is configured to communicate the data based at least in part on the priority of the data and the status of the network.
[0149] Thus, certain embodiments of the present invention provide systems and methods for adaptive throughput data management. Certain embodiments provide a technical effect of adaptive throughput data management.
[0150] While the invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
Claims
The invention claimed is:
1. A method for communicating data, the method including:
performing by at least one processing device:
prioritizing data by assigning a priority to the data, wherein the prioritization occurs at least one of:
in a transport layer of a network communications protocol stack of a data communication system, and
at a top of the transport layer of the network communications protocol stack of the data communication system;
analyzing a network to determine a status of the network;
selecting a mode of the data communication system based upon the status of the network;
changing rules for assigning priority to the data based upon the mode of the data communication system; and
communicating the data based at least in part on the priority of the data and the status of the network, wherein the data is communicated at a transmission rate metered based at least in part on the status of the network.
2. The method of claim 1, wherein the data includes a block of data.
3. The method of claim 2, wherein the block of data includes at least one of a cell, a frame, a packet, and a stream.
4. The method of claim 1, wherein the priority of the data is based at least in part on one or more of a type of the data, a category of the data, and a group of the data.
5. The method of claim 1, further including the step of receiving the data at a node on the edge of the network.
6. The method of claim 5, wherein the receiving step includes receiving the data at least in part from an application program.
7. The method of claim 1, wherein the prioritizing step includes determining message content of the data and assigning the priority to the data based at least in part on the message content.
8. The method of claim 1, wherein the prioritizing step includes determining protocol information of the data and assigning the priority to the data based at least in part on the protocol information.
9. The method of claim 1, wherein the prioritizing step includes assigning the priority to the data based at least in part on a user defined rule.
10. The method of claim 1, wherein the analyzing step includes determining the status of the network based at least in part on one or more of a bandwidth of the network, a latency of the network, and a jitter of the network.
11. The method of claim 1, wherein the analyzing step includes determining the status of the network based at least in part on a user defined rule.
12. The method of claim 1, wherein the communicating step includes communicating the data to an application program.
13. A system for communicating data, the system including:
a data prioritization component adapted to assign a priority to data, wherein the prioritization occurs at least one of:
in a transport layer of a network communications protocol stack of a data communication system, and
at a top of the transport layer of the network communications protocol stack of the data communication system;
a network analysis component adapted to determine a status of a network;
a mode selection component adapted to select at least one mode based at least in part on the status of the network; and
a data communications component adapted to communicate the data based at least in part on the priority of the data and the status of the network, the data prioritization component being adapted to assign priority to the data based on prioritization rules, wherein the prioritization rules are selected based upon the selected at least one mode, wherein the data is communicated at a transmission rate metered based at least in part on the status of the network.
14. The system of claim 13, further including a data organization component adapted to organize the data with respect to other data based at least in part on the priority of the data.
15. The system of claim 13, wherein the data organization component is adapted to organize the data using a data structure.
16. The system of claim 15, wherein the data structure includes one or more of a queue, a tree, a table, and a list.
17. A non-transitory computer-readable medium including a set of instructions for execution on a computer, the set of instructions including:
a data prioritization routine configured to assign a priority to data, wherein the prioritization occurs at least one of:
in a transport layer of a network communications protocol stack of a data communication system, and
at a top of the transport layer of the network communications protocol stack of the data communication system;
a network analysis routine configured to determine a status of a network;
a mode selection routine configured to select at least one mode based at least in part on the status of the network; and
a data communications routine configured to communicate the data based at least in part on the priority of the data and the status of the network, the data prioritization routine being configured to assign priority to the data based on prioritization rules, wherein the prioritization rules are selected based upon the selected mode, wherein the data is communicated at a transmission rate metered based at least in part on the status of the network.
Patent Citations (272)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5559999(A) | 1996-09-01 | Maturi et al. | Applicant |
| US5560038(A) | 1996-09-01 | Haddock | Applicant |
| US5627970(A) | 1997-05-01 | Keshav | Applicant |
| US5664091(A) | 1997-09-01 | Keen | Applicant |
| US5671224(A) | 1997-09-01 | Pyhalammi et al. | Applicant |
| US5844600(A) | 1998-12-01 | Kerr | Applicant |
| US5949758(A) | 1999-09-01 | Kober | Applicant |
| US5960035(A) | 1999-09-01 | Sridhar et al. | Examiner |
| US6028843(A) | 2000-02-01 | Delp et al. | Applicant |
| US6044419(A) | 2000-03-01 | Hayek et al. | Applicant |
| US6067557(A) | 2000-05-01 | Hegde | Applicant |
| US6072781(A) | 2000-06-01 | Feeney et al. | Applicant |
| US6075770(A) | 2000-06-01 | Chang et al. | Applicant |
| US6124806(A) | 2000-09-01 | Cunningham et al. | Applicant |
| US6154778(A) | 2000-11-01 | Koistinen et al. | Applicant |
| US6170075(B1) | 2001-01-01 | Schuster et al. | Applicant |
| US6205486(B1) | 2001-03-01 | Wei et al. | Applicant |
| US6233248(B1) | 2001-05-01 | Sautter et al. | Applicant |
| US6236656(B1) | 2001-05-01 | Westerberg et al. | Applicant |
| US6247058(B1) | 2001-06-01 | Miller et al. | Applicant |
| US6279035(B1) | 2001-08-01 | Brown et al. | Applicant |
| US6301527(B1) | 2001-10-01 | Butland et al. | Applicant |
| US6314425(B1) | 2001-11-01 | Serbinis et al. | Applicant |
| US6332163(B1) | 2001-12-01 | Bowman-Amuah | Applicant |
| US6343085(B1) | 2002-01-01 | Krishnan et al. | Applicant |
| US6343318(B1) | 2002-01-01 | Hawkins et al. | Applicant |
| US6363411(B1) | 2002-03-01 | Dugan et al. | Applicant |
| US6397259(B1) | 2002-05-01 | Lincke et al. | Applicant |
| US6401117(B1) | 2002-06-01 | Narad et al. | Applicant |
| US6404776(B1) | 2002-06-01 | Voois et al. | Applicant |
| US6407998(B1) | 2002-06-01 | Polit et al. | Applicant |
| US6408341(B1) | 2002-06-01 | Feeney et al. | Applicant |
| US6421335(B1) | 2002-07-01 | Kilkki et al. | Examiner |
| US6438603(B1) | 2002-08-01 | Ogus | Applicant |
| US6490249(B1) | 2002-12-01 | Aboul-Magd et al. | Applicant |
| US6498782(B1) | 2002-12-01 | Branstad et al. | Applicant |
| US6507864(B1) | 2003-01-01 | Klein et al. | Applicant |
| US6532465(B2) | 2003-03-01 | Hartley et al. | Applicant |
| US6542593(B1) | 2003-04-01 | Bowman-Amuah | Applicant |
| US6556982(B1) | 2003-04-01 | McGaffey et al. | Applicant |
| US6557053(B1) | 2003-04-01 | Bass et al. | Applicant |
| US6560592(B1) | 2003-05-01 | Reid et al. | Applicant |
| US6563517(B1) | 2003-05-01 | Bhagwat et al. | Applicant |
| US6587435(B1) | 2003-07-01 | Miyake et al. | Applicant |
| US6587875(B1) | 2003-07-01 | Ogus | Applicant |
| US6590588(B2) | 2003-07-01 | Lincke et al. | Applicant |
| US6598034(B1) | 2003-07-01 | Kloth | Applicant |
| US6600744(B1) | 2003-07-01 | Carr et al. | Applicant |
| US6611522(B1) | 2003-08-01 | Zheng et al. | Applicant |
| US6614781(B1) | 2003-09-01 | Elliott et al. | Applicant |
| US6618385(B1) | 2003-09-01 | Cousins | Applicant |
| US6625650(B2) | 2003-09-01 | Stelliga | Applicant |
| US6633835(B1) | 2003-10-01 | Moran et al. | Applicant |
| US6640184(B1) | 2003-10-01 | Rabe | Applicant |
| US6640248(B1) | 2003-10-01 | Jorgensen | Applicant |
| US6650902(B1) | 2003-11-01 | Richton | Applicant |
| US6668175(B1) | 2003-12-01 | Almgren et al. | Applicant |
| US6671589(B2) | 2003-12-01 | Holst et al. | Applicant |
| US6671732(B1) | 2003-12-01 | Weiner | Applicant |
| US6680922(B1) | 2004-01-01 | Jorgensen | Applicant |
| US6687735(B1) | 2004-02-01 | Logston et al. | Applicant |
| US6691168(B1) | 2004-02-01 | Bal et al. | Applicant |
| US6700871(B1) | 2004-03-01 | Harper et al. | Applicant |
| US6715145(B1) | 2004-03-01 | Bowman-Amuah | Applicant |
| US6728749(B1) | 2004-04-01 | Richardson | Applicant |
| US6732228(B1) | 2004-05-01 | Willardson | Applicant |
| US6741562(B1) | 2004-05-01 | Kelrouz et al. | Applicant |
| US6748070(B2) | 2004-06-01 | Kalmanek, Jr. et al. | Applicant |
| US6760309(B1) | 2004-07-01 | Rochberger et al. | Applicant |
| US6771609(B1) | 2004-08-01 | Gudat et al. | Applicant |
| US6772223(B1) | 2004-08-01 | Corl et al. | Applicant |
| US6778530(B1) | 2004-08-01 | Greene | Applicant |
| US6778546(B1) | 2004-08-01 | Epps et al. | Applicant |
| US6798776(B1) | 2004-09-01 | Cheriton et al. | Applicant |
| US6819655(B1) | 2004-11-01 | Gregson | Applicant |
| US6820117(B1) | 2004-11-01 | Johnson | Applicant |
| US6822940(B1) | 2004-11-01 | Zavalkovsky et al. | Applicant |
| US6826627(B2) | 2004-11-01 | Sjollema et al. | Applicant |
| US6832118(B1) | 2004-12-01 | Heberlein et al. | Applicant |
| US6832239(B1) | 2004-12-01 | Kraft et al. | Applicant |
| US6839731(B2) | 2005-01-01 | Alexander et al. | Applicant |
| US6839768(B2) | 2005-01-01 | Ma et al. | Applicant |
| US6845100(B1) | 2005-01-01 | Rinne | Applicant |
| US6850486(B2) | 2005-02-01 | Saleh et al. | Applicant |
| US6854009(B1) | 2005-02-01 | Hughes | Applicant |
| US6854069(B2) | 2005-02-01 | Kampe et al. | Applicant |
| US6862265(B1) | 2005-03-01 | Appala et al. | Applicant |
| US6862622(B2) | 2005-03-01 | Jorgensen | Examiner |
| US6865153(B1) | 2005-03-01 | Hill et al. | Applicant |
| US6870812(B1) | 2005-03-01 | Kloth et al. | Applicant |
| US6873600(B1) | 2005-03-01 | Duffield at al. | Applicant |
| US6879590(B2) | 2005-04-01 | Pedersen et al. | Applicant |
| US6882642(B1) | 2005-04-01 | Kejriwal et al. | Applicant |
| US6885643(B1) | 2005-04-01 | Teramoto et al. | Applicant |
| US6888806(B1) | 2005-05-01 | Miller et al. | Applicant |
| US6888807(B2) | 2005-05-01 | Heller et al. | Applicant |
| US6891839(B2) | 2005-05-01 | Albert et al. | Applicant |
| US6891842(B2) | 2005-05-01 | Sahaya et al. | Applicant |
| US6891854(B2) | 2005-05-01 | Zhang et al. | Applicant |
| US6892309(B2) | 2005-05-01 | Richmond et al. | Applicant |
| US6901484(B2) | 2005-05-01 | Doyle et al. | Applicant |
| US6904054(B1) | 2005-06-01 | Baum et al. | Applicant |
| US6904058(B2) | 2005-06-01 | He et al. | Applicant |
| US6907243(B1) | 2005-06-01 | Patel | Applicant |
| US6907462(B1) | 2005-06-01 | Li et al. | Applicant |
| US6910074(B1) | 2005-06-01 | Amin et al. | Applicant |
| US6912221(B1) | 2005-06-01 | Zadikian et al. | Applicant |
| US6914882(B2) | 2005-07-01 | Merani et al. | Applicant |
| US6917622(B2) | 2005-07-01 | McKinnon, III et al. | Applicant |
| US6920145(B2) | 2005-07-01 | Matsuoka et al. | Applicant |
| US6922724(B1) | 2005-07-01 | Freeman et al. | Applicant |
| US6928085(B2) | 2005-08-01 | Haartsen | Applicant |
| US6928471(B2) | 2005-08-01 | Pabari et al. | Applicant |
| US6934250(B1) | 2005-08-01 | Kejriwal et al. | Applicant |
| US6934752(B1) | 2005-08-01 | Gubbi | Applicant |
| US6934795(B2) | 2005-08-01 | Nataraj et al. | Applicant |
| US6937154(B2) | 2005-08-01 | Zeps et al. | Applicant |
| US6937561(B2) | 2005-08-01 | Chiussi et al. | Applicant |
| US6937566(B1) | 2005-08-01 | Forslow | Applicant |
| US6937591(B2) | 2005-08-01 | Guo et al. | Applicant |
| US6940808(B1) | 2005-09-01 | Shields et al. | Applicant |
| US6940813(B2) | 2005-09-01 | Ruutu et al. | Applicant |
| US6940832(B2) | 2005-09-01 | Saadawi et al. | Applicant |
| US6941341(B2) | 2005-09-01 | Logston et al. | Applicant |
| US6944168(B2) | 2005-09-01 | Paatela et al. | Applicant |
| US6947378(B2) | 2005-09-01 | Wu et al. | Applicant |
| US6947943(B2) | 2005-09-01 | DeAnna et al. | Applicant |
| US6947996(B2) | 2005-09-01 | Assa et al. | Applicant |
| US6950400(B1) | 2005-09-01 | Tran et al. | Applicant |
| US6950441(B1) | 2005-09-01 | Kaczmarzyk et al. | Applicant |
| US6952401(B1) | 2005-10-01 | Kadambi et al. | Applicant |
| US6952416(B1) | 2005-10-01 | Christie, IV | Applicant |
| US7023851(B2) | 2006-04-01 | Chakravorty | Applicant |
| US7095715(B2) | 2006-08-01 | Buckman et al. | Applicant |
| US7149898(B2) | 2006-12-01 | Marejka et al. | Applicant |
| US7200144(B2) | 2007-04-01 | Terrell et al. | Applicant |
| US7251242(B2) | 2007-07-01 | Schrodi | Applicant |
| US7260102(B2) | 2007-08-01 | Mehrvar et al. | Applicant |
| US7289498(B2) | 2007-10-01 | Yu et al. | Applicant |
| US7330908(B2) | 2008-02-01 | Jungck | Applicant |
| US7337236(B2) | 2008-02-01 | Bess et al. | Applicant |
| US7349422(B2) | 2008-03-01 | Duong et al. | Applicant |
| US7359321(B1) | 2008-04-01 | Sindhu et al. | Applicant |
| US7376829(B2) | 2008-05-01 | Ranjan | Applicant |
| US7408932(B2) | 2008-08-01 | Kounavis et al. | Applicant |
| US7424579(B2) | 2008-09-01 | Wheeler et al. | Applicant |
| US7433307(B2) | 2008-10-01 | Hooper et al. | Applicant |
| US7434221(B2) | 2008-10-01 | Hooper et al. | Applicant |
| US7471689(B1) | 2008-12-01 | Tripathi et al. | Applicant |
| US7477651(B2) | 2009-01-01 | Schmidt et al. | Applicant |
| US7489666(B2) | 2009-02-01 | Koo et al. | Applicant |
| US7499457(B1) | 2009-03-01 | Droux et al. | Applicant |
| US7543072(B1) | 2009-06-01 | Hertzog et al. | Applicant |
| US7590756(B2) | 2009-09-01 | Chan | Applicant |
| US2001/0030970(A1) | 2001-10-01 | Wiryaman et al. | Applicant |
| US2002/0009060(A1) | 2002-01-01 | Gross | Applicant |
| US2002/0010792(A1) | 2002-01-01 | Border | Applicant |
| US2002/0062395(A1) | 2002-05-01 | Thompson et al. | Applicant |
| US2002/0091802(A1) | 2002-07-01 | Paul et al. | Applicant |
| US2002/0122387(A1) | 2002-09-01 | Ni | Applicant |
| US2002/0122395(A1) | 2002-09-01 | Bourlas et al. | Applicant |
| US2002/0141338(A1) | 2002-10-01 | Burke | Applicant |
| US2002/0143948(A1) | 2002-10-01 | Maher | Applicant |
| US2002/0188871(A1) | 2002-12-01 | Noehring et al. | Applicant |
| US2002/0191253(A1) | 2002-12-01 | Yang et al. | Applicant |
| US2003/0004952(A1) | 2003-01-01 | Nixon et al. | Applicant |
| US2003/0016625(A1) | 2003-01-01 | Narsinh et al. | Examiner |
| US2003/0021291(A1) | 2003-01-01 | White et al. | Applicant |
| US2003/0033394(A1) | 2003-02-01 | Stine | Applicant |
| US2003/0067877(A1) | 2003-04-01 | Sivakumar | Applicant |
| US2003/0110286(A1) | 2003-06-01 | Antal et al. | Applicant |
| US2003/0112802(A1) | 2003-06-01 | Ono et al. | Applicant |
| US2003/0118107(A1) | 2003-06-01 | Itakura et al. | Examiner |
| US2003/0158963(A1) | 2003-08-01 | Sturdy et al. | Applicant |
| US2003/0189935(A1) | 2003-10-01 | Warden et al. | Applicant |
| US2003/0195983(A1) | 2003-10-01 | Krause | Applicant |
| US2003/0236828(A1) | 2003-12-01 | Rock et al. | Applicant |
| US2004/0001493(A1) | 2004-01-01 | Cloonan et al. | Applicant |
| US2004/0057437(A1) | 2004-03-01 | Daniel et al. | Applicant |
| US2004/0076161(A1) | 2004-04-01 | Lavian et al. | Applicant |
| US2004/0077345(A1) | 2004-04-01 | Turner et al. | Applicant |
| US2004/0131014(A1) | 2004-07-01 | Thompson et al. | Applicant |
| US2004/0165528(A1) | 2004-08-01 | Li et al. | Applicant |
| US2004/0172476(A1) | 2004-09-01 | Chapweske | Applicant |
| US2004/0174898(A1) | 2004-09-01 | Kadambi et al. | Applicant |
| US2004/0190451(A1) | 2004-09-01 | Dacosta | Applicant |
| US2004/0218532(A1) | 2004-11-01 | Khirman | Applicant |
| US2004/0228363(A1) | 2004-11-01 | Adamczyk et al. | Applicant |
| US2004/0252698(A1) | 2004-12-01 | Anschutz et al. | Applicant |
| US2005/0021806(A1) | 2005-01-01 | Richardson et al. | Applicant |
| US2005/0030952(A1) | 2005-02-01 | Elmasry | Applicant |
| US2005/0041669(A1) | 2005-02-01 | Cansever et al. | Applicant |
| US2005/0060427(A1) | 2005-03-01 | Phillips et al. | Applicant |
| US2005/0078672(A1) | 2005-04-01 | Caliskan et al. | Applicant |
| US2005/0157660(A1) | 2005-07-01 | Mandato et al. | Applicant |
| US2005/0169257(A1) | 2005-08-01 | Lahetkangas et al. | Applicant |
| US2005/0171932(A1) | 2005-08-01 | Nandhra | Applicant |
| US2005/0220115(A1) | 2005-10-01 | Romano et al. | Applicant |
| US2005/0232153(A1) | 2005-10-01 | Bishop et al. | Applicant |
| US2005/0249240(A1) | 2005-11-01 | Boyce et al. | Examiner |
| US2005/0281277(A1) | 2005-12-01 | Killian | Applicant |
| US2006/0039381(A1) | 2006-02-01 | Anschutz et al. | Applicant |
| US2006/0039404(A1) | 2006-02-01 | Rao et al. | Applicant |
| US2006/0104287(A1) | 2006-05-01 | Rogasch et al. | Applicant |
| US2006/0106753(A1) | 2006-05-01 | Yoon et al. | Applicant |
| US2006/0109857(A1) | 2006-05-01 | Herrmann | Applicant |
| US2006/0140121(A1) | 2006-06-01 | Kakani et al. | Applicant |
| US2006/0149845(A1) | 2006-07-01 | Malin et al. | Applicant |
| US2006/0165051(A1) | 2006-07-01 | Banerjee et al. | Applicant |
| US2006/0215593(A1) | 2006-09-01 | Wang et al. | Applicant |
| US2006/0286993(A1) | 2006-12-01 | Xie et al. | Examiner |
| US2007/0058561(A1) | 2007-03-01 | Virgile | Applicant |
| US2007/0060045(A1) | 2007-03-01 | Prautzsch | Applicant |
| US2007/0133582(A1) | 2007-06-01 | Banerjee et al. | Applicant |
| US2007/0153798(A1) | 2007-07-01 | Krstulich | Applicant |
| US2007/0153802(A1) | 2007-07-01 | Anke et al. | Examiner |
| US2007/0156919(A1) | 2007-07-01 | Potti et al. | Applicant |
| US2007/0171910(A1) | 2007-07-01 | Kumar | Applicant |
| US2007/0189327(A1) | 2007-08-01 | Konda | Applicant |
| US2007/0206506(A1) | 2007-09-01 | Purpura | Applicant |
| US2007/0253412(A1) | 2007-11-01 | Batteram et al. | Applicant |
| US2007/0263616(A1) | 2007-11-01 | Castro et al. | Applicant |
| US2007/0275728(A1) | 2007-11-01 | Lohr et al. | Applicant |
| US2007/0291656(A1) | 2007-12-01 | Knazik et al. | Applicant |
| US2007/0291751(A1) | 2007-12-01 | Smith et al. | Applicant |
| US2007/0291766(A1) | 2007-12-01 | Knazik et al. | Applicant |
| US2008/0065808(A1) | 2008-03-01 | Hoese et al. | Applicant |
| US2008/0144493(A1) | 2008-06-01 | Yeh | Applicant |
| US2008/0293413(A1) | 2008-11-01 | Sharif-Ahmadi et al. | Examiner |
| US2009/0161741(A1) | 2009-06-01 | Ginis et al. | Applicant |
| EP853404 | 1998-07-01 | Applicant | |
| EP886454 | 1998-12-01 | Applicant | |
| EP1052816 | 2000-11-01 | Applicant | |
| EP1052816(A2) | 2000-11-01 | Applicant | |
| EP1193938 | 2002-04-01 | Applicant | |
| EP1193938(A1) | 2002-04-01 | Applicant | |
| EP1300991 | 2003-04-01 | Applicant | |
| EP1300991(A1) | 2003-04-01 | Applicant | |
| EP1575224 | 2005-02-01 | Applicant | |
| EP1648125 | 2006-04-01 | Applicant | |
| WO174027 | 2001-10-01 | Applicant | |
| WO230066 | 2002-04-01 | Applicant | |
| WO230066(A1) | 2002-04-01 | Applicant | |
| WO3053013 | 2003-06-01 | Applicant | |
| WO2004023323 | 2004-03-01 | Applicant | |
| WO2004036845 | 2004-04-01 | Applicant | |
| WO2005076539 | 2005-08-01 | Applicant | |
| WO2006001155 | 2006-07-01 | Applicant | |
| WO2006071155 | 2006-07-01 | Applicant | |
| WO2006071155(A1) | 2006-07-01 | Applicant | |
| WO2007149165 | 2007-02-01 | Applicant | |
| WO2007149166 | 2007-02-01 | Applicant | |
| WO2007130414 | 2007-11-01 | Applicant | |
| WO2007130415 | 2007-11-01 | Applicant | |
| WO2007147032 | 2007-12-01 | Applicant | |
| WO2007147040 | 2007-12-01 | Applicant | |
| WO2007149769 | 2007-12-01 | Applicant | |
| WO2007149805 | 2007-12-01 | Applicant | |
| WO2007147032(A1) | 2007-12-01 | Applicant | |
| WO2007147040(A2) | 2007-12-01 | Applicant | |
| WO2007149769(A2) | 2007-12-01 | Applicant | |
| WO2007149805(A2) | 2007-12-01 | Applicant | |
| WO2008008865 | 2008-01-01 | Applicant | |
| WO2008008865(A2) | 2008-01-01 | Applicant | |
| WO2008016845 | 2008-02-01 | Applicant | |
| WO2008016846 | 2008-02-01 | Applicant | |
| WO2008016848 | 2008-02-01 | Applicant | |
| WO2008016850 | 2008-02-01 | Applicant | |
| WO2008016845(A1) | 2008-02-01 | Applicant | |
| WO2008016846(A2) | 2008-02-01 | Applicant | |
| WO2008016848(A2) | 2008-02-01 | Applicant | |
| WO2008016850(A2) | 2008-02-01 | Applicant |
Non-Patent Literature (134)
- Bakre A. V. et al: “Implementation and Performance Evaluation of Indirect TCP” IEEE Transactions on Computers, vol. 46, No. 3, Mar. 1997.Applicant
- Chao, H-L, et al.: “Fair Scheduling with QoS Support in Wireless Ad Hoc Networks,” IEEE Transactions on Wireless Communications, vol. 3, No. 6, Nov. 2004.Applicant
- Information Sciences Institute, University of Southern California, “Internet Protocol DARPA Internet Program Protocol Specification,” IETF Standard, Internet Engineering Task Force, IETF, CH, Sep. 1981.Applicant
- Madubata, C.D.: “Prioritization of the Joint Battle Space Infosphere (JBI) Traffic and Priority with Reciprocity CAC Protocol for the JBI Network,” System Theory, 2006 Proceeding of the Thirty-Eighth Southeastern Symposium on Mar. 5, 2006.Applicant
- Orda, A. et al.: “Routing with Packet Duplication and Elimination in Computer Networks,” IEEE Transactions on Communications, vol. 36, No. 7, Jul. 1988.Applicant
- Pancha, P., et al.: “A Delay-Minimizing Service Policy with Guaranteed Bandwidth for Real-Time Traffic,” Internet Article, Aug. 23, 1995.Applicant
- Perkins, Charles E., et al.: “Quality of Service for Ad hoc On-Demand Distance Vector Routing draft-perkins-manet-aodvqos-01.txt,” IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, Ch. No. 1, Oct. 14, 2003.Applicant
- Robles, Tomas, et al.: “QoS Support for an All-IP System Beyond 3G,” IEEE Communications Magazine, vol. 39, No. 8, Aug. 2001.Applicant
- Schoenwaelder, J., “Overview of the 2002 IAB Network Management Workshop,” IETF Standard, Internet Engineering Task Force, May 2003.Applicant
- Xue, Jianbo, et al.: “ASAP: An Adaptive QoS Protocol for Mobile Ad Hoc Networks,” Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 203. 14th IEEE Proceedings on Sep. 7-10, 2003, vol. 2, Sep. 7, 2003.Applicant
- International Search Report and Written Opinion, dated Dec. 12, 2007, for International application No. PCT/US2007/071177, filed Jun. 14, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 29, 2008, for International application No. PCT/US2007/071191, filed Jun. 14, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 17, 2008, for International application No. PCT/US2007/071273, filed Jun. 14, 2007.Applicant
- International Search Report and Written Opinion, dated Dec. 12, 2007, for International application No. PCT/US2007/071440, filed Jun. 18, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 2, 2008, for International application No. PCT/US2007/073301, filed Jul. 12, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 15, 2008, for International application No. PCT/US2007/074577, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 24, 2008, for International application No. PCT/US2007/074587, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Feb. 6, 2008, for International application No. PCT/US2007/074592, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 22, 2008, for International application No. PCT/US2007/074599, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Mar. 14, 2008, for International application No. PCT/US2007/011649, filed May 15, 2007.Applicant
- Office Action, dated Apr. 2, 2008, for U.S. Appl. No. 11/416,057, filed May 2, 2006.Applicant
- Office Action, dated Apr. 4, 2008, for U.S. Appl. No. 11/415,914, filed May 5, 2006.Applicant
- “CCSDS File Delivery Protocol (CFDP)—Part 1—Introduction and Overview” (CCSDS 720.1-G-2—Green Book, Sep. 2003).Applicant
- “CCSDS File Delivery Protocol (CFDP) Part 2—Implementers Guide” (CCSDS 720.2-G-2, Green Book, Sep. 2003).Applicant
- Gao et al., “Performance Evaluation of the CCSDS File Delivery Protocol—Latency and Storage Requirement”, Dec. 10, 2004.Applicant
- Information Sciences Institute, University of Southern California, “Internet Protocol DARPA Internet Program Protocol Specification,” IETF Standard, Internet Engineering Task Force, IETF, CH, Sep. 1981.Applicant
- International Preliminary Report on Patentability dated Feb. 6, 2008 for International Application No. PCT/US2007/071269 filed Jun. 14, 2007 .Applicant
- International Search Report and Written Opinion dated Apr. 28, 2008 for International Application No. PCT/US07/11650 filed May 15, 2007.Applicant
- International Search Report and Written Opinion dated Apr. 28, 2008 for International Application No. PCT/US07/10559 filed May 1, 2007.Applicant
- International Search Report and Written Opinion dated Apr. 29, 2008 for International Application No. PCT/US07/10558 filed May 15, 2007.Applicant
- International Search Report and Written Opinion dated Jun. 5, 2008 for International Application No. PCT/US07/11651 filed May 15, 2007.Applicant
- International Search Report and Written Opinion, dated Dec. 12, 2007, for International Application No. PCT/US2007/071177, Filed Jun. 14, 2007.Applicant
- International Search Report and Written Opinion, dated Dec. 12, 2007, for International Application No. PCT/US2007/071440, filed Jun. 18, 2007.Applicant
- International Search Report and Written Opinion, dated Feb. 6, 2008, for International Application No. PCT/US2007/074592, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 15, 2008 for International Application No. PCT/US2007/074577, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 17, 2008, for International Application No. PCT/US2007/071273, filed Jun. 14, 1997.Applicant
- International Search Report and Written Opinion, dated Jan. 2, 2008, for International Application No. PCT/US2007/073301, filed Jul. 12, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 22, 2008, for International Application No. PCT/US2007/074599, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 24, 2008, for International Application No. PCT/US2007/074587, filed Jul. 27, 2007.Applicant
- International Search Report and Written Opinion, dated Mar. 14, 2008, for International Application No. PCT/US2007/011649 filed May 15, 2007.Applicant
- International Search Report and Written Opinion, dated Jan. 29, 2008, for International Application No. PCT/US2007/071191. filed Jun. 14, 1997.Applicant
- International Search Report and Written Opinion, dated Jan. 2, 2008 for International Application No. PCT/US2007/073301, filed Jul. 12, 2007.Applicant
- Lee, et al., “Expected File-Delivery Time of Deferred NAK ARQ in CCSDS File-Delivery Protocol”, Aug. 2004, IEEE Transactions on Communications, vol. 52 Issue 8. pp. 1408-1416.Applicant
- Madubata, C.D.: “Prioritization of the Joint Battle Space Infosphere (JBI) Traffic and Priority with Reciprocity CAC Protocol for the JBI Network,” System Theory, 2006 Proceeding of the Thirty-Eighth Southeastern Symposium on Mar. 5, 2006.Applicant
- Office Action dated Apr. 23, 2008, for U.S. Appl. No. 11/416,043, filed May 2, 2006.Applicant
- Office Action dated Oct. 20, 2008, for U.S. Appl. No. 11/416,043, filed May 2, 2006.Applicant
- Office Action dated Dec. 22, 2008, for U.S. Appl. No. 11/425,021, filed Jun. 19, 2006.Applicant
- Office Action dated Jan. 5, 2009, for U.S. Appl. No. 11/425,281, filed Jun. 20, 2006.Applicant
- Office Action dated Jan. 30, 2009, for U.S. Appl. No. 11/425,289, filed Jun. 20, 2006.Applicant
- Office Action dated Feb. 5, 2009, for U.S. Appl. No. 11/436,912, filed May 18, 2006.Applicant
- Office Action dated May 21, 2008, for U.S. Appl. No. 11/436,912, filed May 18, 2009.Applicant
- Office Action dated Oct. 16, 2008, for U.S. Appl. No. 11/436,912, filed May 18, 2006.Applicant
- Office Action dated Apr. 1, 2009, for U.S. Appl. No. 11/454,206, filed Jun. 16, 2006.Applicant
- Office Action dated May 30, 2008, for U.S. Appl. No. 11/454,206, filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 11, 2008, for U.S. Appl. No. 11/454,206, filed Jun. 16, 2006.Applicant
- Office Action dated May 30, 2008, for U.S. Appl. No. 11/454,219, filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 15, 2008, for U.S. Appl. No. 11/454,219, filed Jun. 16, 2006.Applicant
- Office Action dated Nov. 25, 2008, for U.S. Appl. No. 11/454,220, filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 4, 2008, for U.S. Appl. No. 11/454,662, filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 29, 2008, for U.S. Appl. No. 11/457,662, filed Jul. 14, 2006.Applicant
- Office Action dated Nov. 13, 2008, for U.S. Appl. No. 11/461,082, filed Jul. 31, 2006.Applicant
- Office Action dated Mar. 6, 2009, for U.S. Appl. No. 11/471,923, filed Jun. 21, 2006.Applicant
- Office Action dated Oct. 17, 2008, for U.S. Appl. No. 11/416,057, filed May 2, 2006.Applicant
- Office Action dated Feb. 9, 2009, for U.S. Appl. No. 11/416,057, filed May 2, 2006.Applicant
- Office Action dated Apr. 2, 2008, for U.S. Appl. No. 11/416,057, filed May 2, 2006.Applicant
- Office Action dated Apr. 2, 2009, for U.S. Appl. No. 11/415,914, filed May 5, 2006.Applicant
- Office Action dated Oct. 20, 2008, for U.S. Appl. No. 11/415,914, filed May 5, 2006.Applicant
- Office Action dated Apr. 2, 2008, for U.S. Appl. No. 11/415,914, filed May 5, 2006.Applicant
- Office Action dated Apr. 21, 2009, for U.S. Appl. No. 11/454,220, filed Jun. 16, 2006.Applicant
- Orda, A. et al.,: “Routing with Packet Duplication and Elimination in Computer Networks,” IEEE Transactions on Communications, vol. 36, No. 7, Jul. 1988.Applicant
- Pancha, P. et al.: “A Delay-Minimizing Service Policy with Guaranteed Bandwidth for Real-Time Traffic,” Internet Article, Aug. 23, 1995.Applicant
- Perkins, Charles E., et al.: “Quality of Service for Ad hoc On-Demand Distance Vector Routing draft-perkins-manet-aodvqos-01.txt,” IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, Ch. No. 1, Oct. 14, 2003.Applicant
- Robles, Tomas et al.: “QoS Support for an AII-IP System Beyond 3G,” IEEE Communications Magazine, vol. 39, No. 8, Aug. 2001.Applicant
- Schoenwaelder, J., “Overview of the 2002 IAB Network Management Workshop,” IETF Standard, Internet Engineering Task Force, May 2003.Applicant
- Tactical Data Network (TDN). USMC Concepts + Programs 2003. p. 140.Applicant
- Xue, Jianbo, et al.: “ASAP: An Adaptive QoS Protocol for Mobile Ad Hoc Networks,” Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 203. 14th IEEE Proceedings on Sep. 7-10, 2003, vol. 2, Sep. 7, 2003.Applicant
- Office Action dated Apr. 27, 2009 for U.S. Appl. No. 11/416,043.Applicant
- Consultative Committee for Space Data Systems, “CCSDS File Delivery Protocol (CFDP)—Part 2—Implementers Guide,” CCSDS 720.2-G-2 - Green Book, Sep. 2003.Applicant
- Akimeka, “LLC - Mobile Modular Command Center (M2C2) Advanced Technologies Training Program (ATTP) Final Analysis Report,” 2004.Applicant
- Ali et al., “Solider Network Extension (SNE) On-The-Move Satellite Communications (SATCOM) for Army Tactical Battalion-Level Network Healing and Thickening,” Oct. 2007.Applicant
- Applecore, “What are APIs, why use them, how to use them, and how to find out more,” pp. 1-3, May 2005.Applicant
- Barker, “Overcoming the Data-Scale Management Challenge in Large Dynamic Networks,” Military Communications Conference, Milcom 2005, IEEE; pp. 1-7, Oct. 2005.Applicant
- Laurie, “DLL Files in WindowS—What Are They?,” pp. 1-2, 2004.Applicant
- Lee et al., “Expected File-Delivery Time of Deferred NAK ARQ in CCSDS File-Delivery Protocol,” IEEE Transactions on Communications, vol. 52, Issue 8, pp. 1408-1416, Aug. 2004.Applicant
- Zheng et al., “Group-Mobility-Aware Spectrum Management for Future Digital Battlefields,” Military Communications Conference, 2006, MILCOM 2006, IEEE; pp. 1-7, Oct. 2006.Applicant
- Floyd et al., “Link-sharing and Resource Management Models for Packet Networks,” IEEE/ACM Transactions on Networking, vol. 3, No. 4, all pages, Aug. 1995.Applicant
- Chan, “Precedence Based Admission Control and Preemption in IP Networks,” Military Communications Conference, 2006, MILCOM 2006, IEEE, pp. 1-7, Oct. 2006.Applicant
- Advisory Action dated Jan. 12, 2010, for U.S. Appl. No. 11/454,206 filed Jun. 16, 2006.Applicant
- Office Action dated Oct. 13, 2009 for U.S. Appl. No. 11/471,923 filed Jun. 21, 2006.Applicant
- Office Action dated Jan. 5, 2009, for U.S. Appl. No. 11/425,281 filed Jun. 20, 2006.Applicant
- Office Action dated Jun. 5, 2009, for U.S. Appl. No. 11/416,057 filed May 2, 2006.Applicant
- Office Action dated Jun. 10, 2009, for U.S. Appl. No. 11/454,517 filed Jun. 16, 2006.Applicant
- Office Action dated Jul. 1, 2009, for U.S. Appl. No. 11/425,281 filed Jun. 20, 2006.Applicant
- Office Action dated Jul. 15, 2009, for U.S. Appl. No. 11/454,219 filed Jun. 16, 2006.Applicant
- Office Action dated Oct. 5, 2009, for U.S. Appl. No. 11/496,107 filed Jul. 31, 2006.Applicant
- Office Action dated Oct. 13, 2009, for U.S. Appl. No. 11/454,219 filed Jun. 16, 2006.Applicant
- Office Action dated Oct. 15, 2009, for U.S. Appl. No. 11/425,281 filed Jun. 20, 2006.Applicant
- Office Action dated Dec. 30, 2009, for U.S. Appl. No. 11/416,057 filed May 2, 2006.Applicant
- Office Action dated May 27, 2009, for U.S. Appl. No. 11/454,662 filed Jun. 16, 2006.Applicant
- Office Action dated Sep. 18, 2009 for U.S. Appl. No. 11/454,662 filed Jun. 16, 2006.Applicant
- Office Action dated May 13, 2009 for U.S. Appl. No. 11/424,635 filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 10, 2009 for U.S. Appl. No. 11/424,635 filed Jun. 16, 2006.Applicant
- Office Action dated Oct. 13, 2009 for U.S. Appl. No. 11/416,043 filed May 2, 2006.Applicant
- Office Action dated Sep. 15, 2009 for U.S. Appl. No. 11/454,220 filed Jun. 16, 2006.Applicant
- Office Action dated May 1, 2009 for U.S. Appl. No. 11/461,052 filed Jul. 31, 2006.Applicant
- Office Action dated Dec. 15, 2009 for U.S. Appl. No. 11/461,052 filed Jul. 31, 2006.Applicant
- Office Action dated Jun. 25, 2009 for U.S. Appl. No. 11/461,082 filed Jul. 31, 2006 .Applicant
- Office Action dated Oct. 28, 2009 for U.S. Appl. No. 11/461,082 filed Jul. 31, 2006.Applicant
- Office Action dated Jun. 10, 2009 for U.S. Appl. No. 11/425,289 filed Jun. 20, 2006.Applicant
- Office Action dated Jun. 10, 2009 for U.S. Appl. No. 11/454,519 filed Jun. 16, 2006.Applicant
- Office Action dated Dec. 30, 2009 for U.S. Appl. No. 11/454,519 filed Jun. 16, 2006.Applicant
- Office Action dated Jul. 1, 2009 for U.S. Appl. No. 11/436,912 filed May 18, 2006.Applicant
- Office Action dated Jan. 6, 2010 for U.S. Appl. No. 11/436,912 filed May 18, 2006.Applicant
- Office Action dated Jul. 21, 2009 for U.S. Appl. No. 11/457,662 filed Jul. 14, 2006.Applicant
- Office Action dated Dec. 30, 2009 for U.S. Appl. No. 11/457,662 filed Jul. 14, 2006.Applicant
- Office Action dated Jun. 1, 2009 for U.S. Appl. No. 11/461,242 filed Jul. 31, 2006.Applicant
- Office Action dated Dec. 30, 2009 for U.S. Appl. No. 11/461,242 filed Jul. 31, 2006.Applicant
- Office Action dated Oct. 26, 2009 for U.S. Appl. No. 11/454,206 filed Jun. 16, 2006.Applicant
- Office Action dated Jan. 5, 2010 for U.S. Appl. No. 11/454,517 filed Jun. 16, 2006.Applicant
- Office Action dated Aug. 31, 2009 for U.S. Appl. No. 11/415,914 filed May 2, 2006.Applicant
- Office Action dated Jun. 15, 2009 for U.S. Appl. No. 11/425,021 filed Jun. 19, 2006.Applicant
- Office Action dated Mar. 16, 2010 for U.S. Appl. No. 11/454,220 filed Jun. 16, 2006.Applicant
- Office Action dated Mar. 18, 2010 for U.S. Appl. No. 11/496,107 filed Jul. 31, 2006.Applicant
- Office Action dated Mar. 12, 2010 for U.S. Appl. No. 11/416,057 filed May 2, 2006.Applicant
- Office Action dated Mar. 15, 2010 for U.S. Appl. No. 11/454,519 filed Jun. 16, 2006.Applicant
- Office Action dated Mar. 15, 2010 for U.S. Appl. No. 11/454,662 filed Jun. 16, 2006.Applicant
- Office Action dated Mar. 16, 2010 for U.S. Appl. No. 11/461,242 filed Jul. 31, 2006.Applicant
- Office Action dated Jan. 28, 2010 for U.S. Appl. No. 11/454,219 filed Jun. 16, 2006.Applicant
- Office Action dated Mar. 31, 2010 for U.S. Appl. No. 11/454,517 filed Jun. 16, 2006.Applicant
- International Preliminary Report for PCTUS200707/436 dated Oct. 10, 2008.Applicant
- ISR for PCTUS200707/436 dated Nov. 9, 2007.Applicant
- Written Opinion of ISR for PCTUS200707/436 dated Nov. 9, 2007.Applicant
- Extended European Search Report for PCTUS2007010558 dated Apr. 12, 2009.Applicant
- International Search Report for PCTUS2007011651 dated Mar. 16, 2010.Applicant