Essia Hamouda

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider a path-scheduling problem at a resource constrained node A that transmits two types of flows to a given destination through alternate paths. Type-1 flow is assumed to have a higher priority than type-2 flow thus, it is never rejected upon arrival. Type-2 flow, on the other hand, may be denied admission to the queue. Once accepted to the system,(More)
  • 1