loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jean-Thomas Camino 1 ; Christian Artigues 2 ; Laurent Houssin 2 and Stéphane Mourgues 3

Affiliations: 1 Airbus Defence and Space, Space Systems, CNRS, LAAS and Univ de Toulouse, France ; 2 CNRS, LAAS and Univ de Toulouse, France ; 3 Univ de Toulouse, France

ISBN: 978-989-758-075-8

Keyword(s): Frequency Assignment, Multiprocessor Scheduling, Path Cover, Linear Programming, Constraint Programming, Maximal Cliques Enumeration.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Linear Programming ; Methodologies and Technologies ; Operational Research ; Optimization ; OR in Telecommunications ; Pattern Recognition ; Resource Allocation ; Software Engineering ; Symbolic Systems

Abstract: To comply with the continually growing demand for multimedia content and higher throughputs, the telecom- munication industry has to keep improving the use of the bandwidth resources, leading to the well-known Frequency Assignment Problems (FAP). In this article, we present a new extension of these problems to the case of satellite systems that use a multibeam coverage. With the models we propose, we make sure that for each frequency plan produced there exists a corresponding satellite payload architecture that is cost-efficient and decently complex. Two approaches are presented and compared : a global constraint program that handles all the constraints simultaneously, and a decomposition method that involves both constraint programming and integer linear programming. For the latter approach, we show that the two identified subproblems can re- spectively be modeled as a multiprocessor scheduling problem and a path-covering problem, and this analogy is used to prove that they both belo ng to the category of NP-hard problems. We also show that, for the most common class of interference graphs in multibeam satellite systems, the maximal cliques can all be enumer- ated in polynomial time and their number is relatively low, therefore it is perfectly acceptable to rely on them in the scheduling model that we derived. Our experiments on realistic scenarios show that the decomposition method proposed can indeed provide a solution of the problem when the global CP model does not. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.201.121.213

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Camino, J.; Camino, J.; Artigues, C.; Houssin, L. and Mourgues, S. (2015). A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems .In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 23-33. DOI: 10.5220/0005218700230033

@conference{icores15,
author={Jean{-}Thomas Camino. and Jean{-}Thomas Camino. and Christian Artigues. and Laurent Houssin. and Stéphane Mourgues.},
title={A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems },
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={23-33},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005218700230033},
isbn={978-989-758-075-8},
}

TY - CONF

JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems
SN - 978-989-758-075-8
AU - Camino, J.
AU - Camino, J.
AU - Artigues, C.
AU - Houssin, L.
AU - Mourgues, S.
PY - 2015
SP - 23
EP - 33
DO - 10.5220/0005218700230033

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.