Differentiated service

About: Differentiated service is a research topic. Over the lifetime, 5539 publications have been published within this topic receiving 105225 citations.

A Constraint-Oriented Service Creation Environment

Abstract: The challenge of this joint project was to design and implement an environment for the creation of advanced telephone services (Intelligent Network Services) on the basis of a library of basic service components going beyond standard 'clipboard-architectures' with some testing support. The novelty of our approach consists of introducing a declarative speci cation layer, which is used for the construction of the desired services according to global constraints guaranteeing executability and other consistency conditions. These constraints are the basis for an on-line veri cation via model checking during the interactive service design process. Important for the success of the method is the high performance and the availability of diagnostic information in the case of failure: Several hundred constraints must be checked in real-time, and the diagnostic information must re ect the responsible constraint violation as concisely as possible, while preserving as much of the structure of the developed service as possible. The corresponding product was presented by Siemens Nixdorf at the Telecom'95 in Geneva and will reach the market this year. Universitat Passau, Innstr. 33, D-94032 Passau (Germany), tel: +49 851 509.3090, fax: +49 851 509.3092, fsteffen,tiziana,classen,v.braung@fmi.uni-passau.de . Siemens Nixdorf Informationssysteme AG, Otto-Hahn-Ring 6, D-81739 Munich (Germany), tel: +49 89 636.42393, fax: +49 89 636.48976, rei@rust.mch.sni.de .

A Differentiated Service Two-Rate, Three-Color Marker with Efficient Handling of in-Profile Traffic

Abstract: This document describes a two-rate, three-color marker that has been in use for data services including Frame Relay services. This marker can be used for metering per-flow traffic in the emerging IP and L2 VPN services. The marker defined here is different from previously defined markers in the handling of the in-profile traffic. Furthermore, this marker doesn't impose peak-rate shaping requirements on customer edge (CE) devices. This memo provides information for the Internet community.

Decentralized Plan-Free Semantic-Based Service Composition in Mobile Networks

Abstract: The inefficiency of one-to-one matching of user requirements to a single service has given rise to service composition Service composition allows simple services to be dynamically combined into more complex services In mobile environments, service discovery and integration involves cooperation between various service nodes where reliance on a centralized service registry introduces efficiency and single point of failure problems Plan- and workflow-based composition solutions restrict service discovery to defined abstract models Semantic similarity measurements play an important role in service integration In this paper we introduce a semantic similarity and semantic nearness service composition method The objective of our work is to free service nodes from adherence to restrictive composition plans Our work also enables compositions to succeed in dynamic environments through a decentralized solution even when nodes are unaware of nearby service nodes This paper presents a service composition solution that semantically advances composition paths towards users’ needs with each service hop while guaranteeing a user-acceptable QoS level Simulation results showcase the effectiveness of the presented solution and its compatibility with underlying service discovery methods

Adaptive token bucket algorithm for fair bandwidth allocation in DiffServ networks

Abstract: We propose an adaptive token bucket algorithm for achieving proportional sharing of bandwidth among aggregate flows in differentiated service (DiffServ) networks. By observing the simulation results obtained in a study of the throughput of TCP flows in a DiffServ network, we note that the aggregate flow with a lower target rate occupies more bandwidth than its fair share, while the aggregate flow with a higher target rate gets less than its fair share. The proposed algorithm solves this unfairness problem by adjusting the target rate according to the edge-to-edge feedback information. This algorithm does not require any additional signaling protocol or measurement of pen-flow states, since it can be implemented in a distributed manner using only two-bit feedback information carried in the TCP acknowledgement. Using ns-2 simulations, we show that the proposed algorithm provides fair bandwidth sharing under various network conditions.

Combining horizontal and vertical composition of services

Abstract: Service composition is a well-established field of research in the service community. Services are commonly regarded as black boxes with well-defined interfaces that can be recursively aggregated into new services. The black-box nature of services does not only include the service implementation but also the middleware and hardware to run the services. Thus, service composition techniques are typically limited to choosing between a set of available services. In this paper we keep the black-box nature and the principle of information hiding for the service implementation, but break up services vertically. By introducing vertical service composition, we allow services to be provisioned on the right middleware when they are requested, thus making service-binding more powerful as services with the desired quality of service can be provisioned on demand. We introduce the concept of vertical service composition and present an extension to an enterprise service bus that implements the concept of vertical service composition by combining concepts from provisioning with those of (dynamic) service binding.