检索结果-内蒙古大学图书馆

12th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2016

作者： Santos, Jan Vincent Torres, Danah Veronica Villanoy, Monica Kathrina Festin, Cedric Angelo Doctor, John Norman Ocampo, Roel Networks and Distributed Systems Group Department of Computer Science University of the Philippines Philippines Computer Networks Laboratory Electrical and Electronics Engineering Institute University of the Philippines Philippines

ISBN: (纸本)9781509007240

In disaster situations communication and power infrastructure could be damaged, disrupting their associated services. This could delay relief efforts and cost more lives. In situations where connections are damaged and unreliable, peer-to-peer (P2P) and delay-tolerant networking (DTN) technologies can help provide alternative communication modes particularly in support of rescue and relief operations. Combining the benefits of the store-and-forward capability of DTN and the data propagation techniques of Wi-Fi Direct, we have created a flexible framework called ARC which allows users to create applications that could meet their specific requirements, particularly those in support of emergency communications. To demonstrate our framework, we created a simple application using ARC, and used this application to evaluate its DTN and Wi-Fi Direct group recovery capabilities. © 2016 IEEE.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

A scalable membership service for group communications in WANs

A scalable membership service for group communications in WA...

引用

Pacific Rim International Symposium on Dependable Computing

作者： Kim, H Lee, D Youn, HY Collaborative Distributed Systems and Networks Laboratory Information and Communications University South Korea School of Electrical and Computer Engg. Sungkyunkwan University South Korea

ISBN: (纸本)0769509754

Group Communication System (GCS) is an important building block for reliable, fault-tolerant distributed applications. Due to highly variable and unpredictable latency in WANs, GCS needs to cope with frequent membership, changes. It results in diminishing the scalability of GCS. In this paper we propose a new scheme that improves the scalability of group membership service for WANs by exploring dedicated membership sewers configured into multiple layers and reaching global agreement on the view through layered servers. It improves the scalability of a process group of N member processes front O(N-2) to O(N-3) with three layers, where N is the number of processes in the group. Computer simulation verifies that the proposed scheme requires much smaller number of message exchanges for reaching an agreement on a next view and does that much quicker. In addition, the proposed scheme pl events applications from being blocked until reaching the final view agreement if the applications permit temporary inconsistency.

关键词： Application software Collaboration Computer networks Delay Intelligent networks Laboratories Maintenance Scalability Web server Wide area networks

来源：评论

学校读者我要写书评

暂无评论

GDCA: A distributed channel assignment mechanism for multi-radio multi-channel wireless mesh networks

引用

Journal of networks 2011年第2期6卷 303-310页

作者： Xia, Yan Zeng, Yingzhi Gong, Zhenghu Xin, Qin School of Computer National University of Defense Technology Changsha Hunan China School of Information Science and Engineering Hunan University Changsha Hunan China Networks and Distributed Systems Simula Research Laboratory Oslo Norway

Channel assignment is one of the most important problem in the research of the multi-radio multi-channel wireless mesh networks ((MRMC-WMN). Aiming at minimizing the overall network interference and optimizing the usage of channel resource, channel assignment problem must obey the constraint of limited radios and available channels for MRMC-WMN. The above optimization problem is known to be NP-complete. This paper focuses on the study of channel assignment in MRMC-WMN. We propose a new grid-loop-based echanism for dynamic channel assignment. Our mechanism exploits the group which we called grid-loop, which is constructed on distributed minimum spanning tree by self-organized. Our new GDCA scheme has many advantages over cluster-based scheme. The analysis and comparison demonstrates its feasibility, stability, cost-saving and efficiency. © 2011 ACADEMY PUBLISHER.

关键词： MESH networking

来源：评论

学校读者我要写书评

暂无评论

Speeding up fractal image compression by genetic algorithms

引用

MULTIDIMENSIONAL systems AND SIGNAL PROCESSING 2005年第2期16卷 217-236页

作者： Mohamed, F Aoued, B Department 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 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

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deadlock-free dynamic network reconfiguration based on close up*/down*graphs

Deadlock-free dynamic network reconfiguration based on close...

引用

14th International Euro-Par Conference, Euro-Par 2008

作者： Robles-Gómez, Antonio Bermúdez, Aurelio Casado, Rafael Solheim, Åshild Grønstad Universidad de Castilla-La Mancha Spain Simula Research Laboratory Networks and Distributed Systems Group Norway Department of Informatics University of Oslo Norway

ISBN: (纸本)3540854509

Current high-performance distributed systems use a switch-based interconnection network. After the occurrence of a topological change, a management mechanism must reestablish connectivity between network devices. This mechanism discovers the new topology, calculates a new set of routing paths, and updates the routing tables within the network. The main challenge related to network reconfiguration (the change-over from one routing function to another) is avoiding deadlocks. Former reconfiguration techniques significantly reduce network service. In addition, most recent proposals either need extra network resources (such as virtual channels) or their computation complexities are prohibitive. For up*/down*routed networks we propose a new reconfiguration method that supports a virtually unaffected network service at a minor computational cost. This method is suitable for both source and distributed routing networks, and does neither restrict the injection of packets nor the updating of routing tables during the topology-change assimilation. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Predicting cement compressive strength using double-layer multi-expression programming

Predicting cement compressive strength using double-layer mu...

引用

4th International Conference on Computational and Information Sciences, ICCIS 2012

作者： Zhang, Qingke Yang, Bo Wang, Lin Zhu, Fuxiang Shandong Province Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China Computer Networks and Distributed Systems Laboratory Beijing Institute Technology Beijing China

ISBN: (纸本)9780769547893

This paper presents a novel algorithm named Double-layer Multi-expression Programming (DMEP). Then DMEP model is applied to the prediction of 28-day Portland cement compressive strength. We compare DMEP model with other four soft computing models, namely Multi-Expression Programming model (MEP), Gene Expression Programming model (GEP), Neural networks model (NN) and Fuzzy logic model (FL) on 28-day cement strength prediction. The experiment results show that DMEP model has a lower rate in RMSE and MAE, and the prediction average percentage error of the cement strength data using DMEP model is reduced to 2.18%, which is lower than other four models. The results obtained from the computational tests demonstrate that DMEP is a promising technique for the prediction of cement strength. © 2012 IEEE.

关键词： Soft computing

来源：评论

学校读者我要写书评

暂无评论

Efficient and deadlock-free reconfiguration for source routed networks

Efficient and deadlock-free reconfiguration for source route...

引用

23rd IEEE International Parallel and distributed Processing Symposium, IPDPS 2009

作者： Solheim, Åshild Grønstad Lysne, Olav Bermúdez, Aurelio Casado, Rafael Sødring, Thomas Skeie, Tor Robles-Gómez, Antonio Networks and Distributed Systems Group Simula Research Laboratory Lysaker Norway Department of Informatics University of Oslo Oslo Norway Computing Systems Department University of Castilla-La Mancha Albacete Spain

ISBN: (纸本)9781424437504

Overlapping Reconfiguration is currently the most effi-cient method to reconfigure an interconnection network, but is only valid for systems that apply distributed routing. This paper proposes a solution which enables utilization of Overlapping Reconfiguration in a source routed environ-ment. We demonstrate how a synchronized injection of tokens has a significant impact on the performance of the method. Furthermore, we propose and evaluate an optimization of the original algorithm that reduces (and in some cases even eliminates) performance issues caused by the token forwarding regime, such as increased latency and decreased throughput. © 2009 IEEE.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Streaming 4K/UHD video to the rest of us: Can bandwidth sharing help? 16

Streaming 4K/UHD video to the rest of us: Can bandwidth shar...

引用

16th IEEE International Symposium on a World of Wireless, Mobile and Multimedia networks, WoWMoM 2015

作者： Montes, Isabel Chua, Jaymari Cruz, Michelangelo Remillano, Augusto Young, Joseph Darwin Ocampo, Roel Festin, Cedric Computer Networks Laboratory Electrical and Electronics Engineering Institute University of the Philippines Diliman Philippinese United States Networks and Distributed Systems Group Department of Computer Science University of the Philippines Diliman Philippinese United States

ISBN: (纸本)9781479984619

High quality video streaming for mobile users is difficult to achieve in some areas of the world due to poor broadband capacity and sparse network coverage. We propose a bandwidth-sharing scheme to allow users with limited uplink bandwidth to borrow idle bandwidth from nearby access points and provide these users the opportunity to experience higher quality video than what their own bandwidth could normally support. We developed a Linux kernel implementation of a multipath less-than-best-effort (MP-LBE) protocol for bandwidth scavenging and demonstrated, through testbed experiments, that video quality may be improved through bandwidth sharing. This may bring us closer to the 'video everywhere' vision even as incremental upgrades are made on broadband Internet infrastructure. © 2015 IEEE.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Combining Source Routing and Dynamic Fault Tolerance

Combining Source Routing and Dynamic Fault Tolerance

引用

International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Frank Olaf Sem-jacobsen Olav Lysne Tor Skeie Networks and Distributed Systems Simula Research Laboratory Lysaker Norway

An increasing amount of interconnect technologies rely on source routing to forward packets through the network. It is therefore important to develop methods for fault tolerance that are well suited for source routed networks. Dynamic fault tolerance allows the network to remain available through the occurrence of faults, as opposed to static fault tolerance which requires the network to be halted to reconfigure it. Source routing readily supports the source node choosing a different path when a fault occurs, but using this approach, packets already in the network will be lost. Local dynamic fault tolerance, where the packet is routed around the fault locally, would prevent much of the traffic being lost during failures, but this is cumbersome to achieve in source routed networks since packets encountering a fault will need to follow a path different from that encoded in the packet header. In this paper we present a mechanism to achieve local dynamic fault tolerance in source routed fat trees, a topology that has widespread use in supercomputer systems, and compare it with endpoint dynamic fault tolerance. We also show that by combining the two approaches we achieve performance superior to any of the two individually

关键词： Routing Fault tolerance Switches Supercomputers Network topology Fault tolerant systems Packet switching Multiprocessor interconnection networks Laboratories Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

i-DBF: an Improved Bloom Filter Representation Method on Dynamic Set

i-DBF: an Improved Bloom Filter Representation Method on Dyn...

引用

International Conference on Grid and Cooperative Computing Workshops (GCCW)

作者： Jiacong Wang Mingzhong Xiao Jing Jiang Bonan Min Computer Networks and Distributed Systems Laboratory Peking University China

Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries, which uses an m-bit array to represent a data set. Dynamic bloom filter (DBF) can support concisely representation and approximate membership queries of dynamic set instead of static set. It has been proved that DBF not only possess the advantage of standard bloom filter, but also has better features when dealing with dynamic set. But DBF also has a disadvantage: the addition operation which mapped element x into bloom filter s will become no sense, if some of the first s-1 bloom filters have already responded that element x is in set A with some false positive probability. We point out this shortcoming and improve the addition operation with a new algorithm. We call this improved dynamic bloom filter i-DBF. Finally, we prove that this i-DBF has better performance both in the storage space and in the false positive probability

关键词： Data structures Peer to peer computing Costs Computer networks Laboratories Protocols Information filtering Information filters Bandwidth Grid computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：