Abstract: A method includes receiving, at a device from a content source, a portion of a particular chunk of media content a particular quality level during adaptive bit rate media streaming of the media content. The method includes receiving, at the device, network data related to network conditions associated with the device in response to receipt of the portion. The method also includes, in response to a determination to download the particular chunk at a first quality level different than the particular quality level, the determination based on the particular quality level and the network data: sending a request from the device for the particular chunk at the first quality level to the content source, and replacing the portion with the particular chunk at the first quality level.

Abstract: Managing composable compute system infrastructure with support for decoupled firmware updates includes mapping a device to a server, wherein the device is in a resource pool of devices including at least one idle device, and wherein the device and the server are within a pod of composable compute elements connected by a fabric in a composable system executing a workload; detecting that the device has a needed firmware update; exchanging, transparent to the workload executing in the composable system, the mapping for the device with the needed firmware update and the idle device in the resource pool; and performing the firmware update on the unmapped device as the workload executes in the composable system with the newly mapped device.

Abstract: Methods, apparatus, and systems for data plane interface network Quality of Service (QoS) in multi-tenant data centers. Data plane operations including packet generation and encapsulation are performed in software running in virtual machines (VMs) or containers hosted by a compute platform. Control plane operations, including QoS traffic classification, are implemented in hardware by a network controller. Work submission and work completion queues are implemented in software for each VM or container. Work elements (WEs) defining work to be completed by the network controller are generated by software and processed by the network controller to classify packets associated with the WEs into QoS traffic classes, wherein packets belonging to a give traffic flow are classified to the same QoS traffic class.

Abstract: System and techniques for information centric network (ICN) implemented content data networks (CDNs) are described herein. A directive to initiate a cache operation for content may be received at a gateway of an ICN. An interest packet may be constructed based on the directive. The interest packet may be transmitted on the ICN and a response to the interest packet received. Here, the response has a payload that corresponds to the content. The payload then may be cached at a local repository of the gateway.

Abstract: According to one embodiment, a memory system includes a nonvolatile memory (NVM) and a controller. The controller communicates with an external device via virtual channels (VC) defined in PCI Express Base Specification (PCIe). The external device communicates with the NVM of the memory system per NVM Express Base Specification (NVMe). The controller manages a set of priority relation information (PRI), which maps each priority of Weighted Round Robin with Urgent Priority Class Arbitration mechanism defined in NVMe, to a specific VC. Using the PRI, the controller ensures that the same VC is used throughout the command execution transactions. Quality of Service of communication between the external device and the memory system can thus be improved.

Abstract: A RAID storage controller storage-device-assisted data update system includes a RAID storage controller device coupled to a host system and RAID storage devices in a “look aside” RAID storage controller device configuration. Based on command(s) from the RAID storage controller device, a first RAID primary data storage device may perform a first DMA operation to access first primary data stored on the host system, and write the first primary data to its first buffer subsystem. The first RAID primary data storage device may then perform a first XOR operation using the first primary data stored in its first buffer subsystem and second primary data stored in its first storage subsystem in order to produce first interim parity data, and write the first interim parity data to its second buffer subsystem. The first RAID primary data storage device may then update the second primary data with the first primary data.

Abstract: A data-transfer-based RAID data update system includes a RAID storage controller device coupled to a host system and RAID storage devices. The RAID storage controller device receives a command that is associated with a data update on at least one of the RAID storage devices from the host system. The RAID storage controller device then determines, from a plurality of RAID data update techniques that are available to execute the command and perform the data update on the at least one of the RAID storage devices, a first RAID data update technique that is included in the plurality of RAID data update techniques and that requires the lowest number of data transfers to execute the command and perform the data update. The RAID storage controller device then causes the command to be performed using the first RAID data update technique to provide the data update.

Abstract: A computer program product for electronic communications. Receiving a sender identifier and a recipient identifier. A first message is received from the sender identifier to send to the recipient identifier. Determining the relative ranking of the sender and the recipient. In response to determining that the recipient has a higher relative ranking than the sender, determining whether the first message contains an action item. In response to determining that the first message contains an action item, transmitting a second message to the sender. In response to receiving an indication from the sender to send the first message, sending the first message from the sender identifier to the recipient identifier.

Abstract: A device may receive a message from a first different device that includes an identifier and may determine whether the device has previously received the message. The device may generate, based on determining that the device has not previously received the message, an additional identifier and a message status indicator and may cause the additional identifier, the message, and the message status indicator to be stored in a data structure associated with the device. The device may send an acknowledgment status to the first different device and may cause processing of the message to generate an additional message that includes the additional identifier. The device may send the additional message to a second different device and may cause, after sending the additional message to the second different device, the message status indicator in the data structure to be updated.

Abstract: Resource provisioning information links to resource provisioning information of at least one reusable component resource that satisfies at least a portion of user-specified resource development constraints of a new resource under development are identified within a resource provisioning-link registry. Using the identified resource provisioning information links, the resource provisioning information of the at least one reusable component resource is programmatically collected from at least one data provider repository that stores reusable resources and that publishes the resource provisioning information links to the resource provisioning-link registry. The programmatically-collected resource provisioning information of the at least one reusable component resource is analyzed.

Abstract: Resource provisioning information links to resource provisioning information of at least one reusable component resource that satisfies at least a portion of user-specified resource development constraints of a new resource under development are identified within a resource provisioning-link registry. Using the identified resource provisioning information links, the resource provisioning information of the at least one reusable component resource is programmatically collected from at least one data provider repository that stores reusable resources and that publishes the resource provisioning information links to the resource provisioning-link registry. The programmatically-collected resource provisioning information of the at least one reusable component resource is analyzed.

Abstract: Examples disclosed herein relate to management of default route advertisement by an Area Border Router in an OSPF network. In an example, an ABR in an OSPF network may determine whether a pre-condition for the ABR to advertise a default route to a stub area is met. In response to a determination that the pre-condition for the ABR to advertise the default route to the stub area is met, the ABR may advertise the default route to an adjacent router in the stub area.

Abstract: Embodiments of the present invention disclose a fault analysis method based on a data center. The method includes obtaining a topology structure diagram, where nodes in the topology structure diagram include component devices of the data center and a virtual machine running on the data center. The method also includes, when a fault occurs in the data center, obtaining a fault alarm and determining, according to the topology structure diagram, whether the fault reduces communications paths between virtual machines in a virtual machine group running on the data center.

Abstract: System and techniques for information centric network (ICN) implemented content data networks (CDNs) are described herein. A directive to initiate a cache operation for content may be received at a gateway of an ICN. An interest packet may be constructed based on the directive. The interest packet may be transmitted on the ICN and a response to the interest packet received. Here, the response has a payload that corresponds to the content. The payload then may be cached at a local repository of the gateway.

Abstract: Implementations of the subject matter described herein provide a storage management method and system. The storage management method comprises: in response to receiving a write request, dividing data to be written into a plurality of data blocks with a predetermined size, the plurality of data blocks having their respective logic block addresses; evenly mapping, based on the logic block addresses, the plurality of data blocks to a plurality of RAID extents of a Redundant Array of Independent Disks (RAID); mapping the plurality of data blocks in the plurality of RAID extents to the disk, so that the plurality of data blocks are distributed in order of size of logic block addresses in the disk.

Abstract: This invention relates to a method and system for creating Big Data applications that can be executed on heterogeneous clusters. The applications can be executed on a particular platform, such as SPARK or UIMA-AS, but the method and system are able to translate the input to these targeted platforms without the developer needing to tailor the application specifically to the platform. The method and system are based on the use of an execution dependency graph, a cluster configuration, and a data size to create a stages table. The stages table is then optimized to increase the overall efficiency of the heterogeneous cluster. The stages table is then translated into a platform specific Big Data application.

Abstract: Various example implementations are directed to circuits, apparatuses, and methods for monitoring and/or analysis of computing servers. According to an example embodiment, an apparatus includes a processing circuit having an analysis circuit configured to retrieve operating state data for a plurality of servers. The analysis circuit determines an operating state of each of the servers for a plurality of time periods. The determined operating state is one of an up state, a warning state, and a down state. The processing circuit also includes an interface circuit configured to provide a graphical user interface (GUI). For each of the servers, the GUI displays a timeline having a respective time block for each of the plurality of time periods. Each time block has a graphical indication of one of the three states of operation corresponding to the operating state of the server at the corresponding time period.

Abstract: A data processing system includes a plurality of switch points interconnected by a write data network and a write request network. Each switch point includes write request switch circuitry having write request ingress ports and write request egress ports coupled to the write request network and arbitration circuitry configured to grant a write request received at one of the write request ingress ports access to one of the write request egress ports. Each switch point also includes write data switch circuitry having write data ingress ports and write data egress ports coupled to the write data network. In response to the write request arbitration circuitry granting the write request, allowing write data from the write data ingress port corresponding to the one of the write request ingress ports to be provided at the write data egress port which corresponds to the one of the write request egress ports.

Abstract: Dynamically determining an optimum connectivity path is provided. Default paths to connectivity sources associated with a payer may be determined and ranked based on various metrics, such as availability, content, and cost. When a connection to a primary connectivity source is determined to be down or unresponsive, a request may automatically be routed to a next connectivity source, wherein the next connectivity source is determined to be a next highest ranking connectivity source based on the various metrics. Data associated with availability, content, cost, and other attributes may be collected, stored in a database, and utilized to rank connectivity sources. Accordingly, as new information about a payer or connectivity source is discovered, default paths and rankings of connectivity sources may change.

Abstract: Resources may be managed in a topology for audio/video streaming. The topology includes audio/video sources and sinks and intervening branch devices. Messages between these sources, sinks, and branch devices may be used for resource management.

Abstract: A load balancer obtains respective workload metrics of various worker nodes of a distributed system. In response to determining that a work request is to be assigned, the load balancer generates a workload variation estimate associated with the worker nodes. Using the workload variation estimate, the load balancer determines a size of a candidate pool of worker nodes for the work request. The load balancer assigns the work request to a selected worker node from the candidate pool.

Abstract: Systems and methods for recognizing congestion in a mobile network to make intelligent decisions regarding connecting to an operator network is disclosed. A mobile device having a local proxy equipped with congestion recognition capabilities can use time elapsed to establish connection with a mobile base station in the mobile network to recognize congestion at the mobile base station. Further, in response to recognizing congestion at the mobile base station, the local proxy can selectively block traffic from the mobile device from traversing the mobile network to reduce signaling overload on the mobile network.

Abstract: According to some aspects as described herein, a user may purchase or otherwise be provided with an accelerated service for selected software applications, devices, and/or ports to experience a high level of communication. The accelerated service may be created, for example, by using a dedicated network data flow such that the user's customer premise equipment (CPE) network access device may put priority traffic in a different upstream data flow than the commonly shared flow, which may involve tagging the traffic upstream to the network with a priority indicator such as a flow identifier. Based on similar factors, the user may also control local priority of data received downstream from the network for distribution to one or more local devices.

Abstract: Bandwidth management systems and methods performed in a Software Defined Networking (SDN) controlled network include, responsive to detecting congestion on one or more network services with identifiable data therein, obtaining policy associated with the congested network services and causing bandwidth on demand in the network to mitigate the congestion if the bandwidth on demand is possible in the network and permitted based on the policies of the congested network services; responsive to the congestion remaining subsequent to the bandwidth on demand or if the bandwidth on demand is not possible or permitted, orchestrating bandwidth for the congested network services based on their associated priority in their policy; and, responsive to the congestion remaining subsequent to the orchestrating bandwidth based on priority, orchestrating bandwidth for the congested network services based on an amount remaining to download for each of the congested network services.

Abstract: A method, apparatus and computer program product are provided in order to provide management of allocation of communication resources.

Abstract: Address translation and caching is managed using a processor that includes at least one CPU configured to run a hypervisor and at least one guest operating system. The managing includes: translating from virtual addresses to intermediate physical addresses; translating from the intermediate physical addresses to physical addresses; determining reuse information for memory pages based on estimated reuse of cache lines of data stored within the memory pages; storing the determined reuse information independently from: (1) any bits used to indicate virtual addresses, (2) any bits used to indicate intermediate physical addresses, and (3) any bits used to indicate physical addresses; and using the stored reuse information to store cache lines in a selected group of multiple groups of cache lines of a first cache.

Abstract: A virtual link bandwidth control scheme is described that is a software-based mechanism for achieving distributed and coordinated bandwidth control. The scheme can be seamlessly integrated with the data transfer protocols utilizing queuing delay as part of rate control mechanism for data transfer and allows multiple processes to self-limit their transfer speeds, so that the aggregate rate stabilizes at a pre-configured level below the physical bottleneck capacity.

Abstract: In one embodiment, an apparatus for providing quantized congestion notification (QCN) proxy functionality to a network device control plane includes a processor and logic integrated with and/or executable by the processor, the logic being configured to enable QCN proxy functionality for a particular congestion notification priority value (CNPV) on each edge port of a QCN edge switch, wherein the QCN edge switch includes one or more edge ports connected to devices outside of a congestion notification domain (CND) that operates on the particular CNPV, and forward congestion notification packets received at the QCN edge switch using the QCN proxy functionality when the packets are destined for one of the devices connected outside of the CND that is not QCN-enabled. Other systems, methods, and computer program products for providing QCN proxy functionality to a network device control plane are described in more embodiments.

Abstract: Embodiments of apparatuses with a universal P2P service platform are disclosed herein. A unified infrastructure is built in such apparatuses and a unified P2P network may be established with such apparatuses. In various embodiments, such an apparatus comprises a P2P operating system (OS) virtual machine (VM) 202 and a client guest operating system (OS) virtual machine (VM) 204. There is a collection of P2P services in the P2P OS VM 202 and this VM 202 works as a peer node in the P2P network. There is a collection of API services in the client guest OS VM 204 and this VM 204 interacts with various P2P applications. The two VMs communicate with each other via a shared memory 216 and a virtual machine manager 214. In various embodiments, the apparatus further includes a security checker 318 located in the P2P OS VM 302. Other embodiments are also described.

Abstract: A computer receives a heartbeat message that includes both program reset information and at least one segment, of the heartbeat message, that is configured to indicate whether or not a first program is functioning correctly. The computer determines if the heartbeat message includes the indication that the first program is functioning correctly. If the computer determines that the heartbeat message indicates that the first program is functioning correctly, then the computer sends a data stream to the first program.

Abstract: At least one CPU is configured to run a hypervisor at a first access level and at least one guest operating system at a second access level. At the second access level, translating uses mappings in a first page table; and, at the second access level, class information is determined for a memory page mapped by the first page table based on a classification of virtual addresses. At the first access level, translating uses mappings in a second page table; and, at the first access level, class information is determined for the memory page mapped by the second page table based on a classification of intermediate physical addresses. The class information determined at either access level is independent from certain bits used to indicate addresses. Class information determined at different access levels is processed to determine processed class information for the memory page using a dynamic processing rule.

Abstract: Methods, apparatuses, and computer program products for performing collective operations on a hybrid distributed processing system including: determining by at least one task that a parent of the task has failed to send the task data through the tree topology; and determining whether to request the data from a grandparent of the task or a peer of the task in the same tier in the tree topology; and if the task requests the data from the grandparent, requesting the data and receiving the data from the grandparent of the task through the second networking topology; and if the task requests the data from a peer of the task in the same tier in the tree, requesting the data and receiving the data from a peer of the task through the second networking topology.

Abstract: A traffic profile or description of a mix of different types of traffic is provided to compute, using a model, a performance characteristic of a network device. The model relates a performance characteristic of the network device to parameters associated with different types of traffic.

Abstract: In one embodiment, a method includes receiving a value associated with a data packet and identifying a data set based on the value. The data set is associated with a range of values and represents routing actions. The data set is a first data set from a plurality of data sets if the value is included in the range of values associated with the first data set. The data set is a default data set if the value is not included in a range of values associated with a data set from the plurality of data sets. The method includes combining the first data set with the default data set if the first data set is identified. The method includes combining the default data set with an except data set if the default data set is identified.

Abstract: A method in a cable modern (CM) to adjust its timing offset when waking up prior to the termination of its sleep cycle is provided. The method includes the step of receiving a service identifier (SID) for a multicast maintenance region, receiving a message from a cable modem termination system (CMTS) to enter a sleep cycle, waking up from the sleep cycle before the end of the sleep cycle in response to an event, and sending a message to the cable modem termination system (CMTS) to adjust the CM's timing offset during the multicast maintenance region.

Abstract: Systems and methods for accessing an update server to receive one or more updates for data are provided. In some aspects, a system includes an auto-update module configured to determine whether to access the update server directly or by proxy. If the auto-update module determines to access the update server by proxy, the auto-update module is configured to: transmit a request to a proxy manager module for proxy server data that identifies one or more proxy servers; receive the proxy server data from the proxy manager module in response to the request; and access the update server based on the proxy server data to receive one or more updates for the data. The auto-update module is subject to fewer restrictions in modifying the data than is the proxy manager module.

Abstract: The disclosure relates to a traffic scheduling device for scheduling a transmission sequence of data packets, stored in a plurality of traffic flow queues, an eligibility state of each of the traffic flow queues for the scheduling is being maintained in a hierarchical scheduling database describing a relationship among the plurality of traffic flow queues. The traffic scheduling device includes: a plurality of interconnected memory cluster units. Each memory cluster unit is associated to a single or more levels of the hierarchical scheduling database and each memory cluster unit is coupled to at least one co-processors. At least one co-processor is software-programmable to implement a scheduling algorithm. The traffic scheduling device also includes an interface to the plurality of traffic flow queues.

Abstract: A method for speeding up data downloads across the Internet utilizing a proxy server to receive client requests for downloading remote data files and then establishing multiple concurrent sessions from the proxy server which balance the download of the remote data in multiple segments across two or more available wide-area network (WAN) links.

Abstract: In accordance with some aspects of the present invention, systems and methods are provided for dynamically and/or automatically selecting and/or modifying data path definitions that are used in performing storage operations on data. Alternate data paths may be specified or selected that use some or all resources that communicate with a particular destination to improve system reliability and performance. The system may also dynamically monitor and choose data path definitions to optimize system performance, conserve storage media and promote balanced load distribution.

Abstract: A video surveillance system wherein a monitoring station collects video data obtained by a monitoring camera is disclosed. The system includes a multihop wireless network formed of a plurality of wireless nodes including a first wireless node having the monitoring camera, and a second wireless node having a gateway connected to the monitoring station. The system also includes a priority control device configured to control the wireless network so that transmission in a link between the first wireless node and the second wireless node is performed at a priority level contained in a priority information message. The transmission including transmitting a video data request from the monitoring station to the monitoring camera, or transmitting video data from the monitoring camera to the monitoring station.

Abstract: The present disclosure describes a system and method for reducing total batch completion time using a per-destination max-min fairness scheme. In a distributed computer system, worker nodes often simultaneously return responses to a server node. In some distributed computer systems, multiple batches can traverse a network at any one given time. The nodes of the network are often unaware of the batches other nodes are sending through the network. Accordingly, in some implementations, the different batches encounter different effective path capacities as nodes send flows through links that are or become bottlenecked. The per-destination max-min fairness scheme described herein reduces the total batch completion time by collectively routing the batches in a way that targets providing substantially uniform transmission times without under underutilizing the network.

Abstract: Resource command messages comprise commands and command urgency or importance information that is interpreted by a resource device and is coupled with information relating to the resource device to determine when to process the command within the resource command message. Resource devices comprising a plurality of resource nodes provide increased performance, responsiveness, and load balancing by multiple resource nodes processing the same resource command message in parallel.

Abstract: A system includes a task scheduler to select a queue from a port. The port includes a determined number of cell slots between pick opportunities. The task scheduler selects a queue at a pick opportunity. A queue manager connects with the task scheduler to pop cell packets from the selected queue, and to send update information to the task scheduler. The update information includes information of how the queue manager expects to fill the cell slots between the task scheduler selections. The task scheduler makes subsequent queue selections based on the update information.

Abstract: System and method for facilitating communication between client and target machine are disclosed. Method includes facilitating receiving data from client. Data is in global secure network communication protocol. Method includes facilitating provision of translation layer for converting data between global secure network communication protocol and specific gateway interface associated with target machine. Translation layer is configured to imitate server compatible with client or client compatible with target machine. Method includes encoding, via operation of translation layer, data into encoded data in specific gateway interface associated with target machine. Specific gateway interface is different from the global secure network communication protocol. Method includes facilitating transmitting encoded data to target machine. Method includes facilitating receiving first response from target machine. First response is in specific gateway interface.

Abstract: The disclosure herein describes a system, which provides service switching in a datacenter environment. The system can include a service switching gateway, which can identify a service tag associated with a received packet. During operation, the service switching gateway determines a source client, a requested service, or both for the packet based on the service tag, identifies a corresponding service portal based on the service tag, and forwards the packet toward the service portal. The service switching gateway can optionally maintain a mapping between the service tag and one or more of: a source client, a required service, the service portal, and a tunnel encapsulation. The service switching gateway can encapsulate the packet based on an encapsulation mechanism supported by the service portal and forward the packet based on the mapping.

Abstract: New communication system with packet's retransmission elements that do not use and do not depend on any routing protocol provides definite mechanisms to deliver packets from sender to receiver. Packet's retransmission elements are no longer in charge for calculating and maintaining routing tables in order to make decision regarding packet forwarding from ingress port to egress port. Each packet besides data contains set of instructions that presents complete path description from sender to receiver and rules of packet's processing on its way depending on various network metrics. The set of instructions is devised to be executed or interpreted by each network element that packet passing through. The outcome of instructions execution provides decision regarding packet forwarding and transformation. In order to provide information for path calculation and rules of packet processing there are centralized services—Network map, Pathfinder, Name registrar and Network policy.

Abstract: In the technical field of data storage and access, the invention relates to the technique of data transmission using a storage area network (SAN) in a magnetic disk storage device environment, including a method for transmitting data over a SAN in such an environment, including: determining a logical volume accessible to a server of the magnetic disk storage device; obtaining information on a logical volume accessible to a client of the magnetic disk storage device, which is determined by the client; establishing a corresponding relationship between the logical volume accessible to the server and the logical volume accessible to the client; receiving a request for using the logical volume of the magnetic disk storage device from the client; and informing the client of an available logical volume by utilizing the corresponding relationship so that a data access to the available logical volume is performed by the client over the SAN.

Abstract: A secure data parser is provided that may be integrated into any suitable system for securely storing and communicating data. The secure data parser parses data and then splits the data into multiple portions that are stored or communicated distinctly. Encryption of the original data, the portions of data, or both may be employed for additional security. The secure data parser may be used to protect data in motion by splitting original data into portions of data, that may be communicated using multiple communications paths.

Abstract: A non-transitory machine readable medium storing a program that configures first and second managed forwarding elements to perform logical L2 switching and L3 routing is described. The program generates a first set of flow entries for configuring the first managed forwarding element to (1) perform a network address translation (NAT) processing on a first packet and (2) send, to a second managed switching element. The first packet and information indicate that the NAT processing has been performed on the first packet. The program generates a second set of flow entries for configuring the second managed forwarding element to (1) skip performing a logical L3 processing on a second packet to be sent to the first managed forwarding element in response to receiving the first packet and (2) send the second packet to the first managed switching element.

Abstract: According to one embodiment, a method comprises evaluating messages between nodes of a distributed computing environment. Based on timing relationships of the messages, probability of causal links between pairs of messages determined. Based on the determined probability, at least one causal path comprising a plurality of causal links is inferred. Further, an overall probability that the inferred causal path is accurate is determined. In certain embodiments, the overall probability is output for the corresponding causal path to provide an indication of the confidence of the accuracy of such inferred causal path.