Abstract: One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

Abstract: A method is provided in one example embodiment and may include determining at a parent content node that a plurality of recipient content nodes are to receive a same content; generating, based on a determination that the same content is available at the parent content node, a multi-delivery header comprising a plurality of identifiers, wherein each identifier of the plurality of identifiers indicates each recipient content node that is to receive the same content; appending the multi-delivery header to one or more packets of an Internet Protocol (IP) flow associated with the same content; and transmitting packets for the IP flow to each of the plurality of the recipient content nodes.

Abstract: Stateful roaming techniques are provided for use in a wireless network. In one embodiment, a method is provided that includes: obtaining flow information descriptive of one or more traffic flows associated with a wireless client device that is associated to a current access point in a wireless network; storing state data representing the flow information for flows associated with the wireless client device together with a traffic descriptor for each flow; determining that the wireless client device is seeking to roam from the current access point to a new access point; and sending the state data for the wireless client device to the new access point to enable the new access point to apply a policy based on the state data before the wireless client device completes its roam to the new access point.

Abstract: An apparatus and method for path creation element driven dynamic setup of forwarding adjacencies and explicit path. In one embodiment of the method, a node receives an instruction to create a tunnel between the node and another node. The node creates or initiates the creation of the tunnel in response to receiving the instruction, wherein the tunnel comprises a plurality of nodes in data communication between the node and the other node. The node maps a first identifier (ID) to information relating to the tunnel. The node advertises the first ID to other nodes in a network of nodes.

Abstract: In one embodiment, an apparatus includes a frame comprising a top wall, a bottom wall, and sides defining an opening for receiving a plurality of removable electronic modules, a guide slidably insertable into the frame to partition an upper or lower portion of the opening when inserted into the frame, wherein the guide comprises a first edge for slidable engagement with the top wall or the bottom wall, and a lead screw extending from an opening in the guide spaced from a front end of the guide, to a back end of the guide for connecting the guide to the frame.

Abstract: A network monitor may receive network log events and identify: a first set of network devices that have reported a target network log event, a second set of network devices that have not reported the target network log event, a first set of network log events reported by the first set of network devices, and a second set of network log events reported by the second set of network devices. The network monitor may determine which network log events are legitimate, and filter the legitimate network log events from the first set of network log events or the second set of network log events to produce a group of suspicious network log events that may be correlated with the target network log event. The network monitor may predict future suspicious network log events that may be correlated with the target network log event in order to predict equipment failures.

Abstract: A method for providing services by a pair of servers to clients through one or more relay agents. The pair includes a second server configured to respond to discovery messages, and a first server configured to be unresponsive to the discovery messages. The method includes: at the first server, receiving a first discovery message from a first relay agent at a first time; and configuring the first server to become responsive to the first discovery message when a number of discovery messages from the first relay agent is equal to or greater than a predetermined number threshold and when a time lapse between the first time and a second time is equal to or greater than a predetermined time threshold. The count and time period are reset if the second server is determined to be responsive to discovery messages by monitoring the client request messages.

Abstract: An apparatus and method is disclosed for segment routing (SR). In one embodiment, the method includes a node creating a segment stack that identifies one segment calculated using a first algorithm and a second segment calculated using a second, different algorithm. The node then attaches this header to a packet and sends it to another node.

Abstract: In one aspect, a system for displaying a visual topology of a monitored distributed system is disclosed. The system includes a processor; a memory; and one or more modules stored in the memory and executable by a processor to perform operations including: receive data associated with a monitored application performed over a distributed system of interconnected nodes of machines; identify nodes of interest and one or more chains of nodes connected to the nodes of interest from the interconnected nodes based on the received data; generate an interactive flow map of the interconnected nodes in the distributed system; provide a user interface for displaying the interactive flow map; and automatically display the interactive flow map through the provided user interface to visually distinguish the identified nodes of interest and the one or more chains of nodes connected to the nodes of interest from rest of the interconnected nodes.

Abstract: In one embodiment, a first signature template is received, the first signature template being one of a signature template of a first message or a null template, the first signature template comprising at least the following fields: an aggregation depth field, a message identifier, one of the first message or a result of applying a one way hash function to the first message, a bit vector, an aggregated square random integer mod N, a signature of the first message. A second signature template is created based on the first signature template, the second signature template created as follows: increment the aggregation depth of the first signature template, determine a unique message identifier for a second message, determine a second bit vector, determine an second aggregated square random integer mod N, and calculate a new signature for the second message. Related methods, apparatus, and systems are also disclosed.

Abstract: In one embodiment, an apparatus includes a microelectronic package comprising a plurality of semiconductor chips connected to a substrate and a stiffener mounted on the substrate. The stiffener is mounted on the substrate with the semiconductor chips disposed within an opening in the stiffener and the opening defines an asymmetric shape relative to the semiconductor chips to control overall warpage in the microelectronic package by the stiffener.

Abstract: Techniques for reducing latency associated with metaframe error correction. Embodiments receive, via a first port of a plurality of ports, a stream of bits within a metaframe. Upon evaluating a first cyclic redundancy check (CRC) for a first portion of the stream of bits and determining that the first CRC is valid, a measure of latency incurred in transmitting the first portion is reduced, relative to first performing forward error correction (FEC) decoding for the first portion prior to transmission, by transmitting the first portion of the stream of bits without performing FEC decoding for the first portion of the stream of bits. Upon evaluating a second CRC for a second portion of the stream of bits and determining that the second CRC is invalid, FEC decoding is performed for the second portion of the stream of bits before forwarding the second portion of the stream of bits.

Abstract: These techniques introduce various “walker” agents that may physically move between different executing nodes/devices within the network. More specifically, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent.

Abstract: In one embodiment, a client computing device stores a plurality of digital media files. For each digital media files, the client computing device stores data identifying a geographic location associated with the digital media file. When the client computing device receives a request to view digital media files through a graphical user interface, the client computing device uses a GPS receiver to determine a geographic location of the client computing device and an electronic compass circuit to determine an orientation of the client computing device. Based, at least in part, on the location and orientation of the client computing device, the client computing device identifies a plurality of particular geographic locations that are associated with one or more digital media files. The client computing device displays icons corresponding to the plurality of particular geographic locations, ordered by a distance from the client computing device to each of the location.

Abstract: One or more servers store data defining a trust domain among a plurality of entities that participate in supporting a multimedia communication session, each of the plurality of entities having at least one network device that is involved in handling traffic or control signaling for the multimedia communication session. The one or more servers receive from one or more network devices associated with each of the plurality of entities session data generated by the respective network devices in supporting the multimedia communication session. The one or more servers log the session data received from the network devices of the plurality of entities of the trust domain as a blockchain transaction, and share logged session data with one or more devices associated with at least one of the plurality of entities of the trust domain.

Abstract: A method is performed at a source node in a network of nodes configured with a link state protocol, and in which at least some of the nodes are enabled for multiprotocol label switching (MPLS). The node discovers and stores a link state topology representing the nodes of the network, links between the nodes, path-costs for the links, and whether each link is enabled or not enabled for MPLS. The node determines one or more shortest paths from the source node to a destination node among the nodes based on traversing the link state topology and, while the node traverses the link state topology, detects whether each shortest path supports or does not support MPLS end-to-end dataplane continuity. The node programs an IP dataplane with each shortest path, and programs an MPLS dataplane with ones of the one or more shortest paths that support the end-to-end MPLS continuity.

Abstract: A system for collision avoidance includes memory storing instructions which, when executed, cause one or more processors to perform determining a direction of flight of a first drone, causing broadcasting, in the direction of flight based, a beamformed signal of beacon frames, determining a new flight direction of the same first drone, in response to the new flight direction, causing broadcasting of the beacon frames in the new flight direction, detecting second beacon frames from a second drone associated with a direction from which the second beacon frames are arriving; in response, causing the first drone to perform, without input from a pilot, one or more of a change in elevation, heading, speed, or type of operation, directed toward causing the first drone to follow a flight path that is separated from the second drone.

Abstract: In one embodiment, a network node automatically cycles among packet traffic flows and subjects the currently selected packet flows to varying drop probabilities in a packet network, such as, but not limited to in response to congestion in a device or network. Packets of a currently selected packet traffic flow are subjected to a drop or forward decision with a higher drop probability than packets of a currently non-selected flow. By cycling through all of these packet traffic flows, all of these packet flows are subjected to the drop or forward decision in the long term approximately uniformly, thus providing fairness to all packet traffic flows. In the short term, packets of a currently selected flow are targeted for possible dropping with a higher drop probability providing unfairness to the currently selected flows over the non-selected flows.

Abstract: In one embodiment, a method comprises: detecting, by a transport layer executed by a processor circuit in an apparatus, a request message received via a non-deterministic data link from one of a plurality of deterministic network interface circuits, the request message for a transport layer packet having been stored in a buffer circuit storing a plurality of transport layer packets in the apparatus, the deterministic network interface circuits providing respective deterministic links for deterministic transmission of the transport layer packets in a deterministic data network, the request message specifying a first number identifying any missed transmission opportunities on the corresponding deterministic link; determining, by the transport layer, a cause of failure in one or more of the missed transmission opportunities; and selectively executing, by the transport layer based on determining the cause of failure, a corrective action for preventing an increase in latency of the transport layer packets.