A method for managing congestion in a communication network device comprising several ingress queues (IQi), each ingress queue (IQi) being dedicated to store incoming packets according to a given traffic priority (Pi), at least one egress queue adapted to receive and store traffic packets from said several ingress queues (IQi), and a control unit adapted to control either transmitting or discarding the traffic packets stored in the ingress queues (IQi), the method comprising - receiving at the network device an incoming packet of a given traffic priority (Pi), - storing said incoming packet in an corresponding ingress queue (IQi), characterized in that the method comprises performing at said control unit the following steps: receiving from said ingress queues (IQi) a first information comprising the times of arrival of said incoming packets; computing, based on said first information, a distribution function (Di) for each traffic priority (Pi) estimating a probability of arrival (PAi) versus time (t) for future packets of said priority, and determining, based on each distribution function (Di), at least one time window (wi) during which a future packet of corresponding traffic priority (Pi) is estimated to arrive; - detecting the reception of a congestion indicator from said egress queue; - on reception of both said congestion indicator and of said incoming packet, discarding the stored incoming packet if the time of arrival of the received incoming packet falls within a time window (wj) during which a packet of a traffic priority (Pj) higher than said given traffic priority (Pi) is estimated to arrive, else, transmitting the stored incoming packet to the egress queue. - receiving at the network device an incoming packet of a given traffic priority (Pi), - storing said incoming packet in an corresponding ingress queue (IQi), characterized in that the method comprises performing at said control unit the following steps: receiving from said ingress queues (IQi) a first information comprising the times of arrival of said incoming packets; computing, based on said first information, a distribution function (Di) for each traffic priority (Pi) estimating a probability of arrival (PAi) versus time (t) for future packets of said priority, and determining, based on each distribution function (Di), at least one time window (wi) during which a future packet of corresponding traffic priority (Pi) is estimated to arrive; receiving from said ingress queues (IQi) a first information comprising the times of arrival of said incoming packets; computing, based on said first information, a distribution function (Di) for each traffic priority (Pi) estimating a probability of arrival (PAi) versus time (t) for future packets of said priority, and determining, based on each distribution function (Di), at least one time window (wi) during which a future packet of corresponding traffic priority (Pi) is estimated to arrive; - detecting the reception of a congestion indicator from said egress queue; - on reception of both said congestion indicator and of said incoming packet, discarding the stored incoming packet if the time of arrival of the received incoming packet falls within a time window (wj) during which a packet of a traffic priority (Pj) higher than said given traffic priority (Pi) is estimated to arrive, else, transmitting the stored incoming packet to the egress queue.