Packeteer, Inc.

Metricom, Inc.

Cisco Systems Inc.

Airespace, Inc.

Companyons, Inc.

Metricon, Inc.

Brett D Galloway

George H Flammer

Sudhir Kumar Jain

Robert J Friday

Paul F Dietrich

Patrice R Calhoun

Robert B O'Hara, Jr

Mark Hill

Robert L Packer

Anne Cesa Klein

David Anthony Frascone

Scott Andrew Hankins

Michael J Quinn

David L Paulsen

Michael W Ritter

Navin Goel

John Bettendorff

Paolo Perazzo

Ted Thi

Robert P Dilworth

Richard H Fox

George Powers

Contextual messaging systems and message implemented through a mobile device associated with a sender of a message include composing a message to a recipient via a messaging application; selecting one or more unique characters or pictures to trigger one or more of functionality, an application, or a service on a mobile device associated with the recipient; selecting one or more additional details subsequent to selecting the one or more unique characters or pictures, wherein the one or more additional details are used in the functionality, application or service; and sending the message to a mobile device associated with the recipient with the one or more unique characters or pictures and the one or more additional details. The mobile device is configured to receive the message and automatically perform one or more actions based on the one or more unique characters or pictures and the one or more additional details.

Contextual messaging systems and methods

A method and system for controlling network traffic with different tags within the same connection by applying policies for each tag are disclosed. A method is disclosed in which incoming traffic is received. A traffic class is assigned to the traffic class. Outgoing traffic is controlled based on the assigned policy for the incoming traffic.

Method and system for controlling network traffic within the same connection with different packet tags by varying the policies applied to a connection

Methods, apparatuses and systems facilitating location or containment of rogue or unauthorized access points on wireless computer network environments. Embodiments of the present invention support one to a plurality of rogue containment methodologies. A first rogue containment type involves identification of the physical connection of the rogue access point to the wired network infrastructure and, thus, allows for disabling of that physical connection to contain the rogue access point. Other rogue containment methods involve wireless techniques for containing the effect of rogue access points. In some embodiments, the present invention provides methods, apparatuses and systems facilitating network location of rogue access points to determine whether one or more rogue containment methodologies should be applied. As discussed below, the rogue location and containment functionality described herein can be applied to a wide variety of wireless network system architectures.

Discovery of rogue access point location in wireless network environments

A system and method for dynamically controlling a rogue application through incremental bandwidth restrictions is disclosed. A network connection supporting a flow of network traffic in a distributed computing environment is monitored. The network traffic flow includes a stream of data packets generated by a rogue application. Bandwidth allocated to the monitored network connection is incrementally adjusted until the flow of the network traffic for the rogue application achieves a steady state of bandwidth restriction. The flow of subsequent network traffic over the monitored network connection is controlled at the steady state of bandwidth restriction.

System and method for dynamically controlling a rogue application through incremental bandwidth restrictions

Methods, apparatuses and systems facilitating hierarchical network traffic classification and resource allocation schemes. In one embodiment, the present invention provides traffic classification data structure facilitating creation and configuration of multi-dimensional, hierarchical network resource allocation schemes. The present invention features a hierarchical network traffic classification scheme that allows users to logically embed (or otherwise associate) one or more reference trees within selected traffic class nodes of a given traffic classification tree. In one embodiment, an administrator can create a pool of referenceable traffic classification trees and select such trees or sub-trees from the pool to achieve a variety of different traffic classification configurations. The present invention, in one embodiment, also facilitates the implementation of a system or domain-level workflow interface that features managed access links as configurable objects as opposed to the network devices operating on the access links.

Classification data structure enabling multi-dimensional network traffic classification and control schemes

A method and system for controlling network traffic with different tags within the same connection by applying policies for each tag are disclosed. A method is disclosed in which incoming traffic is received. A traffic class is assigned to the incoming traffic. A policy is assigned to the incoming traffic based on the assigned traffic class. Outgoing traffic is controlled based on the assigned policy for the incoming traffic.

Methods, apparatuses and systems facilitating the distribution of updated traffic identification functionality to bandwidth management devices. The present invention, in one embodiment, allows for automatic updates to the traffic identification functionality implemented by bandwidth management devices eliminating the cumbersome upgrade processes required by prior art methods and systems. The present invention, in one embodiment, also provides a system facilitating management of upgrades for multiple bandwidth management devices.

Methods, apparatuses and systems facilitating distribution of updated traffic identification functionality to bandwidth management devices

In a packet telecommunications environment, a method is provided for end to end explicit rate control through a plurality of heterogeneous internetworked networking topologies comprising networks without explicit rate signaling, such as TCP/IP based LAN subnets, and networks with explicit network layer rate signaling, such as Frame Relay permanent or switched virtual circuits (PVC/SVC) or ATM available bit rate (ABR) services by reallocating bandwidth in a partition using a Committed Information Rate of the portion comprising the virtual circuits for a partition size. In specific embodiments, the invention may exist as an integrated device, such as an enhanced FRAD, or a bandwidth management device, which detects congested network conditions from information obtained indirectly from a FRAD or network edge device using techniques such as reading the network edge device's MIB.

Method for data rate control for heterogenous or peer internetworking

A method for pacing data flows in packet switched networks by arranging data transmission over a period of time based upon a set of ascertainable factors about the underlying transmission link to derive an intersegment transmission interval. The intersegment transmission interval can be used to pace either data packets or acknowledgment packets. The method is especially useful for pacing the transmission of data in a digital data packet communication environment having a plurality of digital packet transmission stations inter-connectable in a data path and employing the Transmission Control Protocol (TCP) suite.

Method for pacing data flow in a packet-based network

In a local network connected to other networks which employ an Internet Protocol, and wherein the local network includes nodes which cannot monitor all other nodes in the local network, an Internet Protocol address of a target node in the local network is translated at a gateway node in the local network to a network-specific local address of the target node without the use of broadcasting. The network specific local address of the target node is the address which is usable within the local network for forwarding a packet to the target node.

Method for translating internet protocol addresses to other distributed

In a packet communication system, loose source routing is employed to permit communication over networks of disparate types, including geographic and path-unaware types. No information resides on a wired access point (WAP). All of the intelligence of the system resides in Name Servers, which provide opaque addresses that end nodes (radios) in a wireless cloud can use to send packets to other end nodes (radios) in other wireless clouds. (A cloud is the set of radios serviced by a particular WAP.) According to the invention, the method employs an ordered list called a path and the network address of a packet consists of such an ordered list of addresses with a 'marker' that flags the current destination of the packet and a 'direction bit' that tells which direction on the list the next destination is. Each address in the path is type-length-value (TLV) encoded. The address has preferably a 4 bit 'type' field, followed by a 4 bit 'length' field (indicating length in words) of the value, and then the actual 'value' of the address. Each address describes a 'place' that the packet must 'visit.' These 'places' may be areas which a packet must traverse, and not necessarily actual node addresses.

Method of loose source routing over disparate network types in a packet

In a wireless packet communication system having a plurality of nodes, each having a transmitter and a receiver, the receiver at each node is assigned a seed value and is provided with a channel punchout mask. A node uses its seed value and punchout mask to generate a specific randomly ordered channel hopping band plan on which to receive signals. A node transmits its seed value and punchout mask to target nodes with which it wants to establish communication links, and those target nodes each use the seed value and punchout mask to generate the randomly ordered channel hopping band plan for that node. Subsequently, when one of the target nodes wish to transmit to the node, the target node changes frequency to the frequency of the node according to that node's band plan.

Method for frequency sharing and frequency punchout in frequency hopping

A microcellular digital packet communication system is provided for digital communication having a plurality of repeating packet-mode fixed-site transceivers each being at a plurality of different sites and each being capable of communicating on mutually-common frequencies, including for example by means of frequency-hopping spread spectrum, wherein a terminal transceiver directly communicates substantially simultaneously with at least a few of the fixed-site transceivers on the mutually-common frequencies and distributes information packets of a single originating message among the fixed-site transceivers, the fixed-site transceivers forwarding the information packets via multiple communication links to a single destination terminal on the mutually-common frequencies at which the message is reassembled. The system enables reliable handoffs and robust connectivity by maintaining multiple simultaneous communication links between terminal transceivers and repeating transceivers.

Transceiver sharing between access and backhaul in a wireless digital

In a wireless packet communication system having a plurality of nodes, each having a transmitter and a receiver, the receiver at each node is assigned a specific frequency hopping band plan on which to receive signals, and the transmitter of any source node desiring to communicate with a target node changes frequency to the frequency of the target node according to the band plan. Thereupon, the source node transmits a poll packet which polls the target node to determine whether the target node is able and willing to accept a specified number of packets, at a specified level of priority. A failure to receive an acknowledgement on the source node's receive channel is a prompt to the source node either to retransmit a polling packet later, to change the polling packet or to redirect the polling packet to another target. In the event the target node returns an acknowledgement, the target node reserves access to itself for the polling station at a determined time for a determined duration. The source node then transmits its data packet on the target node receive channel and waits for an acknowledgement on its own receive channel. The source node and the target node exchange information on the agreed upon data exchange channel, even though the expected receive channel according to the frequency hopping band play of the target node may have changed in the meantime.

Growing community of inventors

Campbell, CA, United States of America

Brett D Galloway