Abstract: Implementations disclose an access control mechanism for peer-to-peer sharing technology. A method includes receiving, by a processing device of a first user device, an encrypted media item and a wrapped key from a second user device, wherein the wrapped key comprises content masked from the first user device; transmitting, by the first user device, the wrapped key and a request to a media server to determine whether the first user device is authorized to play the encrypted media item; receiving, from the media server, a response indicating the first user device is authorized to play the encrypted media item, the response comprising a cryptographic key derived from the wrapped key; and decrypting the encrypted media item using the cryptographic key.

Abstract: Examples described herein relate to technologies for reliable packet transmission. In some examples, a network interface includes circuitry to: receive a request to transmit a packet to a destination device, select a path for the packet, provide a path identifier identifying one of multiple paths from the network interface to a destination and Path Sequence Number (PSN) for the packet, wherein the PSN is to identify a packet transmission order over the selected path, include the PSN in the packet, and transmit the packet. In some examples, if the packet is a re-transmit of a previously transmitted packet, the circuitry is to: select a path for the re-transmit packet, and set a PSN of the re-transmit packet that is a current packet transmission number for the selected path for the re-transmit packet.

Abstract: Systems and methods are provided for obtaining data to be secured based on a secret sharing technique, the data being associated with a file identifier and a split specification that includes at least a number of splits n and a minimum number of splits m required for reconstructing the data, and an RRSG scheme. An RRSG state can be initialized based at least in part on a given data transformation key to provide repeatable sequence of random bytes. For every m bytes of data: a polynomial whose coefficients are determined based at least in part on m bytes of the data and a portion of the repeatable sequence of random bytes can be determined; the polynomial can be evaluated at n unique values determined by a portion of repeatable sequence of random bytes to generate n bytes. Each byte can be stored into one of the n split stores.

Abstract: An optical parametric oscillator for producing idler coherent light and signal coherent light from pump coherent light by balanced parametric dispersion includes: substrate cladding; a microring resonator disposed on the substrate cladding and including: a broadly transparent Kerr nonlinear medium including a annulus with a radius R, a height H, and a width W that provides a balanced parametric dispersion; and that: receives pump coherent light from a waveguide; and produces idler coherent light and signal coherent light from the pump coherent light, the idler coherent light and signal coherent light produced according to the balanced parametric dispersion of the microring resonator; and the waveguide disposed on the substrate cladding in optical communication with the microring resonator and comprising a broadly transparent medium such as silicon nitride and that: receives pump coherent light; and communicates the pump coherent light to the microring resonator for production of the idler coherent light and t

Abstract: Examples described herein provide a packet ingress and egress system with a memory buffer in a network device. The ingress and egress system can generate a time stamp for one or more received packets at an ingress port, allocate a received packet to a queue among multiple queues, and permit egress of a packet from a queue. An ingress port can have one or more queues allocated to store received packets. An egress port can use the one or more queues from which to egress packets. A maximum size of a queue is set as the allocated memory region size divided by the number of ingress ports that use the allocated memory region. An egress arbiter can apply an arbitration scheme to schedule egress of packets in time stamp order.

Abstract: Examples describe a manner of scheduling packet segment fetches at a rate that is based on one or more of: a packet drop indication, packet drop rate, incast level, operation of queues in SAF or VCT mode, or fabric congestion level. Headers of packets can be fetched faster than payload or body portions of packets and processed prior to queueing of all body portions. In the event a header is identified as droppable, fetching of the associated body portions can be halted and any body portion that is queued can be discarded. Fetch overspeed can be applied for packet headers or body portions associated with packet headers that are approved for egress.

Abstract: Examples describe an egress subsystem that can be used to schedule fetching and transmission of packets from a switch fabric. Segments of a packet can be requested from a switch fabric and stored in a re-order buffer to re-order any segments that are received out of order from the switch fabric. A header segment re-order buffer can be used to re-order segments of a header. After a header of a packet is available in the header segment re-order buffer, the header can be processed before the entire associated body is received from the switch fabric. A jitter threshold scheme can gate egress of a body from a re-order buffer unless a time threshold or amount threshold is met. The egress subsystem can track a state of packet segments from request to transmission, A flow control message received at the egress subsystem can cause packets in certain states to be paused and not permitted to egress.

Abstract: Examples describe an egress port manager that uses an adaptive jitter selector to apply a jitter threshold level for a buffer, wherein the jitter threshold level is to indicate when egress of a packet segment from the buffer is allowed, wherein a packet segment comprises a packet header and wherein the jitter threshold level is adaptive based on a switch fabric load. In some examples, the jitter threshold level is to indicate a number of segments for the buffer's head of line (HOL) packet that are to be in the buffer or indicate a timer that starts at a time of issuance of a first read request for a first segment of the packet in the buffer. In some examples, the jitter threshold level is not more than a maximum transmission unit (MTU) size associated with the buffer.

Abstract: Examples are described herein that relate to a mesh in a switch fabric. The mesh can include one or more buses that permit operations (e.g., read, write, or responses) to continue in the same direction, drop off to a memory, drop off a bus to permit another operation to use the bus, or receive operations that are changing direction. A latency estimate can be determined at least for operations that drop off from a bus to permit another operation to use the bus or receive and channel operations that are changing direction. An operation with a highest latency estimate (e.g., time of traversing a mesh) can be permitted to use the bus, even causing another operation, that is not to change direction, to drop off the bus and re-enter later.

Abstract: System and method for supporting intra- and inter-subnet address resolution in a network environment using the same linear forwarding tale (LFT) for both the intra- and inter-subnet forwarding. Subnet prefix values in global route headers (GRHs) are used for linear forwarding table (LFT) lookup in a high performance computing environments. An exemplary can provide for use of an Inter Subnet Route Number (ISRN) embedded in the subnet prefix values in the GRHs for LFT lookup in a network switch environment in a high performance computing environment such as a network having an InfiniBand (IB) architecture. A method can provide, at a computer environment, including a network fabric, one or more subnets, each of which subnets are associated with one or more network switches or hosts. The system and method is compatible with legacy switches and nodes that are not conversant with the ISRNs.

Abstract: Disclosed are autonomous vehicles that may autonomously navigate at least a portion of a route defined by a service request allocator. The autonomous vehicle may, at a certain portion of the route, request remote assistance. In response to the request, an operator may provide input to a console that indicates control positions for one or more vehicle controls such as steering position, brake position, and/or accelerator position. A command is sent to the autonomous vehicle indicating how the vehicle should proceed along the route. When the vehicle reaches a location where remote assistance is no longer required, the autonomous vehicle is released from manual control and may then continue executing the route under autonomous control.

Abstract: System and method for supporting virtual machine migration in a high performance computing environment. In accordance with an embodiment, when a virtual machine migrates from a first subnet to a second subnet, a gateway port at the first subnet can, upon receiving packets addressed to the migrated virtual machine, consult a memory lookup table to discover the virtual machine's new addresses. The gateway port can update the packet accordingly. The memory lookup table can be addressed based on a GUID of the virtual machine.

Abstract: Various examples are directed to systems and methods for routing autonomous vehicles. A system may receive an indication of a roadway element associated with a routing graph for routing autonomous vehicles and may determine an impact score for the roadway element. The impact score may describe an impact of applying a routing graph modification to the routing graph to modify routing to the roadway element. Based at least in part on the impact score, the system may apply the routing graph modification to the routing graph to generate a constrained routing graph and generate a route for a first autonomous vehicle based at least in part on the constrained routing graph. The system may instruct the first autonomous vehicle to begin traversing the route.

Abstract: Methods for improving end-to-end congestion reaction using adaptive routing and congestion-hint based throttling for IP-routed datacenter networks and associated apparatus. In connection with forwarding packets between sending and receiving endpoints coupled to one or more networks, one or more network switches are configured to detect current or approaching congestion conditions, generate congestion notification packets (CNPs), and return the CNPs to sending endpoints. The CNPs may be routed using one or more adaptive routing mechanisms to forward the CNPs along non-congested paths or may be forwarded along a fastest path to a sender. The CNPs further may comprise meta-data including a flow identifier associated with a packet sent from an endpoint, a congestion level for the flow, and a timestamp.

Abstract: Examples described herein relate to an interface that is to receive data for transmission and based on indication of failure of receipt of one or more packets that carry segments of the data, cause re-transmission of solely one or more of the multiple packets that comprise a segment of the data referenced by the indication of failure of receipt of one or more packets. In some examples, the interface is to encrypt the data using an encryption engine and to segment the data for transmission using one or more packets. In some examples, the interface is to receive the data and an indication of which segment of the data to re-transmit; encrypt the data; segment the encrypted data into one or more packets; and based on the indication of which segment of the data to re-transmit, transmit solely one or more of the multiple packets that comprise a segment of the data referenced by the indication of failure of receipt of one or more packets.

Abstract: System and method for supporting shared multicast local identifiers (MLIDs) a high performance computing environment. In accordance with an embodiment, a shared MLID range can be configured such that each subnet within a fabric can utilize an MLID within a shared MLID range without the need to utilize a TCAM, or other memory, lookup of a MGID to MLID mapping.

Abstract: The present disclosure is directed to configuring and instructing autonomous vehicles. In particular, one or more computing devices can receive, from a plurality of different autonomous vehicles, data describing travel completed by the plurality of different autonomous vehicles within a geographic area. The computing device(s) can also receive data indicating one or more model parameters for the geographic area. Based at least in part on the data describing the travel and the data indicating the model parameter(s), the computing device(s) can generate one or more models indicating one or more effects of the plurality of different autonomous vehicles on a transportation market for the geographic area. Based at least in part on the model(s), the computing device(s) can generate data indicating instructions for at least one autonomous vehicle of the plurality of different autonomous vehicles and can communicate such data to the at least one autonomous vehicle.

Abstract: System and method for aggressive credit waiting in a high performance computing environment. In accordance with an embodiment, systems and methods can provide for an indexed matrix of credit wait policies between ports within a single switch. In addition, systems and methods can provide for an array of credit wait polices at an egress port from a switch, the array being indexed by virtual lane.

Abstract: System and method for using multiple global identification subnet prefix values in a network switch environment in a high performance computing environment. A packet is received from a network fabric by a first Host Channel Adapter (HCA). The packet has a header portion including a destination subnet prefix identifying a destination subnet of the network fabric. The network HCA is allowed to receive the first packet from a port of the network HCA by selectively determining a logical state of a flag and, selectively in accordance with a predetermined logical state of the flag, ignoring the destination subnet prefix identifying the destination subnet of the network fabric.

Abstract: System and method for supporting multiple concurrent SL to VL mappings in a high performance computing environment. In accordance with an embodiment, systems and methods can provide for two or more SL to VL mappings per ingress switch port in a network switched fabric. By allowing for multiple such mappings, greater virtual lane independence can be achieved while continuing to achieve quality of service guarantees.