(44–45) Requests for binding decisions on the descriptive statements associated with <i>Thea dormoyana</i> and <i>T. piquetiana</i>

Zhao, Dongwei; Parnell, John A. N.; Dubéarnès, Anne

doi:10.12705/655.29

Cited by 5 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zeng et al [17] utilize primal-dual decomposition to translate the joint problem into bi-problems, and design an approximation algorithm to solve each sub-problem. Zhao et al [18] highlight the cost of forwarding requests and downloading services in a homogeneous edge-cloud setting where all services consume the same amount of storage capacity and only resides in one edge node. However, those algorithms [16]- [18] provide unsatisfactory competitive ratios.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Zhao et al [18] highlight the cost of forwarding requests and downloading services in a homogeneous edge-cloud setting where all services consume the same amount of storage capacity and only resides in one edge node. However, those algorithms [16]- [18] provide unsatisfactory competitive ratios.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Heuristic algorithms without provable performance guarantee are proposed in [13]- [15]. Among those algorithms with theoretical approximation guarantees [16]- [18], the performances are usually unsatisfactory.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Online Service Placement and Request Scheduling in MEC Networks

Su¹,

Wang²,

Zhou³

et al. 2021

Preprint

View full text Add to dashboard Cite

Mobile edge computing (MEC) emerges as a promising solution for servicing delay-sensitive tasks at the edge network. A body of recent literature started to focus on cost-efficient service placement and request scheduling. This work investigates the joint optimization of service placement and request scheduling in a dense MEC network, and develops an efficient online algorithm that achieves closeto-optimal performance. Our online algorithm consists of two basic modules: (1) a regularization with look-ahead approach from competitive online convex optimization, for decomposing the offline relaxed minimization problem into multiple sub-problems, each of which can be efficiently solved in each time slot; (2) a randomized rounding method to transform the fractional solution of offline relaxed problem into integer solution of the original minimization problem, guaranteeing a low competitive ratio. Both theoretical analysis and simulation studies corroborate the efficacy of our proposed online MEC optimization algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Online Service Placement and Request Scheduling in MEC Networks

Su¹,

Wang²,

Zhou³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Existing work has extensively studied opportunistic computation offloading, which is often jointly optimized with system computation and communication resource allocation [4]- [8]. Only recently has service caching started to attract research interests [10]- [15]. For a single-server MEC system, [10] proposed an online algorithm to dynamically schedule the cached services without the knowledge of task arrival patterns.…”

Section: A Related Workmentioning

confidence: 99%

“…For the uncached service programs, the edge server is unable to provide the real-time computation services to the corresponding WDs' online applications. This is referred to as service caching [10]- [15].…”

Section: Introductionmentioning

confidence: 99%

Pricing-Driven Service Caching and Task Offloading in Mobile Edge Computing

Jia

Duan

et al. 2020

Preprint

View full text Add to dashboard Cite

Provided with mobile edge computing (MEC) services, wireless devices (WDs) no longer have to experience long latency in running their desired programs locally, but can pay to offload computation tasks to the edge server. Given its limited storage space, it is important for the edge server at the base station (BS) to determine which service programs to cache by meeting and guiding WDs' offloading decisions. In this paper, we propose an MEC service pricing scheme to coordinate with the service caching decisions and control WDs' task offloading behavior in a cellular network. We propose a twostage dynamic game of incomplete information to model and analyze the two-stage interaction between the BS and multiple associated WDs. Specifically, in Stage I, the BS determines the MEC service caching and announces the service program prices to the WDs, with the objective to maximize its expected profit under both storage and computation resource constraints. In Stage II, given the prices of different service programs, each WD selfishly decides its offloading decision to minimize individual service delay and cost, without knowing the other WDs' desired program types or local execution delays. Despite the lack of WD's information and the coupling of all the WDs' offloading decisions, we derive the optimal threshold-based offloading policy that can be easily adopted by the WDs in Stage II at the Bayesian equilibrium. In particular, a WD is more likely to offload when there are fewer WDs competing for the edge server's computation resource, or when it perceives a good channel condition or low MEC service price. Then, by predicting the WDs' offloading equilibrium, we jointly optimize the BS' pricing and service caching in Stage I via a low-complexity algorithm. In particular, we study both the uniform and differentiated pricing schemes. For differentiated pricing, we prove that the same price should be charged to the cached programs of the same workload.

show abstract

Phylogenetics of global Camellia (Theaceae) based on three nuclear regions and its implications for systematics and evolutionary history

Zhao

Hodkinson

Parnell

2022

J of Sytematics Evolution

Self Cite

View full text Add to dashboard Cite

Camellia contains tea, oil camellia, and camellias which benefit people globally. Its infrageneric classification is, however, controversial and unstable, and former phylogenetic analyses failed to yield robust and consistent trees. Here, we aimed to reconstruct a robust phylogenetic tree, date all clades and discuss the evolutionary history of Camellia. Emphasizing the taxonomically comprehensive sampling rather than more DNA data, orthologous nuclear RPB2 introns 11-15 and 23, and waxy were sequenced for 99 taxa of Camellia to reconstruct its phylogenetic history. Ten clades are identified in Camellia: Camellia II, Camelliopsis, Corallina, Furfuracea, Heterogenea, Paracamellia, Piquetia, Stereocarpus, Thea and Yellow camellias II. Camellia grijsii and C. shensiensis are not closely related with other oil camellias that form the clade Paracamellia. Sections Camelliopsis and Theopsis together form the clade Camelliopsis, while clade Furfuracea consists of sect. Furfuracea and C. hongkongensis. Camellia connata is separated from C. lanceolata but nested in the clade Heterogenea, and C. longissima is nested in the clade Thea, suggesting a new germplasm for tea breeding. Molecular dating using four fossil calibration points suggests that the crown age of Camellia is 39.5 Ma with clade Corallina probably the earliest infrageneric clade to diversify and the most widespread clade, Paracamellia, the latest. Our findings provide new insights into the phylogenetic relationships, systematics and evolutionary history of Camellia.

show abstract

(44–45) Requests for binding decisions on the descriptive statements associated with Thea dormoyana and T. piquetiana

Cited by 5 publications

References 0 publications

Online Service Placement and Request Scheduling in MEC Networks

Online Service Placement and Request Scheduling in MEC Networks

Pricing-Driven Service Caching and Task Offloading in Mobile Edge Computing

Phylogenetics of global Camellia (Theaceae) based on three nuclear regions and its implications for systematics and evolutionary history

Contact Info

Product

Resources

About