Evaluation of firewall performance when ranging a filtration rule set

This article is a continuation of a number of works devoted to evaluation of probabilistic-temporal characteristics of firewalls when ranging a filtration rule set. This work considers a problem of the decrease in the information flow filtering efficiency. The problem emerged due to the use of a sequential scheme for checking the compliance of packets with the rules, as well as due to heterogeneity and variability of network traffic. The order of rules is non-optimal, and this, in the high-dimensional list, significantly influences the firewall performance and also may cause a considerable time delay and variation in values of packet service time, which is essentially important for the stable functioning of multimedia protocols. One of the ways to prevent decrease in the performance is to range a rule set according to the characteristics of the incoming information flows. In this work, the problems to be solved are: determination and analysis of an average filtering time for the traffic of main transmitting networks; and assessing the effectiveness of ranging the rules. A method for ranging a filtration rule set is proposed, and a queuing system with a complex request service discipline is built. A certain order is used to describe how requests are processed in the system. This order includes the execution of operations with incoming packets and the logical structure of filtration rule set. These are the elements of information flow processing in the firewall. Such level of detailing is not complete, but it is sufficient for creating a model. The QS characteristics are obtained with the help of simulation modelling methods in the Simulink environment of the matrix computing system MATLAB. Based on the analysis of the results obtained, we made conclusions about the possibility of increasing the firewall performance by ranging the filtration rules for those traffic scripts that are close to real ones.

On optimal stochastic jumps in multi server queue with impatient customers via stochastic control

<p style='text-indent:20px;'>In this paper, a queuing system as multi server queue, in which customers have a deadline and they request service from a random number of identical severs, is considered. Indeed there are stochastic jumps, in which the time intervals between successive jumps are independent and exponentially distributed. These jumps will be occurred due to a new arrival or situation change of servers. Therefore the queuing system can be controlled by restricting arrivals as well as rate of service for obtaining optimal stochastic jumps. Our model consists of a single queue with infinity capacity and multi server for a Poisson arrival process. This processes contains deterministic rate <inline-formula><tex-math id="M1">\begin{document}$ \lambda(t) $\end{document}</tex-math></inline-formula> and exponential service processes with <inline-formula><tex-math id="M2">\begin{document}$ \mu $\end{document}</tex-math></inline-formula> rate. In this case relevant customers have exponential deadlines until beginning of their service. Our contribution is to extend the Ittimakin and Kao's results to queueing system with impatient customers. We also formulate the aforementioned problem with complete information as a stochastic optimal control. This optimal control law is found through dynamic programming.</p>

Search of Web Service Based on Weighted Association Rule

The rapid growth of web services need efficiently discovering the desired web services for the users. Web service interfaces are defined with WSDL that is described by a bag of terms. Many similarity metrics are proposed to solve this problem, it is hardly to resolve the problem that only few pairs of terms between two services have high semantic distance, the semantic distance of other terms between two services are low. Using traditional keyword search metrics may acquire a wrong result that these two web services are similar, in addition, semantics of the web services is hardly to exploit. In this work the authors firstly help the request service to find the services that belong to the same class, and then they use association rule to find terms that are often appear together and find the most similar terms. The authors weaken the weight of the most similar term contained in an association rule and enhance the other terms' weight contained in an association rule to solve the situation above. The experiments show that our approach outperforms some searching methods.

Search of Web Service based on Weighted Association Rule

The rapid growth of web services need efficiently discovering the desired web services for the users. Web service interfaces are defined with WSDL that is described by a bag of terms. Many similarity metrics are proposed to solve this problem, it is hardly to resolve the problem that only few pairs of terms between two services have high semantic distance, the semantic distance of other terms between two services are low. Using traditional keyword search metrics may acquire a wrong result that these two web services are similar, in addition, semantics of the web services is hardly to exploit. In this work the authors firstly help the request service to find the services that belong to the same class, and then they use association rule to find terms that are often appear together and find the most similar terms. The authors weaken the weight of the most similar term contained in an association rule and enhance the other terms' weight contained in an association rule to solve the situation above. The experiments show that our approach outperforms some searching methods.

A Heterogeneous Cross-Domain Authentication Model Based on Access Tickets in Virtual Cable Television Network

The virtual cable television network is a cable television system with virtual assets, users in the network may have different authentication mechanisms. In order to meet corporate users across heterogeneous virtual, trusted domain request service is required. This paper proposes a bill based on the access authorization authentication scheme across heterogeneous domains. The scheme is based on VCA certification model, the Kerberos AS and the PKI domain as the domain where the CA Enterprise Domain external authentication node, generate its extracellular domain users access, the domain resources authorization bill and the session key, and then realize PKI and Kerberos cross-domain authentication ,domain user and session key agreement. Article on the safety and efficiency of the program are analyzed. Analysis shows that this scheme can resist various attacks, with high security, and higher than the efficiency of alternative solutions for virtual cable television network, efficient resource sharing of cross-domain security provides an effective solution.

CaLRS: A Critical-Aware Shared LLC Request Scheduling Algorithm on GPGPU

Ultra high thread-level parallelism in modern GPUs usually introduces numerous memory requests simultaneously. So there are always plenty of memory requests waiting at each bank of the shared LLC (L2 in this paper) and global memory. For global memory, various schedulers have already been developed to adjust the request sequence. But we find few work has ever focused on the service sequence on the shared LLC. We measured that a big number of GPU applications always queue at LLC bank for services, which provide opportunity to optimize the service order on LLC. Through adjusting the GPU memory request service order, we can improve the schedulability of SM. So we proposed a critical-aware shared LLC request scheduling algorithm (CaLRS) in this paper. The priority representative of memory request is critical for CaLRS. We use the number of memory requests that originate from the same warp but have not been serviced when they arrive at the shared LLC bank to represent the criticality of each warp. Experiments show that the proposed scheme can boost the SM schedulability effectively by promoting the scheduling priority of the memory requests with high criticality and improves the performance of GPU indirectly.

Distributed Mobile Services and Interfaces for People Suffering from Cognitive Deficits

The mobile device presented here is designed to offer several services to enhance autonomy, security, and communication for the cognitively impaired people and their caregivers. Two mobile devices are linked through a server; one is dedicated to the patient, the other one to the caregivers. The services fill three functions for patients: a simplified reminder, an assistance request service, and an ecological information gathering service. Three services are available for the caregiver: monitoring patients’ADLs, informing system and colleagues of an intervention, and planning patients’ ADLs.

A Multi-Level Matching Filtering Algorithm Based on Similarity

A similarity-based filtering algorithm is proposed for multi-level matching. The algorithm consider all elements like service name, description information, input and output, reputation and effects respectively, cosine theorem and semantic distance are given in this paper to calculate their similarity. The aspects of the algorithm are as follows. It achieves a more comprehensive metrical scheme on the similarity between publishing service and request service from multiple stages and multiple perspectives in web service matching process. It judges whether the service preconditions match the effects based on description logic. Finally, it introduces reputation metrical scheme .In addition, the qualitative and quantitative analysis of the algorithm are given in this paper. The analysis results show that the Multi-level Matching Filtering Algorithm can obviously improve the recall ratio and precision ratio of Web service discovery.