High-speed, large-scale networks present new challenges to an intrusion detection system. These challenges include: the volume of data that must be analyzed, the high-speed data stream that IDS must deal with. To adap...
详细信息
ISBN:
(纸本)0769524052
High-speed, large-scale networks present new challenges to an intrusion detection system. These challenges include: the volume of data that must be analyzed, the high-speed data stream that IDS must deal with. To adapt these new demands, this paper propose a novel architecture for Large-scale distributed Intrusion Detection Systems(LDIDS) that can be applied to large-scale networks. This architecture is based on hierarchy, which consists of a root node, several branch nodes and leaf nodes. In this architecture, each node is an independent IDS, all IDSs constituting the whole LDIDS. The main advantage of this architecture is scalability and collaboration. We describe the framework of the nodes in detail. We also present an implementation of LDIDS which is designed according to the architecture.
How to share the data in databases of autonomous organizations quickly and flexibly is an important problem. Traditional data integration systems are supposed to be a solution to the problem. Unfortunately, they requi...
详细信息
ISBN:
(纸本)9780769534435
How to share the data in databases of autonomous organizations quickly and flexibly is an important problem. Traditional data integration systems are supposed to be a solution to the problem. Unfortunately, they require a global schema before they can be used to share data and they are centralized system. They can not support data sharing without a common schema and on-demand data sharing in applications. In addition, security is also the important requirements. This paper presents a community-based system for distributed data integration and sharing, Honeycomb. Honeycomb supports many virtual data integration and sharing systems on a single machine, and the system utilizes Web Services to access data on other nodes to avoid changing security configuration of autonomous organizations. In addition, the system adopts new cache techniques to improve performance greatly.
Unstructured Peer-to-Peer networks support uncoupled data placements, elaborate semantic queries and highly dynamic scenario. These properties make such systems extraordinary suitable for applications of mass-market d...
详细信息
ISBN:
(纸本)0769524052
Unstructured Peer-to-Peer networks support uncoupled data placements, elaborate semantic queries and highly dynamic scenario. These properties make such systems extraordinary suitable for applications of mass-market decentralized file sharing, which is still the most dominant application currently in use on current P2P-powered systems. In this paper, we propose SSplus, a novel search algorithm extended from our previously developed Smart Search algorithm, focusing on improving the search efficiency and the network utilization in unstructured P2P file-sharing systems, We achieve these goals by introducing several novel techniques below as enhancements: (a) Load Balancing based on Free Availability, (b) Intelligent 2-Level Replication, and (c) Resources Booking and Reservation. Extensive simulations under realistic conditions substantiate significant performance gains of SSplus, compared with the original Smart Search algorithm.
Designing a Java processor supporting horizontal multithreading has been becoming more attractive as network computing gains importance. Different from the traditional superscalar processors that issue multiple instru...
详细信息
ISBN:
(纸本)0780378407
Designing a Java processor supporting horizontal multithreading has been becoming more attractive as network computing gains importance. Different from the traditional superscalar processors that issue multiple instructions from a single instruction stream to exploit the instruction level parallelism (ILP), the horizontal multithreading Java processors issue multiple instructions (bytecodes) from multiple threads in parallel to exploit not only the ILP but the thread level parallelism (TLP). Such processors have multiple dispatch slots and require the instruction fetch unit to supply instructions with much higher bandwidth than superscalar processors. Using a traditional superscalar cache architecture in a horizontal multithreading Java processor results in high cache miss ratio caused by the interference among the threads. This paper investigates multibank instruction cache architecture for horizontal multithreading Java processor to meet the requirements of the high instruction fetch bandwidth. In order to evaluate the cache performance as well as the horizontal multithreading Java processor performance, we developed a trace driven simulator. The simulator consists of a trace generator that generates the Java bytecode execution traces and an architectural simulator that reads the traces and evaluates,the performance of the instruction cache and the overall performance of the Java processor. Our simulation results show that the performance improvements are obtained by the low cache miss ratio and the high instruction fetch bandwidth of the proposed cache architecture. The IPC performance is about 19 when both the number of slots and the number of banks are 8, about 5 times better than one bank cache.
Reconfigurable computing (RC) is the presence of hardware that can be reconfigured to implement specific functionality more suitable for specially tailored hardware than on a simple uniprocessor [1]. Although the conc...
详细信息
Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical sch...
详细信息
ISBN:
(纸本)9780769534435
Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical schemes which are suitable for the parallel environment. In this work, we investigate the parallel implementation of the four-point Modified Explicit Decoupled Group (MEDG) method which was introduced by Ali and Ng (2007) as a fast solver for the two dimensional Poisson pde. The method was shown to be more superior than all the methods belonging to the four-points explicit group family namely the Explicit Group (EG) [8], Explicit Decoupled Group (EDG) [1] and Modified Explicit Group (MEG) [7]. This paper presents the preliminary results of the parallel algorithms implemented on a distributed memory PC cluster. Two parallelizing strategies comprising of the two-color zebra and the four-color chessboard orderings in solving a two dimensional Poisson model problem will be discussed.
Centralized parallel packet switch algorithm and distributedparallel packet switch algorithm are two typical scheduling algorithms for parallel packet switch. This paper analyzes the two algorithms in detail, address...
详细信息
ISBN:
(纸本)9780769527369
Centralized parallel packet switch algorithm and distributedparallel packet switch algorithm are two typical scheduling algorithms for parallel packet switch. This paper analyzes the two algorithms in detail, addresses several key problems in their implementation and finally presents several available methods and suggestions to make the parallel packet switch more practical.
A kind of negotiation policy is proposed for the allocation problem solved by agent-based system in distributed manufacturing environment, in which subtasks in the same task have in-tree precedence constraints and fle...
详细信息
With service-oriented architecture entering into the mainstream and the fundamental role security service played in Grid computing, it is necessary and commonplace to integrate security service(s) with other Grid serv...
详细信息
ISBN:
(纸本)0769524052
With service-oriented architecture entering into the mainstream and the fundamental role security service played in Grid computing, it is necessary and commonplace to integrate security service(s) with other Grid services. However, current ad-hoc, handcrafted and proprietary integrating manners greatly hinder the the newly-integrated service's QoS (Quality of Service) and QoP (Quality of Protection). Efficient and effective security-service integration entails a higher-level abstraction of specific integration scenarios. That's where this paper takes root. In this paper, we borrow some idea from software engineering and propose several integration patterns of Grid security service. According to the number of the to-be-integrated non-security service(s), we classify all the patterns into 2 kinds: bilateral patterns and multilateral patterns, and propose 6 patterns (binding, on-demand, tailor, composite, contract and migration) and 4 patterns (separated, shared, mediated and enhanced) respectively. For each pattern, we discuss its intent, applicability, participants and consequences.
Wireless sensor networks (WSNs) are important for a number of strategic applications. Target localization is an important task in WSNs. In this paper, a distributed and cooperative target localization algorithm in wir...
详细信息
暂无评论