COST REDUCTION MECHANISM IN CLOUD USING PACK COST REDUCTION MECHANISM IN CLOUD USING PACK GUIDE PROJECT BY Dr. J.JAGADEESAN AVAYAMBIGAI.J SANTHI.K.S PARIMALA.S.

Slides:



Advertisements
Similar presentations
The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
Advertisements

A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Abstract There is significant need to improve existing techniques for clustering multivariate network traffic flow record and quickly infer underlying.
Hello i am so and so, title/role and a little background on myself (i.e. former microsoft employee or anything interesting) set context for what going.
Secure Data Storage in Cloud Computing Submitted by A.Senthil Kumar( ) C.Karthik( ) H.Sheik mohideen( ) S.Lakshmi rajan( )
Chapter 4 Infrastructure as a Service (IaaS)
INTRODUCTION TO CLOUD COMPUTING CS 595 LECTURE 6 2/13/2015.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
REDUNDANCY IN NETWORK TRAFFIC: FINDINGS AND IMPLICATIONS Ashok Anand Ramachandran Ramjee Chitra Muthukrishnan Microsoft Research Lab, India Aditya Akella.
Presented by Tianhe Wang. Mobile applications: People send/receive messages using wireless network much more frequently. Multimedia messages are often.
Introduction Dr. Ying Lu CSCE455/855 Distributed Operating Systems.
1 Manpreet Singh, Prashant Pradhan* and Paul Francis * MPAT: Aggregate TCP Congestion Management as a Building Block for Internet QoS.
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
Presenter: Vikash Nath MCP, CCNA, MCTS. On-Premise Private Cloud Public Cloud Hybrid Cloud.
SPRING 2011 CLOUD COMPUTING Cloud Computing San José State University Computer Architecture (CS 147) Professor Sin-Min Lee Presentation by Vladimir Serdyukov.
SharePoint Portal Server 2003 JAMES WEIMHOLT WEIDER HAO JUAN TURCIOS BILL HUERTA BRANDON BROWN JAMES WEIMHOLT INTRODUCTION OVERVIEW IMPLEMENTATION CASE.
Internet GIS. A vast network connecting computers throughout the world Computers on the Internet are physically connected Computers on the Internet use.
Customer Sales Presentation Stoneware webNetwork Powered by ThinkServer.
Abstract Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement.
Construction of efficient PDP scheme for Distributed Cloud Storage. By Manognya Reddy Kondam.
Abstract Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more.
Adam Leidigh Brandon Pyle Bernardo Ruiz Daniel Nakamura Arianna Campos.
WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.
Cloud Computing Saneel Bidaye uni-slb2181. What is Cloud Computing? Cloud Computing refers to both the applications delivered as services over the Internet.
Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.
CLOUD COMPUTING. What is cloud computing ? History Virtualization Cloud Computing hardware Cloud Computing services Cloud Architecture Advantages & Disadvantages.
Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.
Cloud Computing. What is Cloud Computing? Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable.
Privacy-Preserving Public Auditing for Secure Cloud Storage
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
Module 8 Configuring Mobile Computing and Remote Access in Windows® 7.
Introduction to Cloud Computing
Improving Network I/O Virtualization for Cloud Computing.
LOGO Service and network administration Storage Virtualization.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System
Optimal Client-Server Assignment for Internet Distributed Systems.
Identity-Based Secure Distributed Data Storage Schemes.
On the use of Reliable Multicast for Content Distribution Vassilis Chatzigiannakis
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems.
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
An Architecture for Distributed High Performance Video Processing in the Cloud 作者 :Pereira, R.; Azambuja, M.; Breitman, K.; Endler, M. 出處 :2010 IEEE 3rd.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
EndRE: An End-System Redundancy Elimination Service Bhavish Aggarwal, Aditya Akella, Ashok Anand, Athula Balachandran, Pushkar Chitnis, Chitra Muthukrishnan,
1 NETE4631 Course Wrap-up and Benefits, Challenges, Risks Lecture Notes #15.
Kiew-Hong Chua a.k.a Francis Computer Network Presentation 12/5/00.
Document Clustering for Forensic Analysis: An Approach for Improving Computer Inspection.
Plethora: A Wide-Area Read-Write Storage Repository Design Goals, Objectives, and Applications Suresh Jagannathan, Christoph Hoffmann, Ananth Grama Computer.
BZUPAGES.COM Presentation on TCP/IP Presented to: Sir Taimoor Presented by: Jamila BB Roll no Nudrat Rehman Roll no
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
SECURING SELF-VIRTUALIZING ETHERNET DEVICES IGOR SMOLYAR, MULI BEN-YEHUDA, AND DAN TSAFRIR PRESENTED BY LUREN WANG.
DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.
CLOUD COMPUTING. What is cloud computing ? History Virtualization Cloud Computing hardware Cloud Computing services Cloud Architecture Advantages & Disadvantages.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Harnessing the Cloud for Securely Outsourcing Large- Scale Systems of Linear Equations.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
CLOUD COMPUTING AND LESSONS FROM THE PAST Presented By Sanjana Malhotra.
Privacy-Preserving and Content-Protecting Location Based Queries.
Energy-Efficient Protocol for Cooperative Networks.
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud.
Tackling I/O Issues 1 David Race 16 March 2010.
Load Rebalancing for Distributed File Systems in Clouds.
Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.
BY S.S.SUDHEER VARMA (13NT1D5816)
Distributed Cache Technology in Cloud Computing and its Application in the GIS Software Wang Qi Zhu Yitong Peng Cheng
Towards Scalable Traffic Management in Cloud Data Centers
Department Of Computer Science Engineering
NYMBLE: BLOCKING MISBEHAVING USERS IN ANONYMIZING NETWORKS
Presentation transcript:

COST REDUCTION MECHANISM IN CLOUD USING PACK COST REDUCTION MECHANISM IN CLOUD USING PACK GUIDE PROJECT BY Dr. J.JAGADEESAN AVAYAMBIGAI.J SANTHI.K.S PARIMALA.S PRAKASH.C

CONTENT 1. INTRODUCTION 2. ABSTRACT 3. EXISTING SYSTEM 4. PROPOSED 5. SYSTEM REQUIREMENTS 6. CONCLUSION 7. REFERENCES

INTRODUCTION Cloud computing offers its customers an economical and convenient pay as you go service model, known also as usage-based Pricing. Cloud customers pay only for the actual use of computing resources, storage and bandwidth, according to their changing needs, utilizing the cloud’s scalable and elastic computational capabilities. Consequently, cloud customers, applying a judicious use of the cloud’s resources, are motivated to use various traffic reduction techniques, in particular Traffic Redundancy Elimination (TRE), for reducing bandwidth costs. In this Presentation, we show that cloud elasticity calls for a new TRE solution that does not require the server to continuously maintain clients’ status.

ABSTRACT In this PPT, we present PACK (Predictive ACKs), a novel end-to- end Traffic Redundancy Elimination (TRE) system, designed for cloud computing customers. PACK very suitable for pervasive computation environments that combine client mobility and server migration to maintain cloud elasticity. PACK is based on a novel TRE technique, which allows the client to use newly received chunks to identify previously received chunk chains, which in turn can be used as reliable predictors to future transmitted chunks.

EXISTING SYSTEM TRE is used to eliminate the transmission of redundant content and, therefore, to significantly reduce the network cost. In most common TRE solutions, both the sender and the receiver examine and compare signatures of data chunks, parsed according to the data content prior to their transmission. When redundant chunks are detected, the sender replaces the transmission of each redundant chunk with its strong signature. Commercial TRE solutions are popular at enterprise networks, and involve the deployment of two or more proprietary protocol, state synchronized middle-boxes at both the intranet entry points of data centers and branch offices, eliminating repetitive traffic between them. Example : Riverbed solution which will compress the data before sending.

Problem in Existing Setup While proprietary middle-boxes (such as riverbed, Silver peak) are popular point solutions within enterprises, they are not as attractive in a cloud environment. First, cloud providers cannot benefit from a technology whose goal is to reduce customer bandwidth bills, and thus are not likely to invest in one. Moreover, a fixed client-side and server-side middle-box pair solution is inefficient for a combination of a mobile environment, which detaches the client from a fixed location, and cloud-side elasticity which motivates work distribution and migration among data centers. Therefore, it is commonly agreed that a universal, software-based, end- to-end TRE is crucial in today’s pervasive environment

PROSPOSED SYSTEM We propose a new computationally light-weight chunking (fingerprinting) scheme termed PACK chunking. PACK is a novel receiver-based end-to-end TRE solution that relies on the power of predictions to eliminate redundant traffic between the cloud and its end-users. In this solution each receiver observes the incoming stream and tries to match its chunks with a previously received chunk chain or a chunk chain of a local file. To validate the receiver-based TRE concept, we implemented, tested and performed realistic experiments with PACK within a cloud environment.

MODULES DATA OWNER PACK ALGORITHM CLOUD SERVER RECEIVER

SYSTEM REQUIREMENTS Hardware Requirements: System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Memory: 512 Mb. Software Requirements Front End : Java(JSP) Back End: SQL Server 2005 Operating System : Windows XP/07 IDE:Net Beans

REFERENCES [1] 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, [2] Amazon Elastic Compute Cloud (EC2). [3] S. Mccanne and M. Demmer. Content-Based Segmentation Scheme for Data Compression in Storage and Transmission Including Hierarchical Segment Representation. US Patent , December Filed: December [4] A. Medina, M. Allman, and S. Floyd. Measuring the evolution of transport protocols in the Internet. ACM Computer Communication Review, 35(2):37–52, [5] T. Spring and D. Wetherall. A Protocol-Independent Technique for Eliminating Redundant Network Traffic. In Proc. of SIGCOMM, volume 30, pages 87–95, New York, NY, USA, ACM.

CONCLUSION There is a rising need for a TRE solution that reduces the cloud’s operational cost, while accounting for application latencies, user mobility and cloud elasticity. In this project work, we have presented PACK, a receiver-based, cloud friendly end-to-end TRE which is based on novel speculative principles that reduce latency and cloud operational cost. Two interesting future extensions can provide additional benefits to the PACK concept. First, our implementation maintains chains by keeping for any chunk only the last observed subsequent chunk in a LRU fashion. An interesting extension to this work is the statistical study of chains of chunks that would enable multiple possibilities in both the chunk order and the corresponding predictions. The system may also allow making more than one prediction at a time and it is enough that one of them will be correct for successful traffic elimination. A second promising direction is the mode of operation optimization of the hybrid sender-receiver approach based on shared decisions derived from receiver’s power or server’s cost changes.