2024-03-29T15:00:41Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/301962019-06-10T15:27:01Zcom_10261_106com_10261_4col_10261_485
http://hdl.handle.net/10261/30196
30806
A global constraint model for integrated routeing and scheduling on a transmission network
2001
comunicaciĆ³n de congreso
Ros, LluĆs
rp12383
Creemers, Tom
Tourouta, Evgueni
Riera, Jordi
Constraint logic programming
Global constraints
Transmission networks
Bandwidth packing
Path assignment
Routeing
Scheduling
Integrated model
Control theory
2001
International Conference on Information Networks, Systems and Technologies (ICINASTe), 2001, [s.l.]
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.
7th International Conference on Information Networks, Systems and Technologies
2001
40
47