Abstract: In computing networks, path availabilities are estimated according to the present disclosure. The path availabilities may be calculated based on connectivity and performance measurements provided by multiple data sources, including passive, active, and/or route monitoring data sources. The measurements may be classified using network topology and processed to determine availability indicators corresponding to the measurements. The availability indicators may be aggregated to determine an overall path availability score for a path associated with the indicators.

Abstract: In one example embodiment, a distributed platform includes at least one node for performing baseband processing of signals, the at least one node including a memory and a processor. The memory has computer-readable instructions stored therein. The processor is configured to the execute computer-readable instructions to enable independent operations of a plurality of radio protocol stacks and a plurality of backhaul protocol stacks for performing the base band processing functions of a plurality of base stations, each of the plurality of base stations being configured to serve one or more user devices. The processor is further configured to manage data packet flows between the plurality of radio protocol stacks and the plurality of backhaul protocol stacks.

Abstract: In one example embodiment, a distributed platform includes at least one node for performing baseband processing of signals, the at least one node including a memory and a processor. The memory has computer-readable instructions stored therein. The processor is configured to the execute computer-readable instructions to enable independent operations of a plurality of radio protocol stacks and a plurality of backhaul protocol stacks for performing the base band processing functions of a plurality of base stations, each of the plurality of base stations being configured to serve one or more user devices. The processor is further configured to manage data packet flows between the plurality of radio protocol stacks and the plurality of backhaul protocol stacks.

Abstract: A capability for cross-layer aware communication of a multipath data flow via a communication network is presented. The multipath data flow is transported using a set of multiple transmission flows based on a multipath transport protocol. The communication network supports a set of multiple communication paths. A controller is configured to determine a set of mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths based on cross-layer state information, compute a set of path mapping rules for a network element based on the mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths, and provide the path mapping rules to the network element. The network element is configured to apply the path mapping rules for mapping packets of the multipath data flow between the multiple transmission flows of the multipath data flow and the multiple communication paths.

Abstract: A capability for cross-layer aware communication of a multipath data flow via a communication network is presented. The multipath data flow is transported using a set of multiple transmission flows based on a multipath transport protocol. The communication network supports a set of multiple communication paths. A controller is configured to determine a set of mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths based on cross-layer state information, compute a set of path mapping rules for a network element based on the mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths, and provide the path mapping rules to the network element. The network element is configured to apply the path mapping rules for mapping packets of the multipath data flow between the multiple transmission flows of the multipath data flow and the multiple communication paths.

Abstract: In one embodiment, a first node is adapted for communication with a plurality of additional nodes of a communication network, such as a Delaunay Triangulation (DT) network. The first node is configured to detect a failure in delivery of a broadcast packet to at least a given one of the additional nodes. Responsive to the detected failure in delivery of the broadcast packet to the given additional node, the first node encapsulates the broadcast packet in a unicast packet for delivery to a downstream node of the given additional node. The first node may be configured to detect the failure in delivery of the broadcast packet to the given additional node using a hop level acknowledgment process. Other embodiments are configured to facilitate implementation of progressive search by communicating identifiers from boundary nodes of the network that are reached in a given stage of the progressive search.

Abstract: In a method for dynamic buffer adjustment at a line card of router, a current buffer occupancy at the line card is compared with at least a first buffer occupancy threshold, the first buffer occupancy threshold being calculated based on a buffer occupancy threshold parameter and a capacity of at least a first buffer memory at the line card; and an active buffer capacity is adjusted by at least one of activating and deactivating buffer memory blocks at the line card based on the comparing step, the activating including switching on the buffer memory blocks, and the deactivating including causing the buffer memory blocks to enter a sleep state.

Abstract: To address the security requirements for cyber-physical systems, embodiments of the present invention include a resilient end-to-end message protection framework, termed Resilient End-to End Message Protection or REMP, exploiting the notion of the long-term key that is given on per node basis. This long term key is assigned during the node authentication phase and is subsequently used to derive encryption keys from a random number per-message sent. Compared with conventional schemes, REMP improves privacy, message authentication, and key exposure, and without compromising scalability and end-to-end security. The tradeoff is a slight increase in computation time for message decryption and message authentication.

Abstract: To address the security requirements for cyber-physical systems, embodiments of the present invention include a resilient end-to-end message protection framework, termed Resilient End-to End Message Protection or REMP, exploiting the notion of the long-term key that is given on per node basis. This long term key is assigned during the node authentication phase and is subsequently used to derive encryption keys from a random number per-message sent. Compared with conventional schemes, REMP improves privacy, message authentication, and key exposure, and without compromising scalability and end-to-end security. The tradeoff is a slight increase in computation time for message decryption and message authentication.

Abstract: In a method for dynamic buffer adjustment at a line card of router, a current buffer occupancy at the line card is compared with at least a first buffer occupancy threshold, the first buffer occupancy threshold being calculated based on a buffer occupancy threshold parameter and a capacity of at least a first buffer memory at the line card; and an active buffer capacity is adjusted by at least one of activating and deactivating buffer memory blocks at the line card based on the comparing step, the activating including switching on the buffer memory blocks, and the deactivating including causing the buffer memory blocks to enter a sleep state.

Abstract: A method and apparatus for scalably and securely providing address invisibility to a content provider over a network. In various embodiments, the content provider determines the closest geographic rendezvous point node to store content, such that each of the geographic regions may have associated with it one or more nodes, which provide content to a subscriber without directory service to thereby provide address invisibility to the content provider and also the content consumer.

Abstract: A packet forwarding determination capability is disclosed herein. The packet forwarding determination capability enables determination of handling of a packet at a current node of a network. A set of candidate neighbor nodes is determined for the current node from a representation of respective locations of the neighbor nodes. The set of candidate neighbor nodes includes each of the neighbor nodes located at least within a circle defined within the representation and having a diameter defined by a line between the current node and a destination node of the packet. The routing of the packet at the current node is determined using the set of candidate neighbor nodes. The routing of the packet may include forwarding the packet toward a next-hop node or identifying the current node as being the intended destination of the packet.

Abstract: Methods, systems, and apparatus for implementing cloud-based demand response are provided. Cloud-based demand response may be performed by publishing a demand response request at a communications node, the published demand response request including at least a load reduction request and an incentive price; initiating a load reduction bidding process in response to the published demand response request, the load reduction bidding process being accessible to customer nodes; and determining an updated incentive price based on at least one load reduction bid received from the customer nodes. The updated incentive price may be determined by a bisection function, and the at least one load reduction bid may be autonomously generated based on a customer cost function.

Abstract: The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. A service-specific probe is an active probe that closely mimics the service traffic so that it receives the same treatment from the network as the actual service traffic. Service-specific probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. A polynomial-time probe-path computation algorithm is provided as well as a 2-approximate solution for merging probe paths when the number of probes exceeds a required bound k. The algorithms are evaluated using ISP topologies generated via Rocketfuel. For most topologies, it is possible to cover more than about 98% of the edges using just about 5% of the nodes as terminals.