BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200129T163603Z
LOCATION:501
DTSTART;TZID=America/Denver:20191117T140000
DTEND;TZID=America/Denver:20191117T142500
UID:submissions.supercomputing.org_SC19_sess103_ws_indis105@linklings.com
SUMMARY:Co-Scheduling of Advance and Immediate Bandwidth Reservations for 
 Inter-Data Center Transfer
DESCRIPTION:Workshop\n\nCo-Scheduling of Advance and Immediate Bandwidth R
 eservations for Inter-Data Center Transfer\n\nHou, Wu, Zuo, Quan, Li...\n\
 nAs scientific applications and business services increasingly migrate to 
 clouds, big data of various types with different priorities need to be tra
 nsferred between geographically distributed cloud-based data centers. It h
 as become a critical task for Cloud Service Providers (CSP) to fully utili
 ze the expensive bandwidth resources of the links connecting such data cen
 ters while guaranteeing users’ Quality of Experience (QoE). Most high-perf
 ormance networks based on software-defined networking (SDN) provide the ca
 pability of advance bandwidth reservation. This paper focuses on the sched
 uling of multiple user requests of two different types with different prio
 rities, namely, advance bandwidth reservation with a lower priority and im
 mediate bandwidth reservation with a higher priority, to maximize the tota
 l satisfaction of user requests.We formulate this co-scheduling problem as
  a generic optimization problem, which is shown to be NP-complete. We desi
 gn a heuristic algorithm to maximize the number of successfully scheduled 
 requests and minimize the number of preempted advance reservation requests
 , while minimizing the completion time of each request. Extensive simulati
 on results show that our scheduling scheme significantly outperforms greed
 y approaches in terms of user satisfaction degree.\n\nTag: Workshop Reg Pa
 ss, Big Data, Data Analytics, Datacenter, Networks, Software-defined netwo
 rking\n\nRegistration Category: Workshop Reg Pass, Big Data, Data Analytic
 s, Datacenter, Networks, Software-defined networking
URL:https://sc19.supercomputing.org/presentation/?id=ws_indis105&sess=sess
 103
END:VEVENT
END:VCALENDAR