Shankar N. Neelakrishnan

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
Applications of stable matching in switch scheduling have been proposed. However, the classical GS stable matching algorithm is infeasible for high-speed implementation due to its high implementation complexity. Instead, acyclic stable matching algorithms have been shown useful in implementing scheduling for high-speed switches/routers. In this paper, we(More)
  • 1