MODIFICATIONS OF THE TOPOLOGY OF A TIME-SENSITIVE NETWORK TO ALLOW AN EFFECTIVE SCHEDULING

    公开(公告)号:EP4440072A1

    公开(公告)日:2024-10-02

    申请号:EP23305435.2

    申请日:2023-03-29

    摘要: The invention relates to a computer-implemented method comprising: obtaining: a topology of a deterministic Ethernet network; and a set of critical streams to instantiate in the network, each critical stream being defined by at least a path, a period, a maximum allowed end-to-end latency, a set of packets, each packet being associated to a size ; generating, from said set of critical streams, a SMT instance comprising formulas that express the constraints that must be complied with by the transmissions of the packets of the streams, and variables defining the configuration of the network ; executing a SMT solver to solve the SMT instance and obtain values of said variables defining the configuration of the network that satisfies the set of formulas ; if the execution of the SMT solver is not successful, defining at least one modification of the topology of the network based on an analysis of an unsatisfiable core of the SMT instance returned by the SMT solver.

    TIME SENSITIVE NETWORK SCHEDULING USING STREAM TRANFORMATIONS

    公开(公告)号:EP4440071A1

    公开(公告)日:2024-10-02

    申请号:EP23305434.5

    申请日:2023-03-29

    摘要: The invention relates to a computer-implemented method comprising: obtaining: a topology of a deterministic Ethernet network; and a set of critical streams to instantiate in the network, each critical stream being defined by at least a path, a period, a maximum allowed end-to-end latency, a set of packets, each packet being associated to a size ; estimating a plurality of numbers of constraints implied respectively by a plurality of sets of stream transformations of said set of critical streams, each stream transformation modifying a stream while preserving or increasing a bitrate between a sender and one or more receiver nodes of the stream ; selecting a set of stream transformations based on said plurality of numbers of constraints ; applying said selected set of stream transformations to obtain a transformed set of critical streams ; generating, from said transformed set of critical streams, an Automated Theorem Proving "ATP" problem comprising formulas that express the constraints that must be complied with by the transmissions of the packets of the streams, and variables defining the configuration of the network ; executing an ATP prover to solve the ATP problem and obtain values of said variables defining the configuration of the network that satisfies the set of formulas ; if the execution of the ATP prover is successful, configuring the network according to said obtained values defining the configuration of the network.