Abstract: An update service of a provider network transmits an update to an edge device by opportunistically selecting one communication channel (or transmission bandwidth) over another (e.g., based on analysis of performance metrics associated with the channel) to transmit different portions of the update to the edge device. For example, the update service may choose the channel with highest available bandwidth or the channel with the lowest failure rates. The update service may receive indications from the edge device that transmission of different update portions was successful. In some cases, the edge device itself may instead perform the selection of one communication channel over another (e.g., based on analysis of channel metrics) to receive different portions of the update at the edge device. The edge device may transmit indications that the edge device successfully received different portions of the update.

Abstract: Protocol and associated system for data transfer between two nodes of partially connected limited network. In a data network, a hybrid solution is proposed that allows isolated clients to communicate via a dynamically configured group of connected clients. In some cases, this solution makes it possible to substantially reduce the number of isolated clients.

Abstract: A radio base station includes: a radio communicator configured to perform radio communication; and a first controller that includes a first scheduler configured to perform a first scheduling that is at least a first part of a scheduling for the radio communication; and a second controller that is coupled to the first controller via a network, wherein the second controller comprises a second scheduler configured to perform a second scheduling that is at least a second part of the scheduling for the radio communication.

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.

Abstract: A method for normalizing leaf nodes of a weighted tree for use in a scheduler is disclosed. In one embodiment, such a method includes obtaining a weighted tree structure having a root node and multiple downstream nodes. Each downstream node is assigned a weight value. The method assigns a global maximum number and a global minimum number to the root node. The method derives, from the weight values and the global maximum number and global minimum number, a maximum number and a minimum number for each downstream node. The method further assigns, to each leaf node of the downstream nodes, an absolute weight value that is related to at least one of its maximum number and its minimum number. The method schedules items associated with the leaf nodes based on the absolute weight values associated with the leaf nodes. A corresponding system and computer program product are also disclosed.

Abstract: One embodiment provides a system that facilitates a flexible strategy for matching content objects and interests. During operation, the system receives, by a computing device, an interest which includes a set of attributes, wherein a respective attribute has one or more values. In response to not obtaining a matching entry for the interest in a pending interest table, the system adds to the pending interest table a first entry which indicates the interest based on the attributes and their values. The system determines whether a received content object satisfies the interest indicated in the first entry based on the attributes of the first entry and attributes of the content object. In response to determining that the content object satisfies the interest, the system forwards the content object, thereby facilitating a flexible strategy for matching content objects to interests.

Abstract: A queue management method and apparatus are disclosed. The queue management method includes: storing a first packet to a first buffer cell included in a first macrocell, where the first macrocell is enqueued to a first entity queue, the first macrocell includes N consecutive buffer cells, and the first buffer cell belongs to the N buffer cells; correcting, based on a packet length of the first packet, an average packet length in the first macrocell that is obtained before the first packet is stored, to obtain a current average packet length in the first macrocell; and generating, based on the first macrocell and the first entity queue, queue information corresponding to the first macrocell of the first macrocell in the first entity queue, a head pointer in the first macrocell, a tail pointer in the first macrocell, and the current average packet length in the first macrocell.

Abstract: A method of configuring a first client device to utilize at least one type of rate adaptation method in a session with a second client device. The client devices determine whether a first type of rate adaptation method and a second type of rate adaptation method are to be used in the session. The first type is usable for both semi-static rate adaptation and dynamic rate adaptation, and the second type provides improved performance for dynamic rate adaptation. When only the first type of rate adaptation is to be used, the first client device is configured to utilize the first type for both semi-static rate adaptation and for dynamic rate adaptation. When both the first type and the second type are to be used, the first client device is configured to utilize the first type for semi-static rate adaptation and to utilize the second type for dynamic rate adaptation.

Abstract: A packet processing method, apparatus, and device are disclosed. The method includes: receiving, by a forwarding plane, an item from a control plane of the forwarding plane, where the item includes an identifier of a connected terminal; receiving an access protocol packet; when the access protocol packet is not an authentication start packet, determining, by the forwarding plane according to the identifier of the connected terminal, whether a terminal served by the access protocol packet is the connected terminal; and discarding, by the forwarding plane, the access protocol packet when the access protocol packet is not the authentication start packet and when the terminal served by the access protocol packet is not the connected terminal. The method improves user experience.

Abstract: Embodiments disclosed herein generally relate to a system and method for proactively generating an intervening message for a remote client device in response to an anticipated user action. A computing system receives one or more streams of user activity. The one or more streams of user activity include interaction with a server of an organization via an application executing on the remote client device. The computing system inputs the one or more streams of user activity into a prediction model. The computing system identifies an anticipated user action based on a prediction output from the prediction model. The computing system determines, based on a solution model, a proposed solution to the anticipated user action. The computing system generates an anticipated message to be transmitted to the remote client device of the user. The computing system transmits the anticipated message to the remote client device of the user.

Abstract: A Network Address Translating (“NAT”) Router, particularly designed for mobile use, and for managing one or more local area networks, having private internet protocol (“IP”) address ranges, along with multiple “upstream” networks, and for efficiently routing communications traffic to and from the upstream networks, is disclosed. The inventive router allocates multiple network connections of varying quality, to automatically optimize the effective connection speed in a mobile client network with optional personal “hotspot” sub-networks. The inventive NAT router is also capable of managing IP address allocation on local networks to substantially avoid conflicts with other networks encountered in normal use.

Abstract: Techniques for non-invasive diagnosis of configuration errors in distributed system are disclosed including obtaining data packets from a network that include inflows and outflows associated with a given component of the network. The number of inflows and the number of outflows for the given component of the network are determined based on the obtained data packets. An intersection point corresponding to a predetermined number of inflows and a predetermined number of outflows is obtained and a score for the given component is determined based on a relationship between the intersection point and the determined number of inflows and outflows for the given component. Whether the score for the given component is greater than a predetermined threshold is determined, and the given component is identified as having a configuration error in response to determining that the score for the given component is greater than a predetermined threshold.

Abstract: Methods, apparatus and articles of manufacture for custom interface specification in a cloud management system are disclosed. An example cloud management system includes: a first interface to communicate with a second interface external to the cloud management system; and a host to manage requests from the second interface and allocate resources to the second interface as a reverse proxy for the second interface with respect to a backend. The example host is to at least: add, at a first request from the second interface, an endpoint with respect to the second interface; fetch, at a second request from the second interface, data for the endpoint from the backend, the backend identified for the endpoint based on metadata in a component registry; and provide the data from the backend to the second interface.

Abstract: A method for transmitting information relating to a communication network, implemented by a first server of a communication network, the method comprising the following steps: storing a data table matching identifiers of subnetworks of the communication network associated with respective qualities of service, with at least one network address of a user terminal, the network address comprising an IP address of the user terminal; receiving a request from a second server of a service provider, the request requesting information linked to said communication network; transmitting at least a part of the data table to the second server, the part comprising the matches between each subnetwork identifier and the at least one network address of a user terminal.

Abstract: Described are techniques for controlling I/O response time. It is determined whether a first observed I/O response time for a storage group exceeds I/O performance specified by a service level objective. If so, first processing may be performed to decrease I/O performance for the storage group. The first processing may include: for each I/O directed to the storage group that is received within a first subsequent time period, determining a first response time denoting an amount of time taken to service each I/O prior to returning a response for each I/O; determining whether the first response time for each I/O is less than a response time delay threshold; and if the first response time for each I/O is less than the response time delay threshold, applying a response time delay to each I/O prior to returning a response for each I/O.

Abstract: Systems, methods, and software can be used to share content. In some aspect, an address associated with a packet is identified at an electronic device. The address is associated with a node on a traverse path of the packet. The address is compared with a list of one or more addresses associated with a security risk. The node is determined to have a security risk based on the address matching an address in the list of one or more addresses. In response to determining, a notification is outputted at the electronic device. The notification indicates that the traverse path of the packet has a security risk.

Abstract: Methods, systems, and computer readable media can be operable to facilitate dynamic packet prioritization for delivery of content to multiple devices. Methods, systems, and computer readable media described herein are operable to prioritize packet delivery to a plurality of client devices based upon feedback received from the client devices, wherein the feedback includes buffer status information associated with the client devices. The rate of transmitting packets to a client device having a stressed buffer may be increased, while the rate of transmitting packets to one or more other client devices may be decreased. Buffer status information may be received periodically or conditionally at a central device in the form of feedback messages output from one or more client devices.

Abstract: In one embodiment, a processor-readable medium storing code representing instructions that when executed by a processor cause the processor to update, at a memory location, a first flow state value associated with a data flow to a second flow state value when at least one of a packet from the data flow is received or the memory location is selected after a time period has expired. At least a portion of the packet is analyzed when the second flow state value represents a flow rate of a network data flow anomaly.

Abstract: Some embodiments provide a method for estimating bandwidth estimate based on a set of statistical measurements that quantifies bandwidth variation. The method receives a piece of media content at a receiving device and computes several instantaneous bandwidth measurements based on sample data blocks or media content received at the receiving device. The method computes the set of statistical measures that quantifies variation between the computed instantaneous bandwidth measurements. Based on the set of statistical measures, the method computes a revised bandwidth estimate for receiving media content at the receiving device. In some embodiments, the method uses the revised bandwidth estimate to determine an amount of media content data to buffer in order to provide an uninterrupted playback.

Abstract: A network interface receives an electronic mail on a first computer. A processor determines that the received electronic mail comprises a classification tag, and in response to the determination parses the classification tag to extract a plurality of classification information. The processor displays the plurality of classification information on the first computer.

Abstract: Systems and methods for adaptive access and handover configuration based on historical data are provided. Access and handover decisions are optimized in a multiple radio access technology environment using historical data associated with network performance. Future needs for access and handovers are predicted using historical data associated with the user and historical data associated with network performance. Performance metrics are received periodically or continuously from nodes in one or more networks at a centralized controller. The centralized multi RAT controller correlates these performance metrics and determines predicted handovers for a user device. Preparations for the predicted handovers can then be made prior to the handover event.

Abstract: A method may include transmitting, via a processor, a plurality of packets to a receiving component, such that the plurality of packets corresponds to a plurality of data operations configured to access a memory component. The plurality of packets is stored in a buffer of the receiving component upon receipt. The method may also include determining, via the processor, whether an available capacity of the buffer is less than a threshold, decreasing a transmission rate of the plurality of packets when the available capacity is less than the threshold.

Abstract: A system for transmitting concurrent data flows on a network, includes a memory containing data of data flows; a plurality of queues assigned respectively to the data flows, organized to receive the data as atomic transmission units; a flow regulator to poll the queues in sequence and, if the polled queue contains a full transmission unit, transmitting the unit on the network at a nominal flow-rate of the network; a sequencer to poll the queues in a round-robin manner and enable a data request signal when the filling level of the polled queue is below a threshold common to all queues, which threshold is greater than the size of the largest transmission unit; and a direct memory access configured to receive the data request signal and respond thereto by transferring data from the memory to the corresponding queue at a nominal speed of the system, up to the common threshold.

Abstract: Systems and methods that provide charging for supplemental content in a data flow separately from other content in the data flow. One embodiment comprises a network element of a Packet-Switched (PS) network that serves mobile User Equipment (UE). The network element receives a data flow of packets for a download of content requested by the UE, and identifies supplemental content in the data flow not requested by the UE, such as advertising content. The network element generates a charging request, inserts charging information for the supplemental content in the charging request, and transmits the charging request to a charging system so that the supplemental content can be charged separately from other content of the data flow.

Abstract: Systems and methods are provided to achieve traffic flow control in accordance with traffic priority as well as service plan considerations. A weight for flow control and a per service plan minimum flow control meter (FCM) can be defined for different throttle rates for different service plans. An FCM value based upon traffic priority can be converted to a per service plan group FCM value so that each service plan can be assigned/configured with its own FCM for each uplink queue. An average throttled data rate is then calculated to determine whether the traffic in a particular gateway is under or over throttled based on the current per service plan FCM with current input data rates. The per service plan FCM can then be revised for use by an Internet Protocol Gateway sending traffic to a Satellite Gateway.

Abstract: A method performed by a network system communicatively coupled to a device over a wireless network, the method comprising: receiving authentication information from the device over the wireless network, the authentication information enabling the network system to authenticate the device; obtaining a charging data record (CDR) comprising information identifying a device activity over the wireless network associated with the device and indicating a usage amount associated with the device activity; and using one or more rules, processing the CDR to generate information configured to assist in (a) providing to a partner entity an accounting of a first portion of usage of the wireless network associated with the device activity indicated by the CDR, the partner entity providing an Internet-based service to the device, and (b) determining an accounting of a second portion of the usage of the wireless network associated with the activity indicated by the CDR.

Abstract: A Packet Data Protocol (PDP) context handling method for a Mobile Station (MS) with a PDP context for an emergency bearer service is provided, wherein a radio access bearer (RAB) associated with the PDP context is released by a network. The method comprises the steps of: downgrading the maximum uplink bit rate and the maximum downlink bit rate associated with the PDP context from original non-zero positive values to a zero value; sending a request signal associated with a modification of the maximum uplink bit rate and the maximum downlink bit rate; and re-establishing the RAB for the PDP context with the maximum uplink bit rate and the maximum downlink bit rate reconfigured as the original non-zero values after the request signal has been sent.

Abstract: Techniques are described for managing data transmissions between computing systems based at least in part on using a streaming transport protocol. At least some such data transmissions may be performed using HTTP, with one or more underlying transport protocols used to implement the HTTP-based data transmissions. HTTP-based data transmissions performed using an underlying streaming transport protocol, for example, may send data without performing error detection for reliability and without ensuring ordered delivery of the sent data. In addition, one or more HTTP-based data transmissions may be initiated using an underlying streaming transport protocol, but subsequent data transmissions may switch to using a different underlying transport protocol (e.g., TCP) or different transmission technique that is performed without using data streaming.

Abstract: A scheme for managing conflict resolution in an ABR streaming environment with respect to a bandwidth pipe serving a customer premises. In one aspect, when a session request is received from a new ABR client launched in the customer premises that includes one or more existing ABR clients having corresponding streaming sessions, a bandwidth forecasting module is configured to forecast bandwidth requirements with respect to the corresponding ABR streaming sessions after accounting for a bandwidth requirement for the new ABR client's session request. A conflict condition may be detected if any of forecasted bandwidth requirements violates a bitrate threshold policy relative to the corresponding ABR streaming sessions and/or the new session being requested. If there is a conflict, an interactive session may be launched with one or more clients for facilitating user selection of one or more options relative to the impending conflict condition.

Abstract: A method of estimating available capacity of a data transfer path that transfers data between a sending and a receiving data communication node of a data communication system is disclosed. The method includes: sending one or more setting packets wherein the one or more setting packets is/are used to set a traffic shaping node arranged in the data transfer path in a steady state; transmitting, from the traffic shaping node, probe packets received from the sending node, towards the receiving node at an average rate for the traffic shaping node; providing, in response to traversal of the data transfer path by the probe packets, and during the real-time operation of the data transfer path, measured data for use in estimating the available capacity of the data transfer path; and estimating the available capacity of the data transfer path using the measured data from the probe packets.

Abstract: A cluster of computing systems is provided with guaranteed real-time access to data storage in a storage area network. Processes issue request for bandwidth reservation which are initially handled by a daemon on the same node as the requesting processes. The local daemon determines whether bandwidth is available and, if so, reserves the bandwidth in common hardware on the local node, then forwards requests for shared resources to a master daemon for the cluster. The master daemon makes similar determinations and reservations for resources shared by the cluster, including data storage elements in the storage area network and grants admission to the requests that don't exceed total available bandwidth.

Abstract: A system may receive, from a base station, information indicating that a network congestion level associated with the base station satisfies a threshold, the network congestion level being a measurement of traffic associated with a network, and the network including the base station. The system may determine, based on the network congestion level satisfying the threshold, traffic flow information for a plurality of traffic flows associated with the base station. The system may identify a congestion-causing traffic flow, of the plurality of traffic flows, based on the traffic flow information. The system may provide information identifying the congestion-causing traffic flow.

Abstract: In one embodiment, methods are described to measure bandwidth limits through multiple test sites. A testing quantity of network packets is generated, the network packets are sent through a service provider network to a plurality of receivers at a testing transmission rate that exceeds an upstream transmission rate limit of the service provider network, a report indicating a received number of packets is received from each of the plurality of receivers, and an upstream transmission rate limit of the service provider network is determined based on the testing transmission and the reports. By using multiple test sites, potential bottlenecks at any one test site are reduced. A similar method can be used to calculate a downstream transmission rate limit. Once measured, the bandwidth limits may be used to adjust quality of service on an edge router or compared against a known service level agreement of the service provider network.

Abstract: A method an apparatus for sending data to a User Equipment via a Radio Access Network node using the Transmission Control Protocol. A TCP node that sends TCP User Plane data to the UE receives a message originating from the RAN node. The message includes a congestion avoidance inhibitor relating to the UE. If the TCP node subsequently detects packet loss is detected between the TCP node and the UE, and the congestion avoidance inhibitor is present, then the TCP node will inhibit a congestion avoidance mechanism. This ensures that congestion avoidance mechanisms, which reduce transmission rate, are not initiated for temporary RAN events such as handover when there is no congestion in the network.

Abstract: A radio base station generates a congestion status flag, based on measured resource usage in its cell, and based on performance of sessions in the cell. The flag may be a one bit, or a small number of bits, indicating whether the base station is congested. The flag can be sent to neighboring radio base stations, for use in determining whether to perform handovers to that radio base station. The flag generated in a radio base station, and the flags generated in neighboring radio base stations, can also be sent to user equipment in a cell.

Abstract: A method of dynamically adjusting quality of service targets for applications and/or subscribers of wireless communication, by reducing or increasing quality of service targets for a group of applications based on overload or under load detection, in order to ensure that actually achieved quality of service levels are adequate, especially when supporting emergency service users.

Abstract: A system to route media information content may include a router that analyzes predetermined content of a plurality of data packets of the media information content and prioritizes forwarding the plurality of data packets from the router based on applying at least one rule to the predetermined content.

Abstract: Monitoring within a network a history of bits throughput to a base station over each of a plurality of time intervals, monitoring within the network a physical resource block utilization level over each of the plurality of time intervals, determining a ratio of the history of bits to the utilization level for each of the plurality of time intervals, determining an updated history of bits for each of a plurality of upcoming time intervals, estimating an updated utilization level in response to the updated history of bits and the ratio, generating messaging to at least one additional network element conveying the estimated updated physical resource block utilization level, and adjusting at least one of a prefilling process or a prefetching process in response to the updated utilization level.

Abstract: Apparatus, and associated method, for improving packet data communications upon a communication path including a radio-link. Determination is made of the conditions on the radio-link when selecting the optimal size of a transmission window within which to transmit packets of data. And, retransmission time-out values are also selected responsive to the indications of the radio-link conditions.

Abstract: An application bandwidth monitor may be configured to determine the amount of data communication channel bandwidth being utilized by each active data communication application within a data communication device. A user interface may be configured to report this information and to receive information indicative of a desired bandwidth allocation among the active applications. An application bandwidth controller may be configured to control the maximum bandwidth that may be utilized by each active data communication application, based on this user information.

Abstract: Balancing load distributions of loopback ports includes determining that a load distribution among loopback ports of a switch is unbalanced, determining whether the load distribution is balanceable, and balancing the load distribution.

Abstract: A method, a computer readable media and a device, the method is for evaluating a capacity of a cell of a radio access network (RAN), and may include monitoring, by a monitor, (a) downstream traffic that is directed towards the cell and (b) responses from the cell to the downstream traffic, to provide monitoring results; calculating, in response to the monitoring results, round trip time (RTT) statistics; and generating an estimate of the capacity of the cell in response to the RTT statistics.

Abstract: A capability is provided for detecting congestion in a communication network. A congestion condition is detected for the network based on resource utilization information associated with the network and a set of user quality-of-experience (QoE) indicators associated with the network. An indication of congestion in the network is detected based on resource utilization information associated with the network and a determination as to whether or not to generate detect a congestion condition for the network is made based on one or more user QoE indicators associated with the network. An indication of congestion in the network is detected based on resource utilization information associated with the network and a determination as to whether or not to generate a congestion alert for the indication of congestion in the network is made based on one or more user QoE indicators associated with the network.

Abstract: A system and method is described for formulating a linked-list hybrid peer-to-peer sub-network that analyzes capabilities of plurality of nodes, and creating at least two linked-list hybrid peer-to-peer sub-networks by forming a first group of nodes of the plurality of nodes having similar capabilities and establishing serial connections between nodes of the first group of nodes to form a first linked-list hybrid peer-to-peer sub-network.

Abstract: A technique for use in a communication device for communicating data involves receiving a plurality of transport data packets in an ordered sequence; rearranging at least some of the transport data packets in a group with a reordered sequence different from the ordered sequence, for increasing the total size of the group to be at or near a maximum transmissible unit size of a transport data frame; formatting the transport data packets of the group having the total size at or near the maximum transmissible unit size into the transport data frame, for data transmission from the communication device; and repeating, for a plurality of transport data frames, the acts of rearranging and formatting, for communicating the data.

Abstract: A system and method for handling a digital electronic flow between a first and second entity in which a flow policy is determined that is to be applied to the flow and the flow is then directed along a path in accordance with the policy. An ID is supplied for each flow and a tag associated with each flow which indicates the policy to be applied to its associated flow. Flows are also associated with one another, with associated flows having associated policies. In particular the flow may be processed or forwarded. The path may include a graph structure and virtual applications.

Abstract: A multihop network and nodes are described herein that implement a reactive routing protocol that enables resources of the multihop network to be continuously adapted in a distributed/opportunistic manner in response to a topology change within the multihop network so as to optimize the performance of a connection between a source node and a destination node. The types of resources that can be adapted include for example: (1) a route; (2) a channel; and/or (3) physical layer parameters. The different types of topology changes that can occur include: (1) movement of a node; (2) quality variations in a channel between the source node and the destination node; (3) changes in traffic patterns in the multihop network; (4) changes in transmit patterns (e.g., power, beamforming direction) in the multihop network; and (5) changes in resource allocations in the multihop network.

Abstract: A method and apparatus for transmitting a digitally encoded video image in real time wherein the video image is digitally encoded using a compression algorithm having a variable bit rate, e.g., JPEG2K, to provide an encoded data stream, the encoded data stream is fed into a buffer of known size, and the data is read from the buffer via a streamer with a controllable bit rate to provide a bit stream at a desired stream bit rate for transmission. The bit rate of the encoded data stream from the encoder is monitored by a predictor and predicts a future bit rate of the encoded data stream; and, the bit rate of at least one of the encoder and the streamer is adjusted to provide the desired streaming bit rate wherein the predicting of the future bit rate is carried out using a prediction model based on a smoothed bit rate vs. time curve of the encoded data stream.

Abstract: Back pressure is mapped within a network, and primary bottlenecks are distinguished from dependent bottlenecks. Further, the presently disclosed technology is capable of performing network healing operations designed to reduce the data load on primary bottlenecks while ignoring dependent bottlenecks. Still further, the presently disclosed technology teaches identifying and/or suggesting a switch port for adding a node to the network. More specifically, various implementations analyze traffic load and back pressure in a network, identify primary and dependent bottlenecks, resolve the primary bottlenecks, collect new node parameters, and/or select a switch port for the new node. Further, a command can be sent to a selected switch to activate an indicator on the selected port. New node parameters may include new node type, maximum load, minimum load, time of maximum load, time of minimum load and type of data associated with the new node.

Abstract: Disclosed is a method for achieving efficient and accurate measurement of path capacities of a communication network. The method includes the following steps: (a) transmitting a number of probes from a local node to a remote node over a forward network path, each probe contains at least one probe packet and can elicit the remote node to transmit a number of response packets to the local node over a reverse network path; (b) determine for each response packet a minimum round-trip packet delay between the time transmitting the probe and the time receiving the response packet; (c) calculate a number of pair-wise minimum delay differences from the minimum round-trip packet delays. The number of pair-wise minimum delay differences can be used as a measurement of the forward capacity, reverse capacity, faster-path capacity, slower-path capacity and a degree of capacity asymmetry between the local node and the remote node.