دانلود مقاله انگلیسی رایگان:تامین کیفیت سرویس برای انواع مختلف انتقال داده های فشرده محدود بین مراکز داده - 2020
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2
دانلود مقاله انگلیسی داده های بزرگ رایگان
  • QoS provisioning for various types of deadline-constrained bulk data transfers between data centers QoS provisioning for various types of deadline-constrained bulk data transfers between data centers
    QoS provisioning for various types of deadline-constrained bulk data transfers between data centers

    سال انتشار:

    2020


    عنوان انگلیسی مقاله:

    QoS provisioning for various types of deadline-constrained bulk data transfers between data centers


    ترجمه فارسی عنوان مقاله:

    تامین کیفیت سرویس برای انواع مختلف انتقال داده های فشرده محدود بین مراکز داده


    منبع:

    Sciencedirect - Elsevier - Future Generation Computer Systems, 105 (2020) 162-174: doi:10:1016/j:future:2019:11:039


    نویسنده:

    Aiqin Hou a, Chase Q. Wub,∗, Ruimin Qiao a, Liudong Zuo c, Michelle M. Zhu d, Dingyi Fang a, Weike Nie a, Feng Chen


    چکیده انگلیسی:

    An increasing number of applications in scientific and other domains have moved or are in active transition to clouds, and the demand for big data transfers between geographically distributed cloudbased data centers is rapidly growing. Many modern backbone networks leverage logically centralized controllers based on software-defined networking (SDN) to provide advance bandwidth reservation for data transfer requests. How to fully utilize the bandwidth resources of the links connecting data centers with guaranteed quality of service for each user request is an important problem for cloud service providers. Most existing work focuses on bandwidth scheduling for a single request for data transfer or multiple requests using the same service model. In this work, we construct rigorous cost models to quantify user satisfaction degree, and formulate a generic problem of bandwidth scheduling for multiple deadline-constrained data transfer requests of different types to maximize the request scheduling success ratio while minimizing the data transfer completion time of each request. We prove this problem to be not only NP-complete but also non-approximable, and hence design a heuristic algorithm. For performance evaluation, we establish a proof-of-concept emulated SDN testbed and also generate large-scale simulation networks. Both experimental and simulation results show that the proposed scheduling scheme significantly outperforms existing methods in terms of user satisfaction degree and scheduling success ratio.
    Keywords: Big data | Data center | High-performance networks | Software-defined networking | Bandwidth scheduling


    سطح: متوسط
    تعداد صفحات فایل pdf انگلیسی: 13
    حجم فایل: 1255 کیلوبایت

    قیمت: رایگان


    توضیحات اضافی:




اگر این مقاله را پسندیدید آن را در شبکه های اجتماعی به اشتراک بگذارید (برای به اشتراک گذاری بر روی ایکن های زیر کلیک کنید)

تعداد نظرات : 0

الزامی
الزامی
الزامی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi