Abstract: Computer-implemented systems and methods are disclosed for distance and congestion-aware resource deployment. In some embodiments, a method is provided to estimate a vehicle deployment region. The method includes constructing a graph data structure using at least in part a single invocation of a form of Dijkstra's algorithm. The method additionally includes partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of the vehicle.

Abstract: A controller node receives a list of a first plurality of flows programmed on a network switch. The controller node extracts a flow cookie value from a flow cookie data field of each flow in the first plurality of flows on the received list and calculates a session identifier on the basis of the extracted cookie values. At least one add flow command is transmitted from the controller node to the network switch to program a second plurality of flows on the network switch. The at least one add flow command comprises flow cookie values in the flow cookie data fields of each of the flows in the second plurality of flows which are set equal to the calculated session identifier. At least one delete flow command is transmitted from the controller node to the network switch to delete programming of the first plurality of flows on the network switch.

Abstract: Measures for processing data in a packet-switched network. At a first device in the network, a packet transmitted from a second device in the network is received. The received packet comprising an Internet Protocol (IP) address for a third device in the network. On the basis of the IP address for the third device comprised in the received data packet, lookup in an IP routing table of the second device is initiated to obtain a next-hop address for the received packet. The obtained next-hop IP address is determined to be an IP address of a device connected to the first device.

Abstract: Measures for processing data in a packet-switched network. At a first device in the network, an echo request packet is transmitted into the network. The echo request packet comprises a predetermined identifier. An echo response packet is received from a second device in the network. In response to the received echo response packet comprising the predetermined identifier, the received echo response packet is identified as a packet generated on the basis of an echo request packet originated from the first device, and an Internet Protocol (IP) address comprised in the received echo response packet is determined to be an IP address of the second device.

Abstract: Measures for processing data in a packet-switched network. A first device is configured to snoop control packets of a predetermined control plane protocol in the network. The predetermined control plane protocol is operated by a plurality of other devices in the network to obtain Layer 2 information on the basis of known Layer 3 information. The first device does not operate the predetermined control plane protocol in the network. At the first device, in response to identifying that a given snooped packet was generated according to the predetermined control plane protocol. Layer 3 information associated with a second device in the plurality is extracted from the given snooped control plane protocol packet on the basis of known Layer 2 information associated with the second device. The second device is connected to the first device.

Abstract: Computer-implemented systems and methods are disclosed for distance and congestion-aware resource deployment. In some embodiments, a method is provided to estimate a vehicle deployment region. The method includes constructing a graph data structure using at least in part a single invocation of a form of Dijkstra's algorithm. The method additionally includes partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of the vehicle.

Abstract: Computer-implemented systems and methods are disclosed for distance and congestion-aware resource deployment. In some embodiments, a method is provided to estimate a vehicle deployment region. The method includes constructing a graph data structure using at least in part a single invocation of a form of Dijkstra's algorithm. The method additionally includes partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of the vehicle.