Brian Bockelman

Brian Bockelman

Auto-generated profile, based on publicly available information

Brian Bockelman

Morgridge Institute for Research, Madison, WI, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 September 2017 in Computing and Software for Big Science
Verified
Journal Article
Open access
PDF file
BHBurt Holzman
Burt Holzman
LBLothar A. T. Bauerdick
Lothar A. T. Bauerdick
BBBrian Bockelman
Brian Bockelman
DDDave Dykstra
Dave Dykstra
IFIan Fisk
Ian Fisk
EVEric W. Vaandering
Eric W. Vaandering
Historically, high energy physics computing has been performed on large purpose-built computing systems. These began as single-site compute facilities, but have evolved into the distributed computing grids used today. Recently, there has been an exponential increase in the capacity and capability of commercial clouds. Cloud resources are highly virtualized and intended to be able to be flexibly deployed for a variety of computing tasks. There is a growing interest among the cloud providers to demonstrate the capability to perform large-scale scientific computing. In this paper, we discuss results from the CMS experiment using the Fermilab HEPCloud facility, which utilized both local Fermilab resources and virtual machines in the Amazon Web Services Elastic Compute Cloud. We discuss the planning, technical challenges, and lessons learned involved in performing physics workflows on a large-scale set of virtualized resources. In addition, we will discuss the economics and operational efficiencies when executing workflows both in the cloud and on dedicated resources.

1 December 2018
Verified
Conference Paper
Closed access
MAMohammad Alhowaidi
Mohammad Alhowaidi
DNDeepak Nadig
Deepak Nadig
BRByrav Ramamurthy
Byrav Ramamurthy
BBBrian Bockelman
Brian Bockelman
DSDavid Swanson
David Swanson
Named Data Networking (NDN) proposes a contentcentric rather than a host-centric approach to data retrieval. Data packets with unique and immutable names are retrieved from a content store (CS) using Interest packets. The current NDN architecture relies on forwarding strategies that are dependent upon on-path caching and is therefore inefficient. This approach reduces data transfer efficiency by ignoring the cached content available on the adjacent off-path routers in the network. In this paper, we propose a novel distributed multipath (D-MP) forwarding strategy and enhancements to the NDN Interest forwarding pipeline. Furthermore, we develop a centralized SDNenabled control for the multipath forwarding strategy (S-MP) that distributes Interests efficiently by using the global knowledge of the NDN network states. We perform extensive evaluations of our proposed methods on an at-scale WAN testbed spanning six geographically separated sites. Our solutions outperform the existing NDN forwarding strategies by a significant margin. We show that the D-MP strategy results in performance gains ranging between 10.4x to 12.5x over the default NDN implementation without in-network caching, and gains of 12.2x to 18.4x with in-network caching. In addition, for the S-MP case, we demonstrate a performance improvement of 10.6x to 12.6x, and 12.9x to 18.5x, for with- and without in-network caching respectively.

1 November 2021 in Computer Networks
Verified
Journal Article
Closed access
MAMohammad Alhowaidi
Mohammad Alhowaidi
DNDeepak Nadig
Deepak Nadig
BHBoyang Hu
Boyang Hu
BRByrav Ramamurthy
Byrav Ramamurthy
BBBrian Bockelman
Brian Bockelman

16 November 2020 in EPJ Web of Conferences
Verified
Journal Article
Open access
PDF file
EFEdgar Fajardo
Edgar Fajardo
DWDerek Weitzel
Derek Weitzel
MRMats Rynge
Mats Rynge
MZMarian Zvada
Marian Zvada
JHJohn Hicks
John Hicks
ISIgor Sfiligoi
Igor Sfiligoi
A general problem faced by opportunistic users computing on the grid is that delivering cycles is simpler than delivering data to those cycles. In this project XRootD caches are placed on the internet backbone to create a content delivery network. Scientific workflows in the domains of high energy physics, gravitational waves, and others profit from this delivery network to increases CPU efficiency while decreasing network bandwidth use.

5 June 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MAMd Arifuzzaman
Md Arifuzzaman
BBBrian Bockelman
Brian Bockelman
JBJames Basney
James Basney
EAEngin Arslan
Engin Arslan
Research networks provide high-speed wide-area network connectivity between research and education institutions to facilitate large-scale data transfers. However, scalability issues of legacy transfer applications such as scp and FTP hinder the effective utilization of these networks. Although researchers extended the legacy transfer applications to increase their performance by exploiting I/O and network parallelism, these solutions necessitate users to fine-tune parallelism level, a task that is challenging even for experienced users due to the dynamic nature of networks. In this article, we propose an online optimization algorithm, Falcon , to tune the degree of parallelism for file transfers to maximize transfer throughput while keeping system overhead at a minimum. As research networks are shared infrastructures, we introduce a game theory-inspired novel utility function to evaluate the performance of various parallelism levels such that competing transfers are guaranteed to converge to a fair and stable solution. We assessed the performance of Falcon in isolated and production high-speed networks and found that it can discover optimal transfer parallelism in as little as 20 seconds and outperform the state-of-the-art solutions by more than $2\times$ . Moreover, Falcon is guaranteed to converge to Nash Equilibrium when multiple transfers compete for the same resources with the help of its game theory-inspired utility function. Finally, we demonstrate that Falcon can also be used as a central transfer scheduler to speed up convergence time, increase stability, and enforce system/user-level resource limitations in shared networks.

1 July 2017 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZZZhe Zhang
Zhe Zhang
BBBrian Bockelman
Brian Bockelman
DCDale W. Carder
Dale W. Carder
TTTodd Tannenbaum
Todd Tannenbaum