Abstract: Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Abstract: Examples relate to routing packets based on the actual congestion sensed in the minimal and the non-minimal candidate routes between a source network device and a destination network device. A packet is received at a network device in a network and all possible minimal and non-minimal candidate routes for the packet to be routed to the destination network device are determined. An adaptive weight is assigned to the non-minimal candidate routes, wherein the adaptive weight is a function of congestion of the minimal candidate routes and the non-minimal candidate routes. An optimal route is selected among the plurality of candidate routes and the packet is routed to the destination device using the optimal route.

Abstract: Examples relate to hierarchical switching devices comprising a plurality of sub-switches forming a fully interconnected all-to-all network. The sub-switches comprise internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The internal input ports of the sub-switches have exclusive access to a queue partition for each external output port of the respective sub-switch. A switch controller receives a packet at a first sub-switch of the plurality of sub-switches that is to be routed to a particular external output port of a second sub-switch of the plurality of sub-switches. The switch controller routes the packet directly from the first sub-switch to the second sub-switch using an internal output port of the first sub-switch and a queue partition of the second sub-switch that is for the particular external output port of the second sub-switch.

Abstract: Example implementations relate to congestion management across a network fabric. An example implementation includes setting an uncongested sequence length threshold to a first value. A completed transaction received count may also be set to an initial value. The completed transaction received count may be incremented in response to a completion of a transaction request. In response to a detected congestion event, the injection rate may be decreased. A second value for the uncongested sequence length threshold may be determined from the CTR count, and the uncongested sequence length threshold may be set to the second value. Furthermore, in response to the CTR count being greater than or equal to the uncongested sequence length threshold, the injection rate may be increased.

Abstract: Examples relate to routing packets in dimensional order in multidimensional networks. A packet is received at a network device in a fully connected multidimensional network and all possible candidate output ports for the packet to be routed to the destination network device with a dimensional order are determined. The candidate output ports correspond to candidate minimal paths and candidate non-minimal paths between the network device and the destination network device. An optimal output port among all the candidate output ports is selected and the packet is routed to a next hop of the network though the optimal output port using a first resource class when the optimal output port corresponds to a candidate minimal path and a second resource class when the optimal output port corresponds to a candidate non-minimal path.

Abstract: Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Abstract: Example implementations relate to calculating a time to live (TTL). An example implementation includes receiving a transaction request containing a first time to live (TTL) from a requester. A second TTL for a transaction response may be computed, and a transaction response containing the second TTL may be transmitted.

Abstract: A system for use by cabin crew on board an aircraft, comprising a server including a database, the server being at a location remote from the aircraft. The server selectively communicates with a plurality of systems external to the system to retrieve information related to a journey to be made by the aircraft. The server runs an application for communicating with the external systems to send and receive data to and from the server. A portable computing device such as a tablet computer on board the aircraft has a database for receipt and storage of flight related information received from the server, the flight related information including seating information and other passenger related information. The portable device runs an application for real-time communication with the server during a flight or after the flight, for exchange with the server of at least one of seating and passenger related information.

Abstract: Examples relate to routing packets based on the actual congestion sensed in the minimal and the non-minimal candidate routes between a source network device and a destination network device. A packet is received at a network device in a network and all possible minimal and non-minimal candidate routes for the packet to be routed to the destination network device are determined. An adaptive weight is assigned to the non-minimal candidate routes, wherein the adaptive weight is a function of congestion of the minimal candidate routes and the non-minimal candidate routes. An optimal route is selected among the plurality of candidate routes and the packet is routed to the destination device using the optimal route.

Abstract: Examples relate to routing packets using distance classes in multidimensional networks. A packet is received at a network device in a fully connected multidimensional network and all possible candidate output ports for the packet to be routed to the destination network device are determined. The candidate output ports correspond to candidate minimal paths and candidate non-minimal paths between the network device and the destination network device along all remaining unaligned dimensions of the multidimensional network. An optimal output port among all the candidate output ports is selected and the packet is routed to a next hop in the network though the optimal output port and using a next distance class.

Abstract: Examples relate to routing packets in dimensional order in multidimensional networks. A packet is received at a network device in a fully connected multidimensional network and all possible candidate output ports for the packet to be routed to the destination network device with a dimensional order are determined. The candidate output ports correspond to candidate minimal paths and candidate non-minimal paths between the network device and the destination network device. An optimal output port among all the candidate output ports is selected and the packet is routed to a next hop of the network though the optimal output port using a first resource class when the optimal output port corresponds to a candidate minimal path and a second resource class when the optimal output port corresponds to a candidate non-minimal path.

Abstract: Example implementations relate to calculating a time to live (TTL). An example implementation includes receiving a transaction request containing a first time to live (TTL) from a requester. A second TTL for a transaction response may be computed, and a transaction response containing the second TTL may be transmitted.

Abstract: Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Abstract: Examples relate to routing packets considering the propagation delay of candidate routes in a network. A packet is received at a network device in a network and a plurality of weighted candidate routes for the packet to be received at a destination device are determined. Each candidate route is associated to a weight based on a propagation delay of the candidate route. An optimal route is selected among the plurality of weighted candidate routes and the packet is routed to the destination device using the optimal route.

Abstract: Disclosed are methods and systems for authenticating a key exchange between a first peer device and a second peer device. In an aspect, the first peer device sends federated login credentials of a user and a first identifier to a first federated login provider, receives a first authentication response from the first federated login provider, receives a second authentication response from the second peer device, authenticates the second authentication response with a second federated login provider, sends the first authentication response to the second peer device, receives an acknowledgment from the second peer device indicating that the second peer device has authenticated the first authentication response with the federated login provider, sends an acknowledgment to the second peer device indicating that the first peer device has authenticated the second authentication response, and authenticates the key exchange based on the acknowledgment from the second peer device.

Abstract: Examples disclosed herein relate to receiving, by a scheduler, a request for a window during which to send a data packet through a crossbar. Transmission of the data packet is dependent upon a pool of transmission credits. The scheduler determines whether the pool of transmission credits is sufficient for transmitting the data packet, and when it is determined that the pool of transmission credits is insufficient, the scheduler determines whether to block the request or to speculatively arbitrate the window based on a value of a speculative request counter.

Abstract: Methods of delivering corticosteroids or metabolites thereof for treating and preventing tissue damage resulting from acute radiation injury in the gastrointestinal tract with locally effective therapeutic agents.

Abstract: The present invention features methods of delivering corticosteroids or metabolites thereof for treating inflammatory conditions otherwise difficult to cure with topical administration.

Abstract: The present invention features methods of delivering corticosteroids or metabolites thereof for treating inflammatory conditions otherwise difficult to cure with topical administration.

Abstract: A remote station is configured with a certificate from a local root certificate authority for securing a wireless network. To configure the certificate, the remote station forwards a station public key to the local root certificate authority. The station public key is forwarded out-of-band of the wireless network. The remote station receives a certificate and a root public key from the local root certificate authority. The certificate is generated by the local root certificate authority based on the forwarded station public key, and the certificate and the root public key are received out-of-band of the wireless network. The remote station securely communicates, using the wireless network, with another station based on the certificate and the root public key.