The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Most radio resource management algorithms engage radio resource management and Call Admission Control (CAC) separately as two different procedures. This incorporation of these two procedures into a single scheme seems challenging. In this paper a novel framework combining radio resource management and Probabilistic CAC (PCAC) is proposed. When an incoming call requests admission to the network, radio...
Coverage and connectivity are both attractive issues in wireless sensor networks. They are important measurements of quality of service (Qos). Among the existing researches, probabilistic detection model used in coverage configuration meets the actual signal decay sensing characteristic of the sensor node well. Based on this model, our previous work has presented a simplified coverage checking eligible...
An efficient Call Admission Control (CAC) arithmetic is essential to guarantee QoS for enhancing the utilization of radio resource in multi-traffic CDMA systems. This paper presents a Multi-Class Services Dynamic Mixed Judgment CAC arithmetic. This arithmetic judges a new coming call whether to accept or not based on the remaining resource, the priority of all services and the resource reservation...
Process algebras are a set of formal languages that are suitable to describe concurrent and composite systems including services composition. Nowadays, though process algebras have been effectively exploited for modeling and verifying functional aspects of services composition, modeling non-functional aspects of services composition with process algebras has been ignored. Cost is one of the most important...
This paper proposes a dynamic Probabilistic Priority Adaptive Time-Threshold-based bandwidth allocation Scheme for Multimedia services (PPATTSM) in cellular networks. Because future data service will occupy a large portion of all services in next generation mobile networks and forced termination of an ongoing call is clearly less desirable than blocking of a new call attempt, there is much significance...
This paper addresses the problem of optimum allocation of distributed real-time workflows with probabilistic service guarantees over a grid of physical resources made available by a provider. The discussion focuses on how such a problem may be mathematically formalised, both in terms of constraints and objective function to be optimized, which also accounts for possible business rules for regulating...
The inherent properties of wireless sensor networks (WSN) disqualify most classic methods targeting timeliness guarantees. Assumptions of such methods as well as a restrictive notion of timeliness borrowed from classic real-time systems clash with the indeterminism of realistic scenarios. In this paper, we introduce a generalized notion of timeliness which allows to provide meaningful performance...
In this work, we derive analytical expressions for the maximum attainable user rate by accomplishing a probabilistic delay constraint in an uncorrelated Rayleigh channel. These rates are derived for two representative scheduling schemes, round robin (RR) and best channel (BC) allocation, but presented tools can be applied to any scheduling policy. On the basis of the effective bandwidth theory, the...
Over the last few years we are deploying various kinds of radio access technologies (RATs). Different kinds of RATs are being deployed in overlay, providing different services in terms of their bandwidth, coverage, Quality of Service (QoS), price, etc. Under the multi-radio overlay network environment RAT selection becomes an important issue for efficient use of radio access networks. One of the most...
We consider a broadcast channel (BC) in which the base station is equipped with multiple antennas and each user has a single antenna. We study the design of systems with linear precoders and probabilistically-constrained quality of service (QoS) requirements for each user, in scenarios with imperfect channel state information (CSI) at the transmitter. Each user's QoS is expressed as an upper bound...
Energy efficiency is a critical consideration in the design of low cost sensor networks. This paper studies the problem of extending the lifetime of the sensor networks as far as possible while maintaining the quality of network coverage. A systematical analysis on the relationship between the network lifetime and cover sets alternation is given, and by introducing the concept of time weight factor,...
In this paper we extend our previous work on soft probabilistic contracts for QoS management, from the particular case of "response time", to general QoS parameters. Our study covers composite QoS parameters dealing not only with time aspects but also with quality of data. We also study contract composition (how to derive QoS contracts for an orchestration from the QoS contracts with its...
Accurate estimation of quality of online services is both an important and difficult problem, since a service has many interdependent quality attributes influenced by several contextual factors. It is even more challenging as quality ratings come from sources with unknown reliability, each source may rate a service on different quality aspects. Although several solutions have been proposed, there...
A large body of networking research has addressed the question of predicting steady state quality of service measures such as delay distributions and loss probabilities for various purposes such as network design (i.e., dimensioning links, buffers, switches, etc.) and admission control (making a decision whether or not to admit a connection or set of connections into the network). In a high-speed...
This paper deals with the problem of scheduling workflow applications with quality of service (QoS) constraints, comprising real-time and interactivity constraints, over a service-oriented grid network. A novel approach is proposed, in which high-level advance reservations, supporting flexible start and end time, are combined with low-level soft real-time scheduling, allowing for the concurrent deployment...
Web services are software applications that are published over the Web, and can be searched and invoked by other programs. New Web services can be formed by composing elementary services, such composite services are called Web service orchestrations. Quality of service (QoS) issues for Web service orchestrations deeply differ from corresponding QoS issues in network management. In an open world of...
The capacity with probabilistic delay constraint CDt,epsiv expresses the maximum source rate that may be supported in a wireless system with a probability epsiv of exceeding certain delay bound Dt. In a previous paper by the authors (see Proc. IEEE GLOBECOM, November 2007), CDt,epsiv was calculated for a Rayleigh channel carrying a constant rate flow. In this work, the potential of the effective...
This paper discusses the mitigation of Distributed Denial of Service (DDoS) attack and as well preservation of computational time on wireless network. The DDoS effects upon the QoS in the loss of bandwidth and the resources available at the server. The uncertainty of Distributed denial of Service attack can be best simulated with the help of probabilistic model. The simple hop count method was used...
In network reliability studies, nodes and links are usually represented as binary entities (either up or down). In many cases the analysis of the performance of the system requires a richer representation by associating to each arc a weight representing a specific attribute of the arc (e.g. capacity, resistance, cost, length). For example, the amount of traffic characterizing the connections in communication...
In this paper we study the probabilistic view coverage problem for image sensing in wireless sensor networks. The view coverage of an image sensor network determines the quality of the surveillance services that an image sensor network can provide. In this paper, we present an indepth analysis on probabilistic view coverage in an image sensor network, where omnidirectional image sensors are randomly...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.