Abstract: A method and system for processing spanning tree protocol (STP) state in a multichassis link aggregation (MLAG) domain. More specifically, a pair of MLAG peers in the MLAG domain receive and transmit bridge protocol data units (BPDUs) in order to update a spanning tree used to implement the STP. The pair of MLAG peers includes an active MLAG peer and a standby MLAG peer operatively connected via a MLAG peer link. Further, processing of STP state towards updating the spanning tree is held accountable by the active MLAG peer until it experiences failover, after which responsibility for processing the STP state transfers to the standby MLAG peer. Duplicate BPDUs received by the MLAG domain are tracked to refresh a retention period for the STP state retained by the MLAG domain, and thus, prevent the premature discarding of STP state.

Abstract: In one embodiment, a device receives a router advertisement message after a power outage event in a network. The device joins the network, in response to receiving the router advertisement message. The device sends a power restoration notification message via the network. The device selectively delays a disconnected node from joining the network.

Abstract: The present invention defines a method for controlling uplink transmission power of a terminal in a communication system which is operated by combining heterogeneous systems. Specifically, the present invention defines a method for selectively applying a power control command in order to control uplink power of a terminal in a communication system which is operated by combining an LTE/LTE-A system with a system which applies a new radio access technology, and a method for differently operating power control units depending on whether beam sweeping is applied or not. Such methods efficiently control transmission power of a terminal, and lower the generation of uplink interference signals, thereby improving system efficiency.

Abstract: Techniques are described for reusing downstream-assigned labels when establishing a new instance of a label switched path (LSP) prior to tearing down an existing instance of the LSP using make-before-break (MBB) procedures for RSVP. The techniques enable a routing engine of any non-ingress router along a path of the new LSP instance to reuse a previously allocated label for the existing LSP instance as the downstream assigned label for the new LSP instance when the paths of the existing LSP instance and the new LSP instance overlap. In this way, the non-ingress router does not need to update a label route in its forwarding plane for the reused label. When the new LSP instance completely overlaps the existing LSP instance, an ingress router of the LSP may avoid updating an ingress route in its forwarding plane for applications that use the LSP.

Abstract: Provided is a technology capable of constructing an RF communication automated material handling system while minimizing structural change for a previously installed optical-communication automated material handling system, by constructing RF communication environment between an automated guided vehicle and manufacturing equipment by using separate communication modules provided in the automated guided vehicle and the manufacturing equipment.

Abstract: A process for determining neighbor tier relationships between cells in a wireless telecommunications network includes establishing a plurality of cell points, each cell point representing a cell of a plurality of cells in the wireless telecommunications network, forming a plurality of triangles, the vertices of each triangle of the plurality of triangles corresponding to respective cell points of the plurality of cell points, removing edges from a portion of the plurality of triangles, determining neighbor tier relationships between the plurality of cells using remaining triangle edges between the plurality of cell points, storing the neighbor tier relationships in a first memory, and using the neighbor tier relationships for handovers between the plurality of cells.

Abstract: A computer identifies data detailing usage of a first set of one or more applications by a first user and a first set of users, and information associated with usage of a second set of one or more applications by the first set of users. The computer determines one or more similarity coefficients between the first user and the first set of users and determines an overall predicted taste score for each content associated with the second set of one or more applications based on the determined one or more similarity coefficients. The computer determines one or more recommendations for one or more contents of the second set of one or more applications based on the determined one or more overall predicted taste scores.

Abstract: In one embodiment, an apparatus includes a buffer memory, ingress ports, egress ports, at least one processor, and logic integrated with and/or executable by the at least one processor. The logic is configured to communicate with a software-defined network (SDN) controller, store a look-up table in a first portion of the buffer memory, receive a packet using an ingress port of the apparatus, start an egress timer upon receipt of the packet, process the packet in order to finish processing prior to the egress timer expiring, determine an egress port for the packet, determine a packet size from information in a header of the packet when packet size information is available in the header, begin to route the packet via the egress port once the egress port is determined, and send the packet to the egress port upon expiration of the egress timer without further processing.

Abstract: Embodiments are disclosed for providing network management and application services for a telecommunications network. In an embodiment, data associated with a network entity in the telecommunication network may be received from a provider-specific data source, and the received data may include one or more data attribute values. The telecommunications network may be represented by a network graph containing vertices and edges, and each vertex may correspond to a respective network entity having a respective entity type. The plurality of edges in the network graph connected to the first vertex may be updated based on a linking rule that specifies a relationship between network entities having respective entity types, and a walk associated with the first vertex may be identified. The identified walk may then be dynamically executed from an intermediate starting vertex to generate one or more output entities.

Abstract: A mechanism is created within the tunnel context, in which a plurality of tunnels may resolve a given customer's traffic associated with a virtual local area network. The use of a tunnel context may allow distribution of traffic across multiple servers and other devices, such as across top of rack switches and different parts of the fabric infrastructure.

Abstract: In one embodiment, a multiple spanning tree (MST) region is defined in a network, where the MST region includes a plurality of network nodes interconnected by links. A MST cluster is defined within the MST region, where the MST cluster includes a plurality of network nodes selected from the plurality of network nodes of the MST region. A network node of the MST cluster generates one or more MST bridge protocol data units (BPDUs) that present the MST cluster as a single logical entity to network nodes of the MST region that are not included in the MST cluster, yet enables per-multiple spanning tree instance (per-MSTI) load balancing of traffic across inter-cluster links that connect network nodes included in the MST cluster and network nodes of the MST region that are not included in the MST cluster.

Abstract: The application disclose a method, an apparatus and a system for controlling routing information advertising, which relates to the field of communications and is used for reducing the configuration complexity and reinforcing the operability. The method includes: receiving, by a control device, first routing information sent by a first forwarding device; wherein the first routing information includes an identifier of the first forwarding device; determining a first routing path according to the identifier of the first forwarding device, an identifier of a second forwarding device and a routing path group; and determining an advertising range of second routing information for the second forwarding device according to the first routing path; for enabling the second forwarding device to advertise the second routing information according to the advertising range of the second routing information.

Abstract: Systems, methods and transitory computer-readable storage media for constructing a loop free multicast tree. The methods include observing a network topology transition affecting a first path from the particular node to a root node, calculating a second path from the particular node to the root node and sending a message to an upstream node requesting that the upstream node be a root port in the calculated second path. If the upstream node agrees to be the root port in the calculated second path, the method further includes creating a new FTAG tree topology view that includes the upstream node as the root port in the second path.

Abstract: Methods, apparatuses and systems directed to a distributed bootstrapping mechanism for peer-to-peer networks. In particular implementations, the de-centralized bootstrapping mechanism utilizes an allocated set of anycast addresses from the public IP space. Routing nodes or peer nodes corresponding to respective autonomous systems select an anycast address by computing a hash of an Autonomous System (AS) number (or other string) and mapping the hash value, or a portion of the hash value, to one of the anycast addresses in the allocated set. Other mechanisms for selecting anycast addresses (such as random selection) can be used. One or more of the routing nodes of the autonomous system may advertise a host route identifying the selected anycast address. When a new peer node is added to the P2P network, it may, upon initialization, transmit discovery messages using the anycast addresses from the allocated set, which may be ultimately routed to one of the peers in the P2P network.

Abstract: Novel tools and techniques might provide for implementing virtual platform media access control (“MAC”) address—based layer 2 and layer 3 network switching. In some embodiments, a method might comprise receiving, at a network node in a network, a data packet having a header comprising a MAC destination address, and routing, with the network node, the data packet over open systems interconnection (“OSI”) model layer 3 or network layer of the network, based at least in part on the MAC destination address in the header of the data packet. The MAC destination address comprises a first portion comprising an organizationally unique identifier (“OUI”) and a second portion comprising an identifier for a destination network interface controller (“NIC”) and/or virtual NIC (“VNIC”), which might be associated either with the same service provider associated with the network node or the network or with a different service provider, content provider, and/or application provider.

Abstract: Fast channel change systems and methods are operable to change channels to a newly selected media content event in response to a user request. An exemplary embodiment communicates a previously stored low resolution version segment of the newly selected media content event to a presentation system while the media device is performing a tuning operation to change channels to receive a currently broadcasting high resolution version of the newly selected media content event. Once the tuning process has been completed at the media device, a handshake process is performed wherein the media device transitions presentation from the low resolution version to the high resolution version of the newly selected media content event.

Abstract: A hierarchical cellular network administration system operative to administrate for a hierarchical cellular network having a core, the hierarchical cellular network administration system comprising a link establishment initiator operative to generate link establishment commands; and relay manager functionality operative to establish at least one link between at least one relay in the hierarchical cellular network and all nodes in said cellular network desired to be served by said at least one relay, as per said link establishment commands generated by the link establishment initiator; and to control operation of links thus established.

Abstract: A system, a method, a device, and a computer program product for transmission of data packets between a user device and a server. A transmission control protocol proxy component for establishing a communication link between the user device and the server in accordance with a transmission control protocol for transmission of a data packet between the user device and the server is provided. The data packet is transmitted utilizing the transmission control protocol.

Abstract: A method includes receiving a message having a message header at a network node, where the message header includes a source address field. The method also includes determining whether the message has been previously received at the network node using one or more bits of the source address field. The method further includes, upon a determination that the message has not been previously received at the network node, setting the one or more bits of the source address field to a specified value indicating that the message has been received at the network node. The one or more bits in the source address field are used in a manner that is contrary to original device specifications.

Abstract: In general, techniques are described for providing Hot-Root Standby in Global Table Multicast (GTM) environments. For example, in such GTM environments, normally a single unicast route to the customer multicast source (“C-Source”) will be available to egress provider edge (PE) routers. As described herein, ingress PE routers may advertise multiple routes to a C-Source, including unicast routes that include Route Import Extended Communities, which are imported by egress PE routers. This enables an egress PE router to have multiple paths to the C-Source, and the egress PE router may generate multiple C-multicast source tree joins for respective ingress PE routers in order to receive respective multicast streams sourced by the C-Source from the ingress PE routers.

Abstract: Applying an MSTP configuration can include instructing a plurality of network devices to disable non-MSTP links in response to a verification of receipt of the MSTP configuration and instructing the plurality of network devices to apply the MSTP configuration in response to a verification that each of the plurality of network devices disabled the non-MSTP links.

Abstract: A method implemented by network element (NE) configured as a local cloud switch point (CSP), the method comprising receiving a first post message from a remote CSP via a cloudcasting network, wherein the first post message indicates a remote virtual extensible network (VXN) identifier (ID) of a remote virtual network attached to the remote CSP, receiving a first data packet from a local virtual network attached to the local CSP, wherein the first data packet is associated with the remote virtual network, performing encapsulation on the first data packet to produce a first encapsulated data packet by selecting an encapsulation header for the first data packet based on the remote VXN ID and not based on network protocols of the local virtual network and the remote virtual network, and sending the first encapsulated data packet to the remote CSP.

Abstract: Techniques are described for operating a network switch device associated with a virtual layer two (L2) network instance according to a protocol independent multicast (PIM) relay mode. The PIM relay mode enables the network switch device to receive a PIM control message, i.e., a PIM join and/or prune request, for a multicast group on a downstream port of the network switch device associated with a virtual L2 network instance, determine an upstream neighbor port of the network switch device associated with the instance, and relay the PIM control message on the upstream neighbor port of the network switch device without flooding the PIM control message on all ports of the switch device associated with the instance. In the PIM relay mode, the network switch device avoids triggering join suppression in downstream PIM neighbor devices with receivers, and avoids maintaining upstream states and setting a PIM periodic message timer.

Abstract: An input string, which includes exception data payload, is received at the API exception that resides in the upper management layer. The API exception is dedicated to receiving the exception data payloads. The API exception validates the input string. The API exception transmits the exception data payload to a lower management layer without the lower management layer knowing where the exception data payload was transmitted from.

Abstract: Embodiments are provided for providing optimal route reflector (ORR) root address assignment to route reflector clients and fast failover capabilities in an autonomous system, including identifying a first node in an autonomous system as a candidate root node of a first routing group, identifying a client node based on a neighbor address used in a first routing protocol, mapping the neighbor address to routing information received from the client node via a second routing protocol, and associating the neighbor address with the first routing group if the routing information includes an identifier of the first routing group. In more specific embodiments, identifying the first node as a candidate root node includes determining the first node and the first routing group are advertised in a first protocol packet, and determining the first node and the second routing group are advertised in a second protocol packet.

Abstract: A secure electronic apparatus and a method for determining that a secure electronic apparatus has been tampered with. The apparatus includes a memory and a plurality of sensors which each to receive an input signal and output a digital signal determined by the input signal and by a physical quantity sensed by the sensor (e.g. capacitance). A measurement routine includes applying a plurality of input signal values to the sensors and, for each input signal value, using the digital output signals of each sensor to determine a combined output result. The combined output results of the measurement routine are compared with a set of combined output results stored in the memory. A detected a difference between the combined output results of the measurement routine and the set of combined output results stored in the memory can be used to determine that the secure electronic apparatus has been tampered with.

Abstract: Methods, apparatus, and articles of manufacture to provide a multicast virtual private network (MVPN) are disclosed. An example method to transmit multicast data over a communication network includes receiving, at a first machine, a multicast data packet from an ingress provider edge router of the communication network, the multicast data packet associated with a multicast route, and transmitting a first replication of the multicast data packet from the first machine to a second machine via a first unicast path. The first replication of the multicast data packet includes a first label provided by the second machine to identify the multicast route in the second machine. Example methods further include receiving the first replication of the multicast data packet at the second machine via the first unicast path, and replicating the multicast data packet from the second machine to an egress provider edge router of the communication network.

Abstract: A device may provide information associated with initiating a segmented tunnel to be used to transfer multicast traffic via a network covering a plurality of areas. The device may receive acknowledgement information associated with the segmented tunnel. The acknowledgement information may include information that identifies a number of egress devices, associated with at least one area of the plurality of areas, that are to receive the multicast traffic. The device may determine, based on the acknowledgement information, a total number of egress devices that are to receive the multicast traffic. The device may selectively provide the multicast traffic via the segmented tunnel based on the total number of egress devices that are to receive the multicast traffic.

Abstract: Some implementations provide a method for managing switches in a data center that includes: (1) establishing a connection from one switch to another switch in the data center, the data center providing a plurality of virtual local area networks (VLANs), each VLAN including at least one Virtual Machine and capable of spanning across more than one of the plurality of switches; (2) provisioning device prefixes for IPv6 addresses, a given device prefix corresponding to a particular VLAN on a particular switch in the data center, the given device prefix included in a host address of a particular virtual machine, the particular virtual machine hosted on a server computer, the sever computer connected to the particular switch without additional intervening switches; (3) configuring a hardware memory to include prefix information and address information; and (4) transferring packets by using the prefix information and the address information.

Abstract: A first event notification is received. The first event notification is associated with a first event. Criteria is determined based, at least in part, on the first event notification. A first component is identified based, at least in part, on the criteria a component graph. An operational status associated with the first component is determined. It is determined not to generate a second event notification based, at least in part, on the operational status.

Abstract: A method of providing connectivity to a device having N communication interfaces and M virtual connections, each interface being connectable to a further device. The method comprises determining, for each of the interfaces, a characteristic of the interface. Respective ones of the M virtual connections are associated with respective ones of the N interfaces based upon the determined characteristics.

Abstract: Transmitting, by a current root network device, a first unicast message to a network router and determining, by the current root network device, whether the first unicast message is received by one or more other network devices. If the current root network device determines that the first unicast message is not received by one or more other network devices, then a second unicast message is sent to the network router. If the current root network device determines that the first unicast message is received by one or more other network devices, then the current root network device identifies a particular network device of the one or more other network devices that received the first unicast message to serve as a new root network device. The current root network device sends a message to designate the identified particular network device as the new root network device.

Abstract: A method, device, program, server and terminal are provided for monitoring a data-exchange session between first terminals belonging to a first user and at least one second terminal belonging to a second user. The method includes, after the first user receives an invitation to establish a session, creating a first group of the first terminals belonging to the first user suitable for enabling the session to be established with the first group.

Abstract: A computer-implemented method for anonymously selecting streams for analysis is described. In one embodiment, control information that associates one or more telemetry feeds with one or more multicast sources is identified. One or more multicast sources are joined based on the received control information and data from the multicast source is analyzed based on one or more data analysis parameters.

Abstract: In an approach to analyzing a path on a graph, a computer receives a graph comprising a plurality of vertices and edges, each edge linking two vertices. The computer, for each one of said plurality of vertices, analyzes edges linked to said one of plurality of vertices to determine a number of outbound links from said one of plurality of vertices, orders said edges, and assigns a value to each ordered edge. The computer, for the graph, receives a path comprising a plurality of edges linking two of said plurality of vertices through at least one other of said plurality of vertices, encodes said path, the encoding using said number of outbound links and said assigned values of each of said one or more edges linking said two of said plurality of vertices, compresses the encoded path, and analyzes said path on said graph using said compressed, encoded path.

Abstract: In various embodiments, methods and systems for enhanced access to storage data based on a collaboration data proxy system are provided. A plurality of metadata tables on one or more peer nodes are referenced for data corresponding to a data request of a requesting node. The metadata tables indicate availability of chunks of data in the one or more peer nodes. A determination is made that the data corresponding to the data request is downloadable from the one or more node; the determination is based on the metadata tables. A download operation configuration instance is generated for a data request of a requesting node. The download operation configuration instance comprises configuration settings for downloading data corresponding to the data request from the one or more peer nodes. The chunk of data is downloaded from the corresponding one or more peer nodes where the chunk is located, using the configuration settings.

Abstract: The system and method for determining the feedback capacity of information distributed in a complex network determines feedback capacity as information is received and diffused throughout the network. Traditionally, real networks, such as computer networks, were used in determining network feedback. However, current complex networks typically incorporate graphing models for network analysis. The system and method provide a process to determine the quality of a complex network with respect to feedback capacity, such as can be determined by a corresponding Belief Propagation algorithm and a corresponding entropy equation. The system and method can also determine the cyclic entropy per penetration in a complex network, the depth penetration for nodes in the complex network and a plurality of cycle counts per node in the complex network based on a source node.

Abstract: A communications network with a plurality of network devices is provided. The communications network has a plurality N of virtual networks, which are implemented in the communications network in such a manner that each of the network devices is coupled to the communications network via at least two virtual networks. The communications network also has a plurality of network segments. A subset of the network devices is assigned to each of the network segments, wherein each network device arranged at a peripheral region of a network segment has N limiting units, each of the N limiting units being assigned to a respective one of the N virtual networks and designed to limit a data reception of the respective virtual network to a threshold for the data transmission rate predetermined for the respective virtual network.

Abstract: An information processing apparatus includes a data format determination unit determining whether data read by near field wireless communications correspond to data read in a peer-to-peer mode; a data attribute determination unit identifying an application that can use the data based on attribute information of the data when it is determined that the data correspond to the data that are read in the peer-to-peer mode; a communication method determination unit identifying an application that can use the data based on a communication method used when the data are read, when it is determined that the data do not correspond to the data that are read in the peer-to-peer mode; and an application use processing unit performing processing so that the application identified by the data attribute determination unit or the application identified by the communication method determination unit can use the data.

Abstract: A method of configuring a logical network in a datacenter is provided. The datacenter includes a plurality of host physical computing devices, a compute manager to configure one or more data compute nodes (DCNs) on virtualization software of each host, and a network manager. The method configures, by the network manager, a logical network. the method provides, by the network manager, a read-only configuration construct of the logical network to the virtualization software of a set of hosts in the plurality of hosts. The method obtains, by the compute manager, the read-only configuration construct of the logical network from the virtualization software of the set of hosts. The method configures, by the compute manager, a plurality of DCNs to connect to the logical network using the read only configuration construct of the logical network.

Abstract: In one embodiment, a first device in a multicast label distribution (mLDP) network receives a first label mapping message that includes IPv4 and IPv6 addresses of a root node of a multicast tree. The first device also receives a second label mapping message from a second device that identifies the multicast tree and includes one of: the IPv4 address or the IPv6 address of the root node. The first device determines that the second label mapping message is associated with the multicast tree. In response to determining that the second label mapping message is associated with the multicast tree, the first device adds the second device to the multicast tree.

Abstract: A method includes receiving broadcast fingerprints indicative of broadcast frames of broadcast media streams being streamed to a plurality of channels by a broadcaster and receiving television (TV) fingerprints indicative of an ordered sequence of TV frames of a TV media stream at a corresponding media device. The method further includes matching the TV fingerprints with the broadcast fingerprints by determining a difference between respective broadcast fingerprints and corresponding TV fingerprints of the ordered sequence of TV frames. The matching includes populating a binary tree structure with respective differences. The method also includes detecting a channel change of the media device from a first channel to a second channel in response to locating a value indicative of the channel change in the binary tree structure within a threshold number of children nodes from a root node upon traversing down the binary tree structure.

Abstract: A network accessing method includes selecting a group representative dynamically from each machine to machine (M2M) terminal group, wherein terminals in the M2M terminal group not selected as the group representative serve as group members. The method also includes requesting, by the group representative, network access from a base station, and serving, as a group member automatically after entering an idle state or entering another cell. This enables multiple M2M terminals to access a network at the same time while avoiding network access congestion.

Abstract: This invention concerns the transmitting and receiving of digital media packets, such as audio and video channels and lighting instructions. In particular, the invention concerns the transmitting and receiving of redundant media packet streams. Samples are extracted from a first and second media packet stream. The extracted samples are written to a buffer based on the output time of each sample. Extracted samples having the same output time are written to the same location in the buffer. Both media packet streams are simply processed all the way to the buffer without any particular knowledge that one of the packet streams is actually redundant. This simplifies the management of the redundant packet streams, such as eliminating the need for a “fail-over” switch and the concept of an “active stream”, The location is the storage space allocated to store one sample.

Abstract: A first tree data structure is used to track an allocation state for each block included in a first set of storage blocks. Upper level nodes in a given tree present the allocation state of connected lower level nodes in the given tree, such that each allocation state indicates whether any associated storage blocks are free. A second tree data structure is used to track an allocation state for each block included in a second set of storage blocks. The first tree data structure and the second tree data structure each have a number of leaf nodes corresponding to a maximum number of blocks that can be included in a superset of storage blocks, wherein the first set of storage blocks and second set of storage blocks are included in the superset of storage blocks.

Abstract: The present disclosure describes techniques and apparatuses for hardware-implemented AVL tree updates. In some aspects, records are accessed as part of a search performed to update an AVL tree. The update may involve inserting a new node into, or removing a node from, the AVL tree. The AVL tree is represented by records stored in memory, each of which represents a node of the AVL tree. During the search, each of the records accessed is read from memory. The records read from memory are then written to an AVL tree rebalancing component implemented in hardware. Once the records are written to the hardware-implemented AVL tree rebalancer, it can modify, without subsequently accessing the memory, those records corresponding to the nodes affected by the update. After those records are modified by the hardware-implemented AVL tree rebalancer, the modified records are written back to the memory effective to update the AVL tree.

Abstract: In general, techniques are generally described for reducing or preventing transient black-holing of network traffic in an overlay network. A method includes executing, by a network device included in a link state domain, an Interior Gateway Protocol (IGP) to exchange link-state messages with at least one remote network device in the link-state domain; generating, by the network device, an IGP link-state message that includes link overload information to overload a link in the link-state domain that couples the network device to the remote network device; and sending, by the network device and to the at least one other network device, the IGP link-state message that includes the link overload information to direct the remote network device to stop sending network traffic to the network device using the overloaded link.

Abstract: Systems and methods for designing cellular backhaul networks are disclosed. The system can include an Adaptive Graph Minimum Spanning Tree (AG-MST) algorithm to identify and connect stranded cellular sites at minimum cost. The system can compare pending bids for new connections such as, for example, new microwave or fiber optic links at stranded sites to provide new connectivity. The system can design a network that connects the maximum number of stranded sites at the minimum average cost per site.

Abstract: Transactional log data for a distributed database may be archived by a number of computing nodes scalable to a specified concurrency parameter. A log record may be mapped to a computing node for performance of an archiving operation. The log record may be stored with information indicative of a position, in a hierarchy of shards, of the shard from which the log record originated. The log record may be replayed in an order, relative to other records, that is based on the shard's position in the shard hierarchy. The log record may be replayed on a shard identified based on a time-invariant and idempotent hash function.

Abstract: A system comprising a plurality of path computation elements (PCEs) configured to communicate with an ingress node, jointly compute a core tree for an inter-domain point-to-multipoint (P2MP) tree across a plurality of network domains, and independently compute a plurality of sub-trees in at least some of the network domains, wherein the core tree connects the ingress node to a boundary node (BN) in each one of the network domains that have a destination node and each sub-tree connects the BN to a plurality of destination nodes in one of the network domains that have a destination node.