Abstract: Visualizing event impact risk over time. At least one location of interest is identified on a geospatial map, and an event path is plotted on the geospatial map for an event over time. The event path includes actual and/or forecasted paths of the event. Along the event path, connected geospatial polygons are generated. The geospatial polygons represent actual and/or forecasted intensity of the event over time. A determination is made as to whether the connected geospatial polygons intersect one or more of the locations of interest indicating an impact risk for the event. Action are taken to reduce the impact risk for the location of interest.

Abstract: Visualizing event impact risk over time. At least one location of interest is identified on a geospatial map, and an event path is plotted on the geospatial map for an event over time. The event path includes actual and/or forecasted paths of the event. Along the event path, connected geospatial polygons are generated. The geospatial polygons represent actual and/or forecasted intensity of the event over time. A determination is made as to whether the connected geospatial polygons intersect one or more of the locations of interest indicating an impact risk for the event. Action are taken to reduce the impact risk for the location of interest.

Abstract: A method and system for reducing arbitration latency employs speculative transmission (STX) without prior arbitration in combination with routing fabric scheduled arbitration. Packets are sent from source locations to a routing fabric through scheduled arbitration, and also through speculative arbitration, to non-contentiously allocate outputs that were not previously reserved in the routing fabric to the speculatively transmitted packets.

Abstract: A method and a system for controlling a plurality of queues of an input port in a switching or routing system. The method supports the regular request-grant protocol along with speculative transmission requests in an integrated fashion. Each regular scheduling request or speculative transmission request is stored in request order using references to minimize memory usage and operation count. Data packet arrival and speculation event triggers can be processed concurrently to reduce operation count and latency. The method supports data packet priorities using a unified linked list for request storage. A descriptor cache is used to hide linked list processing latency and allow central scheduler response processing with reduced latency. The method further comprises processing a grant of a scheduling request, an acknowledgement of a speculation request or a negative acknowledgement of a speculation request. Grants and speculation responses can be processed concurrently to reduce operation count and latency.

Abstract: A method and system for reducing arbitration latency employs speculative transmission (STX) without prior arbitration in combination with routing fabric scheduled arbitration. Packets are sent from source locations to a routing fabric through scheduled arbitration, and also through speculative arbitration, to non-contentiously allocate outputs that were not previously reserved in the routing fabric to the speculatively transmitted packets.