Abstract: A method, processing system and processor-readable medium for generating network configurations using a graph neural network (GNN) are provided. The method may include receiving a first matrix M generated based on a set of network requirements; storing a GNN having a plurality of nodes v and a plurality of edges; initializing the GNN based on a second matrix Xv having a plurality of elements, each element corresponding to a node from a plurality of nodes v of the GNN; and generating an output matrix having a plurality of nodes labelled based on the first matrix M.

Abstract: There is provided a method and apparatus to generate temporal congestion signals. The method is used by a device and includes receiving a packet which includes a request for network state information and generating one or more temporal congestion signals. The method also including adding the temporal congestion signals to the packet and transmitting the packet including the temporal congestion signals. The temporal congestion signals can include one or more of a line busyness signal, which measures the duration of a busy period of the device, and a line idleness signal, which measures the duration of an idle period of the device.

Abstract: There is provided methods and devices for network management. A method includes receiving at least one data flow, transmitting in-band management packet periodically for each of the at least one data flow, receiving in-band acknowledgement packets for each of the at least one data flow, and producing network management data based on received in-band acknowledgement packets. A device includes a processor, and a non-transient computer readable memory having stored thereon machine executable instructions which when executed by the processor configure the device to execute the methods disclosed herein. A system includes a source node, a receiver and a data-plane device, the system configured to execute the methods disclosed herein.

Abstract: There is provided a method and apparatus to generate temporal congestion signals. The method is used by a device and includes receiving a packet which includes a request for network state information and generating one or more temporal congestion signals. The method also including adding the temporal congestion signals to the packet and transmitting the packet including the temporal congestion signals. The temporal congestion signals can include one or more of a line busyness signal, which measures the duration of a busy period of the device, and a line idleness signal, which measures the duration of an idle period of the device.

Abstract: The present disclosure describes methods and systems for proactively managing a distributed computer network based on learned relationships between state changes and network events. During an initial identification phase, information representing state changes occurring at host nodes, and network events occurring at network nodes, is collected and processed to generate a database of event probability signatures, each event probability signature indicating a respective probability that a specified event type will occur at a specified network node given a specified type of state change at one of the hosts. During a subsequent action phase, a smart network engine can interact with software drivers installed on each host node to actively monitor for state changes, and when a state change is detected, compare the type of state change with the types of state changes specified in the plurality of event probability signatures to select a matching event probability signature.

Abstract: Systems and methods are provided for scheduling the transmission of data in a datapath. A source node can send a registration request indicating its preferred sending time for data transmission. Intermediate nodes can determine if there are overlaps in timeslot reservations and adjust, and schedule, the requested preferred sending time accordingly.

Abstract: Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Abstract: Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Abstract: A method, processing system and processor-readable medium for generating network configurations using a graph neural network (GNN) are provided. The method may include receiving a first matrix M generated based on a set of network requirements; storing a GNN having a plurality of nodes v and a plurality of edges; initializing the GNN based on a second matrix Xv having a plurality of elements, each element corresponding to a node from a plurality of nodes v of the GNN; and generating an output matrix having a plurality of nodes labelled based on the first matrix M.

Abstract: There is provided methods and devices for network management. A method includes receiving at least one data flow, transmitting in-band management packet periodically for each of the at least one data flow, receiving in-band acknowledgement packets for each of the at least one data flow, and producing network management data based on received in-band acknowledgement packets. A device includes a processor, and a non-transient computer readable memory having stored thereon machine executable instructions which when executed by the processor configure the device to execute the methods disclosed herein. A system includes a source node, a receiver and a data-plane device, the system configured to execute the methods disclosed herein.

Abstract: Systems and methods are provided for scheduling the transmission of data in a datapath. A source node can send a registration request indicating its preferred sending time for data transmission. Intermediate nodes can determine if there are overlaps in timeslot reservations and adjust, and schedule, the requested preferred sending time accordingly.

Abstract: Systems and methods are provided for scheduling the transmission of CPRI traffic over Ethernet in a datapath. A source node can send a registration request indicating its preferred sending time for data transmission. Intermediate nodes can determine if there are overlaps in timeslot reservations and adjust, and schedule, the requested preferred sending time accordingly.

Abstract: Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Abstract: Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Abstract: Switch fabric in routers require tight characteristics in term of packet loss, fairness in bandwidth allocation and low latency for high-priority traffic. Such attributes have been resolved using specialized switch devices, but with the emergence of Data Center Bridging, the possibility of using commodity Ethernet switches to build switch fabric in routers is considered. Systems and methods are provided for estimating congestion associated with a network path in accordance with the variation in average delay experienced by samples of packets.

Abstract: Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Abstract: Systems and methods are provided for scheduling the transmission of CPRI traffic over Ethernet in a datapath. A source node can send a registration request indicating its preferred sending time for data transmission. Intermediate nodes can determine if there are overlaps in timeslot reservations and adjust, and schedule, the requested preferred sending time accordingly.

Abstract: Switch fabric in routers require tight characteristics in term of packet loss, fairness in bandwidth allocation and low latency for high-priority traffic. Such attributes have been resolved using specialized switch devices, but with the emergence of Data Center Bridging, the possibility of using commodity Ethernet switches to build switch fabric in routers is considered. Systems and methods are provided for estimating congestion associated with a network path in accordance with the variation in average delay experienced by samples of packets.

Abstract: Switch fabric in routers require tight characteristics in term of packet loss, fairness in bandwidth allocation and low latency for high-priority traffic. Such attributes have been resolved using specialized switch devices, but with the emergence of Data Center Bridging, the possibility of using commodity Ethernet switches to build switch fabric in routers is considered. Systems and methods are provided for adjusting a data transmission rate in accordance with an estimation of network path utilization.

Abstract: Switch fabric in routers require tight characteristics in term of packet loss, fairness in bandwidth allocation and low latency for high-priority traffic. Such attributes have been resolved using specialized switch devices, but with the emergence of Data Center Bridging, the possibility of using commodity Ethernet switches to build switch fabric in routers is considered. Systems and methods are provided for adjusting a data transmission rate in accordance with an estimation of network path utilization.