Abstract: Methods and apparatus are disclosed for obtaining diagnostic test results in respect of network elements in a network, the test results being obtained from a population of probes associated with network elements. The method comprises receiving a first-stage set of probe reports comprising, in respect of probes in an initial subset, a test result and metadata, each test result indicating a state of the network element associated with the probe; identifying a specific subset of probes in the initial subset wherein the test results from the probes in the specific subset satisfy a predefined condition; determining a subsequent subset based on the metadata of the probes in the specific subset; and triggering the probes in the subsequent subset to provide a second-stage set of probe reports comprising test results indicating states of network elements associated with probes in the subsequent subset.

Abstract: The present invention is directed towards systems and methods for selecting a path or link from a plurality of links between intermediary devices, based on characteristics of links between the intermediary devices and end nodes of the communication flow. The link choice may be determined from latency, packet drop rates, jitter, congestion, or other characteristics of the links to the end nodes. Link selection may further be based on traffic priority or transport layer quality of service (QoS) requirements of the connection, load balancing requirements, or other such features.

Abstract: A method for shaping traffic across a wide area network is disclosed. The method involves advertising a data rate limit across a wide area network (WAN) from a first node, measuring the rate of data received at a WAN interface of the first node, and, if the measured rate of data received at the WAN interface of the first node exceeds a maximum threshold, advertising a reduced data rate limit across the WAN, and, if the measured rate of data received at the WAN interface of the first node is below a minimum threshold, advertising an increased data rate limit across the WAN.

Abstract: In various embodiments, a multi-channel request-to-send and a multi-channel clear-to-send may be used in a wireless communications network to assure that a subsequent multi-channel communications exchange between two devices takes place only over channels that are sensed by both devices as being free.

Abstract: A control system is disclosed, including a first control device, a second control device and a driver component for driving signals on a data bus. The first control device includes a data output which is connected to a data input of the driver component, and a monitoring device for deactivating the data output in the event of a fault. A deactivation signal of the second control device for the driver component is fed to a data input of the first control device, and the first control device is configured to deactivate the data output in the event of an error signal at the data input.

Abstract: Network packet forwarding systems and methods are disclosed to push pre-processing tasks to network tap devices. In certain embodiments, packet flows from multiple monitoring points within a packet network communication system are monitored by a plurality of network tap devices to generate tapped packet flows associated with monitored network traffic flows. The tapped packet flows are transmitted from each network tap device to a tap controller, and the tap controller generates pre-processing rules based upon the tapped packet flows. Control messages including the pre-processing rules are then transmitted from the tap controller to the network tap devices, and the tapped packet flows are pre-processed at the network tap devices using the pre-processing rules to generate pre-processed packet flows. These pre-processed packet flows are then transmitted back to the tap controller where they are further processed and output to one or more destination devices.

Abstract: System resources on a computer system are conserved by controlling the applications that use those system resources. This can be accomplished by monitoring an indication of use of a system resource by a plurality of applications, determining whether the indication of use exceeds a predetermined threshold of use, if the indication of use exceeds the predetermined threshold of use then bundling the applications using that system resource into a resource group, and assigning a resource usage rate to the resource group for a period of time, the assigned resource usage rate being below the indication of use of that system resource, and the assigned resource usage rate applying collectively to the applications in the resource group.

Abstract: In an embodiment, a method monitors a plurality of data streams passing through a router in the connectivity service provider environment, and for each of the data streams, periodically samples packets at the router. The method further generates a stream signature based at least on the payload of the sampled packets. The method further includes, for each generated stream signature, attaching information to the stream signature. Such information may, for example, include time-stamp information for the stream signature, or an identification of the router. The method may further comprise storing the stream signatures corresponding to the data streams in a database. The stored stream signatures may be compared to determine matching stream signatures. Matching signatures may identify data streams that carry identical or similar content.

Abstract: Failure to identify an accurate rising position of a queueing delay alone has led to the inability to ensure estimation precision. An available bandwidth estimation method comprises: transmitting a packet train constituted by packet pairs arranged at equal intervals, each of the packet pairs comprising two packets of the same size arranged at a zero transmission interval, with the packet size of the packet train increasing at a constant rate; receiving the packet train; calculating an observation delay of the packets included in the received packet train; calculating a serialization delay on the basis of the reception interval between the two packets constituting each packet pair included in the received packet train; removing the calculated serialization delay from the calculated observation delay, thereby calculating a queueing delay; and estimating an available bandwidth on the basis of the calculated queueing delay.

Abstract: A method of monitoring a server rack system includes: initializing each of a rack management controller (RMC), a rack back plate (RBP) and a baseboard management controller (BMC); transmitting by the RMC an initiation message to RBP; transmitting by the RBP initiation messages to the BMC and the RMC, respectively; transmitting by the BMC an initiation message to RBP transmitting by the BMC a real-time monitoring output associated with a condition of a server to the RBP after receiving the initiation message transmitted by the RBP; and transmitting by the RBP at least a portion of the real-time monitoring output received from the BMC to the RMC after receiving the initiation message transmitted by the RMC.

Abstract: An approach, executed by a computer, for adjusting polling parameters. The approach includes one or more processors polling an endpoint application using an initial polling quantity and an initial polling frequency. The approach includes determining a first number of events not consumed in a queue of a listening application and a second number of events in a queue at the endpoint application at an end of a polling cycle. Furthermore, the approach includes adjusting at least one of the initial polling quantity and the initial polling frequency based, at least in part, on a comparison of the first number of events not consumed in the queue of the listening application and the second number of events in the queue at the endpoint application at the end of the polling cycle.

Abstract: In a method for adjusting the modulation of information onto subcarriers transmitted on a network, a first modulation profile of a network node on the network is set a first density. A plurality of messages in support of a link maintenance operation (LMO) on the network are monitored. The first modulation profile of the network node is updated to a second modulation profile having a second density. The updating is based on the monitored messages. Interference is detected by determining that a link between the first network node and a second network node on the network is not conveying a predetermined class of messages correctly. The first network node is set to a third modulation profile more robust than the first and second modulation profiles in response to the detected interference. The third modulation profile is common to each network node on the network.

Abstract: A method performed by a network device includes: receiving a first packet by the network device, wherein the first packet is tapped from a network; identifying a session to which the first packet belongs when the first packet has one or more values that at least partially match one or more terms, wherein the act of identifying the session is performed by the network device; receiving a second packet by the network device; determining whether the second packet belongs to the session; and performing a packet processing action by the network device based on the identified session; wherein the session is identified based on a first criterion, and the act of determining whether the second packet belongs to the session is performed based on a second criterion that is different from the first criterion.

Abstract: Notifying original state listeners within a domain model. Identifying listener registration information pertaining to a listener. Monitoring a hierarchical relationship tree for an observable event, whereby the hierarchical relationship tree includes model objects, and whereby an observable event includes one or more of a change to a model object, an error condition associated with a model object, and the hierarchical relationship tree returning to an original state. Determining that a first observable event to the hierarchical relationship tree has occurred. Transmitting a notification to the listener detailing the occurrence of the first observable event. Determining that a second observable event to the hierarchical relationship tree has occurred. Determining that a third observable event to the hierarchical relationship tree has occurred, whereby the third observable event includes the hierarchical relationship tree returning to an original state.

Abstract: A system communicates packets of data between two computers starting at an initial rate. The system then enters a slow start mode and increases the rate. As the rate increases, the system monitors acknowledgement data indicating a round trip time (RTT) associated with individual packets. When the RTT meets or exceeds a threshold, the system exits the slow start mode and continues the background connection a selected rate. The selected rate is based on the acknowledgement data associated with one or more packets having an RTT that meet or exceed the threshold. The features disclosed herein mitigate some of the issues with the LEDBAT protocol and other congestion control techniques, some which may include queue overflows and unnecessary slowdowns.

Abstract: The technologies disclosed herein provide improvements to the Low Extra Delay Background Transport (LEDBAT) protocol. In some scenarios, a LEDBAT connection cannot obtain accurate measurements for the base delay that it relies on. Slowing down a connection, initially and periodically, can ensure that base delay measurements begin accurately and remain accurate throughout the life of a connection. Data is communicated between two computers in a slow start mode, where a rate of the communication is increased over time from an initial rate. When one or more conditions are met, e.g., an interval lapses, the communication is slowed for a predetermined time period. The communication of the data then resumes in a slow start mode, where a rate of the communication is increased over time from an initial rate.

Abstract: An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform.

Abstract: The system and method of the present disclosure relates to technology for a network system supporting multiple topology transparent zones (TTZs) on an edge node. TTZs have a topology including TTZ nodes consisting of edge nodes and internal nodes connected together by internal links. The edge nodes may also be connected to external nodes outside of the TTZ. The edge node is responsible for generating and distributing link state advertisements (LSAs) to generate virtual paths from the edge node to other edge nodes in each of the TTZs. Each TTZ sharing the edge node and each external node neighboring one of the other edge nodes of the TTZs is virtualized by distribution of the LSAs. However, the internal topology of each TTZ is concealed from each of the other TTZs sharing the edge node and from any neighboring external node connected to one of the other edge nodes.

Abstract: System and method for supporting virtual machine migration in a high performance computing environment. In accordance with an embodiment, when a virtual machine migrates from a first subnet to a second subnet, a gateway port at the first subnet can, upon receiving packets addressed to the migrated virtual machine, consult a memory lookup table to discover the virtual machine's new addresses. The gateway port can update the packet accordingly. The memory lookup table can be addressed based on a GUID of the virtual machine.

Abstract: System and method for supporting flexible partition key (P_Key) mapping in a high performance computing environment. In accordance with an embodiment, when such computer environments comprise more than one subnet and/or forwarding domain that support inter-subnet partitions, the P_Keys comprising such inter-subnet partitions can change across domain boundaries. In such situations, a partition key of a packet can be updated upon entry to a new subnet and/or forwarding domain.

Abstract: Methods, devices, and systems for mapping transport segment labels to packet network endpoints using a mapping server. In some implementations, an end point address in an edge domain is received from an edge router, a mapping of one of the end point address to a transport segment label is received from a network device, the mapping is stored in a non-transitory memory device, and the mapping is transmitted to the edge router.

Abstract: A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.

Abstract: The document discloses a method for invoking a routing algorithm, an SDN-OAF, and an SDN controller. The method includes pre-configuring a customized routing algorithm; an SDN controller receiving a path computation request from an application, invoking a corresponding customized routing algorithm according to information about the customized routing algorithm carried in the path computation request to compute a service path.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising assigning one or more bitmask positions (BMPs) to one or more bit forwarding egress routers (BFERs) and advertising the assigned one or more BMPs. The method may further include one or more of determining an elected bitmask (BM) length based on maximum local BM lengths advertised by other BFRs and determining an elected tree type based on supported tree types advertised by other BFRs.

Abstract: A packet is received at a network device hosting a service function that is part of a service chain. The packet is sent to the network device from an originating network device. The content of the packet is analyzed to determine that the packet comprises a request for statistical values to be aggregated by the network device. The statistical values are aggregated at the network device. A report comprising the statistical values aggregated at the network device is generated. The report is sent to the originating network device.

Abstract: A method, operational at a device, includes receiving at least one packet belonging to a first set of packets of a packet flow marked with an identification value, determining that the at least one packet is marked with the identification value, determining to change a quality of service (QoS) treatment of packets belonging to the first set of packets marked with the identification value that are yet to be received, and sending a request to change the QoS treatment of packets belonging to the first set of packets marked with the identification value that are yet to be received to trigger a different QoS treatment of packets within the packet flow, responsive to determining to change the QoS treatment. Other aspects, embodiments, and features are also claimed and described.

Abstract: Expertise, for performing classification of a type of network traffic, can be encapsulated in a module. A set of modules, as currently available to a traffic controller, can be referred to as a collection. Programming language constructs are introduced that facilitate the writing of modules customized to identify network traffic that is peculiar to a particular user, or to a relatively small group of users. An example programming language, based on Tcl, is introduced. A key aspect is event-driven programming, and the “when” command construct is introduced. Three important event types, that can trigger a “when” command, are CLIENT_DATA, SERVER_DATA, and RULE_INIT. Another key aspect is an ability to keep state information between events. Constructs for intra-session, intra-module, and global state are introduced. A module can be blocked from executing more than once for a session. Successful execution of a module can be specified by a “match” statement.

Abstract: In one embodiment, a device in a network receives a packet that includes a forwarding label for a service in a service chain. The packet encapsulates a service chain header for the service chain. The device swaps the forwarding label for the service in the packet for a reserved label that identifies the packet as encapsulating the service chain header. The device forwards the packet with the reserved label to the service.

Abstract: In one embodiment, a traffic engineering (TE) label switched path (LSP) is established between a head-end node in a local domain and a tail-end node in a remote domain. The TE-LSP spans one or more intervening domains located between the local domain and the remote domain. The head-end node sends a routing information request over the TE-LSP to a target node on the TE-LSP that is in the remote domain. The head end node receives routing information from the target node. The received routing information includes a list of address prefixes reachable by the target node. The head end node uses the received routing information to calculate routes reachable via the TE-LSP to the target node. The calculated routes have a next-hop interface set to be the TE-LSP. The calculated routes are inserted into a routing table of the head-end node.

Abstract: The invention relates to a method of controlling a packet stream generated by an application (APP) installed in a mobile terminal (UE), the stream being intended to be sent by the terminal over a communications network managed by an operator, the method comprising the following steps implemented in the terminal, for all or some of the packets generated by the application: obtaining and analysis of a packet, termed the first packet (P1), sending by the terminal of a second packet (P2) based on the first packet and conforming to at least one processing rule established by the operator, as a function of the result of the analysis and if the result of the analysis permits the sending.

Abstract: Embodiments of the present invention provide a communications method and a communications device, so that multiple service signals can be borne in a same bearing area of a same Ethernet PCS lane. Therefore, it is implemented that multiple types of service signals share an Ethernet channel, so that the multiple types of service signals can share a link resource and an interface module resource. This provides a basis for convergence and integration of devices in a multi-technology system, and can improve utilization of link resources and reduce a quantity, a footprint, power consumption, maintenance costs, and the like of devices in a metropolitan area network.

Abstract: Techniques for smart data routing are described. A system may include a storage module configured to store network conditions for a plurality of networks and locations and a server device. The server device may be configured to determine network conditions for each of a plurality of networks and locations based upon detected usage of at least one mobile application being accessed via each of the plurality of networks and in each of the locations. Determined network conditions may be stored at the storage module. The server may be further configured to receive a request for a communication from a client device. Based upon at least the determined network conditions, the server may be configured to determine routing information for the communication. Once determined, the server may be configured to provide the routing information for the communication to the client device.

Abstract: A tool that may be used for querying and obtaining per-hop information along a network path, and/or for verifying the host name of each hop against a data repository such as the DNS. The query and response may be transmitted in, e.g., the destination options header of data packets, such as an IPv6 destination options header.

Abstract: Aspects of the embodiments include receiving a packet at a network element of a packet-switched network; identifying a presence of a shared service destination address in a header of the packet; identifying a shared service destination address for the packet based, at least in part, on a destination internet protocol (IP) address stored in a forward information base; and forwarding the packet to the shared service destination address.

Abstract: Various systems, processes, and products may be used to filter multicast messages in virtual environments. In particular implementations, a system, process, and product for filtering multicast messages in virtual environments may include the ability to, responsive to receiving a multicast message including a destination address, examine a local filtering store of the network adapter for a multicast filtering address matching the destination address. The message is sent to respective virtual machines if the destination address matches the multicast filtering address found in the local filtering store for the respective virtual machines. Responsive to determining that the destination address does not match any multicast filtering address found in the local filtering store, a determination is made whether the local filtering store is full and, if so, the multicast message is dropped.

Abstract: A gateway router can receive an Interest that includes a location-independent name for a data collection. If the Interest does not include an Anchor Identifier, the gateway router can perform a lookup operation in a name-prefix forwarding-information base (NP-FIB) to select an Anchor Identifier for a target anchor node, and to select an interface for forwarding the Interest toward the anchor. The router can update the Interest to include the Anchor Identifier prior to forwarding the Interest via the interface. An edge or core router that receives the Interest can perform a lookup in a routing table using the Interest's Anonymous Identifier (AID) to obtain an interface toward the anchor node and a second AID that is to be used by the next-hop neighbor to process the Interest. The router may then update the Interest to replace the Interest's AID with the second AID prior to forwarding the Interest.

Abstract: Example implementations relate to fragmented packet processing resource determination. For example, an apparatus includes a processor receive an initial fragmented packet from a source device. The initial fragmented packet includes a first header and a second header. The processor is also to generate a first hash value based on the first header and based on the second header. The processor is further to determine an initial fragmented packet processing resource based on the first hash value and to generate a second hash value based on the first header.

Abstract: A method for load balancing in a data network including a plurality of network switches includes receiving a data flow, initiating a path selection process to determine a path between a source network switch and a destination network switch, the path selection process selecting an optimal path based on congestion information of the first network switch and the congestion information of the second network switch, the optimal path corresponding to a path of minimal congestion, and transmitting the data flow along the selected path.

Abstract: System and method for aggressive credit waiting in a high performance computing environment. In accordance with an embodiment, systems and methods can provide for an indexed matrix of credit wait policies between ports within a single switch. In addition, systems and methods can provide for an array of credit wait polices at an egress port from a switch, the array being indexed by virtual lane.

Abstract: A method for providing quality of service includes identifying a high network traffic event at a node, providing a user score to each user account of a plurality of user accounts, wherein the plurality of user accounts corresponds to a plurality of user devices connected to the node, and responsive to identifying the high network traffic event, providing instructions to a subset of user devices of the plurality of user devices, wherein the instructions instruct the subset of devices to enter a low traffic mode, and wherein each device of the subset of devices corresponds to a user account with a user score below a threshold. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A system and method of providing status updates to one or more mobile devices. The method includes receiving a vehicle action request from the mobile device at a central office, determining a status update frequency based upon at least one real-time characteristic, and instructing the mobile device to request status updates on the vehicle action request to the central office at the status update frequency. In an alternative method, a plurality of mobile devices may be instructed to use different status update frequencies. The system includes a server configured to receive a vehicle action request from the mobile device at a central office, determine a status update frequency based upon at least one real-time characteristic, and instruct the mobile device to request status updates on the vehicle action request to the central office at the status update frequency.

Abstract: The technologies disclosed herein provide improvements to the Low Extra Delay Background Transport (LEDBAT) protocol. Some aspects of the present disclosure introduce an adaptive congestion window gain for background connections. In some configurations, a gain value for influencing the transmission rate of a background connection is dynamically adjusted based on data indicating a round trip time (RTT). The RTT includes a sum of a time in which the data is communicated to a remote device and a time in which acknowledgement is data returned from the remote device. In some configurations, the gain is decreased when the RTT is below a threshold and the gain is increased when the RTT is above the threshold. Among other features, the present disclosure also provides techniques involving a modified slow-start, multiplicative decrease and periodic slowdowns. The features disclosed herein mitigate some existing issues, such as latency drift, inter-LEDBAT fairness, and unnecessary slowdowns.

Abstract: A control apparatus controlling a first data transfer apparatus including a first port, the control apparatus includes a memory, and a processor configured to detect a first transmission rate of first data transmitted using the first port is equal to or higher than a first value, when it is detected that the first transmission rate is equal to or higher than the first value, request the first data transfer apparatus to change a destination of a first packet from a first information processing apparatus to a data buffer, after the first packet transmitted from the first data transfer apparatus is stored for a first period in the data buffer, cause the data buffer to transmit the first packet to the first data transfer apparatus, and request the first data transfer apparatus to change the destination of the first packet from the data buffer apparatus to the first information processing apparatus.

Abstract: Disclosed are a management node and the like for enabling packets to be efficiently sent to a plurality of destination terminals, while preventing the increase of implementation scale of network interface cards (NIC). The management node includes: a rule determination means for determining a prescribed rule for distributing packets to a plurality of rate control means included in the network interface cards (NIC) provided to the terminals; and a rule sending means for sending the determined prescribed rule to the terminals.

Abstract: Systems and methods for integrating ultra-fast programmable networks in microgrid are disclosed to provide flexible and easy-to-manage communication solutions, thus enabling resilient microgrid operations in face of various cyber and physical disturbances. The system is configured to establish a novel software-defined networking (SDN) based communication architecture which abstracts the network infrastructure from the upper-level applications to significantly expedite the development of microgrid applications, develop three functions of the SDN controller for microgrid emergency operations, including time delay guarantee, failover reconfiguration and rate limit and create a hardware-in-the-loop cyber-physical platform for evaluating and validating the performance of the presented architecture and control techniques.

Abstract: The present disclosure relates to a pre-5th-Generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4th-Generation (4G) communication system such as Long Term Evolution (LTE). An operation method of a transmission device according to an embodiment includes determining the amount of packets transferred from an application layer to a buffer and determining the amount of packets transferred from the buffer to a transmission layer. The method also includes blocking/non-blocking a packet transfer from the application layer to the buffer, based on the amount of packets transferred from the application layer to the buffer and the amount of packets transferred from the buffer to the transmission layer.

Abstract: A computer implemented system is provided for improving performance of transmission in real-time or near real-time applications from at least one transmitter unit to at least one receiver unit. The system includes an intelligent data connection manager utility that generates or accesses performance data for two or more data connections associated with the two or more communication networks, and based on the current performance data determining current network transmission characteristics associated the two or more data connections, and bonds the two or more data connections based on: a predetermined system latency requirement; and dynamically allocating different functions associated with data transmission between the two or more data connections based on their respective current network transmission characteristics.

Abstract: Relating to Active Queue Management (AQM) in wireless communication networks, a method of congestion control in a first network node. The first network node is operable in a wireless communication network utilizing a distributed queue system for in-sequence delivery of data packets between the first network node and a second network node. A condition indicative of congestion is detected by the first network node. In response thereto, a control message is transmitted from the first network node to the second network node. The control message comprises an instruction to the second network node to discard, or distort, a subsequent data packet. The receiving, network node is thus made aware of the congestions situation relatively quickly. Accordingly, the second network node may speedily take appropriate measures by discarding, or distorting, a subsequent data packet and thereby establish a congestion avoidance mechanism.

Abstract: Provided are a communication system and a communication device that allow a reception node to estimate delay time, a generation time point or the like of a message. A delay time estimation part in an ECU determines whether a message received by itself is transmitted in sequence with another message without being provided with time information by a transmission node. If the received message is transmitted in sequence with another message, the received message may be delayed due to arbitrary processing. Thus, the delay time estimation part checks the priority of one or more sequential messages preceding the received message, and estimates delay time of the received message occurring due to the arbitrary processing in accordance with the priority of each message. A generation time point estimation part estimates the time point when the received message is generated by an ECU, based on the delay time estimated.

Abstract: A method of managing bandwidth allocation across a video pipe that delivers both streaming adaptive bitrate (ABR) content and progressive download ABR content includes receiving a designation of a congestion boundary within a video pipe, the congestion boundary designating a first percentage of the video pipe that is to be used for streaming ABR content when congestion exists on both sides of the congestion boundary, wherein a remaining percentage of the video pipe is to be used for progressive download ABR; allocating bandwidth for streaming ABR content, wherein the gateway device can allocate for streaming content only that portion of the remaining percentage of bandwidth that is not requested for progressive download content; and allocating bandwidth for progressive download content, wherein the gateway device can allocate for progressive download content only that portion of the first percentage of bandwidth that is not requested for streaming content.