A New Hashing Scheme to Overcome the Problem of Overloading of Articles in Usenet

Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 166)

Abstract

Usenet is a popular distributed messaging and files sharing service. Usenet flood articles over an overlay network to fully replicate articles across all servers. However, replication of Usenet’s full content requires that each server pay the cost of receiving (and storing) over 1 Tbyte/day. This paper shows the design and implementation of Usenet database in Multilevel Hash table. A Usenet system that allows a set of cooperating sites to keep a shared, distributed copy of Usenet articles. In a standard multiple hashing scheme, each item is stored improves space utilization. This schemes open very amenable to Usenet implementation unfortunately this scheme occasionally require a large number of items to be moved to perform an insertion and deletion in Usenet database this paper shows that it is possible to significantly increase the space utilization of multiple choice hashing scheme by allowing at most one item to be moved during an insertion.

This paper represents the problems occur in this type of methods with little bit solution of them. Users may want to read, but it will not solve the problem of near exponential growth or the problems of Usenet’s backbone peers.

Keywords

Usenet Multiple Hashing scheme Overloading of articles 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sit, E., Morries, R., Frans Kaashoek, M., MIT CSAIL: Usenet DHT: A low-overhead design for usenetGoogle Scholar
  2. 2.
    Kirsch, A., Mitzenmacher, M., Member IEEE: The power of one move hashing schemes for hardwareGoogle Scholar
  3. 3.
    Akinwale, A.T., Ibharalu, F.T.: The usefulness of multilevet hash tables with multiple hash functions in large databases Google Scholar
  4. 4.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of the 18th ACM Symposium on Operating Systems Principles (October 2001)Google Scholar
  5. 5.
    Dabek, F., Sit, E., Li, J., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: Proc. of the 1st Symposium on Networked System Design and Implementation (March 2003)Google Scholar
  6. 6.
    Ganger, G.R., Kaashoek, M.F.: Embedded inodes and explicit grouping: exploiting disk bandwidth for small files. In: Proc. of the 1997 USENIX Annual Technical Conference, pp. 1–17 (January 1997)Google Scholar
  7. 7.
    Gradwell.com. Diablo statistics for news-peer.gradwell.net, http://news-peer.gradwell.net/ (accessed February 12, 2004)
  8. 8.
    Grimm, B.: Diablo statistics for newsfeed. wirehub.nl (all feeders), http://informatie.wirehub.net/news/allfeeders/ (accessed February 12, 2004)
  9. 9.
    Gschwind, T., Hauswirth, M.: NewsCache: A high performance cache implementation for Usenet news. In: Proc. of the 1999 USENIX Annual Technical Conference, pp. 213–224 (June 1999)Google Scholar
  10. 10.
    Kantor, B., Lapsley, P.: Network news transfer protocol. RFC 977, Network Working Group (February 1986) Google Scholar
  11. 11.
    Karger, D.R., Ruhl, M.: Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 288–297. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Netwin. DNews: Unix/Windows Usenet news server software, http://netwinsite.com/dnews.htm (accessed November 9, 2003)
  13. 13.
    Nixon, J., D’itri, M.: Cleanfeed: Spam filter for Usenet news servers, http://www.exit109.com/~jeremy/news/cleanfeed/ (accessed on February 15, 2004)
  14. 14.
  15. 15.
    Saito, Y., Mogul, J.C., Verghese, B.: A Usenet performance study (November 1998), http://www.research.digital.com/wrl/projects/newsbench/usenet.ps
  16. 16.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM (August 2001); An extended version appears in ACM/IEEE Trans. on NetworkingGoogle Scholar
  17. 17.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: A resilient globalscale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1) (January 2004)Google Scholar
  18. 18.
    Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a Common API for Structured Peer-to-Peer Overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 33–44. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  19. 19.
    Decandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s highly available key-value store. In: Proc. of the 21st ACM Symposium on Operating System Principles (October 2007)Google Scholar
  20. 20.
    Ford, B.: Structured streams: a new transport abstraction. In: Proc. of the 2007 ACM SIGCOMM (August 2007)Google Scholar
  21. 21.
    Freedman, M.J., Freudenthal, E., Mazières, D.: Democratizing content publication with Coral. In: Proc. of the 1st Symposium on Networked Systems Design and Implementation (March 2004)Google Scholar
  22. 22.
    Fritchie, S.L.: The cyclic news filesystem: Getting INN to do more with less. In: Proc. of the 9th LISA, pp. 99–112 (1997)Google Scholar
  23. 23.
    Ghane, S.: Diablo statistics for spool-1t2.cs.clubint.net (Top1000 #24), http://usenet.clubint.net/spool-1t2/stats/ (accessed March 18, 2008)
  24. 24.
    Ghane, S.: The official Top1000 Usenet servers page, http://www.top1000.org/ (accessed September 13, 2007)
  25. 25.
    Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google file system. In: Proc. of the 2003 19th ACM Symposium on Operating System Principles, Bolton Landing, NY (October 2003)Google Scholar
  26. 26.
    Giganews. 1 billion usenet articles (April 2007), http://www.giganews.com/blog/2007/04/1-billion-usenet-articles.html
  27. 27.
    Godfrey, P.B., Stoica, I.: Heterogeneity and load balance in distributed hash tables. In: Proc. of the 24th Conference of the IEEE Communications Society, Infocom (March 2005)Google Scholar
  28. 28.
    Gradwell.com. Diablo statistics for news-peer.gradwell.net, http://news-peer.gradwell.net/ (accessed September 30, 2007)
  29. 29.
    Gray, J., Mcjones, P., Blasgen, M., Lindsay, B., Lorie, R., Price, T., Putzolu, F., Traiger, I.: The recovery manager of the System R database manager. ACM Computing Surveys 13(2), 223–242 (1981)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Monika Saxena
    • 1
  • Praneet Saurabh
    • 1
  • Bhupendra Verma
    • 1
  1. 1.Technocrats Institute of TechnologyBhopalIndia

Personalised recommendations