CloudGPS: A scalable and ISP-friendly server selection scheme in cloud computing environments

Ding, Cong; Chen, Yang; Xu, Tianyin; Fu, Xiaoming

doi:10.1109/iwqos.2012.6245964

Cited by 25 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With Matrix Factorization Model, the distance is the dot product of two well-defined vectors. Thanks to the high precision of NCS, it has been used in more and more stateof-the-art applications such as cloud computing [9], [10] and social graph analysis [11], [12].…”

Section: Introductionmentioning

confidence: 99%

RNC: A high-precision Network Coordinate System

Cheng¹,

Guan

Ye³

et al. 2014

2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)

View full text Add to dashboard Cite

Network Coordinate System (NCS) has drawn much attention over the past years thanks to the increasing number of large-scale distributed systems that require the distance prediction service for each pair of network hosts. The existing schemes suffer seriously from either low prediction precision or unsatisfactory convergence speed. In this paper, we present a novel distributed network coordinate system based on Robust Principal Component Analysis, RNC, that uses a few local distance measurements to calculate high-precision coordinates without convergence process. To guarantee the non-negativity of predicted distances, we propose Robust Nonnegative Principal Component Analysis (RUN-PACE) which only involves convex optimization, consequently resulting in low computation complexity. Our experimental results indicate that RNC outperforms the state-of-the-art NCS schemes.

show abstract

Section: Introductionmentioning

confidence: 99%

RNC: A high-precision Network Coordinate System

Cheng¹,

Guan

Ye³

et al. 2014

2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)

View full text Add to dashboard Cite

show abstract

“…An intuitive and easy-to-implement strategy for client assignment is to assign each client to its nearest server, i.e., the server with the shortest distance (network latency) to it. This is known as the nearest-server assignment and is widely used in many applications [8], [16], [26]. On the other hand, a simple and straightforward setting of simulation times is to synchronize the simulation times of the servers.…”

Section: Approximating Mit Problemmentioning

confidence: 99%

Analysis of Minimum Interaction Time for Continuous Distributed Interactive Computing

Zhang

Tang

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Distributed interactive computing allows participants at different locations to interact with each other in real time. In this paper, we study the interaction times of continuous Distributed Interactive Applications (DIAs) in which the application states change due to not only user-initiated operations but also time passing. Given the clients and servers of a continuous DIA, its interaction time is directly affected by how the clients are assigned to the servers as well as the simulation time settings of the servers. We formulate the Minimum Interaction Time (MIT) problem as a combinatorial problem of these two tuning knobs and prove that it is NP-hard. We then approximate the problem by fixing the client assignment or the simulation time offsets among the servers. When the client assignment is fixed, we show that finding the minimum achievable interaction time can be reduced to a weighted bipartite matching problem. We further show that this approach establishes a tight approximation factor of 3 to the MIT problem if each client is assigned to its nearest server. When the simulation time offsets among the servers are fixed, we show that finding the minimum achievable interaction time is still NP-hard. This approach can approximate the MIT problem by a factor within 2 if the simulation times of all servers are synchronized. A mix of the above two approaches better approximates the MIT problem within a factor of 5/3. We further conduct experimental evaluation of these approaches with three real Internet latency datasets.

show abstract

“…These both problems are solved by some outsourcing mapping systems, for example DONAR (decentralized server selection for cloud services) provides both proximity and server load in their selection policy. In this paper authors proposed CloudGPS, a friendly server selection scheme to address the above problems and server selection algorithm, which have three important metrics: network performance, server workload balance and inter domain transit traffic [9]. Long latency between clients and servers creates poor user experience and network performance, imbalanced workload of servers increases the risk of server breaking down and inters domain transit traffic produces unnecessary ISP (Internet service providers) operational cost.…”

Section: Distributed Data Center For Logistics Information System Ovementioning

confidence: 99%

A New Algorithm for Improving Latency in Distributed Data Center for Logistics Information System over Cloud

Dubey¹,

Jain²

2015

IJCA

View full text Add to dashboard Cite

The cloud based distributed data center uses virtualization technology to share the resources to the outside world through a virtual machine. Cloud administrator selects the data center to access virtual machines by using administrative and dynamic policies. Every data center has multiple virtual machines. Selection of data center is an important task which affects on performance as well as cost effectiveness of the data center. This problem can be solved by centralized as well as distributed data center. In Logistics Company, Centralized data center faces bottleneck in operations like virtual machine migration, creation, deletion, and needs to contact central administrator which can increase the negligible amount of network traffic. The paper presents comparison of distributed and centralized data center and strategies of distributed data center for reducing the latency and cost of selection of data center over the cloud by proposing an algorithm distributed service broker policy (DSBP) for logistics information system.

show abstract

CloudGPS: A scalable and ISP-friendly server selection scheme in cloud computing environments

Cited by 25 publications

References 24 publications

RNC: A high-precision Network Coordinate System

RNC: A high-precision Network Coordinate System

Analysis of Minimum Interaction Time for Continuous Distributed Interactive Computing

A New Algorithm for Improving Latency in Distributed Data Center for Logistics Information System over Cloud

Contact Info

Product

Resources

About