Service level

About: Service level is a research topic. Over the lifetime, 7647 publications have been published within this topic receiving 126093 citations. The topic is also known as: service level.

Supply chain structures : coordination, information and optimization

Abstract: 1. Introduction and Overview Jing-Sheng Song, D.D. Yao. 2. Efficient Supply Chain Structures for Personal Computers Lingxiu Dong, H.L. Lee. 3. Intrafirm Incentives and Supply Chain Performance N. Agrawal, A.A. Tsay. 4. Impact of Manufacturing Flexibility on Supply Chain Performance S. Biller, et al. 5. The Use of Demand Information in Supply Chain Management G. Gallego, O. Ozer. 6. Supply Chain Information Sharing in a Competitive Environment Lode Li, Hongtao Zhang. 7. Planning and Scheduling in an Assemble-To-Order Environment N.J. Vandaele, M.R. Lambrecht. 8. Network Server Supply Chain at HP: A Case Study D. Beyer, J. Ward. 9. Inventory Allocation at a Semiconductor Company A.O. Brown, et al. 10. Leadtime, Inventory, and Service Level in ATO Systems Yashan Wang. 11. Dependence Analysis of Assemble-to-Orders Systems S.H. Xu. 12. Sequences of Multi-Item Demands J.W. Mamer, S.A. Smith.

Meta-policies for distributed role-based access control systems

Abstract: In this paper meta-policies for access control policies are presented. There has been a lot of research into the various ways of specifying policy for a single domain. Such domains are autonomous and can be managed by the users or by a specific system administrator It is often helpful to have a more general policy description in order to restrict the ways in which policy can be modified. Meta-policies fill this particular role. With their help changes to policy can be made subject to predefined constraints. Meta-policies are long lived and so can provide users with stable information about the policy of the system. In addition they can provide bodies external to a domain with relevant but restricted information about its policies, so forming a basis for co-operation between domains. For example, a domain's meta-policy can function as a policy interface, thus establishing a basis for agreement on the structure of the objects accessed In this way it is possible to build service level agreements between domains automatically.

Reputation-Based service level agreements for web services

Abstract: Most web services need to be contracted through service level agreements that typically specify a certain quality of service (QoS) in return for a certain price. We propose a new form of service level agreement where the price is determined by the QoS actually delivered. We show that such agreements make it optimal for the service provider to deliver the service at the promised quality. To allow efficient monitoring of the actual QoS, we introduce a reputation mechanism. A scoring rule makes it optimal for the users of a service to correctly report the QoS they observed. Thus, we obtain a practical scheme for service-level agreements that makes it uninteresting for providers to deviate from their best effort.

Dynamic core provisioning for quantitative differentiated services

Abstract: Efficient network provisioning mechanisms that support service differentiation are essential to the realization of the Differentiated Services (DiffServ) Internet. Building on our prior work on edge provisioning, we propose a set of efficient dynamic node and core provisioning algorithms for interior nodes and core networks, respectively. The node provisioning algorithm prevents transient violations of service level agreements (SLA) by predicting the onset of service level violations based on a multiclass virtual queue measurement technique, and by automatically adjusting the service weights of weighted fair queueing schedulers at core routers. Persistent service level violations are reported to the core provisioning algorithm, which dimensions traffic aggregates at the network ingress edge. The core provisioning algorithm is designed to address the difficult problem of provisioning DiffServ traffic aggregates (i.e., rate-control can only be exerted at the root of any traffic distribution tree) by taking into account fairness issues not only across different traffic aggregates but also within the same aggregate whose packets take different routes through a core IP network. We demonstrate through analysis and simulation that the proposed dynamic provisioning model is superior to static provisioning for DiffServ in providing quantitative delay bounds with differentiated loss across per-aggregate service classes under persistent congestion and device failure conditions when observed in core networks.