Learning Patterns Through Online And Offline By Using Cloudy Knapsack Algorithm

Authors(2) :-T. Sruthi, K. Sunitha

Offloading of assignments to the cloud is one of the ways to deal with enhance the execution of circulated applications. At the point when financial imperatives are available, choice of the errands to be offloaded winds up essential keeping in mind the end goal to guarantee effective utilization of the accessible cloud assets. This turns into a test for huge scale disseminated applications as the choices on offloading must be made locally at the hubs without a correct worldwide perspective of the framework. In our prior work, we demonstrated this test as another class of formal issues named overcast rucksack issue and inferred some hypothetical limits on the arrangement space for most pessimistic scenario undertaking arrangements. In numerous certifiable applications, the errand successions have innate examples which can be misused to enhance offloading. In this work, we propose a cloud offloading calculation that endeavors these examples through disconnected and internet learning. Test assessment utilizing practical datasets for a cloud-helped distributed inquiry contextual analysis uncovers that the proposed arrangement performs near a theoretical omniscient offloading calculation having a total perspective of the framework. The proposed cloud-helped distributed internet searcher gives a practical way to deal with address versatility bottleneck in shared web crawlers.

Authors and Affiliations

T. Sruthi
Department of MCA, Mother Theresa Institute of Computer Applications, Palamaner, India
K. Sunitha
Department of MCA, Mother Theresa Institute of Computer Applications, Palamaner, India

cloud computing, peer-to-peer, cloud-assisted, search

  1. B.-G. Chun and P. Maniatis, "Augmented smartphone applications through clone cloud execution," in Proceedings of the 12th Conference on Hot Topics in Operating Systems, ser. HotOS’09. Berkeley, CA, USA: USENIX Association, 2009, pp. 8-8.
  2. R. Kemp, N. Palmer, T. Kielmann, and H. Bal, "Cuckoo: A computation offloading framework for smartphones," in Mobile Computing, Applications, and Services. Springer Berlin Heidelberg, 2012, vol. 76, pp. 59-79.
  3. S. Kosta, A. Aucinas, P. Hui, R. Mortier, and X. Zhang, "Thinkair: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading," in INFOCOM, 2012 Proceedings IEEE, March 2012, pp. 945-953.
  4. A. Montresor and L. Abeni, "Cloudy weather for p2p, with a chance of gossip," in Peer-to-Peer Computing (P2P), 2011 IEEE International Conference on, Aug 2011, pp. 250-259.
  5. R. Sweha, V. Ishakian, and A. Bestavros, "Angels in the cloud: A peer-assisted bulk-synchronous content distribution service," ser. IEEE CLOUD ’11. Washington, DC, USA: IEEE Computer Society, 2011, pp. 97-104.
  6. X. Jin and Y.-K. Kwok, "Cloud assisted p2p media streaming for bandwidth constrained mobile subscribers," in Parallel and Distributed Systems (ICPADS), 2010 IEEE 16th International Conference on, Dec 2010, pp. 800-805.
  7. H. Haridas, S. Kailasam, and J. Dharanipragada, "Cloudy knapsack problems: An optimization model for distributed cloudassisted systems," in Peer-to-Peer Computing (P2P), 14-th IEEE International Conference on, Sept 2014, pp. 1-5.
  8. Y. Wen, W. Zhang, and H. Luo, "Energy-optimal mobile application execution: Taming resource-poor mobile devices with cloud clones," in INFOCOM, 2012 Proceedings IEEE, March 2012, pp. 2716-2720.
  9. H. Flores, S. N. Srirama, and C. Paniagua, "Towards mobile cloud applications: Offloading resource-intensive tasks to hybrid clouds," International Journal of Pervasive Computing and Communications, vol. 8, no. 4, pp. 344-367, Apr. 2012.
  10. A. Payberah, H. Kavalionak, V. Kumaresan, A. Montresor, and S. Haridi, "Clive: Cloud-assisted p2p live streaming," in Peer-toPeer Computing (P2P), 2012 IEEE 12th International Conference on, Sept 2012, pp. 79-90.
  11. G. S. Lueker, "Average-case analysis of off-line and on-line knapsack problems," Journal of Algorithms, vol. 29, no. 2, pp. 277-305, 1998.
  12. Y. Zhou, D. Chakrabarty, and R. Lukose, "Budget constrained bidding in keyword auctions and online knapsack problems," in Proceedings of the 17th International Conference on World Wide Web, ser. WWW ’08. New York, NY, USA: ACM, 2008, pp. 1243-1244.
  13. A. Marchetti-Spaccamela and C. Vercellis, "Stochastic on-line knapsack problems," Math. Program., vol. 68, no. 1, pp. 73-104, Jan. 1995.
  14. A. S. Tigelaar, D. Hiemstra, and D. Trieschnigg, "Peer-to-peer information retrieval: An overview," ACM Trans. Inf. Syst., vol. 30, no. 2, pp. 9:1-9:34, May 2012.
  15. J. Risson and T. Moors, "Survey of research towards robust peerto-peer networks: Search methods," Computer Networks, vol. 50, pp. 3485-3521, 2006.
  16. P. Reynolds and A. Vahdat, "Efficient peer-to-peer keyword searching," in Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware, ser. Middleware ’03. New York, NY, USA: Springer-Verlag New York, Inc., 2003, pp. 21-40.
  17. G. Skobeltsyn, T. Luu, I. P. Zarko, M. Rajman, and K. Aberer, "Web text retrieval with a p2p query-driven index," in SIGIR, 2007.
  18. H. Chen, H. Jin, L. Chen, Y. Liu, and L. M. Ni, "Optimizing bloom filter settings in peer-to-peer multikeyword searching," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 4, pp. 692-706, 2012.
  19. J. Zhang and T. Suel, "Efficient query evaluation on large textual collections in a peer-to-peer environment," in Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, ser. P2P ’05. Washington, DC, USA: IEEE Computer Society, 2005, pp. 225-233.
  20. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for internet applications," Networking, IEEE/ACM Transactions on, vol. 11, no. 1, pp. 17-32, Feb 2003.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-03-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 405-409
Manuscript Number : CSEIT184110
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

T. Sruthi, K. Sunitha, "Learning Patterns Through Online And Offline By Using Cloudy Knapsack Algorithm", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.405-409, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT184110

Article Preview

Follow Us

Contact Us