Skip to main content
SpringerLink
Log in

An efficient and scalable ubiquitous storage scheme for delay-sensitive IT applications

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Ubiquitous storage services oriented to social networks need timely responses to users’ requests and high scalability with the increasingly size of storage systems. In this paper, we propose a virtual node based ring-like storage system architecture and data placement scheme for delay-sensitive ubiquitous applications. For improving the fault-tolerant ability of the storage service, we design a data replication approach based on a quorum-fault-tolerant state machine protocol. Moreover, we investigate a three-layered messaging protocol based on the heartbeat mechanism to detect the node failure and maintain the ring topology. The theoretic analysis and experiment results demonstrate the feasibility and high operation efficiency of our ubiquitous storage scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Celik, N., Nageshwaraniyer, S. S., & Son, Y. J. (2010). Impact of information sharing in hierarchical decision-making framework in manufacturing supply chains. Journal of Intelligent Manufacturing, online.

  • Chockler G., Guerraoui R., Keidar I. et al (2009) Reliable distributed storage. Computer, 42(4): 60–67

    Article  Google Scholar 

  • Decandia, G., Hastorun, D., Jampani, M., et al. (2007). Dynamo: Amazon’s highly available key-value store. In Proceedings of twenty-first ACM SIGOPS symposium on operating systems principles (SOSP ‘07) (pp. 205–220). New York, USA: ACM Press, 2007.

  • Gholami M., Zandieh M. (2009) Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop. Journal of Intelligent Manufacturing 20: 481–498

    Article  Google Scholar 

  • Greer K., Stewart J. R., McCollum B. (2008) Comparison of a centralised and distributed approach for a generic scheduling system. Journal of Intelligent Manufacturing 19: 119–129

    Article  Google Scholar 

  • Gupta, I., Birman, K., Linga, P., et al. (2003). Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In Proceedings of 2nd international workshop on peer-to-peer systems (IPTPS ‘03), 2003.

  • Jepson T. C. (2004) The basics of reliable distributed storage networks. IT Professional 6(3): 18–24

    Article  Google Scholar 

  • Karger, D., Lehman, E., Leighton, T., et al. (1997). Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of ACM symposium on theory of computing, May 1997, pp. 654–663.

  • Marcelm-Jimenez R., Rajsbaum S., Stevens B. (2006) Cyclic storage for fault-tolerant distributed executions. IEEE Transactions on Parallel and Distributed Systems 17(9): 1028–1036

    Article  Google Scholar 

  • Park J. H., Lee S., Lim J., Yang L. T. (2009) U-HMS: Hybrid system for secure intelligent multimedia data services in Ubi-Home. Journal of Intelligent Manufacturing 20: 337–346

    Article  Google Scholar 

  • Ramakrishnan K. K., Emer J. S. (1989) Performance analysis of mass storage service alternatives for distributed systems. IEEE Transactions on Software Engineering 15(2): 120–133

    Article  Google Scholar 

  • Ramasubramanian, V., & Sirer, E. G. (2004). Beehive: O(1)lookup performance for power-law query distributions in peer-topeer overlays. In Proceedings of the 1st conference on symposium on networked systems design and implementation, San Francisco, CA, March 29–31, 2004.

  • Renesse, R. V., Minsky, Y., & Hayden, M. (1998). A gossip-style failure detection service. Technical Report, TR98–1687.

  • Rowstron, A., & Druschel, P. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Lecture notes in computer science, Vol. 2218, pp. 329–350, 2001.

  • Satyanarayanan M., Kistler J. J., Kumar P. (1990) Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers 39(4): 447–459

    Article  Google Scholar 

  • Schneider F. B. (1990) Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Survey 22(4): 299–319

    Article  Google Scholar 

  • Stoica, I., Morris, R., Karger, D., et al. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM ‘01) (pp. 149–160). New York, NY, USA: ACM Press, October 2001.

  • Tian, J., Yang, Z., & Dai, Y. F. (2007). A data placement scheme with time-related model for P2P storages. In Proceedings of seventh IEEE international conference on peer-to-peer computing (P2P 2007), 2007, pp. 151–158.

  • Wan, Y. P., Luo, Y., & Liu, L. (2009). A dynamic failure detector for P2P storage system. In Proceedings of 2009 international conference on new trends in information and service science (pp. 15–19). Beijing, China, June 30-July 02, 2009.

  • Yamamoto H., Maruta D., Oie Y. J. (2006) Replication methods for load balancing on distributed storages in P2P networks. IEICE Transactions on Information and Systems E89-D(1): 171–180

    Article  Google Scholar 

  • Yang, C. T., Chen, H. Y., Huang, C. L., et al. (2009). A distributed file storage with Replica management in peer-to-peer environments. In Proceedings of ninth IEEE international conference on computer and information technology (CIT ‘09), 2009, pp. 75–80.

  • Yi, S. Y., & Shin, H. (2010). A hybrid scheduling scheme for data broadcast over a single channel in mobile environments. Journal of Intelligent Manufacturing, online.

  • Yiu W. P. K., Xing J., Chan S. H. G. (2007) VMesh: Distributed segment storage for peer-to-peer interactive video streaming. IEEE Journal on Selected Areas in Communications 25(9): 1717–1731

    Article  Google Scholar 

  • Zeng Z., Veeravalli B. (2008) On the design of distributed object placement and load balancing strategies in large-scale networked multimedia storage systems. IEEE Transactions on Knowledge and Data Engineering 20(3): 369–382

    Article  Google Scholar 

  • Zhao B. Y., Huang L., Stribling J. et al (2004) Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1): 41–53

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, China

    Feilong Tang, Minyi Guo & Qiang Wang

  2. School of Computer Science and Engineering, The University of Aizu, Fukushima, 965-8580, Japan

    Feilong Tang & Song Guo

Authors
  1. Feilong Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Song Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Minyi Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Feilong Tang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, F., Guo, S., Guo, M. et al. An efficient and scalable ubiquitous storage scheme for delay-sensitive IT applications. J Intell Manuf 23, 955–963 (2012). https://doi.org/10.1007/s10845-010-0496-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-010-0496-y

Keywords

Search

Navigation