CaltechAUTHORS
  A Caltech Library Service

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

Douik, Ahmed and Dahrouj, Hayssam and Al-Naffouri, Tareq Y. and Alouini, Mohamed-Slim (2018) Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs. IEEE Transactions on Communications, 66 (1). pp. 209-224. ISSN 0090-6778. https://resolver.caltech.edu/CaltechAUTHORS:20170914-083027237

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170914-083027237

Abstract

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://dx.doi.org/10.1109/TCOMM.2017.2749573DOIArticle
http://ieeexplore.ieee.org/document/8027131/PublisherArticle
ORCID:
AuthorORCID
Douik, Ahmed0000-0001-7791-9443
Dahrouj, Hayssam0000-0002-0737-6372
Additional Information:© 2017 IEEE. A part of this paper [1] is published in IEEE Global Telecommunications Conference (GLOBECOM’ 2015), San Diego, CA, USA., for funding the research reported in this paper through the Research and Consultancy Institute. Manuscript received October 17, 2016, revised March 14, 2017 and July 27, 2017; accepted August 24, 2017. Date of publication September 7, 2017; date of current version January 13, 2018. This paper was presented at the IEEE Global Telecommunications Conference (GLOBECOM’ 2015), San Diego, CA, USA. H. Dahrouj would like to thank Effat University, Jeddah, Saudi Arabia, for funding the research reported in this paper through the Research and Consultancy Institute. The associate editor coordinating the review of this paper and approving it for publication was D. Wu. (Corresponding author: Ahmed Douik.)
Funders:
Funding AgencyGrant Number
Research and Consultancy InstituteUNSPECIFIED
Subject Keywords:Multi-cloud networks, coordinated scheduling, scheduling-level coordination, signal-level coordination, centralized and distributed scheduling
Issue or Number:1
Record Number:CaltechAUTHORS:20170914-083027237
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170914-083027237
Official Citation:A. Douik, H. Dahrouj, T. Y. Al-Naffouri and M. S. Alouini, "Distributed Hybrid Scheduling in Multi-Cloud Networks Using Conflict Graphs," in IEEE Transactions on Communications, vol. 66, no. 1, pp. 209-224, Jan. 2018. doi: 10.1109/TCOMM.2017.2749573
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81435
Collection:CaltechAUTHORS
Deposited By: Ruth Sustaita
Deposited On:14 Sep 2017 17:57
Last Modified:03 Oct 2019 18:42

Repository Staff Only: item control page