Abstract: A network device, capable of understanding communications between an end user and the core network on a RAN network is disclosed. In some embodiments, the device is able to decode the control plane and the user plane. As such, it is able to determine when the end user has requested multimedia content. Once this is known, the device can optimize the delivery of that content in several ways. In one embodiment, the device requests the content from the content server (located in the core network) and transmits this content in a just-in-time manner to the end user. In another embodiment, the device automatically changes the encoding and resolution of the content, based on overall monitored network traffic. In another embodiment, the device automatically selects or modifies the format and resolution options based on overall bandwidth limitations, independent of the end user.

Abstract: A method of generating optimal packet workload for achieving a balance between maximizing cell throughput and fairness across multiple users in UMTS/HSPA Network is disclosed. The packet scheduler of the current invention enhances the performance of other schedulers, such as Proportionally Fair Scheduler in NodeB and RNC in UMTS/HSPA Networks by monitoring recent RAN bandwidth to each mobile device, and increasing buffer occupancy of high rate data-flows in the RAN devices. The scheduler uses the desired performance goals of maximum cell throughput and fairness at various network congestion levels, and controls egress burst rate while delivering packets to the RAN (Radio Access Network).

Abstract: Methods and applications for modulating the vibration mode of cellular handsets using patterned sequences are disclosed. This modulation allows additional information to be conveyed, thereby communicating messages in a variety of domains before the user responds to the vibration alert. This modulation may cause different patterns of vibration to convey additional information such as the importance of the call, identity of the caller, and other such information. The invention further extends vibration modulation to additional gaming and music & entertainment applications, such as rhythm synchronization, dance/step synchronization in a group, aerobic and other physical exercise related applications.

Abstract: A packet scheduling method and apparatus with the knowledge of application behavior, anticipated usage/behavior based on the type of content, and underlying transport conditions during the time of delivery, is disclosed. This type of scheduling is applicable to a content server or a transit network device in wireless (e.g., 3G, WIMAX, LTE, WIFI) or wire-line networks. Methods for identifying or estimating rendering times of multi-media objects, segmenting a large media content, and automatically pausing or delaying delivery are disclosed. The scheduling reduces transit network bandwidth wastage, and facilitates optimal sharing of network resources such as in a wireless network.

Abstract: The current invention defines a device and a method of logically inserting the device between two other network devices, for example, in a 3GPP Radio Access Network. The device transparently monitors and interacts with one or more control protocol layers in the two neighboring devices. The invention defines methods by which the intercepting node selectively passes through or proxies (selectively modifying portions of the protocols content) in such as way that the neighbor nodes are un-aware of the intercepting device. The proxy operation implies that the intercepting node is capable of terminating some protocol elements, injecting some protocol elements, or modifying protocol elements before forwarding them in such a way that the operation is transparent to neighboring nodes.

Abstract: A system and method to intercept traffic at standard interface points as defined by Cellular/Wireless networks (GSM/GPRS, 3G/UMTS/HSDPA/HSUPA, CDMA, WIMAX, LTE), emulate the respective protocols on either side of the interception point, extract user/application payloads within the intercepted packets, perform optimizations, and re-encapsulate with the same protocol, and deliver the content transparently is disclosed. The optimizations include but are not limited to Content Caching, prediction & pre-fetching of frequently used content, performance of content-aware transport optimizations (TCP, UDP, RTP etc.) for reducing back-haul bandwidth, and improvement of user experience. An additional embodiment of the current invention includes injecting opportunistic content (location based, profile based or advertisement content) based on the information derived while monitoring control plane protocols.

Abstract: Methods for pipelining, piggybacking, and transporting cross layer parameters through a network to reduce round-trip times are disclosed. Application activation, such as accessing a web-site through the internet, currently uses several protocols, including DNS Name resolution, establishing a TCP connection, sending HTTP Request and getting HTTP-Response that contains the web-page data, before the data from the web-site can be displayed to the user. Such operations take several round-trips through the transit network and are of the order of 100 to 200 milliseconds in the wireless access network in the best case. A method of generating a multi-part message to reduce these round trip is disclosed, as well as a proxy device which minimizes client side round trips while utilizing standard messaging in the wireline network. The invention includes client side user parameter gathering when specifying the application first (pre-fix), or specifying the application last (post-fix).

Abstract: A method and system for processing communication at a node in a communication system makes use a series of fixed-length data frames in which multiple data streams are multiplexed. Each of the data streams originates from a corresponding source of data in the communication system, and least two of the data streams originate from a same source of data. For each of the series of fixed-length frames that are processed at a node, multiple offsets within the fixed-length frame are identified, each of these offsets being associated with a different one of the sources of data. The data streams which are multiplexed in the series of fixed-length frames are then processed. For each of the data streams, in each of the series of fixed-length frames, that data stream is processed according to the offset identified for that frame that is associated with the source of that data stream.

Abstract: A method and apparatus for using SONET technology to efficiently carry both data and voice traffic by Add/Drop Multiplexing of both isochronous traffic, such as voice and video, and non-isochronous traffic, such as data, in a SONET/SDH fiber-optic ring topology. A portion of a SONET/SDH frame structure (STS-1, STM-1 etc.) is shared by a number of nodes connected to an optical SONET/SDH ring (either directly or sitting behind a SONET/ADM). The inherent column structure of the SONET/SDH frame is used define dynamic channels (flexible bandwidth channels) between the nodes. Each dynamic channel can be assigned a priority and optionally a minimum bandwidth. The channel to column mapping is varied dynamically for data traffic by a centralized bandwidth manager which serves as an arbiter for requests for bandwidth.

Abstract: A technique for updating a content addressable memory is disclosed. In one exemplary embodiment, wherein the content addressable memory has a plurality of entries, and wherein each of the plurality of entries has a prefix field, a prefix length field, and an associated index identifier, the technique is realized by determining a first index identifier associated with a first of the plurality of entries, wherein the first entry has a first prefix with a first prefix length that is greater than a third prefix length of a third prefix to be added to the content addressable memory. A second index identifier associated with a second of the plurality of entries is also determined, wherein the second entry has a second prefix with a second prefix length that is less than the third prefix length of the third prefix to be added to the content addressable memory. Based upon the first index identifier and the second index identifier, a third index identifier is determined.

Abstract: A technique for updating a content addressable memory is disclosed. In one exemplary embodiment, wherein the content addressable memory has a plurality of entries, and wherein each of the plurality of entries has a prefix field, a prefix length field, and an associated index identifier, the technique is realized by determining a first index identifier associated with a first of the plurality of entries, wherein the first entry has a first prefix with a first prefix length that is greater than a third prefix length of a third prefix to be added to the content addressable memory. A second index identifier associated with a second of the plurality of entries is also determined, wherein the second entry has a second prefix with a second prefix length that is less than the third prefix length of the third prefix to be added to the content addressable memory. Based upon the first index identifier and the second index identifier, a third index identifier is determined.

Abstract: A technique for updating a content addressable memory is disclosed. In one exemplary embodiment, wherein the content addressable memory has a plurality of entries, and wherein each of the plurality of entries has a prefix field, a prefix length field, and an associated index identifier, the technique is realized by determining a first set of index identifiers, wherein each index identifier in the first set of index identifiers is associated with a respective entry in a first set of the plurality of entries, and wherein each entry in the first set of entries has a respective prefix with a respective prefix length that is greater than a third prefix length of a third prefix to be added to the content addressable memory. A second set of index identifiers is analogously determined. Based upon the first set of index identifiers and the second set of index identifiers, a third index identifier is determined.

Abstract: A technique for updating a content addressable memory is disclosed. In one exemplary embodiment, wherein the content addressable memory has a plurality of entries, and wherein each of the plurality of entries has a prefix field, a prefix length field, and an associated index identifier, the technique is realized by determining a first set of index identifiers, wherein each index identifier in the first set of index identifiers is associated with a respective entry in a first set of the plurality of entries, and wherein each entry in the first set of entries has a respective prefix with a respective prefix length that is greater than a third prefix length of a third prefix to be added to the content addressable memory. A second set of index identifiers is analogously determined. Based upon the first set of index identifiers and the second set of index identifiers, a third index identifier is determined.

Abstract: An approach for managing dynamic traffic on a shared medium, for example, on a SONET ring, makes use of a central arbiter that communicates with stations coupled to the medium. Each station makes requests to change bandwidth for dynamic traffic entering the medium at that station, and also implements a congestion avoidance algorithm that is coordinated with its requests for changes in bandwidth. The central arbiter responds to the requests from the stations to provide a fair allocation of bandwidth available on the shared medium.

Abstract: A method and system for processing communication at a node in a communication system makes use a series of fixed-length data frames in which multiple data streams are multiplexed. Each of the data streams originates from a corresponding source of data in the communication system, and least two of the data streams originate from a same source of data. For each of the series of fixed-length frames that are processed at a node, multiple offsets within the fixed-length frame are identified, each of these offsets being associated with a different one of the sources of data. The data streams which are multiplexed in the series of fixed-length frames are then processed. For each of the data streams, in each of the series of fixed-length frames, that data stream is processed according to the offset identified for that frame that is associated with the source of that data stream.