Abstract: A system includes: a plurality of network nodes communicatively coupled in a peer-to-peer network; and a plurality of computing devices each communicatively coupled to at least one of the plurality of network nodes. Computing devices transmit market trade requests to at least one of the network nodes. A first subset of network nodes (including at least two network nodes) determine an order of receipt of the plurality of market trade requests. The first subset of network nodes reach a consensus of the order of receipt of the plurality of market trade requests. The first subset of network nodes generate ordered data based on the order of receipt agreed upon by the first subset of network nodes. A second subset of network nodes (including at least two network nodes) match the plurality of market trade requests.

Abstract: An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers using an idempotent, reversible token method, which presents no observable external “change” until communication of information needs to occur between the computers and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to exceeded; and that atomicity, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

Abstract: The disclosure relates to path computation and setup of one or more nodes in a network. Connectivity information is received at a local node of the nodes in the network, and a processor of the local node computes a flooding topology based on the received connectivity information, where the flooding topology is represented by links between nodes in the network. The links are encoded between the local node and remote nodes and between remote nodes on the flooding topology, and a link state message is flooded to the remote nodes from the local node in the network, where the link state message includes each of the encoded links in the flooding topology.

Abstract: Example embodiments facilitate creation of efficient tree structures (and strategic modification of and manipulation of existing tree structures), such that the resulting tree structures enable rapid computing operations, including, but not limited to, rapid relational set operations (e.g., joining trees, comparing tree structures, determining structural similarities of trees, adding tree nodes, removing or replacing tree nodes, accessing tree data, updating tree data, and so on). An example method relates to a method and/or system for creating and manipulating tree data structures (also simply called trees herein) as, for example, in relational databases. One embodiment uses compact bit-wise path encoding that stores structural data related to tree branches to which a current node belongs.

Abstract: A communication method, a device, and a system are disclosed. An SF device adds a first location identifier including an identifier of the SF device and an identifier of a first physical port to a received first packet sent by first user equipment, and sends a second packet to which the first location identifier is added to a first UP device. The first UP device sends a third packet to a CP device, and the CP device sends the third packet to a USF device. The USF device interacts with an SDN controller, to enable the SDN controller to deliver a configuration instruction to the corresponding SF device. The first packet may be a DHCP packet or a PPPoE packet, and OPTION82/OPTION18 is added to carry the first location identifier.

Abstract: A computer-implemented system and method for predicting and flagging an anomaly entered in a digital form. A server computing device classifies a plurality of data fields of the digital form to identify a set of non-zero value data fields; and obtains an anomaly detection model comprising a statistical tree structure associated with the data field of the digital form. The server computing device receives datasets including a target value of a data field and values of a set of cohorting data features; traverses a statistical tree structure of the anomaly detection model with the target dataset to form a set of target cohorts to determine a target statistic value for the data field; flags the data field value of the target dataset as an anomaly item; and generates one or more confidence scores for a runtime prediction based on one or more variance changes for the data field.

Abstract: In some examples, a system is configured to mount on a first vehicle. The system include an antenna configured to transmit a first surveillance message by forming an omni-directional beam. The antenna is also configured to receive a second surveillance message from a second vehicle during a first time period. The antenna is further configured to receive a third surveillance message from a third vehicle during a second time period, where the first and second time periods at least partially overlap in time. The system also includes processing circuitry configured to demodulate the second surveillance message by forming a first beam and demodulate the third surveillance message by forming a second beam. The second beam is different than the first beam, and the first beam is simultaneous with the second beam.

Abstract: A controller includes a transceiver to establish a first session with a route reflector and monitor advertisements received by the route reflector from nodes in a network via second sessions established between the nodes and the route reflector. The controller also includes a processor to generate forwarding instructions for the nodes based on the advertisements. The forwarding instructions indicate one or more routes from a root node to one or more leaf nodes of a service. The transceiver provides the forwarding instructions to the root node. In some cases, the first session is established according to the border gateway protocol (BGP) and the one or more second sessions are established according to the BGP. The controller determines that the one or more leaf nodes are registered for one or more virtual private network (VPN) services based on the advertisements.

Abstract: Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.

Abstract: An aggregated communication network includes one or more communication networks and a plurality of network nodes arranged in a plurality of hierarchical layers, the network nodes including a central node at a highest layer and a remaining network nodes being arranged, as part of the one or more communication networks, in layers below the highest layer, with one or more spatially distributed network nodes at each layer below the highest layer. The network nodes in each communication network are interconnected in a tree-like structure via communication links, with respective sub-branches extending from the network nodes via network nodes in lower layers. The one or more communication networks are connected to the central node in a star-like structure via respective communication links between the central node and respective network nodes in a next-to-highest layer. The communication links between network nodes in a lowest layer.

Abstract: In various examples, performance capabilities of a consumer—such as inference rates of a neural network executing on underlying hardware—may be tested or demonstrated for producers that have lower production rates than consumption rates of the consumer. For example, augmented data instances may be leveraged to augment production data from the producer in order to increase a frequency of transmission of data instances to a consumer. As a result, a data set including additional or alternative instances of data may be generated to emulate real-world data for demonstrating potential performance capabilities of a consuming algorithm beyond a currently required performance capability corresponding to a producer.

Abstract: A C-RAN includes a plurality of remote units; and a central unit communicatively coupled to the remote units via a fronthaul network. The central unit is configured to determine sets of data to be sent to respective subsets of remote units across the fronthaul network. The central unit is also configured to determine a mapping of each of the sets of data to a respective one of the subsets of remote units. The central unit is also configured to, for each of the sets of data, if at least one of the multicast groups wholly contains the respective subset of remote units mapped to that set of data, transmit that set of data to the respective subset of remote units over the fronthaul network by multicasting that set of data to the multicast group that best matches the respective subset of remote units mapped to that set of data.

Abstract: A member switch of multiple connected switches receives a stack-discovery packet from a first coupled switch and, in response, generates and transmits a stack-discovery-response packet to the first coupled switch to allow the member switch to be discovered. The member switch receives stack-configuration information from a stack-control node and forwards the stack-discovery packet to a second coupled switch to facilitate discovery of the second coupled switch. The first coupled switch, the member switch, and the second coupled switch are coupled to each other according to a predetermined order, thereby facilitating an ordered discovery of the multiple connected switches. In response to receiving, from the stack-control node, a control packet, the member switch reboots based on the received stack-configuration information.

Abstract: The present invention relates to a method of building a dynamic overlay network topology based on cross-chain interaction between blockchains, at least comprising: selecting at least one gateway node and at least one ordinary node from at least one cross-chain interaction node; clustering the ordinary nodes into ordinary node clusters based on a clustering algorithm; building a structured network topology and cross-chain connections between the cross-chain interaction nodes based on the gateway node; performing topology building on the ordinary node clusters based on a breadth-first spanning tree algorithm.

Abstract: Systems and methods for analyzing power or energy consumption parameters measured at each of a plurality of nodes or Network Elements (NEs) of a network are provided. A system, according to one implementation, includes a processing device and a memory device configured to store computer logic. The computer logic, for example, may be configured to enable the processing device to receive a power consumption value corresponding to an amount of energy expended at each of a plurality of NEs in a network. Also, the computer logic may be configured to enable the processing device to calculate a cumulative power consumption total from the power consumption values associated with the NEs arranged along a path in the network.

Abstract: An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

Abstract: A performance information visualization apparatus includes a memory and a processor. The memory configured to stores, as node information, information that indicates a connection relationship of a node, and information that indicates a generation in which the node is added to an information processing system and a generation in which the node is deleted from the information processing system. The processor configured to that synthesizes configuration information by, when an event occurrence node where an event has occurred does not exist in configuration information of a specific generation associated with a time when the event has occurred and the event occurrence node is added to the configuration information, adding a node and connection between nodes including a connection relationship of the event occurrence node, based on the node information.

Abstract: Techniques for operating a networking switch in two broadcast networks are provided. In some embodiments, the switch may instantiate a first controller client and a second controller client in a control plane of the switch; register the first controller client with a first broadcast controller associated with a first broadcast network; and register the second controller client with a second broadcast controller associated with a second broadcast network. The switch may further receive a first multicast route through the first controller client; receive a second multicast route through the second controller client; and program at least one of the first multicast route and the second multicast route into a multicast routing information base.

Abstract: An ad hoc supply chain collaborative computing environment management method includes selecting a collaboration model from amongst several models and establishing the environment in accordance with the selected model including defining a knowledge graph, a set of expected events to be received in an event log, and one or more predictive functions operating upon the different events in the event log to produce predictive values. The method also includes, registering actors in a supply chain as authenticated publishers or subscribers to the event log of different events published by different authenticated computing systems of the actors, authenticating different ones of the registered different actors prior the different actors publishing events to the event log, triggering predictive functions for newly published ones of the events in order to produce predictive values and providing read-only access to different states of the entities of the knowledge graph to authenticated subscribers.

Abstract: A method for assessing path quality between a source node and a destination node, the method comprising, at a node: determining a first parameter and a first path classification of a first path having at least one link; determining a second parameter and a second path classification of a second path having at least one link; determining the quality of the first path based on the first parameter and the first path classification; determining the quality of the second path based on the second parameter and the second path classification; and comparing the quality of the first path and the quality of the second path thereby to determine the best quality path.

Abstract: To provide a mechanism capable of improving communication efficiency even in communication before allocation of an AID. A communication device including: a communication unit configured to transmit a first frame including a second association identifier decided by a communication device to which a first association identifier is allocated and receive a second frame including information related to the second association identifier.

Abstract: A method, system and computer program product for processing metrics data with graph data context analysis. Graph data representing one or more devices or sensors is stored into a first database, and metrics data generated by the devices or sensors is stored in a second database. The metrics data is then applied to the graph data for the context analysis, wherein the context analysis reflects the relationships of the devices or sensors in the graph data to the metrics data generated by the devices or sensors. The graph data comprises nodes for representing the devices or sensors, edges for representing a topology of the devices or sensors, and properties for storing the metrics data associated with the nodes and edges; and the metrics data comprises time-series data that is logged by the devices and sensors.

Abstract: Systems and methods are provided herein for supporting Spanning Tree Protocol (STP) in networks that use Ethernet Virtual Private Network (EVPN) All-Active (A-A) multihoming. This may be accomplished by a network administrator defining a super root group comprising a plurality of network devices, wherein each network device provides A-A multihoming to a multihomed device. All network devices in the super root group use a common bridge ID when generating BPDU messages for STP. All network devices in the super root group will send BPDU messages comprising the common bridge ID to the multihomed device. Because the BPDU messages comprise a common bridge ID, the multihomed device treats the network devices in the super root group as a single local bridge, thus STP is enabled without causing STP flapping.

Abstract: A high-resolution substrate having an area of at least 100 square centimeters and selected traces having a line/space dimension of 2 micrometers or less is employed to integrate multiple independently operable clusters of flip chip mounted components, thereby creating a circuit assembly. Each independently operable cluster of components preferably includes a power distribution chip, a test/monitor chip, and at least one redundant chip for each type of logic device and for each type of memory device. The components in at least one of the independently operable clusters of components may include the components provided in a commercially available chiplet assembly. An electronic system may comprise multiple substrates comprising independently operable clusters of components, plus a motherboard, a system controller, and a system input/output connector.

Abstract: Device and method for intrusion detection in a computer network. A data packet is received at an input of a hardware switch unit, an output of the hardware switch unit being selected for sending the data packet or a copy as a function of data link layer information from the data packet and of a hardware address from a memory of the hardware switch unit. An actual value from a field of the data packet is compared by a hardware filter with a setpoint value for values from this field, the field including data link layer data or network layer data, and the data packet or a copy of the data packet being provided to a computing device as a function of a result of the comparison. The analysis for detecting an intrusion pattern in a network traffic in the computer network id carried out by the computing device.

Abstract: Systems, methods, and computer-readable media for identifying a spanning tree loop in a network environment. Spanning tree loop indicators occurring in a network environment that utilizes a spanning tree protocol are identified. The spanning tree loop indicators are correlated to identify correlated spanning tree loop indicators within the network environment. A potential spanning tree loop is recognized from a plurality of the correlated spanning tree loop indicators based on indicator types of the correlated spanning tree loop indicators. The potential spanning tree loop is remedied in the network environment in response to recognizing the potential spanning tree loop in the network environment.

Abstract: A Protocol Independent Multicast (PIM) designated networking device election system includes a first networking device and a second networking device that are coupled to the first edge device. The second networking device receives a first PIM message from the first networking device and determines that the first PIM message indicates that the first networking device supports designated networking device election based on an interface performance property. The second networking device then determines whether a first interface performance property indication indicates that a first interface performance property of the first networking device or a second interface performance property of the second networking device satisfy an interface performance property condition.

Abstract: There is provided a first network node arranged to communicate with a second network node, the first and second network nodes being connected by a first path and a second path. The first path uses a first communications network and the second path uses a second communications network. The first network node has a first mode and a second mode of operation, such that in a first mode traffic between the first and second network nodes is transmitted over the first path and not the second path, and in a second mode traffic between the first and second network nodes is transmitted over the first path and the second path. The network node comprises a mode selector arranged to select the second mode of operation when the demanded amount of traffic between the first and second network nodes exceeds a threshold value for a period of time.

Abstract: A path establishment method and a controller are disclosed. The method includes: when detecting a path establishment request for establishing P2MP TE, computing a P2MP TE path by using head node information and tail node information included in the path establishment request; identifying a target branch node in the P2MP TE path, and obtaining a label of the target branch node; and when a third node corresponding to the head node information and the target branch node are not a same node, sending first information to the third node, and sending second information to the target branch node, where the second information is used to instruct the target branch node to generate a multicast forwarding entry. Embodiments of this application can reduce complexity of establishing the P2MP TE path.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: At a router, at least one memory and computer program code stored therein are configured to, with at least one processor, cause the router to: determine source router identification information for a tunnel traversing the router based on a routable source IP address for the tunnel; determine destination router identification information for the tunnel based on a routable destination IP address for the tunnel; program a bit string entry for the tunnel in a Bit Index Forwarding Table (BIFT) for tunnels from a source router to a plurality of destination routers, the BIFT being indexed based on the source router identification information and at least a portion of the destination router identification information; and route packet data received at the router according to the BIFT.

Abstract: In various embodiments, a device classification service obtains traffic telemetry data for a plurality of devices in a network. The service applies clustering to the traffic telemetry data, to form device clusters. The service generates a device classification rule based on a particular one of the device clusters. The service receives feedback from a user interface regarding the device classification rule. The service adjusts the device classification rule based on the received feedback.

Abstract: Various example embodiments for supporting stateless multicast communications in a communication system are presented. Various example embodiments for supporting stateless multicast communications may be configured to support stateless multicast communications in a label switching network (e.g., a Multiprotocol Label Switching (MPLS) network, an MPLS—Traffic Engineered (TE) network, or the like) based on use of local label spaces of nodes of the label switching network for encoding of an explicit path tree for the multicast communications within the multicast communications. Various example embodiments for supporting stateless multicast communications in a label switching network based on use of local label spaces of nodes of the label switching network may be configured to support use of local label spaces of nodes of the label switching network by using network-wide unique node identifiers to uniquely identify nodes with which the node and adjacency labels of the explicit path tree are associated.

Abstract: A packet sending method and device. The first node sets a next-hop of the routing information to a next-hop through which the first node reaches the first route source. The destination address of the routing information is the address prefix. When the second route source is superior to the first route source, the first node switches the next-hop of the routing information to a next-hop through which the first node reaches the second route source. Then, the first node adds, to a target packet, path information of a forwarding path from the first node to the second route source according to the switching operation, where a destination address of the target packet matches the address prefix. Finally, the first node forwards the target packet to the second route source through the forwarding path.

Abstract: Traffic data is divided into data streams corresponding to workloads, and the data streams are multiplexed onto slice segments based on a multiplexing requirement or rule. Each slice segment is a physical or virtual processing element in a wireless network supporting network slicing. In one example, the data streams are multiplexed onto the slice segments such that data streams having different utility definitions are assigned to different slice segments. In another example, the data streams are multiplexed onto the slice segments such that workloads in the same cluster partitioned in a T-dimensional vector space are assigned to different slice segments.

Abstract: A method of broadcasting event messages in a system-on-chip having system circuitry and monitoring circuitry for monitoring the system circuitry, the monitoring circuitry comprising units connected in a tree-based structure for routing communications through the system-on-chip, the tree-based structure comprising branches extending from a root unit, each branch comprising a plurality of units, each unit connected to a single unit above in the branch and a single unit below in the branch, whereby each unit routes communications to and from individually addressable entities above that unit in its branch, the tree-based structure further comprising crosslinks connecting corresponding units of adjacent branches, the method comprising: if an event is generated at an event unit or its local subsystem, routing an event message directly from that event unit to: any adjacent unit above the event unit in the event unit's branch, any adjacent unit below the event unit in the event unit's branch, and any corresponding un

Abstract: A network device receives multi-destination packets from a first node and forwards at least a first of the multi-destination packets to another network device using a first multi-destination tree with respect to the network device. The network device detects that a link associated with the first multi-destination tree satisfies one or more criteria and, in response to detecting that the link satisfies the one or more criteria, selects a second multi-destination tree with respect to the network device. The network device forwards at least a second of the multi-destination packets to the other network device using the second multi-destination tree.

Abstract: A controller of a radio access network calculates physical path resource information which is resource information about physical paths between devices in the network, and abstract path resource information which expresses the physical path resource information in a representative manner. When receiving a request to create a slice, the controller determines whether a slice that satisfies a requested condition is creatable based on the abstract path resource information and, when determining that the slice that satisfies the requested condition can be created, creates the slice by selecting a physical path that satisfies the requested condition based on the physical path resource information.

Abstract: Embodiments of the present disclosure relate to assisting forwarding of multicast traffic over Ethernet Virtual Private Network (EVPN) from a multicast source to a host multi-homed to multiple provider edge (PE) devices. Embodiments are based on the inclusion of an Ethernet Segment Identification (ESI) to EVPN type-6 routes advertised by PE devices which received a multicast Join message. Other PE devices receiving such routes are able to determine whether they belong to the ES identified by the ESI and to determine whether they are designated forwarders (DFs) for the host. Furthermore, PE devices which are the DFs are configured to re-originate the EVPN type-6 routes, i.e. re-send the advertisements, indicating themselves as DFs. This ensures that a remote PE device associated with the multicast source will also send multicast traffic to such DF PE devices, which, in turn, would allow the multicast traffic to successfully reach the host.

Abstract: Methods and apparatus relating to the use of aggregated links, e.g., links in a bundle, are described. A normal link metric and a limited operation mode link metric a determined for a link bundle, the normal link metric having a lower value than the limited operational mode link metric. The status of links in a link bundle are monitored. Based on the number of currently operational links in a link bundle and a switching threshold, a decision is made whether to advertise the normal link metric, advertise the limited operation mode threshold or refrain from advertising any link metric. The use of the limited operation link metric facilitates the use of a partially failed link bundle providing an alternative routing path in the network that would not otherwise be available.

Abstract: A mobile mux is a radio communication network (RCN) in which base stations (BS's) networked in a tree topology connect a core network (CN) to user equipments (UEs) by installing a backhaul link at a root BS and having non-root BS's wirelessly communicable with the root BS such that all UEs access the CN without a first burden of installing multiple independent backhaul links for all BS's. The frequency resource allocated to the RCN for communicating with the UEs is reused in inter-BS communication, avoiding a second burden of acquiring an additional frequency resource. Avoiding the two burdens enables faster roll-out of communication services. Furthermore, uplink and downlink data traffics between the CN and the UEs are aggregated and received, respectively, at the root BS, allowing a capacity provided by the single backhaul link to be less than a sum of capacities estimated for the independent links.

Abstract: A network packet is received from a network interface card (NIC). A determination is made, in view of a filter specifying handling of network packets, as to whether the network packet is to be modified. In response to determining that the network packet is to be modified, a portion of the network packet is modified in view of the filter. The modified portion of the network packet is provided to the NIC.

Abstract: A method is applied to a server and for providing a link priority between the server and a storage device. The server calculates an average latency of each of a plurality of links between the server and the storage device; then determines a latency interval to which the average latency of each link belongs; and determines a priority of each link based on a priority of the latency interval to which the average latency of each link belongs. At least two consecutive latency intervals are preset in the server, each latency interval represents a range of an average latency, and a priority is set for each latency interval. For latency intervals of adjacent priorities, a minimum latency value of a latency interval of a lower priority is greater than a maximum latency value of a latency interval of a higher priority.

Abstract: A method includes receiving a message at a network bridge from a computer system where the network bridge stores a forwarding table. The method also includes determining a type of the message. The method also includes upon a determination that the type of message is a network notification message, determining whether data within the message corresponds to an entry within the forwarding table. The method also includes upon determining that the data within the message corresponds to the entry within the forwarding table, halting a transmission of the message. The method also includes upon determining that the data within the message does not correspond to the entry in the forwarding table, transmitting the message to a device in communication with the network bridge.

Abstract: A novel design of a gateway that handles traffic in and out of a network by using a datapath pipeline is provided. The datapath pipeline includes multiple stages for performing various data-plane packet-processing operations at the edge of the network. The processing stages include centralized routing stages and distributed routing stages. The processing stages can include service-providing stages such as NAT and firewall. The gateway caches the result previous packet operations and reapplies the result to subsequent packets that meet certain criteria. For packets that do not have applicable or valid result from previous packet processing operations, the gateway datapath daemon executes the pipelined packet processing stages and records a set of data from each stage of the pipeline and synthesizes those data into a cache entry for subsequent packets.

Abstract: A method of and system for performing metadata tag compression in security policy enforcement system may comprise conveying a set of data elements, each with an associated metadata tag, from a first processor subsystem to a second processor subsystem. The first processor subsystem may be configured to process conventional tasks, the second processor configured to apply one or more policy decisions to the data element. The conveying may further comprise sending the set of data elements along with an index element that identifies one or more metadata tags, and sending one or more of the metadata tags identified by the index element.

Abstract: A semiconductor chip for implementing load-aware equal-cost multipath routing includes a number of pipes, each pipe being coupled to a portion of ports on the semiconductor chip, and a central unit consisting of a state machine and multiple databases. The databases contain information regarding a communication network including an overlay network and an underlay network, and the state machine is implemented in hardware and can optimize at least one feature of the overlay network and a corresponding group of paths within the underlay network.

Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.

Abstract: A method for uploading streaming media resources includes: receiving an uploading request for a target streaming media resource sent by a stream-pushing client, where the uploading request includes candidate streaming media information; generating response streaming media information based on the candidate streaming media information, and generating an access address for accessing the target streaming media resource; feeding back the response streaming media information and the access address to the stream-pushing client; and receiving the processed target streaming media resource uploaded by the stream-pushing client, and associating and storing the processed target streaming media resource with the response streaming media information.

Abstract: In one embodiment, a first label-distribution-protocol (LDP) session is established between a first interface of a first computing device and a second computing device, while a second LDP session is established between a second interface and the second computing device. The method may further comprise receiving a request from a third computing device to subscribe to a multicast group, storing an association between a first label, the multicast group, and the first interface, and sending, to the second computing device via the first LDP session, an indication that the first label is associated with the multicast group. Further, the method may include receiving a request from a fourth computing device to subscribe to the multicast group, storing an association between a second label, the multicast group and, the second interface, and sending, via the second LDP session, an indication that the second label is associated with the multicast group.