Discrete-event simulation of computernetworks has significant scalability issues, which makes simulating large-scale networks problematic. We propose a high-level abstraction modeling network domains, interdomain lin...
详细信息
The CSFS (cryptographic storage file system) is a network file storage system that is suitable for a small-to-medium sized networks such as a campus network. In a CSFS, a lot of distributed file servers are organized ...
详细信息
Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications wh...
详细信息
作者:
Mohamed, FAoued, BDepartment of Computer Science
Evolutionary Engineering and Distributed Information Systems Laboratory EEDIS University of Sidi Bel-Abbès Algeria Department of Electronics
Communications Networks Architectures and Multimedia Laboratory University of Sidi Bel Abbès Algeria
The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation t...
The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation time have led to a bad-quality or a lower compression ratio. For example, the Fisher's [ 7] proposed classification pattern greatly accelerated the algorithm, but image quality was poor due to the search-space reduction imposed by the classification, which eleminates a lot of good solutions. By using genetic algorithms to address the problem, we optimize the domain blocks search. We explore all domain blocks present in the image but not in exhaustive way ( like a standard algorithm) and without omitting any possible block (solution) as a classification pattern does. A genetic algorithm is the unique method for satisfying these constraints. And it is a way to do be a random search because the genetic one is directed by fitness selection, which produces optimal solutions. Our goal in this work is to use a genetic algorithm to solve the IFS inverse problem and to build a fractal compression algorithm based on the genetic optimization of a domain blocks search. we have also implemented standard Barnsley algorithm, the Y. Fisher based on classification, and the genetic compression algorithm with quadtree partitioning. A population of transformations was evolved for each range block, and the result is compared with the standard Barnsely algorithm and the Fisher algorithm = based classification. We deduced an optimal set of values for the best parameters combination, and we can also specify the best combination for each desired criteria: best compression ratio, best image quality, or quick compression process. By running many test images, we experimentally found the following set of optimal values of all the algorithm parameters that ensure compromise between execution time and solutions optimality: Population size = 100, Maximum generations = 20, Crossover rat
In this paper we present a P2P file-sharing architecture optimized for mobile networks. We discuss the applicability of current P2P techniques for resource access and mediation in the context of 2.5G/3G mobile network...
详细信息
Wireless communication technologies enabled the possibility of building spontaneous networks between two or more users to exchange data. The problem in the establishment of such networks lies in the configuration that...
详细信息
Wireless communication technologies enabled the possibility of building spontaneous networks between two or more users to exchange data. The problem in the establishment of such networks lies in the configuration that has to be agreed on and in the way the communicating parties can be identified. In prior publications we have presented our vision of convenient networking in a heterogeneous environment. In this paper, we describe an implementation that offers a dashboard-like tool, which can, with the help of a cellular network, ease the formation of spontaneous networks among heterogeneous nodes. Furthermore, the provided implementation is able to secure the acquired communication links in the spontaneous network and therefore protect the exchanged information against possible abuse.
One of the research challenges for 4G-wireless systems is the design of mobility management techniques that integrate cellular and ad-hoc networks. Currently there are no structured mobility management schemes for the...
详细信息
One of the research challenges for 4G-wireless systems is the design of mobility management techniques that integrate cellular and ad-hoc networks. Currently there are no structured mobility management schemes for these heterogeneous multi-hop networks. In this paper we propose an adaptive protocol for mobility management in multi-hop heterogeneous networks (M/sup 3/HN) for seamless mobility in an integrated cellular and ad-hoc network. This paper describes techniques for tracking a mobile node in a multi-hop network with minimum overhead. Using M/sup 3/HN a node can migrate from a single-hop network to a multi-hop connectivity seamlessly. This scheme is independent of the routing protocol used in a multi-hop network.
The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduce...
详细信息
The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduces the wasted energy while increasing the throughput and decreasing the latency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control-packet overhead, and overhearing. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach, especially compared to the S-MAC and T-MAC protocols.
Peer-to-peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications wh...
详细信息
Peer-to-peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. In this work we are investigating the performance of an eDonkey-based mobile P2P file-sharing system by means of time-dynamic simulation. Mobile networks differ from wireline networks by the limited capacity of the radio link and the mobility of the users. P2P networks, in contrast, are overlays which consider the transport network in an abstract way. In a mobile environment, the question arises, whether the abstraction can be maintained and what will be the performance impact if there is any. We will show in detail how the mobile access technology (GPRS or UMTS), the churn behavior of mobile users, the file size of mobile specific content, and special infrastructure entities, such as a cache peer, influences the performance of the suggested mobile P2P file-sharing service.
9.1 Storage Load Balancing of Data in distributed Hash Tables 9.1.1 Definitions 9.1.2 A Statistical Analysis 9.1.3 Algorithms for Load Balancing in DHTs 9.1.4 Comparison of Load-Balancing Approaches 9.2 Reliability of...
详细信息
暂无评论