Login / Signup

Constrained max-min fair scheduling of variable-length packet-flows to multiple servers.

Jalal Khamse-AshariGeorge KesidisIoannis LambadarisBhuvan UrgaonkarYiqiang Q. Zhao
Published in: Ann. des Télécommunications (2018)
Keyphrases
  • variable length
  • max min
  • fixed length
  • min max
  • n gram
  • scheduling problem
  • hill climbing
  • linear programming
  • text classification
  • multistage
  • bitstream
  • robust optimization