Raytheon Bbn Technologies Corp.

Verizon Corporate Services Group Inc.

Verizon Patent and Licensing Inc.

Bbnt Solutions Llc.

Other

Bbn Technologies Corporation

Gte Internetworking Incorporated

Bbn Corporation

Gregory Donald Troxel

Walter Clark Milliken

Subramanian Ramanathan

Christine Elaine Jones

Laura Jane Poplawski Ma

Stephen Henry Polit

Gwendolyn Jean Gesler

Frank Kastenholtz

Brig Barnum Elliott

David Spencer Pearson

David Patrick Mankins

Gregory Stephen Lauer

Karen Z Haigh

David Paul Wiggins

A system comprising a plurality of nodes forming a network and a link-state packet capable of being transmitted by a source node in the network to a destination node in the network over a communication link; wherein the source node subtracts a transmission cost associated with the communication link from a time-to-live value associated with the link-state packet prior to transmitting the link-state packet to the destination node. Each node in the network may be configured to use a routing protocol, such as a no-sight routing protocol, to assign the transmission cost to the communication link.

Variable translucency no-sight routing for ad-hoc networks

A method, apparatus and computer program product for non-uniform per-packet priority marking for use with adaptive protocols is presented. A packet is received at a first network device, the packet assigned to a priority band. A priority is determined for the packet between a lowest priority of the priority band and a highest priority of the priority band, the priority for the packet selected based on a target distribution of priorities within the priority band, the target distribution comprising a distribution selected to achieve a desired capacity relationship among groups of packets assigned to different priority bands. The selected priority is assigned to the packet.

Non-uniform per-packet priority marker for use with adaptive protocols

A packet is classified into a class. A priority value is assigned to the packet wherein packets in a flow are assigned priorities according to some probability distribution within some band. A determination is made, at a network device for a highest latency class, whether a sum of queued packet sizes of previously received packets having an equal or smaller latency class than the packet and larger or equal priority than the packet is larger than a threshold value. When the sum is larger, the packet is dropped, otherwise a determination is made whether a latency class of the packet is less than the latency class of the network device. When the latency class is not less, the packet is stored in a queue for the latency class. When the latency class is less, then the process is repeated until the packet is dropped or stored in a queue.

Method and apparatus providing precedence drop quality of service (PDQoS) with class-based latency differentiation

A method and apparatus for receiving a group of data messages via a network is provided. A data message is received via the network (). A determination is made regarding whether the data message has an associated valid integrity check value (). When the data message is determined to have the associated valid integrity check value, a determination is made regarding whether a specific number of data messages has been received with associated valid integrity check values (). When the specific number of the data messages is determined to have been received with associated valid integrity check values, the data message is accepted ().

Integrity checking at high data rates

The disclosed technology provides a system and method of synchronizing cryptographic operation between a transmitter and a receiver. A transmitter can communicate encrypted data to a receiver according to a first communications protocol, and communicate a transmitter number and a portion of the encrypted data to the receiver according to a second communications protocol. The receiver can be in communication with a memory space containing locations that are each associated with an encrypted data and that can contain a previous receiver number. The receiver can receive transmitted encrypted data and an associated transmitter number and can search the memory space to find a location wherein the encrypted data associated with the location is entirely, or in part, the same as the transmitted encrypted data. When such a location is found, the receiver can compare the transmitter number with the previous receiver number stored in the location.

Packet-based and pseudo-packet-based cryptographic synchronization systems and methods

The disclosed technology provides a system and method of securely communicating data. An encryptor located at a transmitter can provide encrypted data to the transmitter. The transmitter can maintain a packet number indicating a particular packet for carrying the encrypted data and a sub-packet number indicating a position within the packet where the encrypted data is to be stored. The encryptor can produce the encrypted data using an encryptor seed generated based on the packet number and sub-packet number. A receiver can maintain a receiver packet number indicating a number of previously received packets and can compute a receiver sub-packet number. The receiver can receive a packet containing encrypted data and can decrypt the encrypted data using a decryptor seed generated based on the receiver packet number and sub-packet number.

Packet-based and pseudo-packet based cryptographic communications systems and methods

This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.

Systems and methods for queue management in packet-switched networks

A system comprising a plurality of nodes forming a network, the plurality of nodes comprising source nodes and destination nodes; wherein a propagation limit restricts the travel of link-state information transmitted by the sources nodes to a subset of destination nodes within the network. A network-layer protocol provided at a layer above that of the network facilitates communication between nodes within and outside of this subset of nodes.

No-sight routing for ad-hoc networks

Variable translucency no-sight routing for AD-HOC networks

Systems, devices, and methods for routing data through a first and a second ad-hoc network are described. Routing information structured according to a first routing protocol associated with a plurality of nodes in the first network is received at a border node that is part of at least the first and second ad-hoc networks. Routing information structured according to a second routing protocol associated with a plurality of nodes in the second ad-hoc network is also received. The received routing information is translated from the first routing protocol to the second routing protocol, or vice versa, and disseminated to nodes in the first or second ad-hoc networks. Data packets from nodes in the first ad-hoc network are forwarded to nodes in the second ad-hoc network, or vice versa, based in part on the translated routing information.

System, device, and method for unifying differently-routed networks using virtual topology representations

A system stores pedigrees that include details of how and when each of multiple blocks of encryption key material were distributed between two endpoints using quantum cryptographic techniques. The system receives an indication of a possible quantum cryptographic security violation and accesses the stored pedigrees to identify one or more of the multiple blocks of encryption key material that may have been compromised.

Pedigrees for quantum cryptography

The invention enables hosts that do not share a network prefix to communicate in the event the hosts are unable to communicate with a router.

Growing community of inventors

Stow, MA, United States of America

Gregory Donald Troxel