@article{gandhi_viniotis_2020, title={Guarantees for Mix-flows in Inter-Datacenter WANs in Single and Federated Clouds}, ISSN={["0742-1303"]}, DOI={10.1109/LCN48667.2020.9314789}, abstractNote={Inter-datacenter WANs connect geo-distributed datacenters and carry a considerable amount of traffic, generally a mix of flows. There has been little work done to provide custom guarantees depending on the nature of traffic requirements in such environments. In this paper we address this problem by proposing Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds. With Vritti, cloud providers can offer tailor-made guarantees to users with widely differing requirements (in terms of hard, soft or no deadlines) and traffic characteristics (in terms of known or unknown traffic volumes). We use linear programming to mathematically formulate the problem with the objective of maximizing utility. We propose two online algorithms to generate admission control, scheduling and routing decisions. Our simulations show that Vritti can effectively meet deadline transfers and provide fairness to non-deadline transfers in both single and federated cloud environments.}, journal={PROCEEDINGS OF THE 2020 IEEE 45TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2020)}, author={Gandhi, Shruti and Viniotis, Yannis}, year={2020}, pages={244–255} }
 @article{gandhi_viniotis_2018, title={Joint Virtual Machine Placement and Path Selection in a Virtualized Datacenter Environment}, DOI={10.1145/3154273.3154325}, abstractNote={Today's multi-tenant shared datacenter environments guarantee compute resources over a best-effort intra-datacenter network. Bursty traffic in such a network implies higher delays and losses for tenants. This may result in unpredictable network performance, potentially hurting the tenant's overall application performance. Motivated by these concerns, in this work we propose a Service Level Agreement (SLA) that along with compute capacity, explicitly guarantees intra-datacenter network bandwidth to the tenants in a virtualized, multi-tenant datacenter environment. We design a modified greedy approach that uses virtual machine placement and path selection to solve the joint resource allocation problem. In recent years, several algorithms have been proposed for resource allocation problems to meet a specific SLA. However they do not provide any practical recommendations for the realization of these solutions from a datacenter designer's standpoint. Another main contribution of our work is the design of a rigorous simulation setup to derive a definitive set of guidelines for the datacenter designer implementing the proposed SLA. The guideline answers questions of key practical importance to datacenter designers and enables derivation of effective estimates about the switch fabric and server capacity to be bought and installed, as a function of tenant demands.}, journal={ICDCN'18: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING}, author={Gandhi, Shruti and Viniotis, Yannis}, year={2018} }