Publication

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

Conference Article

Conference

International Conference on Information Networks, Systems and Technologies (ICINASTe)

Edition

Pages

40-47

Doc link

http://ccuc.cbuc.cat/search*cat/i?SEARCH=9854266923&sortdropdown=-&searchscope=23

File

Download the digital copy of the doc pdf document

Abstract

This paper presents a novel approach to planning the sending of messages along a meshed transmission network with limited bandwidth paths. The approach allows determining the topological route-ing of messages and a feasible time schedule satisfying three basic constraints: maximum bandwidth capacity per path, integrity of packages and maximum receiving time for each message. Constraint Logic Programming (CLP) is used to solve the combined problem of routeing and scheduling in an integrated mariner. To this end, a finite-domain model with global constraints has been derived for a generic transmission network. The model implementation, in the CLP language CHIP, is explained in detail. An implementation has been run on extensive test cases, showing the efficiency of this approach.

Categories

control theory.

Author keywords

constraint logic programming, global constraints, transmission networks, bandwidth packing, path assignment, routeing, scheduling, integrated model

Scientific reference

L. Ros, T. Creemers, E. Tourouta and J. Riera. A global constraint model for integrated routeing and scheduling on a transmission network, 7è International Conference on Information Networks, Systems and Technologies, 2001, , pp. 40-47.