SCHEDULING BULK DATA TRANSFERS ACROSS

GEO-DISTRIBUTED DATACENTERS USING SDN

ARCHITECTURE
(OR)
INTER-DATA CENTER BULK TRANSFERS BASED
ON ENSEMBLE MODELING

ABSTRACT

The software defined networking (SDN) paradigm

Aims to design a dynamic,

Highly efficient bulk data transfer service in a geo-distributed

datacenter system,

Engineer its design and solution algorithms closely within an

SDN architecture.

Delay tolerant migration

Chunk routing optimization model is formulated to solve for

the best chunk transfer schedules over time.

AIM

a dynamic, highly efficient bulk data transfer service in

a geo-distributed datacenter system, and engineer its
design and solution algorithms closely within an SDN
architecture.

Increase the speed and performance

Reduce the overhead

INTRODUCTION

Geo-distributed datacenter system is to transfer

bulk volumes of data from one datacenter to
another,

(SDN)

paradigm

realization

of

has
a

shed

light

centralized

on

easy

optimization

algorithm,

It solves the bulk data transfer scheduling

problem,

EXISTING SYSTEM

Data center resizing (DCR) has been proposed to reduce

the computation cost by adjusting the number of data
servers via task placement.

Deadline-Aware Datacenter TCP protocol

Previous work has energy is a significant part of the

operational cost in data centers and that it takes a server
only several seconds to sleep or to wake up.

NetStitcher technique used

Traffic into the network,

DISADVANTAGE
Incresed the transmission time of a given volume.
Low bandwidth
Not flexibility
High computational delay and overhead.

PROPOSED SYSTEM

Bandwidth-reserving algorithm,
Dynamically-adjusting algorithm

optimality and scalability.

SDN architecture

Routing optimality, computational delay and overhead

we formulate the bulk data transfer problem into a
novel, optimal chunk routing problem, which
maximizes the aggregate utility gain due to timely
transfer completions before the specified deadlines.

ADVANTAGE

To minimize the transmission time of a given volume.

To distribute tasks onto servers without violating the

resource constraints.

This proposed system can be used to adjust the

Distributed Data Center layout for load balancing or
energy saving purpose

to solve the optimal chunk routing problem,

computational complexity

SYSTEM DIAGRAM

FLOW DIAGARM

BLOCK DIAGARM

SOFTWARE REQUIREMENTS:

Operating System :

Windows family

Technology :

Java and J2EE

IDE :

Web Server

Database :

Netbeans IDE

: Apache Tomcat server

My SQL

HARDWARE REQUIREMENTS:
Hardware - Pentium
Speed - 1.1 GHz
RAM - 1GB
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard
Windows Keyboard
Mouse - Two or Three
Button Mouse
Monitor - SVGA

APPLICATION
Social Media Applications
Computer communication.