scholarly journals Product-Form Solutions for Integrated Services Packet Networks and Cloud Computing Systems

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Wanyang Dai
Keyword(s):  
Cloud Computing ◽  
Queueing Networks ◽  
Large Scale ◽  
Stochastic Dynamics ◽  
Queueing Systems ◽  
Product Form ◽  
Backbone Networks ◽  
Iterative Solutions ◽  
Computing Centers ◽  
Local Edge

We iteratively derive the product-form solutions of stationary distributions for a type of preemptive priority multiclass queueing networks with multiserver stations. This type of queueing systems can typically be used to model the stochastic dynamics of some large scale backbone networks with multiprocessor shared-memory switches or local (edge) cloud computing centers with parallel-server pools. The queueing networks are Markovian with exponential interarrival and service time distributions. The obtained iterative solutions can be used to conduct performance analysis or as comparison criteria for approximation and simulation studies. Numerical comparisons with existing Brownian approximating model (BAM) related to general interarrival and service times are provided to show the effectiveness of our current designed algorithm and our previous derived BAM. Furthermore, based on the iterative solutions, we can also give some analysis concerning network stability for some cases of these queueing systems, which provides some insight for more general study.

Stability of Product Form G-Networks

1992 ◽  
Vol 6 (3) ◽  
pp. 271-276 ◽  
Author(s):  
Erol Gelenbe ◽  
Rolf Schassberger
Keyword(s):  
Fixed Point ◽  
Queueing Networks ◽  
Existence And Uniqueness ◽  
Queueing Systems ◽  
Sufficient Conditions ◽  
Product Form ◽  
Load Factor ◽  
Flow Equations ◽  
General Stability ◽  
Necessary And Sufficient

We prove necessary and sufficient conditions for the existence and uniqueness of the stationary solution of the queueing networks (G-networks) with negative and positive customers introduced in Gelenbe [3], which have been shown to have product form. First, the existence of the solution of the nonlinear customer flow equations is established using Brouwer's fixed-point theorem; this result is valid for stable and unstable systems, as well as for certain networks that may not have product form. Then, the result is used to establish general stability related to the usual “load factor less than 1” criterion of queueing systems for G-networks with product form.

Public cloud computing for seismological research: Calculating large-scale noise cross-correlations using ALIYUN

2018 ◽  
Vol 31 (5-6) ◽  
pp. 227-233
Author(s):  
Weitao Wang ◽  
◽  
Baoshan Wang ◽  
Xiufen Zheng ◽  
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Public Cloud ◽  
Cross Correlations

State-dependent signalling in queueing networks

1994 ◽  
Vol 26 (02) ◽  
pp. 436-455 ◽  
Author(s):  
W. Henderson ◽  
B. S. Northcote ◽  
P. G. Taylor
Keyword(s):  
Queueing Networks ◽  
State Dependence ◽  
Product Form ◽  
Batch Size ◽  
Single Server ◽  
Negative Customers ◽  
Affect Control ◽  
State Dependent ◽  
Special Cases ◽  
Equilibrium Distributions

It has recently been shown that networks of queues with state-dependent movement of negative customers, and with state-independent triggering of customer movement have product-form equilibrium distributions. Triggers and negative customers are entities which, when arriving to a queue, force a single customer to be routed through the network or leave the network respectively. They are ‘signals' which affect/control network behaviour. The provision of state-dependent intensities introduces queues other than single-server queues into the network. This paper considers networks with state-dependent intensities in which signals can be either a trigger or a batch of negative customers (the batch size being determined by an arbitrary probability distribution). It is shown that such networks still have a product-form equilibrium distribution. Natural methods for state space truncation and for the inclusion of multiple customer types in the network can be viewed as special cases of this state dependence. A further generalisation allows for the possibility of signals building up at nodes.

Predicting Node Failures in an Ultra-Large-Scale Cloud Computing Platform

2020 ◽  
Vol 29 (2) ◽  
pp. 1-24
Author(s):  
Yangguang Li ◽  
Zhen Ming (Jack) Jiang ◽  
Heng Li ◽  
Ahmed E. Hassan ◽  
Cheng He ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Computing Platform ◽  
Cloud Computing Platform ◽  
Node Failures

scholarly journals Zero Queueing for Multi-Server Jobs

2021 ◽  
Vol 5 (1) ◽  
pp. 1-25
Author(s):  
Weina Wang ◽  
Qiaomin Xie ◽  
Mor Harchol-Balter
Keyword(s):  
Cloud Computing ◽  
Stability Region ◽  
Transient Analysis ◽  
Queueing Systems ◽  
Sufficient Conditions ◽  
Hard Problem ◽  
Queueing Model ◽  
Multiple Servers ◽  
First Results ◽  
Multi Server

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.

scholarly journals Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos
Keyword(s):  
Social Networks ◽  
Graph Partitioning ◽  
Large Scale ◽  
Real Life ◽  
Information Networks ◽  
Digital Marketing ◽  
Partitioning Problems ◽  
Iterative Solutions ◽  
Community Extraction ◽  
Stability And Accuracy

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

scholarly journals A Parallel Unmixing-Based Content Retrieval System for Distributed Hyperspectral Imagery Repository on Cloud Computing Platforms

2021 ◽  
Vol 13 (2) ◽  
pp. 176
Author(s):  
Peng Zheng ◽  
Zebin Wu ◽  
Jin Sun ◽  
Yi Zhang ◽  
Yaoqin Zhu ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Retrieval System ◽  
Hyperspectral Image ◽  
Parallel Implementation ◽  
Remotely Sensed Data ◽  
Web Interfaces ◽  
Content Retrieval ◽  
Service Mode ◽  
Computing Platforms

As the volume of remotely sensed data grows significantly, content-based image retrieval (CBIR) becomes increasingly important, especially for cloud computing platforms that facilitate processing and storing big data in a parallel and distributed way. This paper proposes a novel parallel CBIR system for hyperspectral image (HSI) repository on cloud computing platforms under the guide of unmixed spectral information, i.e., endmembers and their associated fractional abundances, to retrieve hyperspectral scenes. However, existing unmixing methods would suffer extremely high computational burden when extracting meta-data from large-scale HSI data. To address this limitation, we implement a distributed and parallel unmixing method that operates on cloud computing platforms in parallel for accelerating the unmixing processing flow. In addition, we implement a global standard distributed HSI repository equipped with a large spectral library in a software-as-a-service mode, providing users with HSI storage, management, and retrieval services through web interfaces. Furthermore, the parallel implementation of unmixing processing is incorporated into the CBIR system to establish the parallel unmixing-based content retrieval system. The performance of our proposed parallel CBIR system was verified in terms of both unmixing efficiency and accuracy.

scholarly journals Cloud-based intelligent self-diagnosis and department recommendation service using Chinese medical BERT

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Junshu Wang ◽  
Guoming Zhang ◽  
Wei Wang ◽  
Ka Zhang ◽  
Yehua Sheng
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Medical Service ◽  
Rapid Development ◽  
Medical Knowledge ◽  
Language Models ◽  
Computing Environment ◽  
Computing Power ◽  
Cloud Computing Environment ◽  
Proposed Model

AbstractWith the rapid development of hospital informatization and Internet medical service in recent years, most hospitals have launched online hospital appointment registration systems to remove patient queues and improve the efficiency of medical services. However, most of the patients lack professional medical knowledge and have no idea of how to choose department when registering. To instruct the patients to seek medical care and register effectively, we proposed CIDRS, an intelligent self-diagnosis and department recommendation framework based on Chinese medical Bidirectional Encoder Representations from Transformers (BERT) in the cloud computing environment. We also established a Chinese BERT model (CHMBERT) trained on a large-scale Chinese medical text corpus. This model was used to optimize self-diagnosis and department recommendation tasks. To solve the limited computing power of terminals, we deployed the proposed framework in a cloud computing environment based on container and micro-service technologies. Real-world medical datasets from hospitals were used in the experiments, and results showed that the proposed model was superior to the traditional deep learning models and other pre-trained language models in terms of performance.

Sign in / Sign up

Export Citation Format

Share Document