IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v23y2012i2p505-535.html
   My bibliography  Save this article

SOA Performance Enhancement Through XML Fragment Caching

Author

Listed:
  • Anindya Datta

    (Department of Information Systems, National University of Singapore, Singapore)

  • Kaushik Dutta

    (Department of Information Systems, School of Computing, National University of Singapore, Singapore)

  • Qianhui Liang

    (Hewlett Packard Labs, Fusionopolis, Singapore)

  • Debra VanderMeer

    (Department of Decision Sciences and Information Systems, College of Business, Florida International University, Miami, Florida 33199)

Abstract

Organizations are increasingly choosing to implement service-oriented architectures to integrate distributed, loosely coupled applications. These architectures are implemented as services, which typically use XML-based messaging to communicate between service consumers and service providers across enterprise networks. We propose a scheme for caching fragments of service response messages to improve performance and service quality in service-oriented architectures. In our fragment caching scheme, we decompose responses into smaller fragments such that reusable components can be identified and cached in the XML routers of an XML overlay network within an enterprise network. Such caching mitigates processing requirements on providers and moves content closer to users, thus reducing bandwidth requirements on the network as well as improving service times. We describe the system architecture and caching algorithm details for our caching scheme, develop an analysis of the expected benefits of our scheme, and present the results of both simulation and case study-based experiments to show the validity and performance improvements provided by our caching scheme. Our simulation experimental results show an up to 60% reduction in bandwidth consumption and up to 50% response time improvement. Further, our case study experiments demonstrate that when there is no resource bottleneck, the cache-enabled case reduces average response times by 40%--50% and increases throughput by 150% compared to the no-cache and full message caching cases. In experiments contrasting fragment caching and full message caching, we found that full message caching provides benefits when the number of possible unique responses is low while the benefits of fragment caching increase as the number of possible unique responses increases. These experimental results clearly demonstrate the benefits of our approach.

Suggested Citation

  • Anindya Datta & Kaushik Dutta & Qianhui Liang & Debra VanderMeer, 2012. "SOA Performance Enhancement Through XML Fragment Caching," Information Systems Research, INFORMS, vol. 23(2), pages 505-535, June.
  • Handle: RePEc:inm:orisre:v:23:y:2012:i:2:p:505-535
    DOI: 10.1287/isre.1110.0368
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/isre.1110.0368
    Download Restriction: no

    File URL: https://libkey.io/10.1287/isre.1110.0368?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kaushik Dutta & Samit Soni & Sridhar Narasimhan & Anindya Datta, 2006. "Optimization in Object Caching," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 243-254, May.
    2. Anindya Datta & Kaushik Dutta & Helen Thomas & Debra VanderMeer, 2003. "World Wide Wait: A Study of Internet Scalability and Cache-Based Approaches to Alleviate It," Management Science, INFORMS, vol. 49(10), pages 1425-1444, October.
    3. Kartik Hosanagar & Ramayya Krishnan & John Chuang & Vidyanand Choudhary, 2005. "Pricing and Resource Allocation in Caching Services with Multiple Levels of Quality of Service," Management Science, INFORMS, vol. 51(12), pages 1844-1859, December.
    4. Vijay S. Mookerjee & Yong Tan, 2002. "Analysis of a Least Recently Used Cache Management Policy for Web Browsers," Operations Research, INFORMS, vol. 50(2), pages 345-357, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kartik Hosanagar & Yong Tan, 2012. "Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching," Information Systems Research, INFORMS, vol. 23(2), pages 356-375, June.
    2. Yonghua Ji & Subodha Kumar & Vijay Mookerjee, 2016. "When Being Hot Is Not Cool: Monitoring Hot Lists for Information Security," Information Systems Research, INFORMS, vol. 27(4), pages 897-918, December.
    3. Kartik Hosanagar & Ramayya Krishnan & John Chuang & Vidyanand Choudhary, 2005. "Pricing and Resource Allocation in Caching Services with Multiple Levels of Quality of Service," Management Science, INFORMS, vol. 51(12), pages 1844-1859, December.
    4. Mohit Tawarmalani & Karthik Kannan & Prabuddha De, 2009. "Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses," Management Science, INFORMS, vol. 55(1), pages 132-147, January.
    5. Yong Tan & Yonghua Ji & Vijay S. Mookerjee, 2006. "Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 506-522, November.
    6. Mehran Garmehi & Morteza Analoui & Mukaddim Pathan & Rajkumar Buyya, 2015. "An economic mechanism for request routing and resource allocation in hybrid CDN–P2P networks," International Journal of Network Management, John Wiley & Sons, vol. 25(6), pages 375-393, November.
    7. Arthur M. Geoffrion & Ramayya Krishnan, 2003. "E-Business and Management Science: Mutual Impacts (Part 2 of 2)," Management Science, INFORMS, vol. 49(11), pages 1445-1456, November.
    8. Arthur M. Geoffrion & Ramayya Krishnan, 2003. "E-Business and Management Science: Mutual Impacts (Part 1 of 2)," Management Science, INFORMS, vol. 49(10), pages 1275-1286, October.
    9. Kartik Hosanagar & John Chuang & Ramayya Krishnan & Michael D. Smith, 2008. "Service Adoption and Pricing of Content Delivery Network (CDN) Services," Management Science, INFORMS, vol. 54(9), pages 1579-1593, September.
    10. Zhang, Zhongju & Fan, Weiguo, 2008. "Web server load balancing: A queueing analysis," European Journal of Operational Research, Elsevier, vol. 186(2), pages 681-693, April.
    11. Chia-Wei Kuo & Kwei-Long Huang & Chao-Lung Yang, 2017. "Optimal contract design for cloud computing service with resource service guarantee," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1030-1044, September.
    12. Abhijit Dutt & Hemant Jain & Sanjeev Kumar, 2018. "Providing Software as a Service: a design decision(s) model," Information Systems and e-Business Management, Springer, vol. 16(2), pages 327-356, May.
    13. Elias Vathias & Eleftheria Katsarou & Stathes Hadjiefthymiades, 2017. "A secondary market metaphor for content delivery networks," Netnomics, Springer, vol. 18(2), pages 183-214, December.
    14. E. Borgonovo & L. Peccati, 2011. "Managerial insights from service industry models: a new scenario decomposition method," Annals of Operations Research, Springer, vol. 185(1), pages 161-179, May.
    15. Hemant K. Bhargava & Vidyanand Choudhary, 2008. "Research Note--When Is Versioning Optimal for Information Goods?," Management Science, INFORMS, vol. 54(5), pages 1029-1035, May.
    16. Doukidis, Georgios I. & Pramatari, Katerina & Lekakos, Georgios, 2008. "OR and the management of electronic services," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1296-1309, June.
    17. Dengpan Liu & Subodha Kumar & Vijay S. Mookerjee, 2012. "Advertising Strategies in Electronic Retailing: A Differential Games Approach," Information Systems Research, INFORMS, vol. 23(3-part-2), pages 903-917, September.
    18. Yang Yu & Ray Qing Cao & Dara Schniederjans, 2017. "Cloud computing and its impact on service level: a multi-agent simulation model," International Journal of Production Research, Taylor & Francis Journals, vol. 55(15), pages 4341-4353, August.
    19. Elias Vathias & Stathes Hadjiefthymiades, 2021. "A stock options metaphor for content delivery networks," Netnomics, Springer, vol. 22(2), pages 195-230, December.
    20. Elias Vathias & Stathes Hadjiefthymiades, 2022. "A stock options metaphor for content delivery networks," Netnomics, Springer, vol. 22(2), pages 195-230, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orisre:v:23:y:2012:i:2:p:505-535. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.