DDCCast: Meeting Point to Multipoint Transfer Deadlines Across Datacenters using ALAP Scheduling Policy

نویسندگان

  • Mohammad Noormohammadpour
  • Cauligi S. Raghavendra
چکیده

Large cloud companies manage dozens of datacenters across the globe connected using dedicated inter-datacenter networks. An important application of these networks is data replication which is done for purposes such as increased resiliency via making backup copies, getting data closer to users for reduced delay and WAN bandwidth usage, and global load balancing. These replications usually lead to network transfers with deadlines that determine the time prior to which all datacenters should have a copy of the data. Inter-datacenter networks have limited capacity and need be utilized efficiently to maximize performance. In this report, we focus on applications that transfer multiple copies of objects from one datacenter to several datacenters given deadline constraints. Existing solutions are either deadline agnostic, or only consider point-to-point transfers. We propose DDCCast, a simple yet effective deadline aware point to multipoint technique based on DCCast [3] and using ALAP traffic allocation [2]. DDCCast performs careful admission control using temporal planning, uses rateallocation and rate-limiting to avoid congestion and sends traffic over forwarding trees that are carefully selected to reduce bandwidth usage and maximize deadline meet rate. We perform experiments confirming DDCCast’s potential to reduce total bandwidth usage by up to 45% while admitting up to 25% more traffic into the network compared to existing solutions that guarantee deadlines.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DCCast: Efficient Point to Multipoint Transfers Across Datacenters

Using multiple datacenters allows for higher availability, load balancing and reduced latency to customers of cloud services. To distribute multiple copies of data, cloud providers depend on inter-datacenter WANs that ought to be used efficiently considering their limited capacity and the ever-increasing data demands. In this paper, we focus on applications that transfer objects from one datace...

متن کامل

Coflow: A Networking Abstraction for Distributed Data-Parallel Applications

Coflow: A Networking Abstraction for Distributed Data-Parallel Applications by N M Mosharaf Kabir Chowdhury Doctor of Philosophy in Computer Science University of California, Berkeley Professor Ion Stoica, Chair Over the past decade, the confluence of an unprecedented growth in data volumes and the rapid rise of cloud computing has fundamentally transformed systems software and corresponding in...

متن کامل

Preference-Oriented Scheduling Framework for Periodic Real-Time Tasks

We consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) while still meeting their deadlines. After introducing the idea of preference-oriented (PO) execution, we formally define the concept of PO-optimality. For fully-loaded systems (with 100% utilization), we first propose a PO-optimal scheduler, na...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

Preference-oriented real-time scheduling and its application in fault-tolerant systems

In this paper, we consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) while still meeting their deadlines. After introducing the idea of preference-oriented (PO) execution, we formally define the concept of PO-optimality. For fully-loaded systems (with 100% utilization), we first propose a PO-optima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1707.02027  شماره 

صفحات  -

تاریخ انتشار 2017