Differentiated service

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

Dynamic resource management considering the real behavior of aggregate traffic

Abstract: This paper explains why the theory of effective bandwidth is in general not applicable to characterize realistic traffic sources. Moreover, we show that a static allocation of network resources (bandwidth and/or buffer space) based on large deviation theory can be highly inefficient when the real statistical behavior of traffic is taken into account. As an alternative, we propose a dynamic resource management scheme based on prediction techniques. As a specific example, we apply this scheme to a Differentiated Service (DiffServ) Internet environment, in which the goal, besides policing the incoming traffic, is to optimize the use of network resources, thus minimizing the probability of occurrence of violations of contract guarantees. The performance of the proposed scheme is evaluated via simulations and our results show the superior performance of the new algorithm in terms of buffer overflows, output link utilization, and jitter, as compared to currently used policing and shaping mechanisms.

Per Hop Behaviors Based on Dynamic Packet State

Abstract: This document proposes a family of Per Hop Behaviors (PHBs) based on Dynamic Packet State (DPS) in the context of the differentiated service architecture. With these PHBs, distributed algorithms can be devised to implement services with flexibility, utilization, and assurance levels similar to those that can be provided with per flow mechanisms. With Dynamic Packet State, each packet carries in its header, in addition to the PHB codepoint, some PHB-specific state. The state is initialized by the ingress node. Interior nodes process each incoming packet based on the state carried in the packet's header, updating both its internal state and the state in the packet's header before forwarding it to the next hop. By using DPS to coordinate actions of edge and interior nodes along the path traversed by a flow, distributed algorithms can be designed to approximate the behavior of a broad class of "stateful" networks using networks in which interior nodes do not maintain per flow state. We give examples of services that can be implemented by PHBs based on DPS. We also discuss several possible solutions for encoding Dynamic Packet State that have the minimum incompatibility with IPv4.

Cooperative call processing across public and private intelligent networks

Abstract: A wide range of advanced call processing services are optimally provided through a cooperative effort between public and private intelligent networks Service control logic in the public network interacts with service control logic in the private network The cooperative call processing exploits the best service features from both environments More specifically, a logical relationship is established over an end-to-end, service logic communication path between the service control elements of both networks using a very small set of operation procedures Using that set of operational procedures, either network's service control logic requests and receives a service feature orchestrated entirely by the other network's service logic In this way, specific service features making up a requested service may be provided by the network best suited to perform a particular service feature Since neither network needs to control or even know how the other network performs its assigned service feature, the integrity and simplicity of each network's control logic and protocols are preserved

A differentiated service model for enhanced distributed channel access (EDCA) of IEEE 802.11e WLANs

Abstract: In this paper, we propose a new differentiated service model, referred to as Differentiated Service-EDCA (DS-EDCA), for the Enhanced Distributed Channel Access (EDCA) of IEEE 802.11e wireless local area networks (WLANs). With DS-EDCA, both strict priority and weighted fair service can be provided. The strict priority service is provided for high priority traffic through carefully setting the EDCA parameter sets of lower priority traffic; the proportional fairness service is enabled by determining the backoff intervals according to the distributed scheduling discipline (DFS). We also propose a hierarchical link sharing model for IEEE 802.11e WLANs, in which AP and mobile stations are allocated different amounts of link resource. The performance of DS-EDCA and EDCA is compared via ns-2 simulations. The results show that DS-EDCA outperforms the original EDCA in terms of its support for both strict priority and weighted fair service. More importantly, DS-EDCA can be easily implemented, and is compatible to the IEEE 802.11 Standard.

A Quality of Service Broker Based Process Model for Dynamic Web Service Composition

Abstract: Problem statement: With fast spreading of web services technology ove r the Internet, the quality aspects of a web service has received signi ficant attention to the practitioners. The quality of web service includes both functional and nonfunctio nal details. In order to provide the correct and meaningful information to web service consumer, sometimes there is a need to compose existing web services in order to create new web service. Approach: We have proposed a Quality of Service (QoS) broker based process model for Dynamic Web Service Composition (DWSC). The QoS broker in the proposed model is responsible for web servic e collection, selection, optimization and composition based on the service consumer's require ments. It also verifies and certifies the functiona l and QoS specifications provided by service provider at the time of web service registration before publishing it in Universal Description, Discovery a nd Integration (UDDI) registry. The detailed working of QoS broker is also presented in the stud y with functionality of each component. We will also discuss the process flowchart for new web serv ice registration and web service composition at runtime. Results: The proposed QoS broker based model for dynamic web service composition solves the problems associated with quality of web service. It also prevents the central repository from malicious service provider to publish wrong in formation. Conclusion: The QoS broker-based process model for dynamic web service composition guarantees the quality of delivered service to web service consumers and improve the efficiency of composition.