Quasi-Optimal Resource Allocation in Multispot MFTDMA Satellite Networks

Alouf, Sara; Altman, Eitan; Galtier, Jérôme; Lalande, Jean-François; Touati, Corinne

doi:10.1007/0-387-29026-5_13

Cited by 9 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In satellite as well as terrestrial network traffic switching the following problem occurs [1][2][3][4][5]: N transmitting stations have to send data to N receiving stations through a switch. The switch provides a number K of simultaneous transponders/carriers, where 14K4N: The traffic is represented by an N Â N demand traffic matrix M; where entry M ij is the traffic from station i to station j: (Each station may itself generate (receive) the stated traffic or may serve as a concentrator (deconcentrator) for traffic generated by (intended for) other stations lower down the hierarchy.)…”

Section: Introductionmentioning

confidence: 99%

Improved TDM switching assignments for variable and fixed burst length

Kagaris

2006

Satell Commun Network

View full text Add to dashboard Cite

SUMMARYIn this paper we present two algorithms for improved satellite-switched TDM slot assignments of N Â N traffic matrices under K transponders/carriers (simultaneous connections), 14K4N: The first algorithm applies to data switching with variable burst length and achieves optimum transmission time with a significantly lower number of switching configurations than a previously proposed algorithm, while still having the same time complexity ðOðN 4 ÞÞ: Experimental results demonstrate the advantage. The second algorithm applies to the case of fixed burst length and offers a faster complexity of OðL Á N 2 Þ; where L is the minimum transmission time, at the cost of occasionally missing the minimum. Extensive simulations indicate that the difference from the minimum is rare and is at most one. They also show that the presented algorithm even improves a previous one which was proposed for the fixed burst length case and has the same time complexity but uses K ¼ N:

show abstract

Section: Introductionmentioning

confidence: 99%

Improved TDM switching assignments for variable and fixed burst length

Kagaris

2006

Satell Commun Network

View full text Add to dashboard Cite

show abstract

“…Observe that for the data in Table I, this constraint allows to solve the problem of the placement by sacrificing less than w (1,4) /3456 = 0.897% of the bandwidth. It might be possible to do even better than that by adopting a lower value of δ, assuming that the arrangement will still be feasible.…”

Section: Results 41mentioning

confidence: 99%

“…Due to space limitations, we will not write here the placement algorithm. The interested reader may refer to [4] for a simple version of it. We will therefore just give an example of the final stage of an algorithm working with 3 types of terminals, as seen in Fig.…”

Section: Results 41mentioning

confidence: 99%

“…Second, we have considered the fact that terminals have specific transmission's capabilities, which is translated into demands of different types of communications. In this context, our model is much more general than the ones found in the literature (refer to [4] for a survey).…”

Section: Discussionmentioning

confidence: 99%

“…We refer to the book chapter [4] for a survey. We wish to mention however that problems with similar nature but with simpler structure have also been treated in the context of scheduling in ad-hoc networks, see e.g.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites

Alouf

Altman

Galtier

et al.

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.

View full text Add to dashboard Cite

Abstract-This paper presents an algorithm for resource allocation in satellite networks1 . It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a different amount of bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses linear and integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.

show abstract

Improper coloring of unit disk graphs

2009

View full text Add to dashboard Cite

Motivated by a satellite communications problem, we consider a generalized coloring problem on unit disk graphs. A coloring is k -improper if no more than k neighbors of every vertex have the same colour as that assigned to the vertex. The k -improper chromatic number χ k (G) is the least number of colors needed in a k -improper coloring of a graph G. The main subject of this work is analyzing the complexity of computing χ k for the class of unit disk graphs and some related classes, e.g., hexagonal graphs and interval graphs. We show NP-completeness in many restricted cases and also provide both positive and negative approximability results. Because of the challenging nature of this topic, many seemingly simple questions remain: for example, it remains open to determine the complexity of computing χ k for unit interval graphs.

show abstract

Quasi-Optimal Resource Allocation in Multispot MFTDMA Satellite Networks

Cited by 9 publications

References 25 publications

Improved TDM switching assignments for variable and fixed burst length

Improved TDM switching assignments for variable and fixed burst length

Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites

Improper coloring of unit disk graphs

Contact Info

Product

Resources

About