BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150115Z
LOCATION:D163
DTSTART;TZID=America/Chicago:20181111T160000
DTEND;TZID=America/Chicago:20181111T163000
UID:submissions.supercomputing.org_SC18_sess159_ws_indis101@linklings.com
SUMMARY:Bandwidth Scheduling for Big Data Transfer with Deadline Constrain
 t between Data Centers
DESCRIPTION:Aiqin Hou (Northwest University, China); Chase Q. Wu (New Jers
 ey Institute of Technology); Dingyi Fang (Northwest University, China); Li
 udong Zuo (California State University, Dominguez Hills); Michelle M. Zhu 
 (Montclair State University); and Xiaoyang Zhang, Ruimin Qiao, and Xiaoyan
  Yin (Northwest University, China)\n\nAn increasing number of applications
  in scientific and other domains have moved or are in active transition to
  clouds, and the demand for the movement of big data between geographicall
 y distributed cloud-based data centers is rapidly growing. Many modern bac
 kbone networks leverage logically centralized controllers based on softwar
 e-defined networking (SDN) to provide advance bandwidth reservation for da
 ta transfer requests. How to fully utilize the bandwidth resources of the 
 links connecting data centers with guaranteed QoS for each user request is
  an important problem for cloud service providers. Most existing work focu
 ses on bandwidth scheduling for a single request for data transfer or mult
 iple requests using the same service model. In this work, we construct rig
 orous cost models to quantify user satisfaction degree and formulate a gen
 eric problem of bandwidth scheduling for multiple deadline-constrained dat
 a transfer requests of different types to maximize the request scheduling 
 success ratio while minimizing the data transfer completion time of each r
 equest. We prove this problem to be NP-complete and design a heuristic sol
 ution. Extensive simulation results show that our scheduling scheme signif
 icantly outperforms existing methods in terms of user satisfaction degree 
 and scheduling success ratio.\n\nTag: Architectures, Networks, Security\n\
 nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Ilya Baldin (
 Thomas Jefferson National Accelerator Facility); Paola Grosso (University 
 of Amsterdam, Netherlands); Mary Hester (Dutch National Institute for Suba
 tomic Physics); and Michelle Zhu (Montclair State University)\n\n
END:VEVENT
END:VCALENDAR