Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs

Hosseini Bidi, Seyed Arshia

Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs

dc.contributor.advisor	Ghaderi, Majid
dc.contributor.author	Hosseini Bidi, Seyed Arshia
dc.contributor.committeemember	Hudson, Jonathan
dc.contributor.committeemember	Fupojuwo, Abraham
dc.date	2021-06
dc.date.accessioned	2021-04-22T18:08:12Z
dc.date.available	2021-04-22T18:08:12Z
dc.date.issued	2021-04-16
dc.description.abstract	Wide area networks (WANs) that connect geo-distributed datacenters enable online applications to provide a diversity of services to their users in various locations throughout the world. Inter-datacenter (inter-DC) traffic constitutes a significant portion of today’s world-wide traffic while utilizing dedicated lines that are in different networks than the Internet, making it a very expensive communication. Consequently, inter-DC network providers are keen to minimize their expenses while guaranteeing the quality of service to their customers. As a result, scheduling available resources is of paramount importance to increase the efficacy of these networks for both their providers and customers. In this regard, software-defined wide area networks (SD-WAN) seem to be a promising solution to mitigate legacy WAN’s restrictions such as lack of a global view. While conventional multi-protocol label switching (MPLS) tunnelling has proven to be a practical approach to guarantee performance, its significant service price can be a drawback. Utilizing Internet best-effort paths is a cheap and viable alternative. However, to utilize these paths, we have to take their capacity fluctuations into account to avoid over-allocation. In this thesis, we first characterize and estimate the fluctuations in short and long periods using statistical analysis and machine learning. Next, we take the estimated capacities into account and consider the problem of scheduling bulk transfer requests over best-effort SD-WANs to maximize the gained profit from successful transmissions. Furthermore, we propose an approximate algorithm with a significant computational advantage over our exact algorithm with an approximation ratio that only depends on the number of overlapping requests with the same profit to bandwidth ratio. Finally, we provide a thorough mathematical analysis of the approximate algorithm, as well as simulation and experimental results to evaluate our proposed algorithm’s performance. The results show that our algorithm can improve the inter-DC provider’s profit by an average of 60% while reducing ISP service costs by an average of 15%.	en_US
dc.identifier.citation	Hosseini Bidi, S. A. (2021). Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.	en_US
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/38762
dc.identifier.uri	http://hdl.handle.net/1880/113278
dc.language.iso	eng	en_US
dc.publisher.faculty	Science	en_US
dc.publisher.institution	University of Calgary	en
dc.rights	University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.	en_US
dc.subject	Inter-DC	en_US
dc.subject	Resource Scheduling	en_US
dc.subject	SD-WAN	en_US
dc.subject	SDN	en_US
dc.subject.classification	Computer Science	en_US
dc.title	Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs	en_US
dc.type	master thesis	en_US
thesis.degree.discipline	Computer Science	en_US
thesis.degree.grantor	University of Calgary	en_US
thesis.degree.name	Master of Science (MSc)	en_US
ucalgary.item.requestcopy	true	en_US