Joint Optimization of Bandwidth

for Provider and Delay for User

in Software Defined Data
Centers
 ABSTRACT

▰ In large-scale Internet applications running on geographically distributed datacenters, such as video streaming, it is important to
efficiently allocate requests among datacenters. To the best of our knowledge, existing approaches, however, either solely focus
on minimizing total cost for provider, or guaranteeing QoS for end-users. In this paper, we latest ieee 2018 services
computing projects(SDN) controller to enable the central control of the entire network, and propose a joint optimization
model to consider high bandwidth utilization for provider and low delay for users. We present the Nash bargaining solution (NBS)
based method to model both requirements of provider’s high bandwidth utilization and end-users’ low delay. Specifically, we
formulate the design of request allocation under those requirements as an optimization problem, which is NP-hard. To solve
such hard optimization problem, we develop an efficient algorithm blending the advantages of Logarithmic Smoothing technique
and the auxiliary variable method. According to the theoretical analysis, we verify the existence and uniqueness of our solution
and the convergence of our algorithm. We conduct a large amount of experiments based on real-world workload traces and
demonstrate the efficiency of our algorithm compared to both greedy and locality algorithms.

2
 HELLO!
This is from 1crore project center in chennai
We are here because we love to give presentations.
You can find us at 1croreprojects@gmail.com

3
1
Joint Optimization of
Bandwidth
Let’s start with the first set of slides

4
“ ▰ Joint Optimization of Bandwidth for
Provider and Delay for User in
Software Defined Data Centers

5
 EXISTING SYSTEM

▰ Recently, request allocation problem has gained considerable research interest over the
past few years. However, existing solutions solely focus on the benefit of either provider or
end-users. We review first solutions considering the benefit of end-users. adopt a general
fairness criterion based on Nash bargaining solutions, and present a general optimization
framework that models the realistic environment and practical constraints that a cloud
faces. Proposed to optimize traffic engineering across all upstream ISPs, assuming
requests are simply allocated to the closest ingress point. Supported locality policies
based on on-demand network probing

▰ The joint optimization problem of minimizing carbon emission and electricity cost while
their user assignment algorithm does not attempt to minimize the distance between users
and the datacenters.

6
Disadvantage

▰ This locality policy can benefit end user close to the infrastructure
while can lead to poor performance for users far away from the
infrastructure.
▰ Their work mainly targets in a single datacenter. This is different
from our work since we focus on the request allocation in
geographically distributed datacenters.
▰ The joint optimization problem of minimizing carbon emission and
electricity cost while their user assignment algorithm does not
attempt to minimize the distance between users and the datacenters
7
PROPOSED SYSTEM
▰ We formulate the request allocation under
▰ We focus on the emerging request allocation
problem in geographically distributed datacenters,
and propose a joint optimization model to consider
high bandwidth utilization for provider and low delay
for end-users. Specifically, we present Nash
bargaining solution (NBS) based method to model
both the requirement of provider’s high bandwidth
utilization at all datacenters and end-users’ low delay
those requirements as an optimization
problem. Such optimization can be NP-hard.
To solve it, we propose an efficient request
allocation algorithm by introducing the
auxiliary variable method to eliminate
inequality, rather than directly applying the
Logarithmic Smoothing technique. We
perform theoretical analysis to prove the
existence and uniqueness of our solution,
and the convergence of our algorithm.
8
ADVANTAGE:

▰ Shifting ▰ Their Delay ▰ Our algorithm can

workload doesn’t efficiently improve
the bandwidth
from contain the utilization for the
overloaded response provider and reduce
datacenters time inside the delay for users,
compared with
with low data centers both greedy and
utilization locality algorithms.

9
 ALGORITHM

▰ Genetic Load balancing Algorithm

▰ARCHITECUTRE

10
Want big impact?
USE BIG IMAGE

11
 SYSTEM CONFIGURATION

▰ HARDWARE CONFIGURATION ▰ SOFTWARE CONFIGURATION

▰ System : Pentium IV 2.4 GHz
▰ Hard Disk : 40 GB
▰ Operating system : Windows XP/7/8
▰ Monitor : 15 VGA Colour
▰ Mouse : Logitech ▰ Coding Language : JAVA/J2EE
▰ Ram : 1 GB ▰ IDE : Netbeans
▰ Database : MYSQL

12
▰ REFERENCES

▰ [1] Amazon web services [Online].

Available: http://aws.amazon. com,
2014.

▰ [2] V. K. Adhikari, Y. Guo, F. Hao, M.

Varvello, V. Hilt, M. Steiner, and Z.-
L. Zhang, “Unreeling netflix:
Understanding and improving multi-
CDN movie delivery,” in Proc. IEEE
Conf. Comput. Commun., 2012, pp.
1620–1628.
▰ [3] A. Cockcroft. (2011). Netflix in
the cloud [Online]. Available:
http://velocityconf.com/velocity
2011/public/schedule/detail/
17785
13
▰ [4] B. Wong and E. G. Sirer,
“Closestnode.com: An open access,
scalable, shared geocast service for
distributed systems,” Operating
Syst. Rev., vol. 40, no. 1, pp. 62–64,
2006.
▰ [5] H. Ballani, P. Costa, T.
Karagiannis, and A. Rowstron,
“Towards predictable datacenter
networks,” in Proc. ACM SIGCOMM
Conf., Toronto, ON, Canada, 2011,
pp. 242–253.
▰ [6] N. Laoutaris, M. Sirivianos, X.
Yang, and P. Rodriguez,
“Interdatacenter bulk transfers with
netstitcher,” in Proc. ACM
SIGCOMM Conf., Toronto, ON,
Canada, 2011, pp. 74–85.

14
▰ [7] A. Greenberg, J. Hamilton, D. A.
Maltz, and P. Patel, “The cost of a
cloud: Research problems in data
center networks,” ACM SIGCOMM
Comput. Commun. Rev., vol. 39, no.
1, pp. 68–73, 2008.
▰ [8] A. Singh, M. Korupolu, and D.
Mohapatra, “Server-storage
virtualization: Integration and load
balancing in data centers,” in Proc. Place your screenshot here
ACM/IEEE Conf. Supercomput.,
2008, p. 53.
▰ [9] R. Buyya, R. Ranjan, and R. N.
Calheiros, “Intercloud:
Utilityoriented federation of cloud
computing environments for scaling
of application services,” in Proc.
10th Int. Conf. Algorithms Archit.
Parallel Process., 2010, pp. 13–31.

15
THANKS!
Any questions?
You can find me at
@username & user@mail.me

16