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

The Dataset for Optimal Circulant Topologies

BIG DATA AND COGNITIVE COMPUTING 2023年第2期7卷 80页

作者： Romanov, Aleksandr HSE Univ Moscow 101000 Russia

This article presents software for the synthesis of circulant graphs and the dataset obtained. An algorithm and new methods, which increase the speed of finding optimal circulant topologies, are proposed. The results obtained confirm an increase in performance and a decrease in memory consumption compared to the previous implementation of the circulant topologies synthesis method. The developed software is designed to generate circulant topologies for the construction of networks-on-chip (NoCs) and multi-core systems reaching thousands of computing nodes. The developed software makes it possible to achieve high performance on an ordinary research workstation commensurate with similar solutions created for a supercomputer. The use cases of application of the created software for the analysis of routing algorithms in circulants and the regression analysis of the generated dataset of graph signatures to predict the characteristics of graphs of any size are described.

关键词： circulant graph circulant topologies dataset routing algorithm network-on-chip supercomputing

来源：评论

学校读者我要写书评

暂无评论

MSSN: An Attribute-Aware Transmission algorithm Exploiting Node Similarity for Opportunistic Social Networks

引用

INFORMATION 2019年第10期10卷 299页

作者： Guo, Mei Xiao, Min Xiangnan Univ Sch Software & Commun Engn Chenzhou 423000 Peoples R China

Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism proposed by traditional routing algorithms to implement the massive data transmission between mobile devices. Consequently, opportunistic social networks propose that the effective data transmission process could be implemented by selecting appropriate relay nodes. At present, most existing routing algorithms find suitable next-hop nodes by comparing the similarity degree between nodes. However, when evaluating the similarity between two mobile nodes, these routing algorithms either consider the mobility similarity between nodes, or only consider the social similarity between nodes. To improve the data dissemination environment, this paper proposes an effective data transmission strategy (MSSN) utilizing mobile and social similarities in opportunistic social networks. In our proposed strategy, we first calculate the mobile similarity between neighbor nodes and destination, set a mobile similarity threshold, and compute the social similarity between the nodes whose mobile similarity is greater than the threshold. The nodes with high mobile similarity degree to the destination node are the reliable relay nodes. After simulation experiments and comparison with other existing opportunistic social networks algorithms, the results show that the delivery ratio in the proposed algorithm is 0.80 on average, the average end-to-end delay is 23.1% lower than the FCNS algorithm (A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks), and the overhead on average is 14.9% lower than the Effective Information Transmission Based on Socialization Nodes (EIMST) algorithm.

关键词： opportunistic social networks routing algorithm mobile similarity social similarity social attributes data transmission

来源：评论

学校读者我要写书评

暂无评论

A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY

引用

PARALLEL PROCESSING LETTERS 2012年第4期22卷 1250013-1250013页

作者： Xiao, Wenjun Liang, Huomin Parhami, Behrooz South China Univ Technol Sch Software Engn Guangzhou 510006 Guangdong Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Guangdong Peoples R China Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

We propose a symmetrical scheme, by drawing results from group theory, and use it to build a new class of data center network models. The results are superior to current network models with respect to a number of performance criteria. Greater symmetry in networks is important, as it leads to simpler structure and more efficient communication algorithms. It also tends to produce better scalability and greater fault tolerance. Our models are general and are expected to find many applications, but they are particularly suitable for large-scale data-center networks.

关键词： data-center network model network performance network cost routing algorithm structural symmetry

来源：评论

学校读者我要写书评

暂无评论

Improving routing Load Fairness in Structured P2P Overlay Networks

Improving Routing Load Fairness in Structured P2P Overlay Ne...

引用

International Conference on Advanced Communications Technology

作者： You ZHOU Keiichi KOYANAGI Graduate School of Information Production and Systems Waseda University Japan

ISBN: (纸本)9781467331487

Structured P2P overlay networks provide rather balanced query routing load compared to centralized network systems. Despite their distributed and scalable design, issues such as different in-degrees of peers, peer churn and non-uniform request distribution may lead to poor routing load fairness in the overlay. In this paper, we propose an enhanced routing strategy that dynamically selects next-hop destination based on peers' current load information and the characteristics of the routing load distribution in the overlay network. Our approach can fairly balance the routing load among close neighbors as well as diverting a portion of the routing load from heavily loaded areas to less loaded ones. Simulation results show that our proposal significantly improves the routing load fairness among peers while the query performance remains almost the same.

关键词： overlay network routing algorithm load balancing Chord

来源：评论

学校读者我要写书评

暂无评论

Analysis of a Switching Fabric Employing Direct Interconnection Networks

Analysis of a Switching Fabric Employing Direct Interconnect...

引用

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

作者： Xudong Zhu Hong Wang Lemin Li National Key Lab of Broadband Optical Transmission and Communication Networks UESTC Chengdu 610054 China

ISBN: (纸本)0780378407

A k-ary n-cube direct interconnection structure is originally introduced and developed in the context of massively parallel computer(MPC) architectures. In recent years, with the development of VLSI(Very Large Scale Integration) technology and requirements of high performance Internet routers/switches, the k-ary n-cube interconnection network is considered to build Terabit routers. In this paper, analysis model for three-dimensional torus is presented as switch cores of Internet ***/throughput characteristics are measured with four different routing algorithms, buffer length and scale of fabric. Also a new algorithm Ladder is presented. All simulation experiments are done on OPNET. Results show that this architecture can build high performance *** to other routing algorithms, Ladder has better performance.

关键词： fabric torus routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Key Problems about Human Body Communication on Wireless Body Area Network

Key Problems about Human Body Communication on Wireless Body...

引用

2nd International Conference on Artificial Intelligence and Engineering Applications(AIEA 2017)

作者： ZHENGQIANG GU HAO PENG YUANMING WU School of Optoelectronic Information University of Electronic Science and Technology of China

In our paper,basing on hop static model and dynamic model of human body,we present By an efficient next selection algorithm hop’s for multi-hop Body Area queue *** and analyzing we every residual about energy,QoS free size,link reliability select and so on,hop can the build BAN.a function Via and present an algorithm we to the but the next for simulation software of MATLB,network gain Last numbers of packet by forwarding and network lifetime and the *** the end,getting vast simulation data analyzing scope it,we finally find the both advantages paper and puts disadvantages,forward application improvement of of the ***,the also some plans and prospects for the future.

关键词： Body Area Network QoS routing algorithm Simulation

来源：评论

学校读者我要写书评

暂无评论

An extended star graph: a proposal of a new network topology and its fundamental properties 03

An extended star graph: a proposal of a new network topology...

引用

Proceedings of the 2003 international conference on Parallel and distributed processing and applications

作者： Satoru Watanabe Satoshi Okawa Graduate Depertment of Computer System of University of Aizu Aizu-Wakamatsu Fukushima-ken Japan

ISBN: (纸本)9783540405238

In the past years, various network architectures for parallel computers have been proposed, for instance, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families of interconnection networks, namely, constant degree networks. In this paper, we propose a new interconnection network named extended star graphs, and we prove the extended star graphs have hypercube's structure. We also propose routing algorithms for node-to-node communication on extended star graphs. Based on the algorithms, we obtain an upper bound 2n - 1 on the diameter for the n-th order extended star graph.

关键词： routing algorithm hypercubes cayley graphs diameter star graphs degree four cayley graphs

来源：评论

学校读者我要写书评

暂无评论

Analysis of a Switching Fabric Employing Direct Interconnection Networks

Analysis of a Switching Fabric Employing Direct Interconnect...

引用

The Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies

作者： Xudong Zhu Hong Wang Lemin Li National Key Lab of Broadband Optical Transmission and Communication Networks UESTCChengdu 610054China

A k-ary n-cube direct interconnection structure is originally introduced and developed in the context of massively parallel computer(MPC) *** recent years,with the development of VLSI(Very Large Scale Integration) technology and requirements of high performance Internet routers/switches,the k-ary n-cube interconnection network is considered to build Terabit *** this paper,analysis model for three-dimensional torus is presented as switch cores of Internet routes. Delay/throughput characteristics are measured with four different routing algorithms,buffer length and scale of *** a new algorithm Ladder is *** simulation experiments are done on *** show that this architecture can build high performance routers. Compared to other routing algorithms,Ladder has better performance.

关键词： fabric torus routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A simulator for opportunistic networks

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第2期29卷

作者： Chilipirea, Cristian Petre, Andreea-Cristian Dobre, Ciprian Pop, Florin Suciu, George Univ Politehn Bucuresti Comp Sci Splaiul Independentei 313 Bucharest Romania

When mobile devices involved in a communication process are unable to establish a direct connection, or when communication should be offloaded to cope with large throughputs, mobile collaboration can be used to enable communication through opportunistic networks. These types of networks are formed when mobile devices communicate only using short-range transmission protocols, usually when users are close. Routes are built dynamically, because each mobile device is acting according to the store-carry-and-forward paradigm. Thus, contacts are seen as opportunities to move data towards the destination. In such networks, the routing protocol is of vital importance, and today, we witness quite a number of routing algorithms that have been proposed to maximize the success rate of message delivery whilst minimizing the communication cost. Such protocols take advantage of the devices history of contacts, or information about users carrying the mobile devices, to make their forwarding decision. This paper extends our previous work with the following: First, we describe a new simplified, fast simulator, designed to minimize the work needed to conduct extensive tests for opportunistic routing algorithm on multiple traces;next, we analyze extensively several of the most popular routing algorithms through extensive simulations conducted using our simulation platform. We highlight their pros and cons in different scenarios, considering different real-world mobility data traces, such as Global Positioning System traces. The raw Global Positioning System traces are converted to a format based on encounters between participating entities. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： simulation delay tolerant opportunistic network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

FPGA-based prototyping of a 2D MESH / TORUS on-chip interconnect (abstract only) 10

FPGA-based prototyping of a 2D MESH / TORUS on-chip intercon...

引用

Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays

作者： Donglai Dai Aniruddha Vaidya Roy Saharoy Seungjoon Park Dongkook Park Hariharan L. Thantry Ralf Plate Elmar Maas Akhilesh Kumar Mani Azimi Intel Corporation Santa Clara CA USA Intel Corporation Braunschweig Germany

ISBN: (纸本)9781605589114

Many-core chip multiprocessors can be expected to scale to tens of cores and beyond in the near future. Existing and emerging workloads on general-purpose many-core processors typically exhibit fast-changing, unpredictable on-chip communication traffic full of burstiness and jitters between different functional blocks. To provide high sustainable performance, scalable interconnects with a rich feature set including support for adaptive and flexible communication, performance isolation, and fault-tolerance are needed. 2D mesh and torus are attractive choices because they are physical layout friendly and scale more gracefully in network latency and bisection bandwidth than other simple interconnects such as buses or rings. However, the adoption of 2D mesh/torus in many-core processor designs is dependent on a verifiable and robust micro-architecture and a validated set of features. FPGA based systems have recently become a cost-effective, rapid prototyping vehicle for chip multiprocessor architectures. In this paper we present an FPGA based prototype of 2D on-die interconnect architecture. Our prototype is a highly configurable full-scale design that supports options selecting many different micro-architectural features and routing algorithms. The prototype incorporates a synthetic traffic generator to exercise and evaluate our design. To facilitate evaluation and characterization, a rich development environment and novel software capabilities including a very detailed performance visualization infrastructure has been developed. We demonstrate the experiment results of several configurations on a 6x6 2D network emulator setup in this paper.

关键词： fpga router architecture routing algorithm on-chip interconnect

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：