Abstract: In a transfer apparatus 44, an internal routing layer L1 detects a destination address of internal routing information from an internal RIB DB 45t, transfers the internal routing information to a transfer apparatus of the detected destination address, and stores the internal routing information or external routing information transferred from another transfer apparatus via internal ports P1 and P2 in an FIB DB 46t. An external routing layer L2 stores external routing information transferred from an agent 65 in an external RIB DB 48t, stores the stored external routing information in the FIB DB 46t of the transfer apparatus to which the external routing layer L2 itself belongs, and transfers the external routing information to another transfer apparatus via the internal ports P1 and P2 such that the external routing information is stored in the FIB DB 46t.

Abstract: Systems and methods for delivering items are disclosed. The systems and methods comprise assigning a unique internal control value to each profile having an identified physical address delivery point. They also receive a request for delivery point information for each of a plurality of items to be distributed and providing a response comprising a list of internal control values thereto. They further receive a plurality of items, each item having printed thereon one of the internal control values on the list. For each of the plurality of items, they scan, by item processing equipment, the item to read the internal control value printed thereon, identifying, in the profile database, the physical address delivery point corresponding to the assigned internal control value, routing, by the item processing equipment, the item according to the identified physical address delivery point, and delivering the item to the identified physical address delivery point.

Abstract: A distributed computing system uses dynamically calculates a subset size for each of a plurality of load balancers. Each of a plurality of load balancers logs requests from client devices for connections to back-end servers and periodically sends a request report to a traffic aggregator, which aggregates the report requests from the load balancers in the corresponding zone. Each traffic aggregator sends the aggregated request data to a traffic controller, which aggregates the request data to determine a total number of requests received at the system. The total request data is transmitted through each traffic aggregator to each load balancer instance, which calculates a percentage of the total number of requests produced by the load balancer and determines a subset size based on the calculated percentage.

Abstract: The system disclosed herein implements an improved end-to-end network performance for data transmissions that span multiple networks operated by different organizations. The improvements are achieved as a result of exchanging routing information. For instance, the exchanged routing information can be representative of network performance factors. When different operators of different networks agree to exchange routing information, an optimal end-to-end path between two endpoint devices can be identified and selected for data transmission. This benefits both network operators as the users served by the networks are more likely to be satisfied with the user experience (e.g., faster download and upload of data).

Abstract: A multi-layer network planning system can determine a set of regenerator sites (“RSs”) that have been found to cover all paths among a set of nodes of an optical layer of a multi-layer network and can determine a set of candidate RSs in the optical layer for use by the links between a set of nodes of an upper layer, wherein each RS can be selected as a candidate RS for the links. The system can determine a binary path matrix for the links between the set of nodes of the upper layer. The system can determine a min-cost matrix that includes a plurality of min-cost paths. The system can determine a best RS from the set of candidate RSs and can move the best RS from the set of candidate RSs into the set of RSs for the links. The system can then update the binary path matrix.

Abstract: Methods, computer readable media, and devices for automated routing based on content metadata are provided. One method may include receiving a user request for content with metadata from a client by a content distribution network (CDN), parsing the user request for content to generate an evaluation of the metadata, determining a routing decision representing a selection of one of a plurality of origin services for the user request for content based on the evaluation of the metadata, transmitting the user request for content to the selected one of the plurality of origin services based on the routing decision, receiving a response to the user request for content from the selected one of the plurality of origin services, and sending the response to the client.

Abstract: Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of a decentralized content fabric. Some implementations are associated with a network configured to manage content object parts representing digital content. A content object part includes raw data, metadata, and build instructions. The network includes: a data layer storing the raw data and the metadata of the content object parts, a code layer storing the build instructions of the content object parts, a contract layer storing a digital contract associated with the content object parts, and a ledger configured to record one or more transactions. Digital output can be provided by at least processing the build instructions and the digital contract in relation to the raw data and the metadata.

Abstract: A forwarding entry update method and apparatus, the method including receiving a write operation packet, where the write operation packet has write operation information, where the write operation information has write operation data and a write operation address, where the write operation data indicates a forwarding entry, and where the write operation address indicates an address to which the write operation data is to be written in a memory, obtaining the write operation information from the write operation packet, and writing the write operation data into the memory according to the write operation address in the write operation information.

Abstract: An apparatus comprises a processing device configured to determine that an entry of a first data structure comprises an indication that a link between a first logical page and a second logical page is broken and to determine that a first address pointed to by the first logical page and a second address pointed to by the second logical page match. The processing device is further configured to determine that the first logical page corresponds to the second logical page based at least in part on the determination that the first address and the second address match and to add an indication of a third address that corresponds to the first logical page to an entry associated with the second logical page.

Abstract: A method of managing nodes in a network is provided, comprising: in accordance with detecting that a new node joins a network including a plurality of nodes, mapping the new node to a virtual ring associated with the network, the plurality of nodes being mapped to different locations on the virtual ring; determining a decision region of the virtual ring, the decision region comprising the new node and at least one of the plurality of nodes, all of nodes in the decision region to jointly review a proposal of one of the nodes in the decision region; and adjusting nodes in the decision region other than the new node to locations on the virtual ring outside the decision region.

Abstract: A method of operating a hypercube network of processing devices includes determining that a plurality of the processing devices are storing data to be processed at a single processing device, obtaining the addresses of the plurality of processing devices storing the data to be processed, determining the most common number for each digit of the addresses of the plurality of processing devices storing the data to be processed, generating a new address comprising the determined most common number for each digit, and transferring the data to be processed to the processing device with the generated new address.

Abstract: A computer-implemented method for implementing an overlay network on peer-to-peer network to enable resource allocation that accounts for attributes and statuses of one or more nodes therein is provided. The computer-implemented method includes registering one or more nodes with the overlay network and executing overlay registration routing of the one or more nodes by building a routing table to cause node types to know about each other. Overlay sorting is executed between the node types based on corresponding characteristics.

Abstract: A home side device according to one aspect of the present invention includes: a UNI port for a communication line used by one or a plurality of communication devices in a user's home; an access processing unit that performs upstream access control and holds a management table of address information of the communication devices; a detecting unit that detects link states of the communication devices; and a control unit that performs a process of clearing the management table when a link-down of all of the communication devices has been detected.

Abstract: Power supply for a networking device may be provided. The networking device may comprise a first plurality of switch bars each comprising a first switch type arranged parallel to one another and a second plurality of switch bars each comprising a second switch type arranged parallel to one another. The first plurality of switch bars and the second plurality of switch bars may be arranged orthogonally. A first plurality of power supplies may be fed by a first source. A second plurality of power supplies may be fed by a second source. Respective ones of a first portion of the first plurality of power supplies feed first respective pairs of the first plurality of switch bars and respective ones of a first portion of the second plurality of power supplies feed second respective pairs of the first plurality of switch bars. The first respective pairs of the first plurality of switch bars may be different from the second respective pairs of the first plurality of switch bars.

Abstract: Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of machine learning for a decentralized content-centric system. In some implementations, predicted scores are obtained for a subset of fabric nodes of an overlay network. The scores can be based on prior training. A top scoring fabric node of the subset is identified as an egress node for communicating with a client. Also obtained are predicted scores for egress-origin segments defining paths in the overlay network between the egress node and origin nodes of the fabric nodes. The origin nodes store a content object part associated with digital content. One or more of the egress-origin segments is identified as being top scoring and is configured to be processed to identify one of the origin nodes for providing the content object part.

Abstract: A covert application, including one or more modules can be provided to assist individuals in conducting covert cyber operations. Furthermore, the covert application can operate in a secure operating environment, which provides a reliable and protected computing environment from which a user can conduct cover cyber operations. The covert application can allow a user to create and utilize one or more personas. Personas created by the covert application can appear to originate from any part of the world, and personas can allow a user of the covert application to interact through various Internet services, such as email, instant messaging, online forums, and website browsing.

Abstract: Computing devices for on-demand de-identification of data in computer storage systems are disclosed herein. In one embodiment, a server can include a process and a memory containing instructions configured to receive an electronic message via a computer network. The electronic message contains data representing a user identifier and a demand to delete any data records in a database that correspond to the user identifier. The server can then extract records corresponding to the user identifier from the database, replacing the user identifier in the extracted records with a random number and/or suppressing or generalizing quasi-identifiers from the extracted records, and then store the new records in a separate table. Copies of the extracted records can then be deleted from the original tables, and thus achieving on-demand anonymization of the one or more data records in the database corresponding to the user identifier.

Abstract: Disclosed are examples of decentralized systems and related apparatus, devices, computer program products, and methods for distributing digital content. In some implementations, an overlay network of fabric nodes is implemented in an application layer differentiated from an internet protocol layer. One or more network-wide parameters and a node identifier (ID) identifying a fabric node are obtained. A set of partition identifiers (IDs) for the node ID is determined using the one or more network-wide parameters. The partition IDs identify partitions to be managed by the fabric node. At least a portion of digital content in the overlay network can be distributed using a partition ID.

Abstract: A system on chip includes an interconnect circuit having an input interface and a number of output interfaces. A source device is coupled to the input interface. A target device includes a sectorized addressable memory space and a number of access ports respectively coupled to the output interfaces. The source device is configured to deliver a transaction containing an address word to the target device.

Abstract: A mobile device (7) configured to provide relay capabilities in a communications system (1) by communicating network-level mobile device relaying capabilities and radio-level mobile device relaying capabilities from the mobile device (7) to a communications node (3) of the communications system (1) so that the mobile device (7) can relay communications between the communications node (3) and another mobile device (2). User subscription information related to relaying is also disclosed.

Abstract: A method of operating a hypercube network of processing devices includes determining that a plurality of the processing devices are storing data to be processed at a single processing device, obtaining the addresses of the plurality of processing devices storing the data to be processed, determining the most common number for each digit of the addresses of the plurality of processing devices storing the data to be processed, generating a new address comprising the determined most common number for each digit, and transferring the data to be processed to the processing device with the generated new address.

Abstract: Provided a method, system, and article of manufacture for updating workflow nodes in a workflow. A workflow program processes user input at one node in a workflow comprised of nodes and workflow paths connecting the nodes, wherein the user provides user input to traverse through at least one workflow path to reach the current node. The workflow program transmits information on a current node to an analyzer. The analyzer processes the information on the current node to determine whether there are modifications to at least one subsequent node following the current node over at least one workflow path from the current node. The analyzer transmits to the workflow program an update including modifications to the at least one subsequent node in response to determining the modifications.

Abstract: A monitoring and diagnosis system reduces a load at the time of collecting operation state information of a plant apparatus and is inexpensive. A plant includes a plant apparatus, a local control device that controls the plant apparatus on the basis of operation state information of the plant apparatus from a sensor, and a high-order control system that is connected to the local control device and controls the operation of the entire plant. A monitoring subsystem performs failure diagnosis in accordance with a failure diagnosis algorithm which is set in advance, on the basis of the operation state information acquired from the local control device. A monitoring and diagnosis system collects results of the failure diagnosis performed by the monitoring subsystem and pieces of operation state information of the plant apparatus which are consolidated by the monitoring subsystem.

Abstract: A control apparatus includes a representative port selection unit configured to select, for each of a plurality of domains formed by a plurality of communication nodes disposed on a network to be controlled, a representative port configured to transfer a broadcast packet with an adjacent one of the domains, a broadcast path calculation unit configured to calculate a forwarding path for the broadcast packet that passes through the representative port, for each of the domains, a control information generation unit configured to generate, for each communication node on the forwarding path, control information for causing the broadcast packet to be forwarded along the forwarding path, and a control information setting unit configured to set the generated control information in each communication node on the forwarding path.

Abstract: Techniques are disclosed herein for controlling object placement in object storage. A placement component of a storage application receives a request to store a first object in an object store having multiple nodes. The object store determines a placement of the first object to one of the nodes based on an object namespace including a numerical namespace and a lexicographical namespace. Each node is assigned a corresponding subspace of the object namespace for storing objects. The first object includes a numerical namespace value and a lexicographical namespace value. A second object (a replica of the first object) is generated. The first object is stored to a first node based on the lexicographical namespace value. The second object is stored to a second node based on the numerical namespace value.

Abstract: A “Media Sharer” operates within peer-to-peer (P2P) networks to provide a dynamic peer-driven system for streaming high quality multimedia content, such as a video-on-demand (VoD) service, to participating peers while minimizing server bandwidth requirements. In general, the Media Sharer provides a peer-assisted framework wherein participating peers assist the server in delivering on-demand media content to other peers. Participating peers cooperate to provide at least the same quality media delivery service as a pure server-client media distribution. However, given this peer cooperation, many more peers can be served with relatively little increase in server bandwidth requirements. Further, each peer limits its assistance to redistributing only portions of the media content that it also receiving. Peer upload bandwidth for redistribution is determined as a function of surplus peer upload capacity and content need of neighboring peers, with earlier arriving peers uploading content to later arriving peers.

Abstract: A device is provided in which messages are received from a backplane through backplane connectors. Switching circuitry identifies which messages received from the backplane are intended for the operational circuitry of the device and interprets the input/output protocol of such messages while returning messages not intended for the operational circuitry to the backplane. The switching circuitry is removable from the device independently of the backplane connectors, allowing it to be changed for use with different backplane protocols without affecting other device elements.

Abstract: A method is provided for a host node in a computer network to determine its coordinates in a d-dimensional network space, comprising discovering an address of a peer node in the network, measuring network latency between the host node and the peer node, determining whether network latency has been measured for at least d+1 peer nodes, where, if network latency has not been measured for at least d+1 peer nodes, estimating the network coordinates of the host node, and where, if network latency has been measured for at least d+1 peer nodes, calculating the network coordinates of the host node using d+1 measured latencies.

Abstract: A distance-vector based routing protocol that integrates with adaptive publish-subscribe mechanisms by establishing routes to well-known controllers using distance-vector signaling.

Abstract: An information handling system includes a plurality of processors that each includes a cache memory, and a receive side scaling (RSS) indirection table with a plurality of pointers that each points to one of the processors. One or more network interface cards interface with the plurality of processors to receive information from a network. A hypervisor executes on one or more of the processors to support execution of virtual machines and coordinates information received at the network interface cards based upon an association between the information and virtual processors of the virtual machines, the virtual processors having identifiers.

Abstract: The present invention relates to a method for detecting a synchronization signal for device-to-device (D2D) in a wireless communication system. More specifically, the method comprises a step of detecting at least one synchronization signal, which is transmitted repeatedly for D2D communication, in a synchronization signal transmission period for D2D communication, wherein the at least one synchronization signal comprises at least one synchronization sequence generated on the basis of a first root index according to a synchronization reference ID.

Abstract: A system with at least one device including a hardware processor, performs the steps of receiving, by the system, a packet from a second system to be transmitted to a third system, forwarding, by the system to the third system, the packet received from the second system; modifying a portion of the packet to obtain a modified packet that falsely identifies a fourth system as a source of the modified packet, and transmitting, by the system to the third system, the modified packet identifying the fourth system as the source of the modified packet.

Abstract: A method is provided in one example embodiment and may include establishing a first binding for a first session for a UE, wherein the first binding includes, at least in part, PCEF connectivity information for a PCEF associated with a PGW hosting the first session for the UE, wherein the first binding is established by a first DRA in a first IP domain; receiving a request by second DRA in a second IP domain associated with establishing a second session for the UE; determining a PCRF serving the first session for the UE; and binding the second session for the UE with the first session for the UE. A method is provided in another example embodiment and may include exchanging PCEF connectivity information over a Dr interface between a plurality DRAs and maintaining PCEF connectivity information for one or more peer DRAs to which each DRA is connected.

Abstract: In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.

Abstract: A facility for publishing information in a distributed network without a central management infrastructure is described. In various embodiments, the facility receives an indication of a new node and a destination node, the new node omitted from a contact list associated with the destination node, the contact list having an approximately logarithmic distribution of neighboring nodes; introduces the new node to the destination node via a permanent circuit; and causes the destination node to add the new node to the contact list when adding the new node improves the logarithmic distribution of neighboring nodes.

Abstract: A system with at least one device including a hardware processor, performs the steps of receiving, by the system, a packet from a second system to be transmitted to a third system, forwarding, by the system to the third system, the packet received from the second system; modifying a portion of the packet to obtain a modified packet that falsely identifies a fourth system as a source of the modified packet, and transmitting, by the system to the third system, the modified packet identifying the fourth system as the source of the modified packet.

Abstract: A method and system for retrieving subscription information associated with a content file are provided. The method, according to an example embodiment, includes automatically generating a hash of the content file and retrieving an identifier for the subscription from a peer machine participating in a distributed hash table network. Subscription information is then retrieved using the subscription identifier, either from a specially configured subscription server or from a subscriber machine in the distributed hash table network.

Abstract: Systems and methods are provided for providing users at remote access devices with conditional access to server-based applications. Requests for access to server-based applications (e.g., requests to launch or obtain data associated with the server-based applications) by remote access devices may be prevented or allowed based on device compliance with one or more policies including whether data-retention prevention code can be downloaded to and operational on the remote access devices. The data-retention prevention code may be used to both determine whether data can be automatically deleted from a cache or file directory at the remote access device and to delete potentially retention-sensitive data once the data is downloaded to the remote access device from the server-based application.

Abstract: A method wherein a plurality of data processors are associated with application IDs whereby the array processes a plurality of applications in parallel.

Abstract: A system and method for multicast transmission are disclosed. In one embodiment, a virtual exchange network including interconnected nodes is embedded within a network. A sender is disposed in communication with a root node and receivers are disposed in communication with a set of edge nodes. The sender publishes a packetized data stream to which the receivers subscribe. The packetized data stream is promulgated by implicit signaling through optimum virtual exchange network connections from the sender through the virtual exchange network to the receivers. The interconnected nodes, responsive to receiving the published packetized data stream, are adapted to multicast N instances of the published packetized data stream to N recipients selected from the group consisting of receivers and other of the interconnected nodes.

Abstract: A router receives a packet at an ingress interface. The router classifies the received packet based on at least a first field value contained in the header of the packet. According to the classification of the received packet, the router associates one of the plurality of forwarding tables to the packet. The router then performs a lookup operation in the associated forwarding table according to at least a second field value contained in the header of the packet. Based on the lookup operation, the router determines an egress interface and transmits the received packet from the determined egress interface.

Abstract: A processing apparatus comprises a plurality of processors 12, each arranged to perform an instruction, and a bus 20 arranged to carry data and control tokens between the processors. Each processor 12 is arranged, if it receives a control token via the bus, to carry out the instruction, and on carrying out the instruction, to perform an operation on the data, to identify any of the processors 12 which are to be data target processors, and to transmit output data to any identified data target processors, to identify any of the processors which are to be control target processors, and to transmit a control token to any identified control target processors.

Abstract: Rather than using a large number of transceivers (transmitter/receiver pairs) operating in parallel, Access Points with multiple channels are used to aggregate, or stack, transmitted response communications, e.g., transmitting multiple acknowledgements (ACKs) in a single packet to one or more sources of received packets. The method includes sending on a plurality of channels, by each of a plurality of respective first nodes, a communication to a second node, receiving on the plurality of channels, by the second node, the communication from each of the plurality of first nodes and sending, by the second node, a transmission that contains a response to each communication that was successfully received from each of the plurality of first nodes. The response to each of the plurality of first nodes is part of a single message sent by the second node.

Abstract: A distributed computing system includes a primary device and one or more backend devices. The primary device provides a management interface for the distributed computing system. A plurality of applications may be installed on the backend devices for execution. The primary device generates registration data that associates the applications with management interface commands or configuration parameters in response to messages received from the applications. Subsequently, when the primary device receives a particular command at the management interface, the primary device identifies, based on the registration data, a particular application from among the plurality of applications. In response to identifying the application, the primary device may send to the application an outgoing message.

Abstract: A software-implemented method which allows the streaming of applications from a server or cluster of server to one or more clients, typically mobile devices. The invention also enables the sharing, through a social network cloud service, of applications located on connected computers or on the cloud. When applications are streamed to mobile devices, the user interface of the application may be modified to fit the native user interface of the device.

Abstract: A method for operating a local area data network with a plurality of network nodes is disclosed, wherein the network nodes send requests to the data network using request values and each of the network nodes has an associated explicit identifier from a key space. A plurality of network nodes respectively has an associated one or more table entries in a value table distributed over the network nodes. In this case each table entry includes a request value having data associated with the key space and with the request value, the network node being responsible for a request value whose identifier is less than or equal to the request value. For the plurality of network nodes, the frequency with which requests for the request values associated with a respective network node are sent to the respective network node is respectively monitored.

Abstract: A system and method for the management of client computing device DNS queries and subsequent resource requests within a content delivery network service provider domain are provided. The management of the DNS queries can include the selection of computing devices corresponding to various Point of Presence locations for processing DNS queries. Additionally, the management of the content requests can include the selection of computing devices corresponding to resource cache components corresponding to various Point of Presence locations for providing requested content. The selection of the computing devices can incorporate logic related to geographic criteria, testing criteria, and the like.

Abstract: An example method for path optimization in distributed service chains in a network environment is provided and includes receiving information about inter-node latency of a distributed service chain in a network environment comprising a distributed virtual switch (DVS), where the inter-node latency is derived at least from packet headers of respective packets traversing a plurality of service nodes comprising the distributed service chain, and modifying locations of the service nodes in the DVS to reduce the inter-node latency. In specific embodiments, the method further includes storing and time-stamping a path history of each packet in a network service header portion of the respective packet header. A virtual Ethernet Module (VEM) of the DVS stores and time-stamps the path history and a last VEM in the distributed service chain calculates runtime traffic latencies from the path history and sends the calculated runtime traffic latencies to a virtual supervisor module.

Abstract: A method for creating a communication network from devices of an automation system, wherein the automation system is developed based on logical addresses of the devices and the devices are assigned physical addresses by which the devices are accessed to exchange data over the communication network when operating the automation system. An overlay network comprising a decentralized network is constructed with the devices as network nodes, wherein conventional mechanisms for decentralized networks for publication of resources and subscription to resources are used to map logical addresses used during development of the automation system to the physical addresses used when operating the automation system. Mapping is achieved by a resource or a subscription to a resource being suitably published during initialization of a respective device, wherein the resources are stored based on keys in the decentralized network which corresponds to a logical addresses, and the resource contents represent physical addresses.

Abstract: In one exemplary embodiment, a method includes: storing data for a file, organized as blocks, each having a portion of the file; and maintaining a skip list for the data. The skip list is an ordered tree structure having a root node, internal nodes and leaf nodes. Each leaf node corresponds to a block. Each node has a rank value corresponding to size of a subtree rooted at the node. The skip list employs a hashing scheme. The hash value of the root node and internal nodes is computed from a level of the node, the rank value and an interval between the node and another linked node to the right of or below the node. The hash value of the leaf nodes is computed from a level of the node, the rank value and an interval associated with the node.