10404783
Spam Filtering based on Preference Ranking
When the average number of spam messages received is continually increasing exponentially, both the Internet service provider and the end user suffer. The lack of an efficient solution may threaten the usability of the email as a communication means. In this paper we present a filtering mechanism applying the idea of preference ranking. This filtering mechanism will distinguish spam emails from other email on the Internet. The preference ranking gives the similarity values for nominated emails and spam emails specified by users, so that the ISP/end users can deal with spam emails at filtering points. We designed three filtering points to classify nominated emails into spam email, unsure email and legitimate email. This filtering mechanism can be applied on both middleware and at the client-side. The experiments show that high precision, recall and TCR (total cost ratio) of spam emails can be predicted for the preference based filtering mechanisms
5267471
Fault-Tolerant Servers for Anycast Communication
Plenty of research has been done for any cast service, but few research touches the fault-tolerant problem based on the best of our knowledge. In this paper, we propose and analyse a fault-tolerant model, called twin server model, for anycast communication to provide reliable and continuous anycast services. We select a twin server in an anycast group for a given anycast server, the primary server. If the twin server suspects that its primary server is dead, it will take the unfinished job(s) of its primary server. We propose two algorithms: the server failure detecting algorithm and the server failure broadcasting algorithm. We then analyse the performance change when a primary server fails using queue theory and obtain some interesting conclusions. At the end, we summary the paper and present the future work.
19007096
A Self-Learning System for Identifying Harmful Network Information
Network information identification is a “hot” topic currently. This paper designs a self-learning system using neural network algorithm for identifying the harmful network messages of both Chinese and English languages. The system segments the message into words and creates key word vector which characterizes the harmful network information. The BP algorithm is taken advantage of to train the neural network. The result of training and studying of the neural network can be applied onto many network applications based on message identification. The result of experiments demonstrates that our system has a high degree of accuracy.
42192006
Reducing the Bandwidth Requirements of P2P Keyword Indexing
This paper describes the design and evaluation of a federated, peer-to-peer indexing system, which can be used to integrate the resources of local systems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, leaf set forwarding and conventional techniques such as aggressive index pruning, index compression, and batching. Together these indexing strategies help to reduce the number of RPC operations required to locate the nodes responsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.
41517658
Improving the Performance of Equalization in Communication Systems
In this paper, research on exploring the potential of several popular equalization techniques while overcoming their disadvantages has been conducted. First, extensive literature survey on equalization is conducted. The focus has been placed on several popular linear equalization algorithm such as the conventional least-mean-square (LMS) algorithm, the recursive least-squares (RLS) algorithm, the filtered-X LMS algorithm and their development. The approach in analysing the performance of the filtered-X LMS Algorithm, a heuristic method based on linear time-invariant operator theory is provided to analyse the robust performance of the filtered-X structure. It indicates that the extra filter could enhance the stability margin of the corresponding non filtered-X structure. To overcome the slow convergence problem while keeping the simplicity of the LMS based algorithms, an H2 optimal initialization is proposed.
19315936
Lease Based Addressing for Event-Driven Wireless Sensor Networks
Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose an addressing mechanism for event-driven wireless sensor networks. The proposed scheme eliminates the need for network wide Duplicate Address Detection (DAD) and enables reuse of addresses.
16218050
A tool for constructing service replication systems
Service replication as a key to providing high availability, fault tolerance and good performance in distributed systems. However, building a service replication system is a difficult and complex task. This paper describes a tool that mimics the design of the remote procedure call (RPC) system to support building distributed service replication systems. The tool includes an interface definition language for describing a replica group, a language preprocessor and a runtime library system.
1954273
An architecture for building reliable distributed object-based systems
This paper proposes an architecture for designing fault-tolerant distributed object systems. The proposed architecture attempts to bring advances in client-server, remote procedure call, reliable group communication, and object orientation technologies under a unified architecture to ease application developers' work of building reliable distributed systems. The resulting application systems should be enhanced with modularity and flexibility.
2813000
Detecting and tolerating failures in a loosely integrated heterogeneous database system
This article presents the design and prototype implementation of a fault detection and fault tolerance facility based on the reactive system model for a loosely integrated heterogeneous database system running on a network of workstations. The database system consists of a number of fully autonomous databases that, through their willingness, can share some portion of their information. Sensors (functions that expose some part of the state of an object) are placed on individual databases and system objects (such as traders, agents, and other sensors). Other databases and system objects, and applications can subscribe to a sensor and therefore are notified whenever the sensor value changes. The fault detection mechanism uses sensors to monitor individual databases and system objects and to detect database or system faults. The fault tolerance mechanism uses actuators (functions that can change the state of an object) to react on database or system faults.
17849791
A tool for layered analysing and understanding of distributed programs
Distributed programs are harder to analyse and understand than sequential programs for a number of reasons. First, a distributed program consists of many entities at different levels of abstraction. Second, communication among the entities of a distributed program may happen concurrently and nondeterministically. To be able to analyse these entities and the communication events among them is therefore essential for understanding any distributed program. This paper describes a tool for assisting the analysis and understanding of distributed programs. The tool analyses the entities and communication events of a distributed program at four levels of abstraction. At the highest level, the tool displays the communication relationships between programs (e.g. server and client programs). At the second level, the communication between processes is displayed. At the third level, the communication between events is displayed. The fourth level is the lowest: it uses a text editor to show the relevant statements that carry out the communication. The tool has been used in the teaching of courses related to distributed computing since 1993.
33519597
A system for managing remote procedure call transactions
Abstract This paper describes the design and implementation of a remote procedure call (RFC) transaction manager. The structures and constructions of RFC-based systems have been widely discussed, yet how to manage the RFC transactions by using these existing structures and constructions remains unclear. We have designed a system for managing RFC transactions based on our RFC transaction model. The system is designed at first to manage single RFC transactions. It is then expanded to manage parallel RFC transactions as well. Some properties of the system are described. We also present some descriptions of the preliminary implementation of our RFC transaction manager.