Results 1-3 of 3.
((uid:50046859))

Bookmark and Share    
Full Text
Peer Reviewed
See detailCombining Time-Flexible Satellite Payload with Precoding: The Cluster Hopping Approach
Gupta, Vaibhav Kumar UL; Ha, Vu Nguyen UL; Lagunas, Eva UL et al

in IEEE Transactions on Vehicular Technology (2022)

High throughput geostationary (GEO) satellite systems are characterized by a multi-beam wide coverage. However, developing efficient resource management mechanisms to meet the heterogeneous user traffic ... [more ▼]

High throughput geostationary (GEO) satellite systems are characterized by a multi-beam wide coverage. However, developing efficient resource management mechanisms to meet the heterogeneous user traffic demands remains an open challenge for satellite operators. Furthermore, the spectrum shortage and the ever increasing demands claim for more aggressive frequency reuse. In this paper, we combine the time-flexible payload capabilities known as beam hopping (BH) with precoding techniques in order to satisfy user traffic requests in areas of high demand (i.e. hot-spot areas). The proposed framework considers a flexible beam-cluster hopping where adjacent beams can be activated if needed, forming clusters with various shapes and sizes. In this context, we present three strategies to design the beam illumination patterns. First, a max-min user demand fairness satisfaction problem; second, a penalty-based optimization is considered to penalize the occurrence of adjacent beams in an attempt to avoid precoding whenever possible. Third, seeking a low-complexity design, we propose a queuing-based approach to solve the problem in a time-slot by time-slot basis trying to provide service to users based on the requested demands. The three methods are discussed in detailed and evaluated via numerical simulations, confirming their effectiveness versus benchmark schemes and identifying the pros and cons of each proposed design. [less ▲]

Detailed reference viewed: 61 (12 UL)
Full Text
Peer Reviewed
See detailFair Coflow Scheduling via Controlled Slowdown
De pellegrini, Francesco; Gupta, Vaibhav Kumar UL; El Azouzi, Rachid et al

in IEEE Transactions on Parallel and Distributed Systems (2022)

The average coflow completion time (CCT) is the standard performance metric in coflow scheduling. However, standard CCT minimization may introduce unfairness between the data transfer phase of different ... [more ▼]

The average coflow completion time (CCT) is the standard performance metric in coflow scheduling. However, standard CCT minimization may introduce unfairness between the data transfer phase of different computing jobs. Thus, while progress guarantees have been introduced in the literature to mitigate this fairness issue, the trade-off between fairness and efficiency of data transfer is hard to control. This paper introduces a fairness framework for coflow scheduling based on the concept of slowdown, i.e., the performance loss of a coflow compared to isolation. By controlling the slowdown it is possible to enforce a target coflow progress while minimizing the average CCT. In the proposed framework, the minimum slowdown for a batch of coflows can be determined in polynomial time. By showing the equivalence with Gaussian elimination, slowdown constraints are introduced into primal-dual iterations of the CoFair algorithm. The algorithm extends the class of the σ-order schedulers to solve the fair coflow scheduling problem in polynomial time. It provides a 4-approximation of the average CCT w.r.t. an optimal scheduler. Extensive numerical results demonstrate that this approach can trade off average CCT for slowdown more efficiently than existing state of the art schedulers. [less ▲]

Detailed reference viewed: 18 (4 UL)