Abstract: A fault-tolerant retry subsystem, method and computer program product are provided in order to automatically retry to deliver a message. In the context of a fault-tolerant retry subsystem, processing circuitry is provided to receive notification that delivery of a message to a subscriber has failed. The processing circuitry also defines a time interval at which delivery of the message is to be retried. The message is to be subjected to a plurality of retry attempts in an instance in which the delivery of the message to the subscriber continues to fail. The time interval is defined in a manner that depends upon which of the plurality of retry attempts is to be performed. As such, the time interval varies between at least some of the retry attempts. The processing circuitry causes the delivery of the message to be retried following expiration the time interval.

Abstract: A queue management method, system, and recording medium include a queue examining device configured to examine a reverse flow queue from a forwarder for an acknowledged packet and a dropping device configured to drop a packet in a forward flow queue if the packet in the forward flow queue includes the acknowledged packet in the reverse flow queue.

Abstract: Systems and methods for bandwidth optimization in a network include monitoring a state of the network, wherein the network is a connection-oriented network; utilizing analytics based on the monitoring to predict trends, create triggers, and determine updates to policy associated with the network; and performing bandwidth optimization on one or more connections based on the trends, the triggers, and the policy, wherein each of the one or more connections has one or more of a Wave Division Multiplexing (WDM) component, a Time Division Multiplexing (TDM) component, and a packet component, and wherein the bandwidth optimization finds the one or more connections with inefficient resource usages and moves the one or more connections, in one or more of time and space, to more optimal paths.

Abstract: The present invention relates to methods and arrangements in a wireless communication system, and in particular to uplink outer loop power control. A Node B identifies if a UE from which the Node B receives data is in a predetermined set of power challenged situations. The Node B transmits to the RNC an indication to hold the SIR target of the UE if the UE has been identified to be in a power challenged situation. As a consequence, the uplink outer loop power control (OLPC) procedure in the RNC will not change the SIR target of the UE. This implies that the output power level of the UE remains unchanged as long as the UE remains in the power challenged situation. Thus, user and network performance are improved in the wireless communication system.

Abstract: A local server is configured to communicate with a plurality of computing devices within a local network. The local server comprises memory for storing instructions and a processor configured to execute the instructions. The instructions cause the processor to dynamically establish a connection with one or more of the plurality of computing devices, the connection identifying the one or more of the plurality of computing devices as data relays; receive data traffic from one or more of the plurality of computing devices within the local network, the data traffic to be communicated to a destination server; transmit the data traffic to the data relays for communication to the destination server via a communication network; receive response data traffic from the data relays; and transmit the response data to the one or more of the plurality of computing devices within the local network.

Abstract: Aspects extend to methods, systems, and computer program products for (re)configuring acceleration components over a network. (Re)configuration can be implemented for any of a variety of reasons, including to address an error in functionality at the acceleration component or to update functionality at the acceleration component. During (re)configuration, connectivity can be maintained for any other functionality at the acceleration component untouched by the (re)configuration. Network (re)configuration of acceleration components facilitates management of acceleration components and accelerated services from a centralized service. Network (re)configuration of acceleration components also relieves host components from having to store (potentially diverse and numerous) image files.

Abstract: The subject disclosure is directed towards scheduling requests using quality values that are defined for partial responses to the requests. For each request in a queue, an associated processing time is determined using a system load and/or the quality values. The associated processing time is less than or equal to a service demand, which represents an amount of time to produce a complete response.

Abstract: The present invention relates to a wireless communication system. In particular, the present invention relates to a method for receiving a downlink control channel in a wireless communication system, and a device therefore, more particularly, to the method and a device therefore, the method comprising the steps of: receiving an upper layer signal including a plurality of frequency resource sets; receiving a subframe carrying a plurality of downlink control channel candidates; and monitoring the plurality of control channel candidates in one specific frequency resource set from the plurality of frequency resource sets, for the downlink control channel, wherein the one specific frequency resource set is determined according to the type or the characteristic of the subframe.

Abstract: One object of the present invention is o method for managing the operation of a Machine Type Communication MTC Device in a mobile communication system, said method comprising a step of: performing said management within a detach of the MTC Device from the mobile communication network.

Abstract: Embodiments are disclosed for dynamically updating bandwidth allocations in an AVB communication system. In some embodiments, a device includes a communication interface communicatively connectable to at least one other device in a communication network and configured to transmit data via the communication network, a processor, and a storage device that stores instructions executable by the processor to detect an incoming data stream, and determine an amount of bandwidth to be used by the data stream. The instructions are further executable to update a bandwidth allocation for the data stream based on the determined amount of bandwidth.

Abstract: A router of a network-on-chip receives delay information associated with a plurality of links of the network-on-chip. The router determines at least one link of a data path based on the delay information.

Abstract: A obstruction determination process by a program stored in a recording medium comprises (i) in cases in which a connection data has been received from a plurality of transfer devices connected to a non-transmitting transfer device which is not transmitting the connection data, identifying a non-transmitting transfer device transfer path on which the non-transmitting transfer device is positioned; and (ii) determining for each of the identified transfer paths whether or not an obstruction has occurred on the identified transfer path, and in cases in which the identified transfer path is the non-transmitting transfer device transfer path identified, employing the transfer volume data that has been received from another transfer device positioned on the non-transmitting transfer device transfer path as the transfer volume data of the non-transmitting transfer device to determine whether or not an obstruction has occurred on the identified transfer path.

Abstract: A system and an algorithm in a mobile core network to distribute the data load across multiple data processing entities. The system is seen as having one data plane entity to the external entities like routers; hence the system can scale without needing to update the external nodes. In general when a data plane processing entity is added or removed, a new distribution rule is provided to the remaining data plane processing entities. Only after some number of sessions have been migrated does the new distribution get provided to the data distribution entities. This delay allows sufficient sessions to be migrated to minimize the overall number of packets that have to be forwarded for processing. This benefit can be maximized by taking advantage of cellular network's idle mode behavior and by migrating the sessions while they are in idle mode.

Abstract: Embodiments provide a method, including: receiving, by a forwarding element, a packet through an inbound port; searching for, by the forwarding element, a port table according to the inbound port and determining a first offset, a first length, and an identifier of a first table; determining, by the forwarding element, a first key according to the first offset and the first length, searching for the first table according to the first key, and determining a first instruction; and processing, by the forwarding element, the packet according to the first instruction. In addition, a forwarding element is provided. In the foregoing technical solutions, before processing a packet, the forwarding element does not need to interpret a data format of the packet, so that the forwarding element can flexibly support packets in different data formats.

Abstract: Systems and techniques for random access to a wireless network are described herein. Components of a wireless station may obtain a back-off value. The components may also decode random access resource units from a frame transmitted to the wireless station from an access point of the wireless network. The components may decrement the back-off for each decoded random access frame. The wireless station may select this frame from a sequence of frames when the back-off reaches zero while decoding the random access resource units of this frame. The wireless station then selects the random access resource unit with a more favorable transmission metric than another random access resource unit of the frame and uses the selected random access resource unit to communicate with the access point.

Abstract: A hardware-implemented rate limiter is described. This implementation guarantees that messages containing a value v are not forwarded at a higher rate than a predefined threshold value r. More specifically, given a number of times x in a time interval y, which specifies a rate r defined by x/y, the rate limiter reports a violation by selectively setting an error value when v occurs more than x times during the time interval y. Moreover, the rate limiter may be able to keep track of multiple predefined threshold values for different rates. Furthermore, the rate limiter may keep track of 2b different values v, where b is the number of digits of the binary representation of v.

Abstract: Aspects of the present disclosure provide for yield management models for dynamically pricing access to wireless communication services. In some examples, access to a network is intermediated by a surrogate access point, which may act as a proxy or relay, expanding communication services to client devices that otherwise may lack a subscription, or may lack a suitable communication interface, to communicate directly with the wireless network. Here, the surrogate access point may be a subscriber device or user equipment. By utilizing the yield management model, the surrogate access point may receive compensation for sharing its connection to the network with nearby client devices. Other aspects, embodiments, and features are also claimed and described.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Systems and techniques are described which improve performance, reliability, and predictability of networks without having costly hardware upgrades or replacement of existing network equipment. An adaptive communication controller provides WAN performance and utilization measurements to another network node over multiple parallel communication paths across disparate asymmetric networks which vary in behavior frequently over time. An egress processor module receives communication path quality reports and tagged path packet data and generates accurate arrival times, send times, sequence numbers and unutilized byte counts for the tagged packets. A control module generates path quality reports describing performance of the multiple parallel communication paths based on the received information and generates heartbeat packets for transmission on the multiple parallel communication paths if no other tagged data has been received in a predetermined period of time to ensure performance is continually monitored.

Abstract: A method for managing port bandwidth in network devices. The method includes determining a first and a second ingress bandwidth of a first and a second network chip, respectively, determining an egress bandwidth of an egress port of a third network chip, determining a first and a second weight for the first and the second network chip, respectively, where the first and the second weight are determined based on a bandwidth including the first and second ingress bandwidth, processing a first data packet, received by a first ingress port administrated by the first network chip, based on the first weight and the egress bandwidth, and processing a second data packet, received by a second ingress port administrated by the second network chip, based on the second weight, and the egress bandwidth, where the destination of the first and the second data packet is the egress port.

Abstract: For future wireless systems, it is desired to keep network implementation aspects, such as transmission point selection, precoder selection, etc, transparent to the terminal. This means that terminals are envisaged to be unaware of e.g. from which specific network node a transmission is made. This may be referred to as the transparency principle. The proposed solution comprises enabling a receiver to determine a type of antenna association that may be assumed in regard of two blocks of information, based on the result of the decoding of e.g. the first data block. The determination is done in a way such that the principle of transparency is not broken.

Abstract: A method and apparatus for enabling prioritization of signaling messages in a communication network are disclosed. For example, the method receives at least one signaling message, and classifies each of the at least one signaling message. The method schedules each of the at least one signaling message for processing, and discards selectively one or more signaling messages that have been scheduled under an overload condition.

Abstract: Machine logic (for example, software) that performs the following steps: (i) providing a system including a first hypervisor and a first topology agent; (ii) running the topology agent on the hypervisor; (iii) dynamically creating a first unique address for the first topology agent; and (iv) storing the first unique address in a set of forwarding database (FDB) table(s) located on a set of network switch(es). Also, lightweight mechanisms on network switches for finding and/or clearing media access controller (MAC) addresses from FDB tables.

Abstract: A system and an algorithm in a mobile core network to distribute the data load across multiple data processing entities. The system is seen as having one data plane entity to the external entities like routers; hence the system can scale without needing to update the external nodes. In general when a data plane processing entity is added or removed, a new distribution rule is provided to the remaining data plane processing entities. Only after some number of sessions have been migrated does the new distribution get provided to the data distribution entities. This delay allows sufficient sessions to be migrated to minimize the overall number of packets that have to be forwarded for processing. This benefit can be maximized by taking advantage of cellular network's idle mode behavior and by migrating the sessions while they are in idle mode.

Abstract: The present invention relates to a method for localization of peer-to-peer packet data traffic in a mobile network comprising a core network and at least one radio access network (RAN). The method comprises obtaining data traffic information for a packet data connection between two peers located in the RAN and where the connection is passing through a packet gateway node P-GW in the core network. If it is determined that the packet data connection is carrying peer-to-peer traffic, the PG-W requests localization policy information from a policy control function entity PCRF. The PCRF returns localization policy information related to the two peers and if localization is permitted, the P-GW requests a mobile management function entity to move the data traffic from the existing packet data connection to another packet data connection passing through another (local) packet gateway node L-GW which could be located in the same RAN as the peers.

Abstract: This specification describes technologies relating to generating transforms based on rule sets. In general, one aspect described in this specification can be embodied in methods that include receiving a rule set including execution cases, where at least one execution case in the rule set includes one or more trigger conditions and a specification of an output that is to be generated when the one or more trigger conditions are all satisfied. The methods may further include generating a control structure including a sequence of rows corresponding to one or more execution cases in the rule set. Each row may include a sequence of one or more trigger conditions and information specifying the output for a corresponding execution case. For at least one of the trigger conditions, when the trigger condition is failed, the control structure may direct processing to skip at least one row in the sequence of rows.

Abstract: Methods, apparatuses, and computer-readable medium for providing a fairness protocol in a network element are disclosed herein. An example method includes receiving one or more packets at each of a plurality of ingress ports of the network element, and scheduling the packets into a plurality of queues, wherein each of the queues is associated with packets that are sourced from one of the ingress ports. The method also includes monitoring a bandwidth of traffic sourced from each of the ingress ports, identifying a port among the ingress ports that sources a smallest bandwidth of traffic, and arbitrating among the queues when transmitting packets from an egress port of the network element by giving precedence to the identified port that sources the smallest bandwidth of traffic. Additionally, arbitrating among the queues distributes a bandwidth of the egress port equally among the ingress ports.

Abstract: Systems and methods for accomplishing charging operations in a communications network in which a plurality of charging and enforcement (CaE) components operate as enforcement points for a single data communication may include receiving in a server computing device usage records from a first CaE component and a second CaE component, generating correlated usage records by using a common Service Data Flow (SDF) to correlate the one or more usage records received from the first CaE component with the one or more records received from the second CaE component, and using the correlated usage records to determine a charge value that identifies correct charges to be applied.

Abstract: The disclosure generally relates to network-initiated and client-initiated mechanisms to enable quality of service (QoS) for web-based client applications that may high efficiency, high performance, or otherwise guaranteed service levels. For example, to enable QoS for calls or other sessions associated a web-based application, one or more signaling messages may be exchanged between a server and a first user equipment (UE) to establish a call between the first UE and a second UE and to establish a peer connection between the server and at least the first UE. As such, QoS may be activated for at least the peer connection between the first UE and the server, wherein the server may route data associated with the web-based application between the first UE and the second UE over the established peer connection to implement the activated QoS.

Abstract: Methods, systems, and computer readable media for distributing general packet radio service (GPRS) tunneling protocol (GTP) traffic are disclosed. According to one exemplary method, the method occurs at a network node simulator configured to distribute GTP encapsulated data packets among a plurality of processors associated with the network node simulator. The method includes receiving a GTP encapsulated data packet associated with a user device, wherein the GTP encapsulated data packet includes a GTP header having a GTP related endpoint identifier indicating a processor among the plurality of processors associated with the network node simulator. The method also includes determining, using the GTP related endpoint identifier, the processor for processing the GTP encapsulated data packet. The method further includes sending, to the processor, the GTP encapsulated data packet for processing.

Abstract: A network component has a set of one or more rules, each of which has a match component and an action component. If an incoming packet maps to the match component of a rule, then the packet is handled according to the rule's action component. If the rule also includes a limit component, then if the packet maps to the rule's match component, a family history of the rule is updated, and the packet is handled according to the rule's action component only if the rule's family history satisfies the rule's limit component.

Abstract: An example method for network selection involves discovering network capabilities by performing an Access Network Query Protocol (ANQP) query at a wireless terminal, and receiving a subsequent ANQP response from an access point of a wireless local area network. The network capabilities are indicated in the subsequent ANQP response. The example method also involves comparing the network capabilities with configured capabilities, finding a match between at least a portion of the network capabilities and at least a portion of the configured capabilities, and joining the wireless terminal with the access point based on the at least the portion of the network capabilities matching the at least the portion of the configured capabilities.

Abstract: A system architecture and methods for data traffic flow classification are provided. An initial traffic class is assigned to a data flow as a current traffic classification, where the initial traffic class is based static traffic classification method(s) applied with respect to an initial packet of the data flow. A predetermined number of further packets of the data flow, subsequent to the initial packet, are analyzed based on predetermined factor(s), and a traffic class based on the analysis of the further packets is determined. The traffic class based on the analysis of the further packets is assigned as the current traffic classification of the data flow. Data indicating a traffic class for the data flow (based on a dynamic traffic classification method) is received, and the traffic class based on the dynamic traffic classification method is assigned as the current traffic classification of the data flow.

Abstract: Stereoscopic image information (3D information) can be efficiently transmitted between electronic devices at high speed. Using a capability register (Capability Register) of MHL, the 3D information is transmitted between devices. (1) An MHL sink device transmits a “SET_INT command” immediately after changing the 3D information of the capability register, a 3D_CHG flag of an MHL source device side is set to “1” and the MHL sink device notifies the MHL source device of the 3D information. (2) The MHL source device responds ACK. (3) The MHL source device recognizes that the 3D_CHG flag is set to 1, transmits a “READ_DEVCAP command” in which address information of the 3D information of the capability register is added to the MHL sink device and reads only the 3D information from the capability register. Using a scratchpad register of MHL, the 3D information is transmitted between the devices and detailed 3D control is performed.

Abstract: A system for detecting three-way calls in a monitored telephone conversation includes a speech recognition processor that transcribes the monitored telephone conversation and associates characteristics of the monitored telephone conversation with a transcript thereof, a database to store the transcript and the characteristics associated therewith, and a three-way Call detection processor to analyze the characteristics of the conversation and to detect therefrom the addition of one or more parties to the conversation. The system preferably includes at least one domain-specific language model that the speech recognition processor utilizes to transcribe the conversation. The system may operate in real-time or on previously recorded conversations. A query and retrieval system may be used to retrieve and review call records from the database.

Abstract: A method and system for tracking and managing network flows including receiving a first flow counter value for a flow of first flows and determining that the flow is an elephant flow. The method further includes obtaining flow egress port information by determining an egress port on a switch for each of the first flows, obtaining port congestion information for the switch, where the port congestion information includes port congestion data for each egress port, and selecting, based on the port congestion information and the flow egress port information, a new egress port for the flow, and sending a request to update a switch chip on the switch, where the request specifies that subsequently received packets for the flow are to be forwarded out of the new egress port.

Abstract: A mechanism controls global synchronization, or registration floods, that may result when a large number of endpoints in a Voice over Internet Protocol (VoIP) network such as an Internet Protocol Multimedia Subsystem (IMS) come online simultaneously after a catastrophic failure. The mechanism allows the Domain Name System (DNS) infrastructure to efficiently control the overload condition by registering user end points with backup border elements, and by staggering and by randomizing the time-to-live (TTL) parameter in registrations with backup border elements.

Abstract: A technique of operating a wireless communication device includes receiving an assigned starting point index and an assigned reference signal bandwidth for a reference signal. The reference signal is then transmitted multiple times, beginning at an initial resource block that is associated with the assigned starting point index and in accordance with the assigned reference signal bandwidth, across a shared channel.

Abstract: A system and method can support queue processing in a computing environment. A lazy sorting priority queue in a concurrent system can include a priority queue and one or more buffers. The one or more buffers, which can be first-in first-out (FIFO) buffers, operate to store one or more requests received from one or more producers, and move at least one message to the priority queue when no consumer is waiting for processing a request. Furthermore, the priority queue operates to prioritize one or more incoming requests received from the one or more buffers, and allows one or more consumers to pick up the requests based on priority.

Abstract: A communication system, method, and components are described. Specifically, a communication system that supports dynamic device pairing of communication devices is described. Such pairing is accomplished using a feature or pairing server, without requiring modification to associated communication endpoints. Moreover, sequenced applications can be applied for all communication endpoints when pairing is in effect.

Abstract: A receiving side data communication device calculates, at prescribed times, an actual measured RTT, which is the time required for data to travel to a transmission side data communication device and back, a data transfer rate for the data transfer, and a data loss ratio, which is the ratio of the number of packets not received by the receiving side data communication device to the number of packets sent from the transmission side data communication device. The receiving side data communication device uses the most recent data transfer rate and the data loss ratio to calculate a transfer score according to a prescribed calculation formula, and increases or decreases the reference RTT in accordance with the change in the transfer score.

Abstract: A network analysis system provides for a user-definable display of information related to messages communicated on the network. The network analysis system includes one or more display formats that provide a display of message exchanges between nodes of a network, and a display augmenter that provides additional information on the display based on a user-defined visualization. The user defined visualization includes augmenting the display based on user-defined coloring characteristics and/or augmenting the display with user-defined labels. To further facilitate user control of the augmentation of the display, the system accepts user-defined programs for discriminating among messages, for controlling the labeling of messages, and for controlling the coloring of messages and labels. Commonly used user-defined characteristics and labels are stored in a library, for use via a selection from among the library entries.

Abstract: A method for offloading data traffic from a cellular connection to a WLAN connection via a wireless P2P connection is disclosed. The method can include the wireless communication device accessing offloading coordination information from an offload coordination service server, including information about at least one neighboring wireless communication device being within sufficient proximity of the wireless communication device to establish a wireless P2P connection and having access to a WLAN access point; using the offloading coordination information to select a relay device from the at least one neighboring wireless communication device; establishing a wireless P2P connection with the relay device; and offloading data traffic from the cellular connection to the wireless P2P connection so that the data traffic is relayed from the relay device to a network via a WLAN access point accessible to the relay device.

Abstract: An OpenFlow network includes multiple controllers. Each controller includes a load control table and a load control unit. The load control table controls at least one of the number of messages which each of switches in the OpenFlow network has transmitted to a controller controlling the switch over a predetermined time and the number of packets that the switch has received over a predetermined time. When a predetermined event occurs, the load control unit detects a controller having a processing load higher than or equal to a first threshold on the basis of the load control table and places at least one of the switches controlled by the detected controller under the control of another controller.

Abstract: In one embodiment, a device in a network receives an indication of a traffic shaping rate adjustment by a node due to a network condition. The device identifies a set of network nodes that are associated with the network condition. The device detects a traffic shaping rules violation by an offending node in the set of network nodes. The device sends an instruction that causes the offending node to use a different traffic shaping rate.

Abstract: Multiple switch planes, each having meshed bufferless switch units, connect source nodes to sink nodes to form a communications network. Each directed pair of source and sink nodes has a first-order path traversing a single switch unit in a corresponding switch plane and multiple second-order paths each traversing two switch units in one of the remaining switch planes. To reduce processing effort and minimize requisite switching hardware, connectivity patterns of source nodes and sink nodes to the switch planes are selected so that each pair of source node and sink node connects only once to a common switch unit. Widely-varying flow rates may be allocated from each source node to the sink nodes. To handle frequent changes of flow-rate allocations, in order to follow variations of traffic distribution, a high-throughput scheduling system employing coordinated multiple scheduler units is provided in each switch plane.

Abstract: One embodiment of the present invention provides a switch. The switch comprises a plurality of ports, a link management module, a forwarding module, and a link adaptation module. The link management module operates at least two ports of the plurality of ports of the switch to form a link aggregation. This link aggregation operates as a single logical channel. The forwarding module determines an egress port for a packet among the ports participating in the link aggregation based on a distribution policy. The link adaptation module detects an imbalance of the respective link utilizations among links of the link aggregation based on one or more imbalance criteria, and applies one or more corrective actions to the distribution policy.

Abstract: System and methods for efficiently distributing data packets in a multi-path network having a plurality of equal cost paths each having the same number of hops are provided. In one aspect, a system and method includes reordering the entries in the routing table of one or more peer routing devices, such that succeeding equal cost next hop routing devices that are interconnected in a Clos formation to the peer routing devices received unbiased traffic from each of the peer routing devices, thus enabling the succeeding next hop routing devices to distribute data traffic evenly over additional equal cost multiple hops further into the network.

Abstract: The embodiments relate to quality of service (QOS) features for a router, especially a router used in a home network or local area network. In the embodiments, the router is enhanced to be capable of measuring, detecting traffic sessions, and analyzing traffic in real time. The real-time analysis identifies traffic sessions in the data traffic and provides QOS to the traffic sessions. The QOS features are autonomous and do not require user configuration or intervention. In some embodiments, the real-time analysis and QOS features are triggered during periods of congestion.

Abstract: A method collects data and subjects it to statistical analysis to detect localized events, which assists in network provisioning. Illustratively, the data employed is hourly network traffic counts that are collected at cell sites. By taking advantage of the additive property of a Poisson process, the method integrates spatial neighbor information by aggregating temporal data in various areas, and iteratively estimating the event location and the radius of event impact by examining the posterior probability based on the aggregated data.