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

IEEE - RIVF International Conference on Computing and Communication Technologies (RIVF)

作者： Chi-Hieu Nguyen Kieu, Chung T. Khanh-Van Nguyen Ha Noi Univ Sci Technol 1 Dai Co Viet St Hanoi Vietnam Ha Noi Vocat Coll High Technol Hanoi Vietnam

ISBN: (纸本)9781538693131

We revisit the well-known research topic of landmark-based compact routing in order to support designing interconnection topologies that can meet new demanding requirements and issues brought up by advances in areas such as massively parallel computing or large-scale data centers. Particularly, it is necessary to reduce the routing table size (RTS) as much as possible while maintaining other performance factors in a good state. Based on a new landmark selection technique, we propose our Geographic Landmark-based Compact routing scheme which can reduce the RTS from the well-known Thorup and Zwick's scheme by roughly 15% for a network of 1024 nodes and roughly 45% for a network of at least 100K nodes, and which also produces shorter average path length.

关键词： Compact routing landmark-based routing interconnection networks routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cluster Heads Selection algorithm of Wireless Sensor Network Based on Cluster Notes Number

A Cluster Heads Selection Algorithm of Wireless Sensor Netwo...

引用

作者： Jing Liu Shoubao Su School of Computer Engineering Jinling Institute of Technology

Nodes of wireless sensor networks need simple and effective cluster heads selection algorithms to balance the energy dissipation because of the limited processing capacity and energy. This article proposed a cluster heads selection algorithm based on cluster notes number----CNN-LEACH, which is improved on classic algorithm LEACH. In order to balance the energy dissipation, if a node has been a cluster head already, it temporarily can not be a cluster head again several rounds afterward. The rounds are decided by cluster nodes number. The algorithm is straightforward, even without considering the residual energy and position information. But it significantly reduces the network energy consumption by using the threshold between 0 and 1 to control the effect of energy dissipation on the final round that one node should not be a cluster head. At the same time, it avoids the significant fluctuation in the number of cluster heads. Simulations and analysis results show that the algorithm can extend the lifetime of the network.

关键词： Wireless sensor network routing algorithm Cluster Lifetime of the network

来源：评论

学校读者我要写书评

暂无评论

Research on Application of AODV Protocol in Mine Wireless Ad-Hoc Network

Research on Application of AODV Protocol in Mine Wireless Ad...

引用

第六届智能交通、大数据及智慧城市国际会议

作者： Zhishuai Shi Xinrong Mao Xi'an University of Science and Technology

In order to better apply the AODV routing protocol to the mine wireless ad-hoc network,this thesis proposes an improved routing *** on the AODV routing protocol choosing the minimum hops path as the routing path,the algorithm adds the consideration of node congestion and residual energy,and designs a new hops count *** method divides different degrees of node congestion and energy consumption into different levels and determines hops according to different *** simulation results show that N-AODV protocol has excellent performance close to AODV protocol and can meet the requirements of mine wireless adhoc network.

关键词： Mine Wireless Ad-Hoc Network routing Protocol routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Disconnected components detection and rooted shortest-path tree maintenance in networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 132卷 299-309页

作者： Glacet, Christian Hanusse, Nicolas Ilcinkas, David Johnen, Colette Univ Bordeaux LaBRI UMR 5800 F-33400 Talence France CNRS LaBRI UMR 5800 F-33400 Talence France

Many articles deal with the problem of maintaining a rooted shortest-path tree. However, after some edge deletions, some nodes can be disconnected from the connected component V-r of some distinguished node r. In this case, an additional objective is to ensure the detection of the disconnection by the nodes that no longer belong to Vr. We present a detailed analysis of a silent self-stabilizing algorithm. We prove that it solves this more demanding task in anonymous weighted networks with the following additional strong properties: it runs without any knowledge on the network and under the unfair daemon, that is without any assumption on the asynchronous model. Moreover, it terminates in less than 2n + D rounds for a network of n nodes and hop-diameter D. (C) 2019 Published by Elsevier Inc.

关键词： routing algorithm Shortest-path Disconnected network Self-stabilization

来源：评论

学校读者我要写书评

暂无评论

A large-scale nesting ring multi-chip architecture for manycore processor systems

引用

OPTICAL SWITCHING AND NETWORKING 2019年 31卷 183-192页

作者： Li, Wenzhe Guo, Bingli Li, Xin Zhou, Yu Huang, Shanguo Rouskas, George N. Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing Peoples R China North Carolina State Univ Dept Comp Sci Raleigh NC USA

The optical network on chip (ONoC) paradigm has emerged as a promising solution to multi-core/many-core processor systems for offering enormous bandwidth and low power consumption. As chip multiprocessors (CMPs) scale to unprecedented numbers of cores, the performance of next-generation CMPs will be bounded by the process yield and power density of single chip. In earlier work we proposed a multi-chip ONoC architecture that scales to large numbers of CMPs and delivers high performance in terms of delay and throughout. Building on that work, in this paper we propose an optimized architecture for integrating a large number of cores into chips with a novel control strategy, including a contention resolution scheme and a resource reservation scheme. The proposed control strategy is crucial to large scale ONoCs, because the resource reservation scheme ensures efficient wavelength allocation for the traffic while the contention management scheme is effective in reducing the impact of contentions. To sustain good performance and energy efficiency of large-scale ONoC, the topology is optimized to reduce the average transmission distance with minimum increase of power consumption. We evaluate the proposed architecture within a 1000-core processor system and compare it with CMesh and several previously proposed topologies with different control strategies. The simulation results show that, our new large-scale architecture can achieve better performance on throughput and delay.

关键词： ONoC Large-scale routing algorithm Resource reservation

来源：评论

学校读者我要写书评

暂无评论

New upper bound for a rearrangeable non-blocking WSW architecture

引用

IET COMMUNICATIONS 2019年第20期13卷 3425-3433页

作者： Lin, Bey-Chi Natl Univ Tainan Dept Appl Math Tainan Taiwan

An optical network based on elastic optical switches allows requests using different spectrum widths to improve utilisation efficiency. This study considers one three-stage WSW (waveband switching-space switching-waveband switching), optical node architecture for elastic optical networks. A sufficient condition for a rearrangeable non-blocking WSW architecture with limited input/output links has been derived in an earlier work. In this study, the author improves the upper bound by adopting a new interstage link partition scheme associated with a tricky routing algorithm. Suppose a WSW architecture has r input/output links each of which has n frequency slot units (FSUs). Compared with earlier results, the results of the proposed scheme show that s - 1 (or 3s - 4) FSUs per interstage link can be reduced for even (or odd) min{r, n}, where s = min{ left ceiling r/2 right ceiling , left ceiling n/2 right ceiling }. The reduction gain is at least 3.5% (or 10%) for even (or odd) min{r, n} if r = n <= 26, even achieving 23.3% for limited odd r = n.

关键词： optical switches telecommunication network routing optical links elastic optical switches three-stage WSW waveband switching-space switching-waveband switching elastic optical networks interstage link partition scheme rearrangeable nonblocking WSW architecture routing algorithm frequency slot units optical node architecture FSU

来源：评论

学校读者我要写书评

暂无评论

A Novel Technique for Transmission Loss Allocation in Restructured Power System

引用

JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY 2019年第4期14卷 1441-1451页

作者： Hasan, Naimul Nasiruddin, Ibraheem Pandey, Yudhishthir Jamia Millia Islamia Dept Elect Engn New Delhi India Qassim Univ Dept Elect Engn Buraydah Saudi Arabia

Transmission loss allocation in a restructured power system is vital in today's electricity market around the world. The problem of transmission loss allocation among the various participants is getting more attention with the increase of the competition level in electricity markets. In this paper, a novel routing algorithm with minimum transmission loss is proposed for judicious allocation of transmission losses over a network. Proposed routing algorithm computes the power flow path through transmission line from the individual generator to load utilizing the shortest path with minimum loss criterion. The load demand is fulfilled with the power flow through the decisively selected transmission path. The new method of transmission loss allocation has distinct advantages over existing methods as locational dependence of loss allocation to both generator and load. The proposed algorithm is implemented on IEEE-30 bus system. The experimental results are obtained with proposed routing algorithm and compared with existing method. Results obtained using proposed method illustrate significant improvements in reducing the transmission losses.

关键词： Loss allocation Optimal DG placement Restructured power system routing algorithm

来源：评论

学校读者我要写书评

暂无评论

RVCCC: A new variational network of cube-connected cycles and its topological properties

引用

THEORETICAL COMPUTER SCIENCE 2019年 767卷 34-50页

作者： Zhang, Zhen Huang, Shu-qiang Guo, Dong Li, Yong-Hui Jinan Univ Dept Comp Sci Guangzhou 510632 Guangdong Peoples R China Jilin Univ Minist Educ Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China Jinan Univ Dept Optoelect Engn Guangzhou 510632 Guangdong Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 00026A Australia

The CCC(r, n) network is an extension of the hypercube which replaces each vertex with a cycle of length n, providing that the hypercube is r-dimensional. When n > r, the CCC(r, n) network contains more vertices than that of CCC(r, r), which makes it more useful in the construction of a large-scale interconnection network. However, the CCC(r, n) is irregular when n > r, which makes their properties difficult to be analyzed. In this paper, we propose a new variational network of the cube-connected cycles (RVCCC). The RVCCC networks have the properties of regularity, vertex-symmetry, and low diameter. Compared with the general CCC networks, the RVCCC networks are more suitable for constructing a large-scale interconnection network. After the shortest internode distance between any two vertices in the RVCCC was determined, the exact diameter of this network was calculated and the communication algorithms, including the routing algorithm and the broadcasting algorithm, were also developed. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Cube-connected cycles Shortest internode distance Diameter routing algorithm Broadcasting algorithm

来源：评论

学校读者我要写书评

暂无评论

A thermal-sensitive design of a 3D torus-based optical NoC architecture

引用

INTEGRATION-THE VLSI JOURNAL 2019年第Sep.期68卷 22-29页

作者： Ye, Yaoyao Zhang, Zhe Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Dept Micro Nano Elect Shanghai 200240 Peoples R China

In order to overcome limitations of traditional electronic interconnects in terms of power efficiency and bandwidth density, optical networks-on-chip (NoC) based on silicon photonics have been proposed as an emerging on chip communication architecture for chip multiprocessors (CMPs) with large core counts. However, due to thermo-optic effects, wavelength-selective silicon photonic devices such as microresonators suffer from temperature-dependent wavelength shift. In this work, we propose a thermal-sensitive design of a 3D torus-based optical NoC architecture. For the 3D torus-based optical NoC architecture, we propose a hybrid optical-electronic router architecture with a fully-connected 7 x 7 optical switching fabric. Besides, a thermal-sensitive routing algorithm is proposed to optimize the optical power loss in the presence of on-chip temperature variations. Simulation results show that for a set of synthetic traffic patterns, the proposed 3D torus-based optical NoC with the thermal-sensitive routing reduces the average thermal-induced optical power loss by 14.3% and 17% respectively as compared to the matched 3D torus-based optical NoC and the 3D mesh-based optical NoC with the traditional XYZ routing. For a set of real applications, the proposed 3D torus-based optical NoC with the thermal sensitive routing reduces the worst-case optical power loss by 7.9% and 14.6% respectively as compared to the matched 3D torus-based optical NoC and the 3D mesh-based optical NoC with the traditional XYZ routing.

关键词： Chip multiprocessor Optical network-on-chip Thermal effect routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Decreasing latency considering power consumption issue in silicon interposer-based network-on-chip

引用

JOURNAL OF SUPERCOMPUTING 2019年第11期75卷 7646-7664页

作者： Dadashi, Sajed Reza, Akram Reshadi, Midia Khademzadeh, Ahmad Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Islamic Azad Univ Dept Comp Engn Shahr E Qods Branch Tehran Iran Iran Telecommun Res Ctr Tehran Iran

Stacking technology is an approach to improve scalability of 2D network-on-chip systems. 3D stacking technology places multiple chips vertically, while silicon chips are stacked side-by-side on a silicon interposer layer in the 2.5D stacking technology. 2.5D stacking can solve many of the 3D stacking difficulties such as thermal problem. The cores in the processing element (PE) layer must have the ability to connect together. Moreover, the connection between the processing cores and the other chips is a critical issue that should be concerned. The memory chip is one of the most important chips, integrated with the many-core chip. The network-on-chip can be extended to the interposer layer to increase the usability of the interposer layer. It is essential to have an efficient topology and deadlock-free routing algorithm to handle operations effectively and decrease delay and power consumption. In this paper, a new topology called "Balanced Mesh" and a deadlock-free routing algorithm is recommended that balances fairly the connection between different Mesh-based segments of a network. Many of interposer network topologies such as Butter Donut increase the degree of intermediate routers in the interposer layer or nodes related to other chips. Many of them cannot be easily used in the PE layer to have a uniform system. The proposed topology can be simply applied to both of many-core layer and the interposer layer to decrease delay and power consumption without any change in the degree of nodes and has lesser number of links. Our proposed topology is compared with some other topologies such as concentrated Mesh(CMesh) and ButterDount. Simulation results show that our proposed topology can improve the system efficiency with lesser number of links. Using our proposed topology in both layers achieves 13% improvement in network latency compared with using Mesh in the PE layer and ButterDonut in the interposer layer. Also, it achieves 12% improvement in power consumption.

关键词： 2 5D stacking Silicon interposer layer Network-on-chip Topology routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：