The ring loading problem with integer demand splitting is that of routing kappa traffic requirements on an undirected ring network. We present a compact polyhedral description of the set of feasible solutions to the problem, whose number of variables and constraints is O(kappa). (C) 2009 Elsevier B.V. All rights reserved.