Cisco Technology, Inc.

Feng Cao

Jonathan Rosen

Harikrishnan Pillai

Radhika Padmanabhan

Saadat Malik

Daniel George Wing

Wen-hsiung Chen

Shuxian Lou

Jie Chu

Binh Don Ha

Gary Fu-Jen Cheng

Douglas Michael Toney

Intelligent distribution of packet flows may be provided. Compute resource data may be received. Next, packets may be classified into flows that may be persistently mapped to compute resources for a lifetime of the flows. Based on the compute resource data, the flows may then be allocated to the compute resources.

Intelligent packet distribution control for optimizing system performance and cost

Techniques and mechanisms for IPsec processing of IPsec packets for routing platforms where IPsec is just one or more features in the middle of data path features on the packet processing path and hence, the typical, simple inline IPsec scheme does not work well for such platforms. The techniques include using a hardware look-up table for packet classification and inbound security association (SA) lookup in one pass with IP 5-tuple plus SPI as a lookup key at hardware table. The techniques provide an entry match action format and mechanism for deriving inbound SA dram addresses that may be used by a hardware (HW)/firmware (FW) crypto/IPsec engine to process inbound packet traffic. A software SA look-up table is also provided to overcome hardware look-up table resource limitations and support more IPsec session scaling than the physical hardware look-up table can handle. Additional techniques are described.

IPsec processing of packets in SoCs

In one embodiment, a network device generates a protection policy responsive to identifying undesired voice data traffic. The network device then distributes the generated protection policy along a call path used for transferring the undesired voice data traffic. The proxy may distribute the protection policy by inserting the protection policy in a call response or other message that traces the call path back to a calling endpoint.

Distributing policies to protect against voice spam and denial-of-service

One embodiment includes a method in a mobile device, including accepting real-time location information on the location of the mobile device, and ascertaining whether real-time information is to be included. In the case it is ascertained that real-time location information is to be embedded, the method includes embedding the accepted location in a payload portion of a media packet; and sending the packets to one or more recipients. At least some of the sent packets include location information embedded in the payload portion.

Real-time location information from mobile devices including embedding location information in media packet payload

A method of filtering telecommunication service includes receiving a call that includes a call identifier. The method also includes determining a filter status of the call and transmitting a notification message to a remote node. The notification message identifies the call identifier and the filter status of the call.

System and method for distributed IP telephony tracking

In one embodiment, an apparatus can include: a receiver configured to receive location-related data, and to provide real-time location information therefrom; and a processor configured to receive the real-time location information, and to provide an extension in a packet header of a media stream, wherein the header extension comprises the real-time location information.

Sharing and tracking real-time location for mobile users

In a butterfly network, a number of switches are set to provide two paths that are independent of each other, from a first switch to a second switch, and from the first switch to a third switch respectively. Identification of switches to be set from among all switches in the butterfly network depends on the locations of the first switch, the second switch and the third switch relative to one another. The to-be-set switches are determined by starting with the first switch as a preceding switch, identifying the next switch for a path by simply changing the level number (e.g. incrementing the level number) of a preceding switch in the path, and by changing a bit of the row number of the preceding switch (e.g. by replacing the (&#x3b1;-th bit with a corresponding bit from the destination switch's row number), and repeating such acts with the just-identified switch as a preceding switch. The direction of the path is reversed on reaching a last level or a last row of the network. Such addressing techniques identify all switches that need to be used to form two node disjoint paths from the first switch to the second and third switches. The two paths can be used to redundantly couple a source switch to a destination switch, for load balancing, for fault tolerance, or for multicasting.

Butterfly network with switches set for two node disjoint paths and method for forming the paths

A method of providing VoIP call routing in a virtual private network is disclosed. A first gatekeeper issues an information request to a gateway. The first gatekeeper receives from the gateway information organized in a string and based on the information in this string recommends to a second gatekeeper a transmission route through a virtual private network. The second gatekeeper then uses this recommendation to select the transmission route for a VoIP call through the virtual private network.

Method and apparatus for providing optimal VoIP call routing in VRF environment

In a butterfly network, a number of switches are set to provide two paths that are independent of each other, from a first switch to a second switch, and from the first switch to a third switch respectively. Identification of switches to be set from among all switches in the butterfly network depends on the locations of the first switch, the second switch and the third switch relative to one another. The to-be-set switches are determined by starting with the first switch as a preceding switch, identifying the next switch for a path by simply changing the level number (e.g. incrementing the level number) of a preceding switch in the path, and by changing a bit of the row number of the preceding switch (e.g. by replacing the &#x3b1;-th bit with a corresponding bit from the destination switch's row number), and repeating such acts with the just-identified switch as a preceding switch. The direction of the path is reversed on reaching a last level or a last row of the network. Such addressing techniques identify all switches that need to be used to form two node disjoint paths from the first switch to the second and third switches. The two paths can be used to redundantly couple a source switch to a destination switch, for load balancing, for fault tolerance, or for multicasting.

In a butterfly network, a number of switches are set to provide two paths that are independent of each other, from a first switch to a second switch, and from the first switch to a third switch respectively. Identification of switches to be set from among all switches in the butterfly network depends on the locations of the first switch, the second switch and the third switch relative to one another. The to-be-set switches are determined by starting with the first switch as a preceding switch, identifying the next switch for a path by simply changing the level number (e.g. incrementing the level number) of a preceding switch in the path, and by changing a bit of the row number of the preceding switch (e.g. by replacing the &agr;-th bit with a corresponding bit from the destination switch's row number), and repeating such acts with the just-identified switch as a preceding switch. The direction of the path is reversed on reaching a last level or a last row of the network. Such addressing techniques identify all switches that need to be used to form two node disjoint paths from the first switch to the second and third switches. The two paths can be used to redundantly couple a source switch to a destination switch, for load balancing, for fault tolerance, or for multicasting.

Growing community of inventors

Sunnyvale, CA, United States of America

Feng Cao