English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Recent studies on cloud-radio access networks assume either signal-level orscheduling-level coordination. This paper considers a hybrid coordinated schemeas a means to benefit from both policies. Consider the downlink of amulti-cloud radio access network, where each cloud is connected to severalbase-stations (BSs) via high capacity links, and, therefore, allows for jointsignal processing within the cloud transmission. Across the multiple clouds,however, only scheduling-level coordination is permitted, as low levels ofbackhaul communication are feasible. The frame structure of every BS iscomposed of various time/frequency blocks, called power-zones (PZs), which aremaintained at a fixed power level. The paper addresses the problem ofmaximizing a network-wide utility by associating users to clouds and schedulingthem to the PZs, under the practical constraints that each user is scheduled toa single cloud at most, but possibly to many BSs within the cloud, and can beserved by one or more distinct PZs within the BSs' frame. The paper solves theproblem using graph theory techniques by constructing the conflict graph. Theconsidered scheduling problem is, then, shown to be equivalent to amaximum-weight independent set problem in the constructed graph, which can besolved using efficient techniques. The paper then proposes solving the problemusing both optimal and heuristic algorithms that can be implemented in adistributed fashion across the network. The proposed distributed algorithmsrely on the well-chosen structure of the constructed conflict graph utilized tosolve the maximum-weight independent set problem. Simulation results suggestthat the proposed optimal and heuristic hybrid scheduling strategies provideappreciable gain as compared to the scheduling-level coordinated networks, witha negligible degradation to signal-level coordination.

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs