Abstract: Aspects of the present disclosure are directed to ascertaining whether data messages are repetitions of a previous data message. As may be implemented in accordance with one or more embodiments characterized herein, data packets (130/131) are received (102) and which use a first time delay relative to transmission of a previous data packet (120/121) by a different transmitter. Repetitions (110A/111A) of data packets are also received (102), and which use a second time delay relative to transmission of a previous data packet (110/111) by the same transmitter. The second time delay is less than the first time delay. The received packet is identified (102) as being a repetition of an immediately-previous data packet based on a time delay between the data packet and the immediately-previous data packet, relative to the first and second time delays.

Abstract: A link locating assisting device in a wireless communication network (10) obtains search limitation data concerning the wireless communication network and sends the search limitation data (SLD) to the wireless terminal (12) via a serving network node (14) and a serving link (SLK) for use in obtaining limitations for limiting a search for a set of candidate links (CLK1, CLK2, CLK3). The wireless terminal (12) obtains the search limitation data (SLD), sets limitations for a link search based on the search limitation data, search for candidate links starting with a current link search setting used with the serving link (SLK), and continues searching for candidate links with an offset from the current link search setting that grows with every search until the search limitations have been met.

Abstract: Systems and methods are provided for automatically discovering applications/clusters in a network and mapping dependencies between the applications/clusters. A network monitoring system can capture network flow data using sensors executing on physical and/or virtual servers of the network and sensors executing on networking devices connected to the servers. The system can determine a graph including nodes, representing at least the servers, and edges, between pairs of the nodes of the graph indicating the network flow data includes one or more observed flows between pairs of the servers represented by the pairs of the nodes. The system can determine a dependency map, including representations of clusters of the servers and representations of dependencies between the clusters, based on the graph. The system can display a first representation of a first cluster of the dependency map and information indicating a confidence level of identifying the first cluster.

Abstract: Systems, devices, and methods are provided for transmitting and retransmitting data. A first message transmitted by a sender computing entity to a receiver computing entity over a first port may exercise a first network path whereas a second message transmitted over a second port may exercise a second network path. A system (e.g., sender computing entity) may determine network reliability metrics for a plurality of network paths. If a system detects data loss (e.g., packet loss) on a first port, a second port may be selected based on network reliability metrics for retransmission of the lost data. A port may for example, be selected for retransmission based on the following criteria: (1) the port has the longest consecutive duration without packet loss and (2) the port has received an acknowledgement for a packet that was sent more recently than the initial transmission of the lost packet.

Abstract: Aspects of the present disclosure involve systems and methods for utilizing verified autonomous system (AS) network interconnections received via a cryptographically certified Recognized Operating Agency (ROA) object to generate an interconnect network model which may be used as a reference model to mitigate hijacking of network communications in downstream route announcements. In particular, AS networks may announce or share a cryptographically certified ROA object that includes a list of other AS networks to which the announcing network is connected. A router, server, or other networking device may receive ROA objects from multiple AS networks and generate a model or graph of the interconnectedness of the AS networks. Further, because each ROA object may be cryptographically certified or signed, the networking device may trust the information provided in the received ROA objects. The networking device may further verify announced routing information against the generated network model.

Abstract: A plant system includes: an access node connected to a network; a plurality of controllers configured to perform distributed control on a plurality of field devices provided in a plant; and a wireless communication unit provided in each group of a plurality of groups into which the plurality of controllers are grouped and connected to each controller in the corresponding group via a wired connection, and configured to connect each controller to the access node via a wireless connection.

Abstract: Various approaches for allocating resources to an application having multiple application components, with at least one executing one or more functions, in a serverless service architecture include identifying multiple routing paths, each routing path being associated with a same function service provided by one or more containers or serverless execution entities; determining traffic information on each routing path and/or a cost, a response time and/or a capacity associated with the container or serverless execution entity on each routing path; selecting one of the routing paths and its associated container or serverless execution entity; and causing a computational user of the application to access the container or serverless execution entity on the selected routing path and executing the function(s) thereon.

Abstract: Disclosed are a method for configuring a scheduling request, a network device, a terminal device, and a computer storage medium. The method comprises: receiving at least one bandwidth part (BWP) configured by a network side; and receiving configuration parameters of at least one scheduling request configured by the network side for each BWP, wherein the configuration parameters of the scheduling request have a mapping relationship with a logical channel.

Abstract: A computer-implemented method includes receiving, from an application framework, a set of tasks, a throughput requirement for each task of the set of tasks, and a set of active connections for a radio network comprising a Wi-Fi radio and a Zigbee radio. The computer-implemented method also includes determining, using the set of tasks, the throughput requirement for each task of the set of tasks, and the set of active connections, a target Wi-Fi radio duty cycle and setting the Wi-Fi radio to operate at the target Wi-Fi radio duty cycle. The computer-implemented method further includes monitoring, using a monitoring unit, air time statistics associated with the Wi-Fi radio, determining, using the air time statistics, a measured Wi-Fi duty cycle, and adjusting Wi-Fi radio settings to decrease a difference between the target Wi-Fi duty cycle and the measured Wi-Fi duty cycle.

Abstract: An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.

Abstract: A process for changing networks for a plurality of wireless devices includes storing in a database current wireless network distribution information for the plurality of wireless devices and storing in the database charge rates for the current wireless network distribution information for the plurality of wireless devices. The process further includes analyzing with the processor the current wireless network distribution information for the plurality of wireless devices and the charge rates for the current wireless network distribution information for the plurality of wireless devices to determine a change in distribution of wireless networks for one or more of the plurality of wireless devices and sending with the processor a command to modify wireless network settings for the one or more of the plurality of wireless devices. A system is disclosed as well.

Abstract: Software implementing a distributed ledger that adjusts in response disconnected peers is provided. The software implements an overlay routing protocol to monitor one or more overlay links between a first peer and one or more second peers that are maintaining a distributed ledger. The software adjusts how blocks for the distributed ledger are formed in response to detecting the one or more second peers becoming disconnected from the peer.

Abstract: Various approaches for allocating resources to an application having multiple application components, with at least one executing one or more functions, in a serverless service architecture include identifying multiple routing paths, each routing path being associated with a same function service provided by one or more containers or serverless execution entities; determining traffic information on each routing path and/or a cost, a response time and/or a capacity associated with the container or serverless execution entity on each routing path; selecting one of the routing paths and its associated container or serverless execution entity; and causing a computational user of the application to access the container or serverless execution entity on the selected routing path and executing the function(s) thereon.

Abstract: In a wireless optical network with multiple coordinators or other access points, the coverage area of coordinators may overlap. Interference in the communication between coordinators and devices may occur in these overlapping coverage areas. Various embodiments propose an automatic allocation of reserved time slots to coordinators. These time slots support the coordinators to advertise their presence without interference and enable a device to detect the presence of a neighbour coordinator in a single MAC cycle. Cooperation of coordinators can be supervised by a global controller to determine non-interfering time schedules whereby the coordinators rely on interference reports from the devices in the overlapping coverage areas. Fast detection allows fast re-scheduling of time slots in the wireless optical network in order to prevent interference when a device that enters the overlapping coverage area of two coordinators.

Abstract: Various examples are provided related to automated chip design, such as a pareto-optimization framework for automated network-on-chip design. In one example, a method for network-on-chip (NoC) design includes determining network performance for a defined NoC configuration comprising a plurality of n routers interconnected through a plurality of intermediate links; comparing the network performance of the defined NoC configuration to at least one performance objective; and determining, in response to the comparison, a revised NoC configuration based upon iterative optimization of the at least one performance objective through adjustment of link allocation between the plurality of n routers. In another example, a method comprises determining a revised NoC configuration based upon iterative optimization of at least one performance objective through adjustment of a first number of routers to obtain a second number of routers and through adjustment of link allocation between the second number of routers.

Abstract: Some examples relate to selection of a rendezvous point in an IP multicast network managing multicast group traffic. An example includes transmitting, from a controller in a cloud computing system, messages to a source device and a host device in an IP multicast-capable network, which may include two peer network devices that are virtualized to function as one virtual device. Based on the response to the messages, the controller may determine that the source device is present in OSI layer 3 and the host device is present in OSI layer 2. The controller may determine that the peer network are located downstream in relation to the determined layer of the source device. The controller may select a non-peer network device as a rendezvous point in the IP multicast-capable network. Further to the selection, the controller may synchronize an active-active configuration between the peer network devices.

Abstract: Embodiments of this application provide a network optimization method, a network optimization system, and a network device, and relate to the communications field. A first network device adjusts, if it is detected that a communications link between the first network device and a second network device is in an abnormal state, a metric of at least one data flow received by the first network device; and the first network device selects a transmission path for the at least one data flow based on adjusted metric, and transmits the at least one data flow to the selected transmission path. In this way, load of the communications link is reduced, and the communications link is restored to a normal state.

Abstract: There is provided an apparatus comprising means for: translating between a first communication apparatus and a first wireless communication network operating as at least part of a bridge between the first communication apparatus and a second communication apparatus; determining that the first and/or second communication apparatus is undergoing or has undergone a mobility event; and executing at least part of a mobility procedure resulting from the mobility event.

Abstract: A network control system that includes several controllers for managing several switching elements. In some embodiments, each switching element implements at least one logical switching element and has a master controller. In some embodiments, at least one controller is a master of at least two switching elements. The network control system accepts definitions of the logical switching elements and, in some embodiments, each logical switching element has a master controller. In some embodiments, at least one controller is a master for at least two logical switching elements.

Abstract: Enhanced mesh network performance is provided by computation of a path metric with respect to multi-hop paths between nodes in a mesh network and determination of a path through the mesh network that is optimal according to the path metric. Information is communicated in the mesh network according to the determined path. Nodes in the mesh network are enabled to communicate via one or more wireless links and/or one or more wired links. The path metric optionally includes an effective bandwidth path metric having elements (listed from highest to lowest conceptual priority) including an inverse of a sustainable data rate, a number of wireless links, and a number of wireless and wired links. The sustainable data rate is a measure of communication bandwidth that is deliverable by a path for a period of time. Accounting is made for interference between contiguous wireless links operating on the same channel.

Abstract: Ultra-Wideband (UWB) technology exploits modulated coded impulses over a wide frequency spectrum with very low power over a short distance for digital data transmission. Today's leading edge modulated sinusoidal wave wireless communication standards and systems achieve power efficiencies of 50 nJ/bit employing narrowband signaling schemes and traditional RF transceiver architectures. However, such designs severely limit the achievable energy efficiency, especially at lower data rates such as below 1 Mbps. Further, it is important that peak power consumption is supportable by common battery or energy harvesting technologies and long term power consumption neither leads to limited battery lifetimes or an inability for alternate energy sources to sustain them. Accordingly, it would be beneficial for next generation applications to exploit inventive transceiver structures and communication schemes in order to achieve the sub nJ per bit energy efficiencies required by next generation applications.

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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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.