Abstract: Methods, systems, apparatuses, and computer program products for transparent integration of a wireless network (e.g., a 3rd Generation Partnership Project (3GPP) network) into a wireline network (e.g., a time sensitive networking (TSN) network) are provided. A method, system, and apparatus may receive, at a networking translator, a notification trigger related to a protocol data unit session from a networking translator client or a network function of a communication network. The method, system, and apparatus may cause transmission, at the networking translator, of notification information to a network controller of the communication network according to an interface.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed herein to identify media presentation by analyzing network traffic. Example instructions cause a machine to generate a traffic profile to reduce a computational burden of identifying streaming media being presented on a media presentation device, the traffic profile including first network traffic data indicative of the streaming media; obtain the traffic profile and second network traffic data corresponding to the streaming media; and generate, in response to a score for the second network traffic data meeting a threshold of similarity, a network traffic analysis report identifying the streaming media being presented on the media presentation device.

Abstract: According to one embodiment, a broadcast request is received from a host that hosts an application that initiated a broadcast message to be broadcast to one or more DP accelerators of a plurality of DP accelerators coupled to the host, where the broadcast request includes one or more DP accelerator identifiers (IDs) identifying the one or more DP accelerators. A broadcast session key for a broadcast communication session to broadcast the broadcast message is received from the host. For each of the one or more DP accelerator IDs, a public key of a security key pair corresponding to the DP accelerator ID is identified. The broadcast message is encrypted using the broadcast session key. The broadcast session key is encrypted using the public key. The encrypted broadcast message and the encrypted broadcast session key are transmitted to a DP accelerator identified by the DP accelerator ID.

Abstract: A system described herein may provide a technique for the resolution of requests for Internet Protocol (“IP”) addresses for Virtualized Network Functions (“VNFs”) in a network, such as a Software-Defined Network (“SDN”) (e.g., a wireless telecommunications network). In the network, different instances of the same VNF may be implemented by different hardware resources, and may accordingly have different IP addresses. Metrics of routes between instances of a requested VNF type and a requestor may be calculated, and a particular instance of the requested VNF may be selected based on the metrics (e.g., a lowest cost, highest performance, etc.). The IP address of the particular VNF instance may be provided to the requestor. The requestor, such as a User Equipment (“UE”), may communicate with the particular VNF instance in order to receive services provided the requested VNF type.

Abstract: The application describes an apparatus including a single application processor operably coupled to a non-transitory memory including instructions stored thereon. The apparatus also includes plural, discrete radio resources operably in communication with the single application processor. Each radio resource includes a modem operating on a network selected from at least one of LoRA, digital mobile radio and metro access network. In the apparatus, the single application processor is configured to execute the instructions of discovering the modem of each discrete radio resource. The single application processor is also configured to execute the instructions of assigning a TCP port to each discovered modem. In addition, the single application processor is configured to execute the instructions of creating an individualized session for each modem.

Abstract: A method for transporting time synchronization information in a wireless network comprising a first wireless node and a second wireless node. The method comprising: transmitting, by the first wireless node, a first message at a first time, the first message comprising a first timestamp; receiving, by the second wireless node, the first message at a second time; transmitting, by the second wireless node, a second message at a third time in response to receiving the first message, the second message comprising a second timestamp. The method further comprising transmitting, by the first wireless node, a third message; receiving by the second wireless node, the third message; and generating a timing correction value based, in part, on the contents of the first message, the second message and the third message.

Abstract: A method including determining, by a VPN server, aggregate amounts of VPN data communicated with a host device during sample durations of time within a reference period; determining, by the VPN server, difference amounts indicating differences in the aggregate amounts of VPN data communicated with the host device during successive sample durations of time; determining, by the VPN server, average aggregate amounts of VPN data communicated with the host device based on averaging the difference amounts; determining, by the VPN server, a largest average aggregate amount, from among the average aggregate amounts, as an average threshold level; and selectively adjusting, by the VPN server, an amount of VPN data communicated with the host device based at least in part on a result of comparing the average threshold level with an observed average aggregate amount of VPN data communicated with the host device. Various other aspects are contemplated.

Abstract: Systems and methods are disclosed for generating synthetic representations of a network and performing path computations using the synthetic representations. A model of the network is created including different representations for different regions of the network based on the network mesh patterns (e.g., a sparse mesh representation, a Clos mesh representation, and a flat mesh representation). The generated representations include synthetic, aggregated nodes and/or links in the represented region that are determined based on different processes according to the type of mesh in the region. Path computations are performed for each representation (e.g., in parallel), then joined to form end-to-end paths between a source and a destination. The computed paths may be used to select a path for routing data through the network.

Abstract: According to one embodiment, a broadcast request is received from a host via a communication switch to broadcast a broadcast message to one or more DP accelerators, where the host hosts an application that initiated the broadcast request. The broadcast request includes a list of one or more public keys associated with one or more DP accelerators of a plurality of DP accelerators coupled to the communication switch. For each of the one or more DP accelerators associated with the public keys of the list, a session key for a broadcast session corresponding to the broadcast message is encrypted using one of the public key associated with the DP accelerator. The broadcast message is encrypted using the broadcast session key. The encrypted broadcast messages and the encrypted broadcast session keys are broadcast to the DP accelerators.

Abstract: Passive monitoring by network devices can be used to validate a network traffic matrix, which aggregates end-to-end traffic demands between source-destination pairs in the network. Using information regarding the physical and logical topology of the network during the same time period as the traffic matrix, a model of the network is generated. Traffic load on each link between network devices in the network is predicted using the model and the traffic matrix. Actual traffic loads on each link are determined from the passive monitoring data from each network device. By comparing the predicted load with the actual load on each link, a measure of the validity or accuracy of the traffic matrix is obtained. The disclosed techniques can also be applied to validate a network loss matrix.

Abstract: The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.

Abstract: Provided are a data processing method, a terminal device and a network device. The method comprises: a terminal device receiving first indication information, used for code block segmentation, sent by a network device; the terminal device performing, according to the first indication information, code block segmentation on the data, so as to obtain at least one code block, wherein the data is data received by the terminal device from the network device, or the data is data to be sent by the terminal device to the network device; and the terminal device encoding or decoding the at least one code block. The embodiments of the present invention improve the flexibility of an encoding/decoding process.

Abstract: Systems and methods are described to utilize a consensus protocol to determine adoption of network routes between autonomous systems (ASes). One or more routers can act as proposers to the groups, proposing a Border Gateway Protocol (BGP) route. Remaining routers vote on whether to accept or reject the announcement. If a majority of the routers of the group accept the announcement, each router modifies its routing tables to reflect the new route. A token ledger is maintained at each router and updated based on the votes of each router—increasing tokens held by routers who propose accepted routes or vote with the consensus, and decreasing tokens held by routers who proposed declined routes or vote against the consensus. The number of tokens held by a router can indicate the operational correctness of the router in proposing or adopting good network routes.

Abstract: In a network, communications between nodes in the network can be routed along different communication pathways. The network can include subnetworks provided and administered by third parties, and can include virtual private networks (VPNs), so that the different pathways can be or include VPN tunnels that pass through different subnetworks of the communications network. A central controller can monitor performance of the pathways, including those not in primary use, and dynamically adjust routing of communications traffic between the nodes by directing communication traffic to specific pathways or tunnels. The controller can direct different types of traffic (for example, data, voice) to particular pathways, and can direct traffic to different pathways based on direction of traffic flow (for example, uplink along one pathway and downlink along another pathway).

Abstract: A peer may receive a peer list from a hybrid overlay management server in response to an overlay network participation request of the peer, may select a first peer from the received peer list, may establish a connection with the selected first peer, and may establish a connection with at least one of second peers. Propagation of the overlay network participation request may be initiated by the selected first peer, and each of the second peers may correspond to a peer that receives the propagated overlay network participation request. One of the established connections may be determined as a primary path, and a communication may be performed through the primary path.

Abstract: System and methods are provided for generating lane aware clusters for vehicle to vehicle communications. A vehicle uses lane level map matching to obtain a current travelling lane. Vehicles that are within a proximity radius exchange data such as location, lane, speed, direction. Sub clusters are creating with vehicles driving on the same lane based on proximity distance. The sub clusters are merged into one cluster based on sub cluster similarity in terms of spatial proximity, average speed, and direction.

Abstract: Provided are a data processing method, a terminal device and a network device. The method comprises: a terminal device receiving first indication information, used for code block segmentation, sent by a network device; the terminal device performing, according to the first indication information, code block segmentation on the data, so as to obtain at least one code block, wherein the data is data received by the terminal device from the network device, or the data is data to be sent by the terminal device to the network device; and the terminal device encoding or decoding the at least one code block. The embodiments of the present invention improve the flexibility of an encoding/decoding process.

Abstract: One or more techniques and/or systems are provided for automatically forming a wireless sensor network, implementing power management for the wireless sensor network, and/or self-healing within the wireless sensor network. For example, hub devices, configured to forward messages through the wireless sensor network to a gateway device having access to a network, may automatically join and configure into the wireless sensor network by locating and connecting to master devices using signal frequencies representing numbers of hops to the gateway device. A hub device may be configured to transition between a low power sleep state for power conservation and an awakened normal operational state for transmitting timing signals according to a duty cycle, and thus the hub device may be capable of operating from a battery. If a hub device determines that a master device has become inoperable, the hub device may automatically search for a new master device.

Abstract: In one embodiment, a method includes performing, by a router, a destination address lookup of an IP packet in a Forwarding Information Base (FIB) and identifying, by the router, an equal cost multi-path (ECMP) object from the destination address lookup. The ECMP object includes a plurality of paths for forwarding the IP packet to a destination associated with a destination address. The method further includes determining, by the router, a source interface associated with the IP packet, determining, by the router, that the source interface matches an egress interface associated with a path among the plurality of paths, and communicating, by the router, the IP packet based on the path to the destination using the egress interface.

Abstract: A method and apparatus for routing packets in a network, such as a satellite mesh network. For each one of multiple destination devices capable of further handling of the packet for routing to a destination (e.g. ground station) a respective cost or utility associated with forwarding the packet to that destination device is determined. For a given value k, an unsorted subset of k of the destination devices for which said costs are lowest or said utilities are highest is determined, without necessarily fully sorting the plurality of destination devices by cost or utility. The data packet is then forwarded to a selected one of this subset of destination devices. Cost may correspond to distance from destination device (e.g. satellite) to the further destination. Sorting networks and selector networks can be used, for example as implemented in hardware, to generate the unsorted subset.

Abstract: A thread executing a task at a node in a multi-socket computing system may access a first data structure to obtain a first calibration dataset for the node. The first thread may generate a timestamp based on the first calibration dataset and a first quantity of time measured by a clock at the first node. The real-time duration of the task may be determined based on the timestamp. The first thread may recalibrate the first clock by at least generating, based on the first quantity of time measured by the clock and a second quantity of time measured by a wall clock of an operating system of the multi-socket computing system, a second calibration dataset. The first thread may update the first data structure to include the second calibration dataset while a second thread accesses a second data structure to obtain calibration data.

Abstract: Embodiments of the present invention disclose a path determining method, apparatus, and system. In a hybrid network including one controller for implementing a control function, the controller may separately obtain network topology information of a first network and a second network of different network types by using a same control channel protocol. When the controller obtains a path determining requirement for the data transmission path, because the controller has the network topology information of the first network and the second network, during computation of the data transmission path, the controller can determine a path computation result including transmission path parts of the first network and the second network, without performing additional information exchange with another device, and send the path computation result to the first network device. In this way, planning efficiency of the data transmission path is improved.

Abstract: The present application describes a path selection method and apparatus. The method may include obtaining a required latency of a service. The method may further include determining a target path for the service from m strict explicit paths based on the required latency, where a latency of the target path is less than or equal to the required latency, all the m strict explicit paths are unallocated paths, any subpath of a first strict explicit path in the m strict explicit paths exists in only the first strict explicit path, the first strict explicit path is any path in the m strict explicit paths, and m is an integer greater than or equal to 1. The present invention is applicable to the field of communications technologies and resolves at least a problem where a path computation element (PCE) cannot ensure that a path allocated to a service can meet a latency requirement of the service.

Abstract: A synchronization information transmission method includes: receiving synchronization information sent by a preceding node; on the basis of synchronization accuracy information of a current node, updating intermediate node information in the synchronization information; and sending the updated synchronization information to a subsequent node.

Abstract: The management node includes a performance information integration unit which integrates performance information pertaining to the analysis node connected to the management node. The analysis node includes a task determination unit which determines, based on a first cost, being calculated based on performance information pertaining to the analysis node, of executing a task in the analysis node, and a second cost being calculated based on performance information pertaining to another of the analysis nodes different from the analysis node integrated by the performance information integration unit, and representing a cost of load distribution of distributing the task to the another analysis node and then executing the task, whether to execute the task in the analysis node, or distribute the task to the another analysis node and then execute the task.

Abstract: An apparatus includes receive path circuitry configured to receive a Motion Picture Experts Group (MPEG) Media Transport (MMT) container and a processing device configured to identify locations of one or more media fragment units (MFUs) in the MMT container using a hint track within the MMT container. Another apparatus includes transmit path circuitry configured to transmit an MMT container and a processing device configured to identify locations of one or more MFUs in the MMT container using a hint track within the MMT container.

Abstract: Disclosed are a method and a device for establishing a multi-domain and dual-home path, herein the method includes: a client network sending information of a first dual-home path and a computation request of a dual-home separating path of the first dual-home path to a parent PCE of a serving network with which the client network is associated; the client network receiving information of the dual-home separating path responded by the parent PCE, herein the information of the dual-home separating path is computed by the parent PCE at least according to the information of the first dual-home path; and the client network establishing a second dual-home path according to the information of the dual-home separating path.

Abstract: A radio frequency (RF) communication system comprising a plurality of RF nodes connected via a mesh wireless network. Each of the RF nodes comprises an RF node processor, an RF node wireless transceiver configured for data communication over the mesh wireless network that is coupled to the RF node processor, an RF node memory that is coupled to the RF node processor of the RF node, and a preloaded routing table in the RF node memory including all or a subset of routes in the mesh wireless network.

Abstract: A node device (4) in a network (1) of communicatively interconnected node devices (4) having limited data processing and storage resources, such as a mesh network (1) of node devices (4), receives an inquiry message of the type ‘find the best match’ for information to be located at a node device (4). The inquiry message comprises benchmark data relating to the information to be located. The receiving node device updates the message based on a comparison of the content in the latest received message and the node's locally stored information. The locally stored information is derived from previous received messages from other node devices (4) in the network (1) and information available at the receiving node device. When no update is required, no message is broadcasted by a node device (4) and the local copy at the node devices involved converges in a few broadcasts to a static content from which the information sought can be located in the network (1).

Abstract: Techniques for dynamically managing capabilities on network monitoring devices are provided. A client application interface associated with a client device for a user to manage network capabilities on network monitoring devices may be provided. An indication of the user renting a first network capability from the client device may be received. The first network capability may be enabled on a first network monitoring device associated with the user.

Abstract: A network service transmission method includes obtaining network topology information and network service information, and determining a node centrality of each node in a set of other nodes; determining at least one segment node in the set of other nodes, determining at least one transmission path used to transmit each network service; and determining traffic of a network service that is to be transmitted on the at least one transmission path used to transmit the network service. After the segment node is determined, traffic of a network service transmitted on each transmission path is determined, and the transmission paths of the network services share the same segment node.

Abstract: A device, system and method for transmitting a response command to a radio using a visualization of locations of radios and communication links therebetween is provided. A device generates a visualization of respective locations of radios and communication links therebetween, the visualization distinguishing between the radios that are inside a coverage area of a communication network and a first radio that is outside of the coverage area, the visualization indicating a second radio in communication with the first radio via a local communication link. The device detects an input indicating a response command associated with the first radio. The device determines a routing path from the computing device to a given radio of the radios that are inside the coverage area. The device transmits, to the given radio, via the routing path, the response command.

Abstract: Systems and methods for dynamically controlling connections between a plurality of servers in a data center, where the data center includes at least a first reconfigurable intelligent surface (RIS) and a first RIS controller (RISC) configured to control physical propagation settings of physical propagation elements of the first RIS, wherein each server of the plurality of servers includes or is communicably connected with a wireless connection component enabling communication via directive wireless propagation via the physical propagation elements of the first RIS. A controller device pushes a set of one or more RIS configurations to the RIS and a set of one or more transceiver beamforming configurations to the wireless connection components and jointly determines an optimal transceiver beamforming configuration and an optimal RIS configuration using the connection feedback information.

Abstract: Techniques configure a network to relay data from a node to a root device are described herein. In an example, one-hop neighbors of the node are determined and ranked according to link quality. The ranked neighbor nodes may be considered potential “parent nodes” of the node. The ranked nodes may be divided into a plurality of groups according to link quality. A parent node may be selected from among the “best” group of one-hop neighbor nodes and may be used to relay data for the node to and/or from the router or other device. The node continues to use the parent node at least until its ranking removes it from the best group or falls below a threshold value. After the ranking of the parent falls below such a prescribed threshold it may be replaced by selection of a replacement parent from the group of one-hop upstream neighbors having the best link quality.

Abstract: A method of displaying network topology and a network management device are disclosed. The method includes: determining a sub-network that can be abstracted from the original network topology, wherein the sub-network includes at least two network devices as well as a network link and a network interface between the at least two network devices; abstracting the at least two network devices, as well as the network link and the network interface between the at least two network devices included in the sub-network and obtaining a virtual network device; and displaying a current network topology, the current network topology including the virtual network device which is generated after abstracting the sub-network.

Abstract: A computer-implemented system and method for generating a minimum-cost circulation topology in a mesh network is provided. The system comprises one or more processors configured to receive a service request from a client computer and identify a group of services for the service request. The one or more processors are further configured to iteratively query a global registry for each of the group of services to obtain respective groups of dependent service instances, generate an adjacency table including a plurality of service dependency paths identified from the respective groups of dependent service instances. The system determines a minimum-cost service dependency path by applying a predetermined cost algorithm on the adjacency table and executing a first service instance of the minimum-cost service dependency path and route the service request to the second service instance in the dependency path.

Abstract: A first distributed processing node transmits distributed data to a second distributed processing node as intermediate consolidated data. A third distributed processing node generates intermediate consolidated data after update from received intermediate consolidated data and distributed data, and transmits the intermediate consolidated data to a fourth distributed processing node. The first distributed processing node transmits the received intermediate consolidated data to fifth distributed processing node as consolidated data. The third distributed processing node transmits the received consolidated data to a sixth distributed processing node.

Abstract: An apparatus includes a first communication interface configured to be communicatively coupled, via an optical line, to a network device that is disposed in an optical network using wavelength division multiplexing (WDM). The apparatus also includes a second communication interface configured to be communicatively coupled to a router via an Ethernet connection. The apparatus also includes a signal generator operatively coupled to the first communication interface and the second communication interface. The signal generator is configured to generate an Ethernet signal representing at least one attribute of the optical line between the first communication interface and the network device. The second communication interface is configured to transmit the Ethernet signal to the router.

Abstract: In some implementations, a message indicating a request for delivery of data to user equipment (UE) (e.g. an IoT device) operative for communications in a mobile network may be received from an application server. One or more first loading or congestion indication values indicative of a first loading or congestion at one or more first network nodes along a first mobile network route may be obtained. In addition, one or more second loading or congestion indication values indicative of a second loading or congestion at one or more second network nodes along a second mobile network route may be obtained. The first or the second mobile network route may be selected based on at least one of the one or more first and the second loading or congestion indication values. The data may be delivered to the UE over the selected mobile network route.

Abstract: Systems and methods for load balancing in a network are disclosed. An illustrative method includes receiving network telemetry data corresponding to network paths of a plurality of coexisting multipaths, performing an adaptive load balancing process by determining whether a network path from the plurality of coexisting multipaths is an adequate network path based on the network telemetry data, and in response to determining the network path is an adequate network path, selecting the network path for a network flow.

Abstract: The technology disclosed herein enables load balancing between a pair of virtual edge systems configured for high availability at an edge of a local network environment. In a particular embodiment, a method provides assigning a virtual network address to the pair of virtual edge systems. The method further provides generating state information used by one or more stateful functions of a first virtual edge system of the pair of virtual edge systems and transferring the state information to a second virtual edge system of the pair of virtual edge systems. Also, the method provides directing a first portion of network traffic to the first virtual edge system and a second portion of the network traffic to the second virtual edge system. The network traffic comprises packets addressed with the virtual network address.

Abstract: Some embodiments of the invention provide a forwarding element that can be configured through in-band data-plane messages from a remote controller that is a physically separate machine from the forwarding element. The forwarding element of some embodiments has data plane circuits that include several configurable message-processing stages, several storage queues, and a data-plane configurator. A set of one or more message-processing stages of the data plane are configured (1) to process configuration messages received by the data plane from the remote controller and (2) to store the configuration messages in a set of one or more storage queues. The data-plane configurator receives the configuration messages stored in the set of storage queues and configures one or more of the configurable message-processing stages based on configuration data in the configuration messages.

Abstract: Techniques and mechanisms to enable a Bidirectional Forwarding Detection (BFD) Echo function to be used for IP multi-hop paths using IP encapsulation. A source device may encapsulate one or more BFD Echo packets as payloads in IP packets. The resulting IP packets may then be sent from a source device to a destination device over a multi-hop path such that one or more intermediary devices forward the IP packets onto the destination device. Upon receiving the IP packets, the destination device may echo back the one or more BFD Echo packets in the forwarding plane to indicate connectivity of the forwarding path between the devices. However, if the BFD Echo packets are not echoed back to the source device, the source device may determine that the multi-hop path has experienced a fault, and that traffic is to be rerouted through other paths.

Abstract: A router includes a plurality of ports interconnected to one or more Customer Edge (CE) nodes and one or more Provider Edge (PE) nodes; and memory storing a forwarding table of routes, wherein the routes in the forwarding table are installed automatically based on static or Interior Gateway Protocol (IGP)-learned default routes, connected routes, Border Gateway Protocol (BGP) routes learned from peers, and routes in an Internet routing table, and wherein a number of the routes installed in the forwarding table is less than a number of routes in the Internet routing table. The number of routes in the Internet routing table exceeds a capacity of the memory, and the routes installed in the forwarding table ensure a loop-free topology. The routes installed in the forwarding table can include all of the BGP routes learned from peers plus longer prefix matches from the routes in the Internet routing table.

Abstract: A communication system includes multiple servers each functioning as an active system or a standby system and a relay device that relays communication between a server of the active system and one or more client terminals operated by clients. Each of the servers includes a priority level determining unit that determines a priority level of each of the clients, a virtual port creating unit that creates, in the server, a virtual port corresponding to a virtual LAN assigned to each of the client terminals, and a communication processing unit (CPU) that instructs the relay device to change a destination of communication performed between the client terminal and the server to the virtual port. The CPU gives an instruction of change of the destination of the communication in order of highest to lowest priority level of the client when a malfunction occurs in another server of the active system.

Abstract: A wireless network device may receive a broadcasted hello message. The wireless network device may determine, based on the broadcasted hello message, interfaces to communicate with neighbor devices. The wireless network device may determine costs for links of the interfaces. A highest cost link of the interfaces may be blocked and a lowest cost link of the interfaces may be unblocked. The wireless network device may transmit, in the network, an announce message that indicates the highest cost link as blocked and the lowest cost link as unblocked.

Abstract: A method may include an instruction to route the data to a destination. The method may additionally include inspecting the data to identify metadata associated with the data. The method may further include identifying, based on the metadata, a first routing path and a second routing path that both lead to the destination. The first routing path may include a first communication link associated with a first link classification, and the second routing path may include a second communication link associated with a second link classification. The method may also include selecting the first routing path based on a configuration preference and based on the first routing path including the first communication link associated with the first link classification. The method may additionally include transmitting the data along the first routing path via the first communication link.

Abstract: In various embodiments, a method and apparatus are configured to receive information associated with a path from a first node to a second node; and generate a set of one or more segment identifiers at least one of which is in an address space having a span in a current region in which the first node resides, and is configured for use in identifying a next region, wherein the set of one or more segment identifiers encodes the path.

Abstract: In an embodiment, a computer-implemented method for highly-scalable, in-network multicasting of statistics data is disclosed. In an embodiment, a method comprises: receiving, from an underlay controller, a match-and-action table that is indexed using one or more multicast (“MC”) group identifiers and includes one or more special MC headers; detecting a packet carrying statistics data; determining whether the packet includes an MC group identifier; in response to determining that the packet includes the MC group identifier: using the MC group identifier, retrieving a special MC header, of the one or more special MC headers, from the match-and-action table; generating an encapsulated packet by encapsulating the packet with the special MC header; and providing the encapsulated packet to an interface controller for transmitting the encapsulated packet to one or more physical switches.

Abstract: Known intra-domain routing methods (e.g., OSPF and IS-IS) are link-state routing protocols with hop-by-hop forwarding that sacrifice optimal traffic engineering for ease of implementation and management. Known optimal traffic engineering procedures are either not link-state methods or require source routing—characteristics that make them difficult to implement. Certain embodiments of the present invention include a fully distributed, adaptive, link-state routing protocol with hop-by-hop forwarding configured to achieve optimal traffic engineering. Such embodiments facilitate significant performance improvements relative to known intra-domain routing methods and decrease network infrastructure requirements.