Abstract: A network event remediation service receives event logs from network computing devices to identify issues associated with these network computing devices. Based on these issues, the service generates various tasks to address the identified issues. The service obtains historical task data in order to determine whether any tasks do not comport with historical tasks performed by the network computing devices and removing such tasks. The service obtains health data from the network computing devices to calculate device scores for each device. The service uses the device scores to prioritize the tasks for each network computing device. These tasks are then dispatched to the network computing devices.

Abstract: The following description is directed to managing routing resources of a communication network. In one example, a method can include determining an amount of routing capacity from a network device and toward a routing prefix. An attribute associated with the routing prefix can be modified based on the amount of routing capacity toward the routing prefix. The modified attribute associated with the routing prefix can be announced to a peer of the network device.

Abstract: A network event remediation service receives event logs from network computing devices to identify issues associated with these network computing devices. Based on these issues, the service generates various tasks to address the identified issues. The service obtains historical task data in order to determine whether any tasks do not comport with historical tasks performed by the network computing devices and removing such tasks. The service obtains health data from the network computing devices to calculate device scores for each device. The service uses the device scores to prioritize the tasks for each network computing device. These tasks are then dispatched to the network computing devices.

Abstract: A system for transmitting data over a network may include data processed according to a data-redundancy encoding technique such as erasure coding to be transmitted via an unreliable, connectionless transmission protocol, for example user datagram protocol (“UDP”). A transmitting manager may receive a request from an application to transmit data. The transmission manager may select encoding parameters and encode data to be transferred using a data-redundancy encoding technique. The transmission manager may initiate transmission of the encoded data and payload header data may via a network, for example via a network communication stream or protocol stack. A reconstruction manager associated with the receiving node may reconstruct the original data using the received erasure coding data and payload header data. In some embodiments, the receiving node may transmit telemetry data to the erasure coding algorithm.

Abstract: A network event remediation service receives event logs from network computing devices to identify issues associated with these network computing devices. Based on these issues, the service generates various tasks to address the identified issues. The service obtains historical task data in order to determine whether any tasks do not comport with historical tasks performed by the network computing devices and removing such tasks. The service obtains health data from the network computing devices to calculate device scores for each device. The service uses the device scores to prioritize the tasks for each network computing device. These tasks are then dispatched to the network computing devices.

Abstract: Network packet tracing may be implemented on packet processors or other devices that perform packet processing. As network packets are received, a determination may be made as to whether tracing is enabled for the network packets. For those network packets with tracing enabled, trace information may be generated and the network packets modified to include the trace information such that forwarding decisions for the network packets ignore the trace information. Trace information indicate a packet processor as a location in a route traversed by the network packets and may include ingress and egress timestamps. Forwarding decisions may then be made and the network packets sent according to the forwarding decisions. Tracing may be enabled or disabled by packet processors for individual network packets. Trace information may also be truncated at a packet processor.

Abstract: A method for adjusting capacity in a multi-stage routing network includes monitoring a number of available connections between a router in a first stage of a multi-stage router network and one or more routers in a second stage of the multi-stage router network. Each of the stages of the multi-stage router network may include a plurality of routers. The method may also include detecting that the number of available connections falls below a threshold number. A notification can be sent to one or more routers in a third stage of the multi-stage router network that the router in the first stage is deprioritized. The one or more routers in the third stage can be operated so that communications to the first stage are routed to one or more other routers in the first stage.

Abstract: Optical patch panels are disclosed. In one example, a housing module may include at least one wall arranged to present connectors for mating with optical cables. A plurality of trunk connectors may be arranged in at least one wall of the housing module, each of the trunk connectors being connectable to an optical trunk line entering the housing module. A plurality of duplex fiber connectors may be arranged in at least one wall of the housing module, the duplex fiber connectors being operable to mate with downstream networking equipment, the duplex fiber connectors being arranged in clusters, each cluster presenting a group of four pairs of duplex fiber connectors. The duplex fiber connectors in a cluster may be optically coupled to one of the plurality of trunk lines via the plurality of trunk connectors.

Abstract: Techniques and solutions for distributing routing updates using timing information are described. For example, inter-device messaging protocols can support timing information (e.g., routing protocols be extended to support timing information). The timing information can indicate a time at which the routing update is to be put into effect where the time decreases the further away a given routing device is from the source of the routing update. For example, each routing device can determine a decayed update reference time when the given routing device will put the routing update into effect according to a decay mode. Routing updates can be managed between routing devices that support timing information and routing devices that do not support timing information.

Abstract: Techniques and solutions for distributing routing updates using timing information are described. For example, inter-device messaging protocols can support timing information (e.g., routing protocols be extended to support timing information). The timing information can comprise an indication of a time at which the routing update is to be put into effect. Using the timing information, a number of routing devices can put the routing update into effect at the same time (e.g., at an update reference time) according to a synchronous mode. Routing updates can be managed between routing devices that support timing information and routing devices that do not support timing information.

Abstract: Optical patch panels are disclosed. In one example, a housing module may include at least one wall arranged to present connectors for mating with optical cables. A plurality of trunk connectors may be arranged in at least one wall of the housing module, each of the trunk connectors being connectable to an optical trunk line entering the housing module. A plurality of duplex fiber connectors may be arranged in at least one wall of the housing module, the duplex fiber connectors being operable to mate with downstream networking equipment, the duplex fiber connectors being arranged in clusters, each cluster presenting a group of four pairs of duplex fiber connectors. The duplex fiber connectors in a cluster may be optically coupled to one of the plurality of trunk lines via the plurality of trunk connectors.