Lockheed Martin Corporation

Ishan Prabhath Weerakoon

Scott Charles Evans

Ping Liu

Suresh K Iyer

Giri Kuthethoor

Harold Woodruff Tomlinson, Jr

Sergei Ivanovich Dolinsky

Thomas Stephen Markham

Budhaditya Deb

Prakash M Sesha

Harold T Tomlinson

Mei Ngan

A method and apparatus for routing communications using end-to-end QoS reservations based on node mobility profiles is disclosed. The method may include setting up active quality of service reservations along a first path to a destination edge node, receiving a mobility profile from the destination edge node, setting up passive quality of service reservations based on the received mobility profile, switching communications from active quality of service reservations to passive quality of service reservations, and tearing down the active quality of service reservations based on the received mobility profile.

Method and apparatus for routing communications using active and passive end-to-end quality-of-service reservations based on node mobility profiles

A method and apparatus that provides quality of service in wireless or sensor networks is disclosed. The method may include determining a class of service for transmission of one or more messages, adjusting a maximum packet length based on the determined class of service, allocating message time slots based on the determined class of service, setting a guard band size and frequency of resynchronization, and transmitting one or more messages using the adjusted maximum packet length, the allocated message time slots, and the set guard band size and frequency of resynchronization.

Method and apparatus for providing quality of service in wireless networks and sensor networks

An information disseminating apparatus that transmits information between nodes of a network while expending minimal or no network bandwidth for transmitting the information. The apparatus can include a message processor that generates or receives a message to be transmitted from a first note to a second node in the network, and a transmitter that transmits data packets in a sequence that represents the message from the first node to the second node. The apparatus may further include a plurality of queues each associated with a class and services one or more data packets each having a marker that corresponds to the class, and a queue processor that dequeues the data packets from the queues in accordance to the sequence and the class associated with each of the queues.

Information dissemination method and system having minimal network bandwidth utilization

A method () and apparatus () for local adaptive provisioning at a node is disclosed. The method may include determining () a per packet latency for a class of packet network traffic in a queue of a plurality of queues for a plurality of classes of packet network traffic at a node, establishing () a reward function for the class of packet network traffic based on a packet latency limit, based on the per packet latency, and based on a source rate for the class of packet network traffic, and adjusting () provisioning of a queue at the node based on the reward function.

Method and apparatus for local adaptive provisioning at a node

A method and apparatus for biasing of network node packet prioritization based on packet content. The method may include marking a packet of data from a data stream of packets. The packet can be marked with a packet type such that subsequent nodes determine the relative priority of the packet with respect to other packets from the same data stream based on the packet type marking. The marked packet can then be transmitted. According to a related corresponding embodiment, a method can include receiving a packet at a node in a network, the node including a plurality of packet queues including a higher priority queue and a lower priority queue. The relative priority of the packet can be determined relative to other packets from the same packet source and intended for the same destination, where the relative priority can be based on the contents of the packet. The relative priority may also be based on a marking of the packet. The packet can be assigned to a higher priority queue based on a higher relative priority of the packet. The assigned packet can then be transmitted.

Growing community of inventors

Rockville, MD, United States of America

Ishan Prabhath Weerakoon