Efficient Multicast Delivery for Data Redundancy Minimization over Wireless Data Centres

Authors(2) :-A. Sudalaimani, D. Stalin David

With the explosive growth of cloud-based services, large-scale data canters are widely built for housing critical computing resources to gain significant economic benefits .In data centres, the cloud services are generally accomplished by multicast –based group communications. Recently ,many well-known industries, such as Microsoft,google and IBM,adopt high speed wireless technologies to augment network capacity in data centers.However,those well-known multicast delivery schemes for traditional wired data centers.We prove the problem are NP-hard and propose efficient heuristic algorithms for the two problems. Based on real traces and practical settings obtained from commercial data centers,a series of experiment conducted and the experimental results show that our proposed algorithm are effective for reducing multicast data traffic. The results also provide useful insights into the design of multicast tree construction and maintenance for wireless data canter networks. Cloud data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. Therefore it is essential to develop efficient and reliable cipher text search techniques. In this paper, a hierarchical clustering method is proposed to support more semantistics and also meet the command for fast cipher text search with in a big data environment. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold. The results show that with a sharp increase of documents in the data set. The search time of the proposed method increases exponentially.Furthermore, the proposed method has advantage over the traditional method in the rank privacy and relevance of retrieved documents. However, Bandwidth constraints may restrict the number of reference views sent to clients, limiting the quality of the synthesized viewpoints. In this work, we study the problem of in-network reference view synthesis aimed at improving the navigation quality at the clients. We consider a distributed cloud network architecture, where data stored in a main cloud is delivered to end users with the help of cloudlets, i.e., resource-rich proxies close to the users. We argue that, in case of limited bandwidth from the cloudlet to the users, re-sampling at the could let the viewpoints of the 3D scene (i.e., synthesizing novel virtual views in the cloudlets to be used as new references to the decoder) is beneficial compared to mere sub sampling of the original set of camera views. We therefore cast a new reference view selection problem that seeks the subset of views minimizing the distortion over a view navigation window defined by the user under bandwidth constraints.

Authors and Affiliations

A. Sudalaimani
Department of M. Sc(Software Engineering), PSN College of Engineering & Technology, Tirunelveli, Tamilnadu, India
D. Stalin David
Department of M. Sc(Software Engineering), PSN College of Engineering & Technology, Tirunelveli, Tamilnadu, India

PrefDB, data, SQL, Query parser, tuples.

  1. Giuseppe Ateniese, "Provable Data Possession at Untrusted Stores", Proc. of ACM Conference on Computer and Comm. Security (CCS), 2007.
  2. Ari Juels and Burton S. Kaliski Jr, "Pors: Proofs of Retrievability for Large Files", Proc. of ACM Conference on Computer and Comm. Security (CCS), pp. 584-597, 2007.
  3. Hovav Shacham and Brent Waters, "Compact Proofs of Retrievability, " International Conf. on Theory and Application of Cryptology and Information Security: Advances in Cryptology, pp. 90-107, 2008.
  4. Giuseppe Ateniese, "Scalable and Efficient Provable Data Possession", International Conf. on Security and Privacy in Comm. Networks (SecureComm), 2008.
  5. C. Chris Erway, Alptekin Kupcu, Charalampos Papamanthou, Roberto Tamassia, "Dynamic Provable Data Possession", ACM International Conf. on Computer and Comm. Security (CCS), 2009.
  6. Qian Wang, Cong Wang, Kui Ren, Wenjing Lou and Jin Li, "Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing", IEEE Transaction on Parallel and Distributed System, vol. 22, no. 5, pp. 847 859, 2011.
  7. Cong Wang, S. M. Chow, Qian Wang, Kui Ren and Wenjing Lou, "Privacy-Preserving Public Auditing for Secure Cloud Storage", IEEE Transaction on Computers, Vol. 62, no. 2, 2013.
  8. Sarah Shaikh, Deepali Vora, "Review of Privacy Preserving Auditing Techniques", International Journal of Computer Applications (0975- 887), Volume 145  No. 13, July 2016.
  9. T S Khatri, G B Jethava "Improving Dynamic Data Integrity Verification in Cloud Computing", 4th IEEE ICCCNT 2013.
  10. S. V. Baghel, D. P. Theng " A Survey for Secure Communication of Cloud Third Party Authenticator ", 2nd International Conference on Electronics and Communication Systems, IEEE ICECS ‘2015.
  11. ElGamal Cryptosystem, http://lxmayr1. informatik. tu- muenchen. de/konferenzen/Jass05/courses/1/papers/meier_paper. pdf

Publication Details

Published in : Volume 2 | Issue 2 | March-April 2017
Date of Publication : 2017-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 751-757
Manuscript Number : CSEIT1722229
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

A. Sudalaimani, D. Stalin David, "Efficient Multicast Delivery for Data Redundancy Minimization over Wireless Data Centres", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 2, pp.751-757, March-April-2017.
Journal URL : http://ijsrcseit.com/CSEIT1722229

Article Preview