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:20181221T160727Z
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:Workshop\nArchitectures, Networks, Security, Workshop Reg Pass
 \n\nBandwidth Scheduling for Big Data Transfer with Deadline Constraint be
 tween Data Centers\n\nHou, Wu, Fang, Zuo, Zhu...\n\nAn increasing number o
 f 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
  geographically distributed cloud-based data centers is rapidly growing. M
 any modern backbone networks leverage logically centralized controllers ba
 sed on software-defined networking (SDN) to provide advance bandwidth rese
 rvation for data transfer requests. How to fully utilize the bandwidth res
 ources of the links connecting data centers with guaranteed QoS for each u
 ser request is an important problem for cloud service providers. Most exis
 ting work focuses on bandwidth scheduling for a single request for data tr
 ansfer or multiple requests using the same service model. In this work, we
  construct rigorous cost models to quantify user satisfaction degree and f
 ormulate a generic problem of bandwidth scheduling for multiple deadline-c
 onstrained data transfer requests of different types to maximize the reque
 st scheduling success ratio while minimizing the data transfer completion 
 time of each request. We prove this problem to be NP-complete and design a
  heuristic solution. Extensive simulation results show that our scheduling
  scheme significantly outperforms existing methods in terms of user satisf
 action degree and scheduling success ratio.
URL:https://sc18.supercomputing.org/presentation/?id=ws_indis101&sess=sess
 159
END:VEVENT
END:VCALENDAR