A data distribution system and method are described herein to improve the distribution of market information to subscribing client devices. Market information updates are provided to subscribing devices over a communication link every time a change in the market occurs. If a bandwidth limitation is reached on the communication link, the preferred embodiments switch to a second mode of transmission such that the market information updates are provided only at predetermined intervals. The preferred embodiment monitors the bandwidth consumption to determine what mode of transmission to apply, and in response, it can dynamically change between modes of transmission. By dynamically adjusting the mode of transmission to comport with the current network bandwidth, the preferred embodiments may provide a network friendly, data intensive, and fast response market information feed.

A method is implemented by a network device to establish a bidirectional forwarding detection (BFD) session with a defined return path to enable detection of data plane failures between an active node and a passive node in a network where a forward path and a reverse path between the active node and the passive node are not co-routed. The method includes receiving a label switched path (LSP) ping including a BFD discriminator type length value (TLV) of the active node and a return path TLV describing a return path to the active node. The BFD discriminator of the active node and a BFD discriminator of the passive node are associated with the BFD session. The return path is associated with the BFD session between the active node and the passive node, and BFD control packets are sent to the active node using the return path to detect a failure on the return path.

Systems and techniques are described for a centralized management system operating within a virtual machine which configures, monitors, analyzes, and manages an adaptive private network (APN) to provide a discovery process that learns about changes to the APN through a network control node (NCN) that is a single point of control of the APN. The discovery process automatically learns a new topology of the network without relying on configuration information of nodes in the APN. Network statistics are based on a timeline of network operations that a user selected to review. Such discovery and timeline review is separate from stored configuration information. If there was a network change, the changes either show up or not show up in the discovery process based on the selected time line. Configuration changes can be made from the APN VM system by loading the latest configuration on the APN under control of the NCN.

The present disclosure provides performance measurement (PM) for segment routing (SR) with flexibility to have PM information piggy backed, preferably using service function chaining (SFC) to data packet itself or dedicate PM packet avoiding change in data packet. A performance measured flow (PMF) identifier is used by transit/egress nodes for statistics collection for a given PMF. The PMF identifier is carried in the piggy backed information without the use of separate SR label. The Piggy backed information carries the node information role of the node used by transit egress nodes to collect statistics for a given PM segment. The present disclosure collects the statistics for multiple segments and multiple PM types using a metadata present in single received packet, saving bandwidth and making PM calculation fast and more accurate. Using the present disclosure, the timer/configuration requirement per performance measurement instance from transit/egress node is avoided.

A system for allocating tasks within a moving multi-hop mesh network includes a processor operatively coupled to memory. The processor is configured to implement the steps of: sending a bid request from a first network node to two or more other network nodes for computing a task, wherein the first network node has a first geographical location relative to a first geographical location of the two or more other network nodes; in response to the first network node receiving a bid from at least two of the two or more other network nodes for computing the task; predicting a second geographical location for each of the at least two of the two or more other network nodes relative to a second geographical location of the first network node based on the time when the task will be completed; predicting a total task completion time for the at least two of the two or more other network nodes; comparing the total task completion time predicted for the at least two of the two or more other network nodes to generate a winning bid; and allocating the task to the winning bid.

Responsive to receiving the BGP UPDATE message, a route reflector may (1) update a CLUSTER_LIST value and, if needed, an ORIGINATOR_ID value, in a path attribute section in the BGP UPDATE message to generate a revised BGP UPDATE message, and (2) send the revised BGP UPDATE message to a client of the route reflector, regardless of whether or not one of (A) field validity checking of the BGP UPDATE message, (B) Adj-RIBS-In update using the BGP UPDATE message, (C) decision processing for route selection using information in the BGP UPDATE message, or (D) Adj-RIBS-Out update using the BGP UPDATE message, is completed (or perhaps even started). This provides faster route propagation and avoids delays associated with processing BGP UPDATE messages (NLRI with advertisements and withdrawals) at each hop the NLRIs using conventional BGP such as next-hop validation, best path selection, etc.

A method for processing data packets in a communication network includes establishing a path for a flow of the data packets through the communication network. At a node along the path having a plurality of aggregated ports, a port is selected from among the plurality to serve as part of the path. A label is chosen responsively to the selected port. The label is attached to the data packets in the flow at a point on the path upstream from the node. Upon receiving the data packets at the node, the data packets are switched through the selected port responsively to the label.

A transceiver is designed to share memory and processing power amongst a plurality of transmitter and/or receiver latency paths, in a communications transceiver that carries or supports multiple applications. For example, the transmitter and/or receiver latency paths of the transceiver can share an interleaver/deinterleaver memory. This allocation can be done based on the data rate, latency, BER, impulse noise protection requirements of the application, data or information being transported over each latency path, or in general any parameter associated with the communications system.

A method for enhanced mesh networking, including performing network analysis, configuring router link parameters, and managing routing paths, is described. A metric for routing path assessment, including a throughput metric and a channel utilization metric, is described. A Segment Table Announced Mesh Protocol, including determining network segments and designating forwarding devices for communication between the network segments, is described.

A method is disclosed for optimizing packet transmission paths in a mobile communication network (400) in which packets are transmitted and received between mobile stations (10-14) or between a mobile station and a fixed network (120) by way of a plurality of packet transmission device (60-64, 70-72, 80, and 81) and radio base stations (50-57). When a mobile station uses a service that is provided by a fixed network (300), imposed are applied on the packet transmission path such that packets pass by way of specific packet transmission devices (80 and 81) depending on the fixed network (external network) 300. When the mobile station uses a service that is provided by the mobile communication network (400), on the other hand, no restrictions are imposed on the packet transmission path, and the packet transmission path is thus set such that the link costs are a minimum.