Wyniki wyszukiwania - BazTech

1

Resources Management and Services Personalization in Future Internet Applications

Świątek P., Rygielski P., Grzech A.

Advances in Electronics and Telecommunications

|

2011

|

Vol. 2, no. 3

50--54

EN

The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service ersonalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one has to manage esources properly especially when communication conditions change i.e. in an ambulance. An exemplary solution has been presented and conclusions for further work have been formulated.

2

Graph-fold: an efficient method for complex service execution plan optimization

Rygielski P., Świątek P.

Systems Science

|

2010

|

Vol. 36, no 3

25-32

EN

The task of optimization of the complex service execution plan is the last stage of the process of complex service composition in systems based on the SOA paradigm. In general, this task consists in choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper, a novel approach to the problem of optimization of complex service execution plan is introduced. In the approach proposed, the MKP feasible solution space is constructed in such a way that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time. This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.

3

Adaptive packet scheduling for requests delay guaranties in packet-switched computer communication network

Świątek P., Grzech A., Rygielski P.

Systems Science

|

2010

|

Vol. 36, no 1

7-12

EN

In this paper, the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of the distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g., buffer lengths) and actual characteristics of the serviced traffic (e.g., lengths of connections following requests, packet intensities within requests, etc.). The paper proposes a new packet scheduling algorithm based on Weighted Round Robin (WRR), whose weights are adapted according to changes of network's load and traffic characteristics. By means of computer simulation, on representative examples, it was shown that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.