International Business Machines Corporation

Ravinder Kumar Sabhikhi

Gordon Taylor Davis

Clark Debs Jeffries

Everett Arthur Corl, Jr

Marco C Heddes

Piyush Chunilal Patel

Raj Kumar Singh

Michael Steven Siegel

Mohammad Peyravian

Rama Mohan Yedavalli

Jeffrey S Hines

Bo Yang

Jian Ye Chen

Qing Fa Wang

Brian Mitchell Bass

Wei Lu

Ronald Leroy Billau

Ganesh Balakrishnan

Vincenzo V Di Luoffo

Yi Zhao

Yonghua Lin

Canio Cillis

Ali Ghassan Saidi

Pascal R Tannhof

George Willard Van Leeuwen

Bruce Oliver Anthony, Jr

James Johnson Allen, Jr

Ling Shao

Sridhar Rao

Zhen Bo Zhu

Seeta Hariharan

Philip E Grady

Kerry A Kravec

Jan M Slyfield

Zhi Liang

Randall W Alexander

Jitesh Ramachandran Nair

Larry W Nicholson

David M Perlsweig

John P Chalmers

Jitesh R Nair

Marc A Boulanger

C Marcel Kinard

Mark Anthony Rinaldi

Garesh Balakrishnan

Mobile network services are performed in a mobile data network in a way that is transparent to most of the existing equipment in the mobile data network. The mobile data network includes a radio access network and a core network. A first service mechanism in the radio access network breaks out data coming from a basestation, and performs one or more mobile network services at the edge of the mobile data network based on the broken out data. These services may include caching of data, data or video compression techniques, push-based services, charging, application serving, analytics, security, data filtering, and new revenue-producing services, as well as others. This architecture allows performing new mobile network services at the edge of a mobile data network within the infrastructure of an existing mobile data network.

Data breakout at the edge of a mobile data network

A base station apparatus, methods of receiving and sending data, and a computer readable article of manufacture. A computer implemented method includes the following for receiving and sending data: receiving the data by an RF header module; grouping data received; transferring the grouped data to a data processing apparatus; distributing the grouped data into an uplink sub-channel; merging the distributed data using at least one downlink sub-channel; transferring the merged data to a transceiving apparatus; degrouping the merged data; and sending the merged data by RF header module. A method of receiving data, a method of sending data, and computer readable non-transitory articles of manufacture are also provided.

Transceiving apparatus and data processing system for communication base stations

A method and an apparatus are disclosed for improving SIP parse performance. The method comprises the steps of: receiving a text-based SIP message to be sent to a SIP server; according to a SIP message filter table, determining whether the text-based SIP message needs to be transformed to a token-based message; and in the case that the text-based SIP message needs to be transformed to a token-based message, performing the transformation and sending the transformed token-based message to said SIP server, otherwise directly sending the text-based SIP message to said SIP server. According to the present principles, larger SIP message throughput in a SIP server and better utilization of resources of a front end device can be achieved.

Method and apparatus for improving SIP parse performance

The present invention discloses a method and an apparatus for improving SIP parse performance. The method comprising the steps of: receiving a text-based SIP message to be sent to a SIP server; according to a SIP message filter table, determining whether the text-based SIP message needs to be transformed to a token-based message; and in the case that the text-based SIP message needs to be transformed to a token-based message, performing the transformation and sending the transformed token-based message to said SIP server, otherwise directly sending the text-based SIP message to said SIP server. According to the present invention, larger SIP message throughput in a SIP server and better utilization of resources of a front end device can be achieved.

An intrusion detection system (IDS) comprises a network processor (NP) coupled to a memory unit for storing programs and data. The NP is also coupled to one or more parallel pattern detection engines (PPDE) which provide high speed parallel detection of patterns in an input data stream. Each PPDE comprises many processing units (PUs) each designed to store intrusion signatures as a sequence of data with selected operation codes. The PUs have configuration registers for selecting modes of pattern recognition. Each PU compares a byte at each clock cycle. If a sequence of bytes from the input pattern match a stored pattern, the identification of the PU detecting the pattern is outputted with any applicable comparison data. By storing intrusion signatures in many parallel PUs, the IDS can process network data at the NP processing speed. PUs may be cascaded to increase intrusion coverage or to detect long intrusion signatures.

Intrusion detection using a network processor and a parallel pattern detection engine

A base station apparatus adaptive for antenna arrays including at least one radio frequency (RF) header module, at least one data processing apparatus, and transceiving apparatus for transceiving data between the at least one radio frequency (RF) header module and the at least one data processing apparatus. The transceiving apparatus includes an uplink module to group data received by the RF header module according to grouping configuration information, and to transfer the grouped data to the data processing apparatus; and a downlink module to degroup the data from the data processing apparatus according to the grouping configuration information, and to transfer the degrouped data to the RF header module. Also provided are methods of receiving and sending data, and a computer readable article of manufacture tangibly embodying computer readable instructions for executing a computer implemented method of sending and receiving data for a base station.

The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.

Retro flow control for arriving traffic in computer networks

Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.

System for defining data mappings between data structures

A method and system for developing portable network processor applications and/or managing heterogeneous network processors in a network is disclosed. The network includes host processor(s) utilizing system configuration application(s) that are network processor independent. In one aspect, the method and system include using standardized interface(s) for each network processor, using a standardized transport layer compatible with the interface(s), and providing a generic message application layer. The generic message application layer defines generic payload(s) and message type(s) for configuration communications between the network and host processors. In another aspect, the method and system include providing packet processing shell(s) and generic protocol software that is coupled with the packet processing shell(s) through standard interface(s), network processor independent, and performs operations for packet processing. The method and system also include providing a library that includes network processor specific information for performing the operations and providing block(s) for performing other network processor specific operations.

Software architecture for managing a system of heterogenous network processors and for developing portable network processor applications

The present invention relates to a system for managing a plurality of multi-field classification rules. The system provides a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The system also includes a network processor for classifying packets of information, wherein the network processor is programmed to utilize the first table and the second table to identify any rules relating to the ingress context and any one rules relating to the egress context that match a search key.

System for managing multi-field classification rules relating to ingress contexts and egress contexts

A Resource Reservation System includes a Token Generation Unit (TGU) which generates and circulates among nodes of a communications system a Slotted Token (SLT) message having sub-fields to carry identification number for each input port in a node and the resource available for each input port. On receiving the message the Resource Control Unit (RCU) in each node can write port identification number, available resource in appropriate sub-fields of the SLT message, and reserve resources in other nodes by adjusting information in the sub-field associated with the other nodes.

Apparatus and method to reserve resources in communications system

Embodiments of the present invention provide systems, articles of manufacture and methods for a telematic parametric speed metering system. In one embodiment, a system may determine a vehicle's location and speed. Once the location has been determined, corresponding geographical zone based speed limits and/or other information may be acquired via internal memory or data transmission. The speed of the vehicle may then be compared against the speed limits for the zone. If the vehicle's speed exceeds those speed limits, one or more of a plurality of actions may be performed including (but not limited to) warning the driver via a visual or audio signal, informing an authority agency via data transmission, logging the excessive speeding condition (e.g., time, date, speed, location, driver name, etc).

Telematic parametric speed metering system

The present invention relates to a system and computer-readable medium for storing a plurality of multi-field classification rules in a computer system. Each multi-field classification rule includes a rule specification that itself includes a plurality of fields and a plurality of field definitions corresponding to the fields. The method of the present invention includes providing a virtual rule table, where the table stores a plurality of field definitions, and for each of the plurality of multi-field classification rules, compressing the rule specification by replacing at least one field definition with an associated index into the virtual rule table. The method also includes storing each of the compressed rule specifications and the virtual rule table in a shared segment of memory.

System and computer program for compressing multi-field classification rules

A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.

Managing traffic within a data communication network

Growing community of inventors

Cary, NC, United States of America

Ravinder Kumar Sabhikhi