Please use this identifier to cite or link to this item:
logo share SHARE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

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

AuthorsRos, Lluís CSIC ORCID ; Creemers, Tom CSIC; Tourouta, Evgueni; Riera, Jordi CSIC
KeywordsConstraint logic programming
Global constraints
Transmission networks
Bandwidth packing
Path assignment
Integrated model
Control theory
Issue Date2001
Citation7th International Conference on Information Networks, Systems and Technologies: 40-47 (2001)
AbstractThis 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.
DescriptionInternational Conference on Information Networks, Systems and Technologies (ICINASTe), 2001, [s.l.]
Appears in Collections:(IRII) Comunicaciones congresos

Files in This Item:
File Description SizeFormat
doc1.pdf89,43 kBAdobe PDFThumbnail
Show full item record
Review this work

Page view(s)

checked on May 22, 2022


checked on May 22, 2022

Google ScholarTM


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.