Jonathan Chase

dblp:150/5470 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2019
0000-0003-4017-7540ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 92% Performance modeling and evaluation · 8%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Computer networks
1 paper
Network optimization and economics · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › discrete optimization
mixed integer linear programming
0.522019
Improving Law Enforcement Daily Deployment Through Machine Learning-Informed Optimization under Uncertainty · IJCAI 2019
A Scalable Approach to Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2019
Network optimization and economics
resource allocation
0.412019
A Scalable Approach to Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2019
Cloud and datacenter computing
cloud security
0.412019
A Scalable Approach to Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2019
Cloud and datacenter computing
resource provisioning
0.312017
Joint Optimization of Resource Provisioning in Cloud Computing · IEEE Trans. Serv. Comput. 2017
Cloud and datacenter computing
stochastic optimization
0.312017
Joint Optimization of Resource Provisioning in Cloud Computing · IEEE Trans. Serv. Comput. 2017
Mathematical optimization
stochastic optimization
0.112019
A Scalable Approach to Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2019
Performance modeling and evaluation › statistical analysis
sensitivity analysis
0.112017
Joint Optimization of Resource Provisioning in Cloud Computing · IEEE Trans. Serv. Comput. 2017

Methods — techniques the papers use, named apart from their topics

stochastic optimization · 1.1sensitivity analysis · 1.1sample average approximation · 0.8machine learning · 0.8lagrange multiplier · 0.8iterated local search · 0.8lagrange multipliers · 0.4stochastic programming · 0.3scenario tree reduction · 0.3deterministic equivalent formulation · 0.3
YearPublicationVenuePosition
2019 Improving Law Enforcement Daily Deployment Through Machine Learning-Informed Optimization under Uncertainty
abstract
Urban law enforcement agencies are under great pressure to respond to emergency incidents effectively while operating within restricted budgets. Minutes saved on emergency response times can save lives and catch criminals, and a responsive police force can deter crime and bring peace of mind to citizens. To efficiently minimize the response times of a law enforcement agency operating in a dense urban environment with limited manpower, we consider in this paper the problem of optimizing the spatial and temporal deployment of law enforcement agents to predefined patrol regions in a real-world scenario informed by machine learning. To this end, we develop a mixed integer linear optimization formulation (MIP) to minimize the risk of failing response time targets. Given the stochasticity of the environment in terms of incident numbers, location, timing, and duration, we use Sample Average Approximation (SAA) to find a robust deployment plan. To overcome the sparsity of real data, samples are provided by an incident generator that learns the spatio-temporal distribution and demand parameters of incidents from a real world historical dataset and generates sets of training incidents accordingly. To improve runtime performance across multiple samples, we implement a heuristic based on Iterated Local Search (ILS), as the solution is intended to create deployment plans quickly on a daily basis. Experimental results demonstrate that ILS performs well against the integer model while offering substantial gains in execution time.
Jonathan Chase, Duc Thien Nguyen, Hoong Chuin Lau
IJCAI1
2019 A Scalable Approach to Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing
abstract
As computing services are increasingly cloud-based, corporations are investing in cloud-based security measures. The Security-as-a-Service (SECaaS) paradigm allows customers to outsource security to the cloud, through the payment of a subscription fee. However, no security system is bulletproof, and even one successful attack can result in the loss of data and revenue worth millions of dollars. To guard against this eventuality, customers may also purchase cyber insurance to receive recompense in the case of loss. To achieve cost effectiveness, it is necessary to balance provisioning of security and insurance, even when future costs and risks are uncertain. To this end, we introduce a stochastic optimization model to optimally provision security and insurance services in the cloud. Since the model we design is a mixed integer problem, we also introduce a partial Lagrange multiplier algorithm that takes advantage of the total unimodularity property to find the solution in polynomial time. We also apply sensitivity analysis to find the exact tolerance of decision variables to parameter changes. We show the effectiveness of these techniques using numerical results based on real attack data to demonstrate a realistic testing environment, and find that security and insurance are interdependent.
Jonathan Chase, Dusit Niyato, Ping Wang 0001, Sivadon Chaisiri, Ryan Kok Leong Ko
IEEE Trans. Dependable Secur. Comput.1
2017 Joint Optimization of Resource Provisioning in Cloud Computing
abstract
Cloud computing exploits virtualization to provision resources efficiently. Increasingly, Virtual Machines (VMs) have high bandwidth requirements; however, previous research does not fully address the challenge of both VM and bandwidth provisioning. To efficiently provision resources, a joint approach that combines VMs and bandwidth allocation is required. Furthermore, in practice, demand is uncertain. Service providers allow the reservation of resources. However, due to the dangers of over- and under-provisioning, we employ stochastic programming to account for this risk. To improve the efficiency of the stochastic optimization, we reduce the problem space with a scenario tree reduction algorithm, that significantly increases tractability, whilst remaining a good heuristic. Further we perform a sensitivity analysis that finds the tolerance of our solution to parameter changes. Based on historical demand data, we use a deterministic equivalent formulation to find that our solution is optimal and responds well to changes in parameter values. We also show that sensitivity analysis of prices can be useful for both users and providers in maximizing cost efficiency.
Jonathan Chase, Dusit Niyato
IEEE Trans. Serv. Comput.1
2015 Bring-Your-Own-Application (BYOA): Optimal Stochastic Application Migration in Mobile Cloud Computing
abstract
The increasing popularity of using mobile devices in a work context, has led to the need to be able to support more powerful computation. Users no longer remain in an office or at home to conduct their activities, preferring libraries and cafes. In this paper, we consider a mobile cloud computing scenario in which users bring their own mobile devices and are offered a variety of equipment, e.g., desktop computer, smart- TV, or projector, to migrate their applications to, so as to save battery life, improve usability and performance. We formulate a stochastic optimization problem to optimize the allocation of user applications to equipment despite future uncertainties. Furthermore, we extend the scenario to consider multiple locations and geographic migration. The performance evaluation shows the superior benefit, e.g., higher profit, compared with a baseline algorithm.
Jonathan Chase, Dusit Niyato, Sivadon Chaisiri
GLOBECOM1
2014 Joint virtual machine and bandwidth allocation in software defined network (SDN) and cloud computing environments
abstract
Cloud computing provides users with great flexibility when provisioning resources, with cloud providers offering a choice of reservation and on-demand purchasing options. Reservation plans offer cheaper prices, but must be chosen in advance, and therefore must be appropriate to users' requirements. If demand is uncertain, the reservation plan may not be sufficient and on-demand resources have to be provisioned. Previous work focused on optimally placing virtual machines with cloud providers to minimize total cost. However, many applications require large amounts of network bandwidth. Therefore, considering only virtual machines offers an incomplete view of the system. Exploiting recent developments in software defined networking (SDN), we propose a unified approach that integrates virtual machine and network bandwidth provisioning. We solve a stochastic integer programming problem to obtain an optimal provisioning of both virtual machines and network bandwidth, when demand is uncertain. Numerical results clearly show that our proposed solution minimizes users' costs and provides superior performance to alternative methods. We believe that this integrated approach is the way forward for cloud computing to support network intensive applications.
Jonathan Chase, Rakpong Kaewpuang, Yonggang Wen 0001, Dusit Niyato
ICC1