A global constraint model for Integrated routeing and scheduling on a transmission network

Abstract

This paper presents a novel approach to planning the sending of messages along a meshed transmision network with limited bandwidth paths. The approach allows determining the topological routing of messages and a feasible time schedule satisfying three basic constraints: maximum bandwidth capacity per path, integrity of packages and maxi receiving time for each message. Constraint Logic Programming (CLP) is used to solve the combined problem o f routeing and scheduling in an integrated manner.