HORIZON: a Classification and Comparison Framework for Pricing-driven Feature Toggling
- URL: http://arxiv.org/abs/2503.21448v1
- Date: Thu, 27 Mar 2025 12:40:10 GMT
- Title: HORIZON: a Classification and Comparison Framework for Pricing-driven Feature Toggling
- Authors: Alejandro García-Fernández, Jose Antonio Parejo, Antonio Ruiz-Cortés,
- Abstract summary: This paper introduces HORIZON, a framework for feature toggling tools tailored to pricing-driven environments.<n>It lays the groundwork for a focused research agenda guiding the development of more robust and adaptable solutions.
- Score: 45.777054792526
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Software as a Service (SaaS) has seen rapid growth in recent years, thanks to its ability to adapt to diverse user needs through subscription-based models. However, as pricing models enhance the customization of subscriptions, managing the associated constraints within a system's codebase becomes increasingly challenging. In response, Pricing-driven Development and Operation has emerged to integrate pricing considerations across the software lifecycle. Among its most challenging objectives is regulating feature access according to users' subscriptions -- a process that requires managing a multitude of conditions throughout the system's codebase. Feature toggles have traditionally been employed to manage dynamic system behavior, but their application to pricing-driven constraints presents unique challenges. When used to enforce subscription-based restrictions, toggles must adapt -- among other factors -- to individual user's use of features, ensuring that subscription limits are not exceeded. Despite the increasing significance of this problem, current industrial solutions lack explicit support for pricing-driven feature toggling, and existing academic contributions remain constrained to specific architectures. This paper contributes to fill this gap by introducing HORIZON, a classification and comparison framework for feature toggling tools tailored to pricing-driven environments. Its utility is demonstrated by categorizing the solutions identified in the literature as promising for such environments, revealing both their strengths and limitations, and thereby pinpointing critical avenues for improvement. In doing so, HORIZON not only provides a comprehensive view of the current landscape but also lays the groundwork for a focused research agenda, guiding the development of more robust and adaptable solutions for streamlining SaaS development and operations driven by pricings.
Related papers
- Assemble Your Crew: Automatic Multi-agent Communication Topology Design via Autoregressive Graph Generation [72.44384066166147]
Multi-agent systems (MAS) based on large language models (LLMs) have emerged as a powerful solution for dealing with complex problems across diverse domains.<n>Existing approaches are fundamentally constrained by their reliance on a template graph modification paradigm with a predefined set of agents and hard-coded interaction structures.<n>We propose ARG-Designer, a novel autoregressive model that operationalizes this paradigm by constructing the collaboration graph from scratch.
arXiv Detail & Related papers (2025-07-24T09:17:41Z) - Demystifying Feature Requests: Leveraging LLMs to Refine Feature Requests in Open-Source Software [0.2748831616311481]
This paper proposes a novel approach leveraging Large Language Models (LLMs) to detect and refine NL defects in feature requests.<n>Our approach automates the identification of ambiguous and incomplete requests and generates clarification questions (CQs) to enhance their usefulness for developers.<n>In addition, we conduct interviews with GitHub developers to gain deeper insights into their perceptions of NL defects.
arXiv Detail & Related papers (2025-07-17T22:16:13Z) - From Static to Intelligent: Evolving SaaS Pricing with LLMs [0.8506969271292961]
This paper proposes leveraging intelligent pricing (iPricing), dynamic, machine-readable pricing models, as a solution to these challenges.<n>We present an LLM-driven approach that automates the transformation of static HTML pricing into iPricing, significantly improving efficiency and consistency while minimizing human error.<n>This work highlights the potential of automating intelligent pricing transformation to streamline pricing management, offering implications for improved consistency and scalability in an increasingly intricate pricing landscape.
arXiv Detail & Related papers (2025-07-16T10:20:14Z) - Automated Analysis of Pricings in SaaS-based Information Systems [42.8610435437513]
This paper advances the field by proposing seven analysis operations that partially or fully support these pricing management tasks.<n>The proposed approach has been implemented in a reference framework using MiniZinc, and tested with over 150 pricing models, identifying errors in 35 pricings of the benchmark.
arXiv Detail & Related papers (2025-03-27T12:36:57Z) - Fast or Better? Balancing Accuracy and Cost in Retrieval-Augmented Generation with Flexible User Control [52.405085773954596]
Retrieval-Augmented Generation (RAG) has emerged as a powerful approach to mitigate large language model hallucinations.
Existing RAG frameworks often apply retrieval indiscriminately,leading to inefficiencies-over-retrieving.
We introduce a novel user-controllable RAG framework that enables dynamic adjustment of the accuracy-cost trade-off.
arXiv Detail & Related papers (2025-02-17T18:56:20Z) - Leveraging Graph-RAG and Prompt Engineering to Enhance LLM-Based Automated Requirement Traceability and Compliance Checks [8.354305051472735]
This study demonstrates that integrating a robust Graph-RAG framework with advanced prompt engineering techniques, such as Chain of Thought and Tree of Thought, can significantly enhance performance.<n>It is both costly and more complex to implement across diverse contexts, requiring careful adaptation to specific scenarios.
arXiv Detail & Related papers (2024-12-11T18:11:39Z) - A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
We address the problem of dynamically pricing complementary items that are sequentially displayed to customers.
Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective.
We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
arXiv Detail & Related papers (2024-07-08T09:55:31Z) - LLM4Rerank: LLM-based Auto-Reranking Framework for Recommendations [51.76373105981212]
Reranking is a critical component in recommender systems, playing an essential role in refining the output of recommendation algorithms.<n>We introduce a comprehensive reranking framework, designed to seamlessly integrate various reranking criteria.<n>A customizable input mechanism is also integrated, enabling the tuning of the language model's focus to meet specific reranking needs.
arXiv Detail & Related papers (2024-06-18T09:29:18Z) - Pricing4SaaS: a suite of software libraries for pricing-driven feature toggling [42.8610435437513]
This paper introduces a novel suite of software libraries named Pricing4SaaS.
It is designed to facilitate the implementation of pricing-driven feature toggles in both the front-end and back-end of systems.
We present a case study based on the popular Spring PetClinic project to illustrate how the suite can be leveraged to optimize developer productivity.
arXiv Detail & Related papers (2024-03-20T22:08:41Z) - Large Language Model Meets Graph Neural Network in Knowledge Distillation [7.686812700685084]
We propose a temporal-aware framework for predicting Quality of Service (QoS) in service-oriented architectures.
Our proposed TOGCL framework significantly outperforms state-of-the-art methods across multiple metrics, achieving improvements of up to 38.80%.
arXiv Detail & Related papers (2024-02-08T18:33:21Z) - CoreDiag: Eliminating Redundancy in Constraint Sets [68.8204255655161]
We present a new algorithm which can be exploited for the determination of minimal cores (minimal non-redundant constraint sets)
The algorithm is especially useful for distributed knowledge engineering scenarios where the degree of redundancy can become high.
In order to show the applicability of our approach, we present an empirical study conducted with commercial configuration knowledge bases.
arXiv Detail & Related papers (2021-02-24T09:16:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.