BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T162633Z
LOCATION:Bldg. 6 - Room 102
DTSTART;TZID=Europe/Stockholm:20260629T120000
DTEND;TZID=Europe/Stockholm:20260629T123000
UID:submissions.pasc-conference.org_PASC26_sess169_pap110@linklings.com
SUMMARY:XOR Bidding and Knapsack Formulations for HPC Network Resource All
 ocation
DESCRIPTION:Abrar Hossain and Kishwar Ahmed (University of Toledo)\n\nMode
 rn High Performance Computing (HPC) centers face growing challenges in ing
 esting large and diverse data streams. These issues often create bottlenec
 ks that limit bandwidth use and delay scientific progress. Traditional sta
 tic allocation and simple queuing methods are not sufficient. This paper p
 resents a dynamic and value-based approach to bandwidth allocation. We for
 malize the problem by incorporating both network and processing constraint
 s. To address it, we introduce two new auction-based mechanisms: the Greed
 y Value Density Auction, which is fast to compute, and the Vickrey–Clarke–
 Groves (VCG) Knapsack Auction, which offers strong theoretical guarantees.
  Both mechanisms rely on user bids that include data needs and scientific 
 value. The goal is to maximize the total value of successful transfers, of
 ten referred to as social welfare. Simulation results show that our auctio
 n mechanisms significantly outperform First Come First Served (FCFS) basel
 ines. In high-load conditions, they reduce average and tail completion del
 ays by over 80%. Predictability also improves, with the Coefficient of Var
 iation of delay falling by 75–85%. Network stability increases as well, wi
 th load volatility (Peak to Average Ratio) dropping by up to 60–70%. This 
 value-driven and adaptive strategy helps reduce congestion, improve bandwi
 dth use, and ensure fairer access based on scientific importance.\n\nSessi
 on Chair: Razvan Vass (Max Planck Society)\n\n
END:VEVENT
END:VCALENDAR