Moulin Herv

Herv Moulin

Information about the author Herv Moulin will soon be added to the site.
Found 5 papers in total
Sharing the cost of a capacity network
Sharing the cost of a capacity network
2010
We consider a communication network where each pair of users requests a connection...
On scheduling fees to prevent merging, splitting, and transferring of jobs
On scheduling fees to prevent merging, splitting, and transferring of jobs
2007
A deterministic server is shared by users with identical linear waiting costs,...
Minimizing the worst slowdown: offline, online
Minimizing the worst slowdown: offline, online
2007
We look for protocols (service disciplines) setting an upper bound on the slowdown...
Fair queuing and other probabilistic allocation methods
Fair queuing and other probabilistic allocation methods
2002
A server processes one job per unit of time and randomly schedules the jobs requested...
Scheduling with opting out: Improving upon random priority
Scheduling with opting out: Improving upon random priority
2001
In a scheduling problem where agents can opt out, we show that the familiar random...
Papers per page: