Abstract: A computer implemented method, apparatus, and computer usable program code to receive data from a source at a plurality of gateways for distribution using a selected priority. The data is transmitted from the plurality of gateways to a plurality of receivers using the selected priority. Every gateway in the plurality of gateways has an adaptive bandwidth control process and a respective set of parameters for controlling the adaptive bandwidth control process for sending the data at the selected priority. Transmission of the data from each gateway for the selected priority has a different impact on other traffic at different gateways in the plurality gateways for the selected priority when different values are set for the set of parameters for the different gateways.

Abstract: A method and apparatus for managing a virtual private network are disclosed. For example, the method collects performance data for at least one parameter from a plurality of customer edge routers and a plurality of provider edge routers associated with the virtual private network. The method correlates the performance data for identifying one or more performance exceptions based on a threshold for each of the at least one parameter, and performs a trending analysis using the one or more performance exceptions to predict a potential problem that will impact the virtual private network.

Abstract: A method to facilitate user equipment (UE) handoff within a packet data communication system includes receiving at the Evolved NodeB (eNB) via a serving relay node an indication that the UE will undergo a handoff from the serving relay node to a target node; receiving at the eNB first packet data having a first payload and a first Internet protocol (IP) header identifying an address of the eNB; extracting, at the eNB, the first payload from the first packet data to form a first packet data unit (PDU) including the extracted first payload and a second IP header identifying the address of the eNB and an address of the target node; and transmitting, from the eNB to the target node, the first PDU to permit the target node to transmit the first payload of the first PDU to the UE, the target node being identified using the second IP header.

Abstract: A plurality of flow network elements monitors network flows at the subscriber level for a plurality of subscribers. The flow network elements export flow records to a collector, which organizes the flow records. A policy client correlates the flow records and determines whether any network flows are violating a flow policy definition. If a flow policy definition is violated, the policy client transmits a policy action to a policy server which indicates what action to take for a given violating flow. The policy server assigns a flow policy for the subscriber corresponding with the violating flow. The assigned flow policy is then transmitted to the flow network element having that violating flow, and that flow network element installs the flow policy.

Abstract: A method of communicating within a mesh network comprises scheduling a mesh access reservation time period for transmission of one or more frames by the mesh device on a channel. During the scheduled mesh access reservation time period: contention for the channel is performed with one or more other mesh devices in the network; and at least one frame is transmitted when the mesh device wins the contention. After the scheduled mesh access reservation time period: when one or more frames scheduled for transmission during the scheduled mesh access reservation time period remain to be transmitted; contention for the channel continues; and the one or more frames are transmitted when the mesh device wins the contention for the channel and when another mesh device has not reserved the channel for the time period.

Abstract: When a mobile station (MS) seeks access to a public land mobile network (PLMN) via an unlicensed or generic access networks (GAN) it first registers with a default GAN. If the default GAN is unable to serve the MS at its current location, it redirects the MS to other GANs serving the same of different PLMNs. However, when using the existing registration and redirection process, an MS has no means of knowing what services are provided by a specific combination of GAN and PLMN. In accordance with the present invention this is achieved by indicating for each PLMN and serving GANC an operation mode supported by the GANC. This operation mode being indicative of the interface used for communication between the GANC and PLMN it serves.

Abstract: Techniques are provided herein to enable monitoring of a real-time transport protocol (RTP) packet flow in devices along the path that the RTP packet flow traversed from a source to a destination. A device that is a source or destination of a RTP packet flow transmits a monitor request message that requests one or more other devices along a path of the RTP packet flow to monitor the RTP packet flow. The device that is the source or destination of the RTP packet flow receives one or more monitoring reports from the one or more other devices along the path of the RTP packet flow. This allows a device that requested monitoring of the RTP packet flow to analyze the monitor reports in order to determine a location of a cause of reduced performance in the RTP packet flow. e.g., missing packets, overly delayed packets, etc.

Abstract: A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.

Abstract: Transmission of information in a wireless network is performed by allocating a channel from a transmitter to a receiver. The channel has at least one time slot with each time slot having a plurality of symbols. Each slot contains at least one reference symbol (RS). As information becomes available for transmission, it is classified as prioritized information (PI) and other information. One or more priority symbols are generated using the digital samples of the priority information. Other symbols are generated using the other data. Priority symbols are transmitted on the channel in a manner that separation of priority symbol(s) and a reference symbol does not exceed a time duration of one symbol. For example, Rank Indicator (RI) is transmitted using symbol k, ACKNAK is transmitted using symbol k+1; and the reference signal (RS) is transmitted using symbol k+2, wherein symbols k, k+1, and k+2 are consecutive in time. The other symbols are transmitted in available locations.

Abstract: There is proposed a modification to the ECN protocol to remove the one-to-one relationship between the network signalling congestion and the sender response to that congestion. The result is to allow a receiver terminal to exhibit some control of bandwidth share relative to other receiver terminals. The idea is to calculate the average CE arrival frequency from received data packets and to set ECE flags at a rate determined as a function of the average CE arrival frequency. Preferably, the function is a multiplier applied to the average CE arrival frequency. The effect of averaging the CE arrival frequency as well as application of a multiplier is a decoupling of the ECE marked ACKs sent by a receiver to the sender, and control of the resulting transmission rate at the sender.

Abstract: A flexible OFDM/OFDMA frame structure technology for communication systems is disclosed. The OFDM frame structure technology comprises a configurable-length frame which contains a variable length subframe structure to effectively utilize OFDM bandwidth. Furthermore, the frame structure facilitates spectrum sharing between multiple communication systems.

Abstract: In ACK/NAK responses with repetition, the ACK/NAK response from the user equipment to a Physical Downlink Shared CHannel (PDSCH) transmission is repeated in consecutive frames a predetermined number of frames following receipt. This repeat ACK/NAK causes a problem when a PSCCH transmission directed to the same user equipment occurs in consecutive subframes. In a first embodiment, the first ACK/NAK response repeats preempting any ACK/NAK response to the later PDSCH transmission. In a second embodiment, the first ACK/NAK response does not repeat and the ACK/NAK response to the later PDSCH transmission occurs.

Abstract: Systems and methods for quality of service control over multiple accesses, more particularly quality of service control over multiple accesses via enhanced quality of service rules. A policy rules and charging function, or similar network entity, can include an indicator in a set of quality of service rules that instructs an access gateway to either setup the quality of service resources/initiate bearer setup immediately, or store the quality of service rules until a request for the quality of service resources s received from the UE or another predetermined event occurs.

Abstract: A data communication system and an associated network node implementation is disclosed that, in certain embodiments, uses single-channel bi-directional communication links between nodes to send frames of data. The network nodes can be connected together in a ring or daisy chain topology with data frames sent in alternating directions through the bi-directional links. Such networks initially configured in a physical ring topology can tolerate single point failures by automatically switching to a logical daisy chain topology.

Abstract: A method and system for determining a wait time (tw) to be used between successive transmissions of packets of a content to achieve a selected target bandwidth BT for the transmission. The wait time between successive packets of a content being transmitted is determined as a function of the selected target bandwidth (BT) to be achieved during the transmission and the size (P) of the packets based on the algorithm t w = P B T The invention provides bandwidth control at the source (the sending device) without relying on network Quality of Service (QoS) facilities.

Abstract: Class-based bandwidth partitioning of a sequence of packets of varying packet classes is performed, such as, but not limited to determining whether or not to admit a packet to a queue based on a probability corresponding to a class of packets associated with the packet, with this probability being based on measured arrival traffic and a fair share based on the length of the queue. Data path processing is performed on each packet to determine whether to admit or drop the packet, and to record the measured received traffic. Control path processing is periodically performed to update these probabilities based on determined arrival rates and fair shares for each class of packets. In this manner, a relatively small amount of processing and resources are required to partition bandwidth for a scalable number of classes of packets.

Abstract: Embodiments of the present invention provide a GMPLS fast re-route of packets within a network using a multicast address and a table comprising a list of alias IP addresses. According to various embodiments of the invention an alternate data path from a source node to a destination node allows a packet to traverse to the destination node without IP forwarding techniques being applied. In other words, a tunneling effect from a source node to a destination node allows other nodes in the network to ignore the packet and only read the multicast address within the header and immediately forward the packet to the destination node. A predetermined set of IP addresses are determined from network topology including all potential paths, for a packet to traverse, to a destination address.

Abstract: A Session Initiation Protocol (SIP) message adapted for communication between a plurality of network elements located on a multi-media services provider system to form a multi-media communication path between at least a first communication device and at least a second communication device of a plurality of communication devices. The SIP message includes a header region and a plurality of header fields located on the header region. The plurality of header fields include predetermined address information associated with at least one network element of the plurality of network elements located on the multi-media services provider system.

Abstract: Provided is a resource management method in a communication system, and more particularly, a resource management method based on priority in a wireless communication system. The resource management method in a wireless management network includes: setting a priority factor value with regard to a link flow for which link establishment is requested; and if a capacity required by the flow for which link establishment is requested exceeds a remaining capacity of a base station, increasing the remaining capacity of the base station by sequentially reducing a minimum reserved rate (MRR) value of flows that receive a service at a lower priority than the flow for which link establishment is requested to a maximum sustained rate (MSR) value, until the remaining capacity required by the flow for which link establishment is requested is generated.

Abstract: A packet analyzer(s) gets multiple packets, typically of a communication between communication devices. The multiple packets use the same protocol and contain one or more protocol headers with individual field(s) that contain data. The packets are organized into an array of packets. Each packet is a row in the array of packets. Each column in the array is comprised of the same field in each packet in the array of packets. The data in the fields in the column are then compressed into a compression packet.