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

A Reliable routing Architecture and Algorithm for NoCs

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2012年第5期31卷 726-739页

作者： DeOrio, Andrew Fick, David Bertacco, Valeria Sylvester, Dennis Blaauw, David Hu, Jin Chen, Gregory Univ Michigan Ann Arbor MI 48109 USA Intel High Performance Circuits Res Grp Hillsboro OR 97124 USA

Aggressive transistor scaling continues to drive increasingly complex digital designs. The large number of transistors available today enables the development of chip multiprocessors that include many cores on one die communicating through an on-chip interconnect. As the number of cores increases, scalable communication platforms, such as networks-on-chip (NoCs), have become more popular. However, as the sole communication medium, these interconnects are a single point of failure so that any permanent fault in the NoC can cause the entire system to fail. Compounding the problem, transistors have become increasingly susceptible to wear-out related failures as their critical dimensions shrink. As a result, the on-chip network has become a critically exposed unit that must be protected. To this end, we present Vicis, a fault-tolerant architecture and companion routing protocol that is robust to a large number of permanent failures, allowing communication to continue in the face of permanent transistor failures. Vicis makes use of a two-level approach. First, it attempts to work around errors within a router by leveraging reconfigurable architectural components. Second, when faults within a router disable a link's connectivity, or even an entire router, Vicis reroutes around the faulty node or link with a novel, distributed routing algorithm for meshes and tori. Tolerating permanent faults in both the router components and the reliability hardware itself, Vicis enables graceful performance degradation of networks-on-chip.

关键词： Fault tolerance hard faults networks-on-chip (NoCs) reconfiguration reliability routing algorithms

来源：评论

学校读者我要写书评

暂无评论

MERA: A Micro-Economic routing Algorithm for Wireless Sensor Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第8期E95B卷 2642-2645页

作者： Esquivel-Gomez, Jesus Balderas-Navarro, Raul E. Stevens-Navarro, Enrique Acosta-Elias, Jesus Univ Autonoma San Luis Potosi San Luis Potosi Mexico UASLP Inst Invest Comunicac Opt San Luis Potosi Mexico

One of the most important constraints in wireless sensor networks (WSN) is that their nodes, in most of the cases, are powered by batteries, which cannot be replaced or recharged easily. In these types of networks, data transmission is one of the processes that consume a lot of energy, and therefore the embedded routing algorithm should consider this issue by establishing optimal routes in order to avoid premature death and eventually having partitioned nodes network. This paper proposes a new routing algorithm for WSN called Micro-Economic routing Algorithm (MERA), which is based on the microeconomic model of supply-demand. In such algorithm each node comprising the network fixes a cost for relay messages according to their residual battery energy;and before sending information to the base station, the node searches for the most economical route. In order to test the performance of MERA, we varied the initial conditions of the system such as the network size and the number of defined thresholds. This was done in order to measure the time span for which the first node dies and the number of information messages received by the base station. Using the NS-2 simulator, we compared the performance of MERA against the Conditional Minimum Drain Rate (CMDR) algorithm reported in the literature. An optimal threshold value for the residual battery is estimated to be close to 20%.

关键词： wireless sensor networks routing algorithms energy efficiency pricing

来源：评论

学校读者我要写书评

暂无评论

Context information prediction for social-based routing in opportunistic networks

引用

AD HOC NETWORKS 2012年第8期10卷 1557-1569页

作者： Hoang Anh Nguyen Giordano, Silvia Univ Appl Sci SUPSI NetLab ISIN DTI Galleria 2 CH-6928 Manno Switzerland

Context information can be used to streamline routing decisions in opportunistic networks. We propose a novel social context-based routing scheme that considers both the spatial and the temporal dimensions of the activity of mobile nodes to predict the mobility patterns of nodes based on the BackPropagation Neural Networks model. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Opportunistic networks routing algorithms Social context-based Context information Encounter probability

来源：评论

学校读者我要写书评

暂无评论

A practical network coding and routing scheme based on maximum flow combination

引用

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT 2012年第5期22卷 373-396页

作者： Wu, Lianlong Curran, Kevin Univ Ulster Fac Comp & Engn Sch Comp & Intelligent Syst Londonderry BT48 7JL North Ireland

Network coding is a novel field of information theory and coding theory. It is a breakthrough over the traditional store-and-forward routing methods by allowing coding of two or more packets together. From an information flow aspect, multiple flows could be overlapped in a routing scheme. Hence the theoretical upper bound of multicast capacity could be achieved by network coding. In this project, a complete routing and coding scheme is constructed to realize the maximum multicast transportation task. In order to implement the scheme, the paths of multiple max-flows are determined. Edges are divided into overlapped and normal type based on the merged max-flows. The transmitting data are represented using packets in a specific format. Multicast, forward and coding operations are defined to transmit data at the nodes. The nodes are classified according to the type of operation. A dynamic coding and routing algorithm is proposed to route packets gradually from source node to destinations in topological sorting order by the three operations on the path of merged max-flows. We show that the use of simple XOR operations can satisfy most of the network topologies. The running time of the algorithm presented here is less than 1 second for most of the benchmark and random datasets. Copyright (C) 2012 John Wiley & Sons, Ltd.

关键词： Information Theory Network coding overlaps Surgery Network routing Runtime routing algorithms Packet Shannon\'s theory Maximum Flow

来源：评论

学校读者我要写书评

暂无评论

Joint scheduling and routing algorithm with load balancing in wireless mesh network

引用

COMPUTERS & ELECTRICAL ENGINEERING 2012年第3期38卷 533-550页

作者： Ning, Zhaolong Guo, Lei Peng, Yuhuai Wang, Xiaojie Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China NEU SOFT Corp Shenyang 110819 Peoples R China

Wireless mesh network (WMN) is a promising solution for last mile broadband internet access. Mesh nodes or mesh routers are connected via wireless links to form a multi-hop backbone infrastructure and improving throughput is the primary goal. While previous works mainly focused on either link level protocol design or complex mathematical model, in this paper, we investigate the performance gains from jointly optimizing scheduling and routing in a multi-radio, multi-channel and multi-hop wireless mesh network. Then, two optimization objectives are addressed by considering wireless media contention and spatial multiplexing. The first objective is to maximize throughput by exploiting spatial reuse while the second one is to ensure fairness among different links. We design a cross-layer algorithm by considering both MAC layer and network layer. Simulation results show that our joint optimization algorithm can significantly increase throughput as well as fairness. (c) 2011 Elsevier Ltd. All rights reserved.

关键词： MAC layer Wireless mesh networks Load balancing Optimization algorithms wireless Throughput routing algorithms Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

PCA-Guided routing Algorithm for Wireless Sensor Networks

引用

JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS 2012年第Pt.2期2012卷 427246.1-427246.10页

作者： Chen, Gong Tan, Liansheng Gong, Yanlin Zhang, Wei Cent China Normal Univ Dept Comp Sci Wuhan 430079 Hubei Peoples R China

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimal K-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

关键词： total energy Ganglia routing algorithms algorithms principal components analysis Wireless sensor networks Network energy consumption

来源：评论

学校读者我要写书评

暂无评论

Reliable and energy-efficient cooperative routing algorithm for wireless monitoring systems

引用

IET WIRELESS SENSOR SYSTEMS 2012年第2期2卷 128-135页

作者： Manfredi, S. Univ Naples Federico II Fac Engn Via Claudio 21 I-80125 Naples Italy

The recent increased interest in distributed and flexible wireless pervasive applications has drawn great attention to Wireless Networked Control Systems (WNCS) architectures based on Wireless Sensor and Actuator Networks (WSANs) and the resulting Quality of Service (QoS) obtained in specific applications. In wireless monitoring systems based on WSANs, providing certain QoS specifications in terms of reliability and energy efficiency is crucial for the sensors/actuators as they perform actions based on the data samples/received with a limited amount of energy to spend. To this aim the paper introduces the cooperative-based routing algorithm to guarantee a good performance trade-off between reliability and energy efficiency of the overall wireless monitoring system. Simulations have been carried out in order to quantify the impact of the proposed algorithm on the overall monitoring system reliability and energy efficiency and a comparison is presented with the existing Ad-hoc On-Distance Vector (AODV), the cooperation along the shortest non-cooperative path (CASNCP) and minimum-power cooperative routing (MPCR) algorithms. Finally it is shown the application of the proposed algorithm to healthcare monitoring system pointing out as the cooperation-based routing algorithms are suitable and rewarding for the management of the future generation of monitoring systems.

关键词： energy capacity Energy efficiency monitoring systems routing algorithms wireless monitoring system wireless Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Double-Layer Sparse Honeycomb Topology for NoC

A Double-Layer Sparse Honeycomb Topology for NoC

引用

International Conference on Computer Science and Network Technology

作者： Rong Gao Feiyang Liu Huaxi Gu Xisong Fu Shenzhen CU-Xidian Joint Center Xidian Univ. Xi'an China

ISBN: (纸本)9781479905607

Network-on-chip (NoC) is emerging as an effective architecture which address the shortcomings of traditional bus-based System-on-chip (SoC). Since its better properties, such as the lower power consumption, smaller size and higher scalability, mesh is often regarded as an effective topology for NoC design. In this paper, we propose a double-layer sparse honeycomb topology as a terrific design option gaining advantages of degree, diameter, and network cost which is vital to network performance. As a result of the fact that 3D IC has developed as a perspective technique for network topology, we transform the sparse honeycomb topology into rectangular brick shape that it is feasible to be implemented on the chip, and double the planar sparse honeycomb structure to obtain this advantageous 3D topology. Based on the addressed topology, a brief routing algorithm which is easy and improved from the dimension order routing algorithm is carried out. The 4×4 router for the new topology has been implemented and simulated. Thus, the degree of routers is reduced and the utilization is increased.

关键词： network routing network topology network-on-chip three-dimensional integrated circuits 3D IC NoC double-layer sparse honeycomb topology rectangular brick shape routing algorithm Computer architecture Conferences Network topology Ports (Computers) routing Three-dimensional displays Topology Network-on-Chip honeycomb layout router network-on-chip Network topology routing algorithms Network routing topology Honeycombs three-dimensional displays three-dimensional integrated circuits Computer Architecture NOCT gene Routers layouts

来源：评论

学校读者我要写书评

暂无评论

LtKademlia - Topology matching and load balancing P2P model

LtKademlia - Topology matching and load balancing P2P model

引用

International Conference on Cyberspace Technology (CCT 2013)

作者： Yong Zhu Yue Hu School of Computer and Communication Engineering University of Science and Technology Beijing China 100083 Beijing Key Laboratory of Know ledge Engineering for Materials Science 100083 China

ISBN: (纸本)9781632660015

An improved model of LtKademlia and associated routing algorithm based on Kademha are proposed. In this model, a method has been proposed to achieve self-organized clustering by mapping IP address to the node ID to match the logical topology to the physical topology and solve the detaining problem. A routing algorithm based on the node real-time comprehensive performance and logical distance has been designed to adapt the load to the power of the node. The simulation result shows that the query delay of the improved model is less than the original model.

关键词： Kademlia-based Load balancing P2P model Topology matching Load balancing topology IP address routing algorithms Simulation results P2RY4 gene peer to peer file sharing original model Line of nodes logical

来源：评论

学校读者我要写书评

暂无评论

A High Performance Network Architecture for Large-scale Cloud Media Data Centers

A High Performance Network Architecture for Large-scale Clou...

引用

IEEE Global Communications Conference

作者： Yantao Sun Min Chen Qiang Liu Jing Cheng School of Computer and Information Technology Beijing Jiaotong University School of Comp Sci. & Tech. Huazhong University of Science and Technology

ISBN: (纸本)9781479913510

Cloud media services will become indispensable to enrich our future daily life. However, bandwidth-intensive cloud media services involve huge amount of data traffic while the requirements for quality of services (QoS) are diverse among different clients. Conventional data center networks (DCN) meet difficulties in terms of scalability and flexibility to support the increasing bandwidth requirements for cloud media services. To solve this problem, a new type of architecture, MatrixDCN, is proposed in this paper. MatrixDCN is an approximate non-blocking network, in which switches and servers are arranged in rows and columns that compose a matrix structure. A MatrixDC-N based network can accommodate up to hundreds of thousands of servers with good scalability. A high-efficient routing algorithm is well designed to fully leverage the regularity in the topology while computing a routing table in a simple way. Theoretical analysis and experimental data show that MatrixDCN have advantages on topology's scalability, network throughput, and its routing algorithm.

关键词： Servers bandwidth requirement routing algorithms Scalability Clouds data center route list Traffic data NETWORK STRUCTURE Quality of service topology Legal Services Heterogeneous Flexibility

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：