Many peer-to-peer systems have been deployed on a large scale to provide users with “live streaming”, that is Internet delivered real-time multimedia content, much as the traditional television service (to name a few, CoolStreaming,TVants and PPLive, UUSee are examples in case).All such systems are organized in an unstructured manner, with epidemic-style information exchanges: users decide who to interact with in an adaptive manner, on the basis of past experience, and decide which data blocks to exchange with their “logical neighbors” by relying on simple, local rules. Despite their success, the performance of such unstructured systems is still poorly understood, especially in comparison of structured systems, such as Split Stream, the performance of which is relatively well understood in symmetric scenarios. In this paper, In this paper we describe how cool streaming are used and We emphasize three salient features of this data-driven design: 1) easy to implement, as it does not have to construct and maintain a complex global structure; 2) efficient, as data forwarding is dynamically determined according to data availability while not restricted by specific directions; and 3) robust and resilient, as the partnerships enable adaptive and quick switching among multi-suppliers.

Keywords— Coolstreaming, peer-to-peer technology (p2p), Live streaming, Zattoo, single overlay.

Now a day’s, E-Commerce business is very much needed for the individuals and concern.  On-line business increases information sharing, a concern regarding the exchange of money securely and conveniently over the internet increases. Therefore, security is a necessity in an e-commerce transaction. The requirements for securing e-commerce transaction are privacy, authentication, integrity maintenance and non-repudiation. These are the crucial and significant issues in recent times for trade which are transacted over the internet through e-commerce channels. The efficiency of the security methods are measured and such efficiency increases as we combined more security methods with each other. A new method of security is suggested which is a based on block cipher algorithm. Block cipher algorithm used until symmetric algorithm, this is the first time we are applying in e-commerce business as a Public Key Infrastructures (PKI). The concept of this new e-commerce securing algorithm is based on modular 37.

Keywords- E-commerce, Trusted Third Party (TTP), Private Key and symmetric key, Public key or Asymmetric key

For wireless sensor networks, the core issue is to design an energy-efficient network protocol as far as possible. Ant colony algorithm has proved to be effective in prolonging the network’s lifecycle and ensuring the reliability of data transmission. In conditions of network topology’s dynamic changes, we optimized the basic ant colony algorithm and introduced the pheromone broadcasting mechanism to improve the routing protocol’s performance. And we analysed the ant colony algorithm’s realization mechanism in TinyOS. The simulation test of the routing protocol is proceeded on the TOSSIM platform. Results show that the optimized ant colony algorithm can choose the shortest path while balancing network energy consumption. The proposed routing protocol prolongs the lifecycle of the entire network, and also better adapts to dynamic changes of the network structure.
Keywords-wireless sensor networks, ant colony algorithm, routing protocol, TinyOS, TOSSIM simulation

E-mail communication is indispensable nowadays, but the e-mail spam problem continues growing drastically. In recent years, the notion of collaborative spam filtering with near-duplicate similarity matching scheme has been widely discussed. The primary idea of the similarity matching scheme for spam detection is to maintain a known spam database, formed by user feedback, to block subsequent near-duplicate spams. On purpose of achieving efficient similarity matching and reducing storage utilization, prior works mainly represent each e-mail by a succinct abstraction derived from e-mail content text. However, these abstractions of e-mails cannot fully catch the evolving nature of spams, and are thus not effective enough in near-duplicate detection. In this paper, we propose a novel e-mail abstraction scheme, which considers e-mail layout structure to represent e-mails. We present a procedure to generate the e-mail abstraction using HTML content in e-mail, and this newly devised abstraction can more effectively capture the near-duplicate phenomenon of spams. Moreover, we design a complete spam detection system Cosdes (standing for Collaborative Spam Detection System), which possesses an efficient near-duplicate matching scheme and a progressive update scheme. The progressive update scheme enables system Cosdes to keep the most up-to-date information for near-duplicate detection.
 We evaluate Cosdes on a live data set collected from a real e-mail server and show that our system outperforms the prior approaches in detection results and is applicable to the real world.

Localization is an indispensable part in wireless sensor networks. In consideration of its importance, extensive research has been carried out resent years. On account of the process that DV-Hop algorithm is implemented in anisotropic density sensor networks, there can be a big localization error in local area， where the information transfer has excess hop counts between two nodes. We proposed a measure that can eliminate the distorted hops by setting ; there can also be  distance accumulated error, we proposed an RSSI based hop count calculation method, that can accurately reflect the distance between adjacent nodes, and thereby the location error can be reduced for the original DV-Hop algorithm. The simulation shows that the localization accuracy of the improved algorithm is better than the original algorithm.
Keywords- localization；wireless sensor network；DV-Hop；hop count； RSSI

 

Uniform memory access, non uniform memory access and cache only memory access are the three memory designs of multiprocessor. All the processors in UMA model share the physical memory uniformly. In the UMA architecture, access time to a memory location is independent from which processor makes the request. In the NUMA model memory access time  depends  relative to a processor and logically follow in scaling from symmetric multiprocessing (SMP) architectures. At the last COMA is memory model in which local memories at each node are used as cache. This is in contrast to using the local memories as actual main memory, as in NUMA organizations. All the models provide some facilities and have some drawbacks too. There are many criteria’s on which performance of a multiprocessor system can be analyzed. In this paper we present the frame work of multiprocessor architecture, than we discuss the memory models after that we are going to compare performances of memory models. 
Keywords— UMA, NUMA, OMP, Speedup, Memory Contention.

 

In mobile ad-hoc wireless network (MANET),secure communication is more challenging task due to its fundamental characteristics like infrastructure less, wireless link, distributed cooperation, dynamic topology, lack of association, resource constrained and physical vulnerability of node. In MANET, attacks can be broadly classified in two categories: routing attacks and data forwarding attacks. Any action not following rules of routing protocols belongs to routing attacks. The main objective of routing attacks to mislead or disrupt normal functioning of network by advertising false routing updates. On the other hand data forwarding attacks include actions such as modification or dropping of data packet that does not disrupt routing protocol. In this thesis work, we proposed a method to secure ad-hoc on-demand distance vector (AODV) routing protocol. The proposed method provides security for routing packets and can efficiently prevent the attacks such as black hole, modifying routing information and impersonation. The proposed method uses hashed message authentication code (HMAC) function which provides fast message verification and sender as well as intermediate nodes authentication. We simulate and compare the proposed method with original AODV and secure AODV (SAODV) protocol using network simulator tool (NS2). Simulation result shows that proposed method minimizes the time delay and network routing load involved in computation and verification of security fields during route discovery process and performs better than the original AODV protocol in the presence of malicious nodes performing black hole attack.

Keywords: Mobile ad-hoc network (MANET), Routing attacks, AODV, Black hole, Impersonation, HMAC, Authentication.

 

The past several years has witnessed an ever-increasing acceptance and adoption of parallel processing. We propose dynamically adaptive programs, programs that adapt themselves to their runtime environment. We discuss the key issues in successfully applying this approach and show examples of its application. The method is based on the data dependency analysis of loops and well-known loop parallelization techniques. The OpenMp standard was chosen for representing the parallelism of algorithms.

Keywords—Super-Scalar processor,Performance of scalar processor, Performance of Uniprocessor and Multi-Processor, Comparisions between Multi-processors and Uniprocessor, Pipelining.