Cloud Bandwidth and Cost Reduction by

Prediction-Based System
P. Muthyalu* B. Bharath Kumar2
1M.Tech

Student, SRES Tirupati, A.P., India, muthyalu.pindi@gmail.com

Professor, SDITW Nandyal, A.P., India, chinna.mdh@gmail.com

2 Assistant

ABSTRACT

Cloud computing is a quick growing field that is

arguably a brand new computing paradigm. In cloud
computing, computing resources square measure
provided as services over the web and users will access
resources on supported their payments. But for server
specific TRE approach it's tough to handle the traffic
efficiently and it doesnt suites for the cloud setting due
to high process prices. During this paper we provide a
survey on the new traffic redundancy technique called
novel-TRE conjointly called receiver based TRE. This
novel-TRE has important options like detective work
the redundancy at the customer, randomly rotating
appear chained, matches incoming chunks with a
antecedently received chunk chain or native file and
sending to the server for predicting the long run
information and no would like of server to unceasingly
maintain consumer state.
Keywords: Cloud Computing, chunking, TRE,
novel-TRE, computing paradigm.

1. INTRODUCTION

Cloud computing [1] is rising sort of delivery during

which applications, information and resources are
speedily provisioned as standardized offerings to
users with a versatile worth. The cloud computing
paradigm has achieved widespread adoption in
recent years. Its success is due mostly to customers
ability to use services on demand with a pay-as-you
go evaluation model, which has proven convenient in
several respects. Low prices and high flexibility create
migrating to the cloud compelling. Cloud computing is
that the long unreal vision of computing as a utility,
wherever users will remotely store their information
into the cloud thus on get pleasure from the ondemand top quality applications and services from a
shared pool of configurable computing resources. By
information outsourcing, users are all aviated from
the burden of native information storage and
maintenance. Traffic redundancy and elimination
approach is employed for minimizing the value.
PACK(traffic
redundancy
elimination):
cloud
customers [2] utilize the pliability of pay-per-use
Bandwidth value reduction(judicious use of cloud
resources) cut back the extra value of TRE
computation and storage industrial TRE solutions
are fashionable at enterprise networks(not in cloud

2014, IJSHRE All Rights Reserved

environments) enterprise networks:-middle boxes at

the entry purpose of information centers and branch
offices cloud settings:-cloud supplier cannot get
benefit(reduce bills) mounted client-side and serverside TRE is inefficient for a mixture of mobile
environment Sender primarily based end-to-end TRE
Load equalization, power optimization, information
migration => hefty masses to server Receiver
primarily based end-to-end TRE

2 .RELATED WORK

Many Redundancy Elimination techniques [3] have

been explored in recent years. A protocol freelance
Redundancy Elimination was planned in This
paper was describes a sender packet-level Traffic
Redundancy Elimination, utilization of the rule
given in several industrial Redundancy Elimination
answers that delineate in and have combined the
sender based TRE concepts with the rule and
implement approach of PACK and on with the
protocol specific optimizations technique for middlebox solution. In necessary have to be compelled to
describe the way to escape with this tripartite hand
shake between the sender half and additionally the
receiver half if any full state synchronize is
maintain.TRE system for the developing world
wherever storage and WAN information measure are
scarce. Its a application primarily based and
connected middle-box replacement for the overpriced
industrial hardware. During this kind, the sender
middle-box holds back the TCP stream and sends data
signatures to the receiver middle-box. The receiver
verifies whether or not the info is found in its native
cache. information chunks that are not found in the
cache are fetched from the sender middle-box or a
near receiver middle-box. Naturally, such a theme
incurs a three-way-handshake (3WH) latency for noncached information.

2.1 Proposed System of the PACK

In this construct, we have a tendency to approach a

unique receiver aspect primarily based destinationto-destination TRE [4] answer that depends on the
ability of predictions to reject the redundant traffic
between the cloud and additionally its users. In this

Page 21

study, each receiver observes the receiving stream

and tries to compare its chunks with a antecedently
received chunk chain or a chunk chain of a short
lived native file. victimization the long-term data
chunks and information data that keep domestically,
now the receiver sends to the server predictions that
embody chunks signatures and really easy-to-verify
hints of the senders future information. On the
incoming aspect, we have a tendency to invent a
replacement historically low weight chunking theme
termed prophetical ACK unitization. Prophetical
Acknowledgement unitization is a future increased
various for Rabin process utilized by RE applications.

formerly received chain using chunk's metadata If

yes, then receiver sends a prediction -- starting point
in the byte stream, the offset and the identity of
several subsequent chunks(PRED command) Upon a
successful prediction, sender responds PRED-ACK
Then receiver copies the corresponding data from the
chunk store to its TCP buffer, according to the
corresponding sequence number Then
sender
respond by normal TCP ACK with the next
expected TCP sequence number If prediction is false,
Sender continues with normal operation

3. PACK RULE

Large size cache of chunks and also their associated

information Chunk metadata chunk's signature and
pointer to the ordered chunk For potency of
maintaining and retrieving the chunk store caching
and categorization techniques utilized new
information is received -> parsed to chunks ->
chunk\'s signature victimization SHA-1 -> chunk and
the corresponding signature are intercalary to the
chunk store.

Fig 2: The sender algorithm

Fig 1: The receiver algorithm

Upon receiving PRED msg from receiver, tries to

match it with its buffered data. Upon a hint match
sender calculates SHA-1 signature for the predicted
range then compares the result to the signature
received in the PRED msg, PRED-ACK msg is sent If
hint not matched signature operation is not performed

Arrival of new data computes the respective

signature of each chunk If match found in chunk store
then receiver determines whether it is a part of a

2014, IJSHRE All Rights Reserved

Page 22

continuation are frequently interrupted, In this turn,

forces the sender to retransmit to the raw data
transmission until a new comparison is found at the
receiver side and It reported back to the sender Side.
To that end, we have to present the Predictive ACK
hierarchal mode of operation.

5. MOTIVATING THE
BASED APPROACH.

RECEIVER

The main objective of this part is to fold and Evaluate

the potential data redundancy for most real time
applications that are most likely to reside in a cloud,
and to estimate the Predictive ACK performance and
cloud network amount of the redundancy elimination
process flow. Our process a reconducted using.
1) Video traces captured at a major Internet Service
Provider.
2) Traffic analyses from the popular social networks
and service.
3) Genuine data sets of real time works.

Fig 3: From the Stream Line to Chunk Chain

4. OPTIMIZATION
For the sake of purity, Part three presents [5] the
most vital basic version of the Predictive ACK
protocol. In this part, we have to describe the
additional options and optimization.

4.1
Adaptive
Window

Receiver

Virtual

Predictive ACK enabling the receiver side to

locally capture the sender data when a local or
temporary copy is available, thus eliminating the
requirement to send this information through the
network. In this term the receivers fetching of that
recent local data as the reception of visual data.

4.2 Cloud Server Acting as a Receiver

In a developing trend, cloud computing storage is
getting a dominant player from backup of store and
sharing of data services to the American National
Library and e -mail services. In this most of these
Services, the cloud is used often the receiver of the
data.

4.3 Hierarchal Approach

Predictive ACKs receiver side based mode is less
amount of efficient if changes in the information
are scattered. In this scenario, the prediction

2014, IJSHRE All Rights Reserved

In this we related to an average size of chunk is 8 KB

and although this algorithm allows each cloud client
can use a different type of chunk size

6. ESTIMATED CLOUD COST FOR

YOUTUBE TRAFFICTRACES
As noted earlier, although TRE reduces cloud
traffic costs, the increased [6] server computational
efforts for TRE computation result in increased
server-hours i.e. time cost. Without TRE, with PACK
and with a sender-based TRE. The cost comparison
takes into account server-hours and overall outgoing
traffic throughput, while omitting storage costs that
we found to be very similar in all the examined
setups. The baseline for this comparison is our
measurement of a single video server that outputs up
to 350 Mbps to 600 we set the cloud policy to add a
server when there is less than 0.25 CPU computation
power unemployed after its removal.

7. EVALUATION

The objective of this section is twofold: evaluating

the potential data redundancy for several
applications that are likely to reside in a cloud, and to
estimate the PACK performance and cloud costs of
the redundancy elimination process. Our evaluations
are conducted using (i) video traces

8. IMPLEMENTATION

PACK receiver -sender protocol is embedded in

TCP option Field Low overhead and compatibility
with legacy systems Keep genuine OS's TCP and

Page 23

protocol above TCP Chunking and indexing at the

client side only Decide independently on their
preferred chunk size To achieve high TRE hit-ratio,
while only negligible overhead of 0.1% Parameters
Server operational cost PACK impact on the client
CPU Chunking scheme PACK message format

8.1
Chunking
scheme

[6] Amazon Elastic Compute

http://aws.amazon.com/ec2/

Cloud

(EC2).

(fingerprinting)

XOR based rolling hash function, for fast TRE

chunking Anchors are detected by mask the at
provides on average 8KB chunk and 48bytes in the
sliding window PACK chunking is faster due to one
less XOR operation per byte

9. CONCLUSIONS

PACK a receiver based end-to-end TRE Reduce

latency and cloud operational cost Doesn't require
the server to continuously maintain client's status,
thus
enabling cloud elasticity and user mobility
Removing redundancy without applying a three-way
handshake Evaluation using wide collection of
content types Implementation maintains chains by
keeping for any chunk only the last observed
subsequent chunk in LRU fashion Extension
Statistical study of chains of chunks that would enable
multiple possibilities in both chunk order and the
corresponding predictions(more than one prediction
at a time)

10. REFERENCES
[1] E. Zohar, I. Cidon, O. Mokryn,The power of
prediction: Cloud bandwidth and cost reduction, In
Proc. SIGCOMM, pp. 8697,2011.
[2] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph,R.
Katz, A. Konwinski , G. Lee, D. Patterson, A. Rabkin, I.
Stoica, M.Zaharia,A view of cloud computing,
Commun . ACM, Vol.53, No. 4, pp. 5058,
[3] E. Zohar, I. Cidon, and O. Mokryn, PACK:
Prediction-Based Cloud Bandwidth and Cost
Reduction System. IEEE/ACM Transactions on
Networking, 01 February 2013.
[4]
M. Armbrust, A. Fox, R. Griffith, A. D.
Joseph,R.Katz, A. Konwinski, G. Lee, D. Patterson, A.
Rabkin, I. Stoica, and M. Zaharia,A view of cloud
computing, Commun. ACM, vol. 53, no. 4, pp. 5058,
2010.2010
[5] B. Aggarwal, A. Akella, A. Anand, A. Balachandran,
P. Chitnis, C. Muthukrishnan, R. Ramjee, and G.
Varghese. EndRE: An End-System Redundancy
Elimination Service for Enterprises. In Proc. of NSDI,
2010.

2014, IJSHRE All Rights Reserved

Page 24