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.
Data mining and scoring tool providers require users to use provider-specific ways to invoke their services. The provider-specific approach could be a major factor affecting why data mining tools and applications are not currently as widespread as one might hope. However, SOA can implements the loose coupling between the services provider and services consumer. Using Web service protocol (such as...
Trust problems exist in open distributed service oriented computing environments. A lot of research work has been done on the theories and applications of trust and reputation management in service oriented environment. However, the design expertise on trust is not well documented yet. In this paper we propose to use trust patterns for documenting solutions for trust problems. The main benefit of...
Intrusion detection is prominently important for civil and military applications in wireless sensor networks (WSNs). It is defined as the mechanism to detect moving intruder(s) by single-sensing or jointly-sensing detection. To date, related works focus on the problem of network configuration for detecting intruder(s) within a pre-specified time/distance threshold by assuming a straight line intrusion...
We present a State Estimation based Internet traffic flow control system where the objective is to maximize the aggregate bandwidth utility of network sources over their transmission rates. The network links and sources are viewed as processors of distributed computation and the control mechanism is based on estimation and optimization framework to solve the dual problem. The novelty of our approach...
Composite Web services are often long-running, loosely coupled and cross-organizational applications. They always run in a highly dynamic environment. For the applications and environment, advanced transaction support is required to ensure the quality of reliable execution. Towards composite service adaptive mechanism unavailable for lacking transaction support, this paper proposes a self-healing...
The coexistence of multimedia services in e-communication systems, with varying bandwidth utilization characteristics, impedes the efficiency of rate control and thereby impacts on the Quality of Service (QoS), in terms of low throughput. As such, the rate control for multimedia flows remains an open problem. This paper proposes a memetic optimization approach to rate allocation of multiclass services...
The paper presents a QoS multicast routing algorithm based on clonal selection and artificial fish swarm algorithms (CSA-AFSA). The hybrid algorithms reasonably use the superiorities of both algorithms and try to overcome their inherent drawbacks. An improved initialization method is used to make sure each individual in initial population is a reasonable multicast tree without loops. The simulation...
Defined by the 3GPP, the IP multimedia subsystem (IMS) is an architectural framework that enables the delivery of multimedia services in mobile networks. Based on the session initiation protocol, the IMS offers unified billing, QoS negotiation mechanisms, and the possibility of combining services deployed in different environments like CAMEL and Parlay OSA. With the aim of determining the real limitations...
Service creation by composing existing services and/or network resources is considered by Telecom and Internet industries as the trend for service provisioning in next generation networks. Related research work is being carried out for years, and various service composition approaches have been proposed by different standardization organizations and companies catering to different network requirements...
Nowadays, how to efficiently compose Web services has become a hotspot. In this paper, we introduce a method of recommending an optimal service sequence based on the original service sequence for a composite service. This method uses a Bayesian-based approach and selects the service sequence that has the largest probability as the best choice. Compared with existing methods, this method has two advantages:...
Services participating in the composition are usually co-ordinated according to a workflow, composed by several activities, each of which carried out by a service. The binding of services to workflow activities may be affected by several parameters (e.g., QoS, price, reputation, etc.). In this paper, we propose a service binding driven by a further important requirement, that is, the incompatibilities...
The poor performance of TCP, designed about 30 years ago, over high bandwidth-delay product connections has attracted much attention in the past few years. Some research work attempt to solve this problem by using innovative window estimations. The bursty nature of packet transmission has compounded the challenges in the problem. In this paper, we propose a new transmission protocol - Fairness Control...
Risk management is an important process for public service organizations to maintain a high quality of service. However, many organizations are not satisfied with the result from risk handling. This paper proposes changes to a risk management model by integrating service level agreements into it. This makes responsibilities more clear to all parties involved in risk management. This paper also introduces...
The Hybrid CDN-P2P architecture, or HCDN, which combines the complementary advantages of CDN and P2P networks, has been proposed to reduce the deployment cost and to improve the quality of service in file sharing and video streaming applications. A replica placement algorithm (RPA) decides where to replicate the specific data. Existing RPAs for pure CDN do not work efficiently in the HCDN architecture...
Guaranteeing quality of service (QoS) for event delivery has been recognized as an important but challenging issue in event based middleware (EBM), that is responsible for routing events from publishers to subscribers over an event broker network. Amongst the numerous QoS parameters, in our work, we focus on reliability as a service guarantee to subscribers in an EBM. We add to the existing body of...
With the widespread of Web services (WS), more deployed services are being registered into a services registry, consequently giving rise to a series of problems. A conspicuous one is the large amount of functionally equivalent Web services returned by a service registry. A plausible solution is to involve QoS (quality of service) in the services discovery. However, some existing QoS-based discovery...
Because of the dynamic nature and an instability of grid computing environment, system behavior in terms of QoS depends crucially on the selection of appropriate subset of the available resources. Thus, a well-defined system model that provides high system availability using a scheduling mechanism is required. In this paper, we propose the SLA based Policy Administrator (SPA) with QoS constraints...
HCF controlled channel access (HCCA), defined in the IEEE 802.11e document, provides a sample scheduler to allocate transmission opportunity (TXOP) to QoS-aware stations (QSTAs). Since the calculation of TXOP duration is based on mean data rate, it is efficient for constant bit rate (CBR) traffic. For variable bit rate (VBR) traffic, however, delay bound of some admitted traffic flows may be violated...
We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as in the perceived quality of service of individual providers. We model the interaction of an arbitrary number of providers and users as a two-stage multi-leader-follower game, and prove existence and uniqueness of the subgame...
We consider the decentralized bandwidth/rate allocation problem in unicast service provisioning with strategic users. We present a mechanism/game form that has the following desirable features. (1) It implements in Nash equilibria the solution of the corresponding centralized rate allocation problem in unicast service provisioning. (2) It is individually rational. (3) It is budget-balanced at all...
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.