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

The Dataset for Optimal Circulant Topologies

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Capacity optimisation of communication networks in integrated equipment systems based on the functional chain mechanism

引用

International Journal of Systems, Control and Communications 2024年第4期15卷 367-386页

作者： Li, Yonggang Wen, Dan Huang, Cheng Li, Haoran Fu, Peide Gao, Ang School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China

For the sake of settling the communication congestion in the integrated equipment system and optimising the network capacity, the complex network analysis method of the structure of the equipment system based on the function division mechanism based on the function chain is adopted, and functional chain modelling is carried out. In view of the fact that the node betweenness determines the ability of the network to process data in some measure, an improved routing algorithm based on both the node betweenness and the link load under the constraint of the functional chain is proposed. By assigning weights to the corresponding nodes and links, and increasing the outbound edge weights of multiple high-intermediate nodes simultaneously, the packets bypass the nodes and links with high loads. Experimental results indicate that the proposed algorithm outperforms the traditional algorithm in terms of convergence and optimisation effect. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： communication congestion complex network equipment system routing algorithm transmission capacity

来源：评论

学校读者我要写书评

暂无评论

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

引用

INFORMATION 2019年第10期10卷

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Research and design of a low-power wireless sensor networks

引用

INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL 2013年第2期20卷 139-147页

作者： Gao, Zhijun Wang, Hongyu Xue, Chunyan Han, Zhonghua Dalian Univ Technol Sch Informat & Commun Engn Dalian 116024 Peoples R China Shenyang Jianzhu Univ Fac Informat & Control Engn Shenyang 110168 Liaoning Peoples R China Shenyang Metrol Testing Inst Shenyang 110179 Liaoning Peoples R China

It is studied, in this paper, the cluster-based network architecture combined with multi-hop transformation and a hop-number-constrained multi-hop routing (HMR) algorithm is proposed. This new scheme is designed to prolong the network lifetime in which the maximum hop-number is considered in order to enhance the stability of the communication from sensor nodes to base station. Meanwhile, nodes with higher residual energy undertake more tasks of relaying information so as to balance the energy consumption in the network. Simulation results show that this new scheme provides longer lifetime than the classical clustering algorithms, and HMR also reaches larger amount of effective messages.

关键词： wireless sensor networks WSNs routing algorithm hop-number-constrained

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

引用

PARALLEL PROCESSING LETTERS 2012年第4期22卷

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Research on intelligent home design of internet of things based on ZigBee

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2021年第3期26卷 272-286页

作者： Yuan, Jie He, Yi Hunan City Univ Yiyang Hunan Peoples R China Beijing Jinhehaitai Informat Technol Co Ltd Room 522Door 5Bldg 416North Taiping Rd Beijing Peoples R China

With the rapid development of information technology, improving the intelligent level of family life and modern life style is the trend of future development. Based on the analysis of the development of smart home at home and abroad, a smart home system is designed by combining ZigBee wireless sensor network, gateway technology and mobile terminal remote control app. Firstly, the development and relating technologies of ZigBee are discussed. Secondly, the system overall architecture and data outlier analysis are carried out. Thirdly, the routing algorithm of ZigBee is improved based on neighbour table, and corresponding mathematical model is designed. Fourthly, the location algorithm of ZigBee is improved based on RSSI location algorithm and DV-Hop algorithm. Finally, the system performance is tested based on simulation analysis, results show that the proposed intelligent home system has better performance.

关键词： ZigBee internet of things IoT intelligent home system location algorithm routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Model for Optimally Configuring Logistics Delivery Networks

A Hierarchical Model for Optimally Configuring Logistics Del...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks(2011第三届通信软件与网络国际会议 ICCSN2011)

作者： Ma Li Su Yang School of Business Xi'an University of Finance and Economics Xi'an 710100 China School of Communication and Information Engineering Xi'an University of Science and Technology Xi'an

This paper presents a hierarchical model of logistics delivery networks by using some principles in graph theory. Based on the proposed hierarchical model, an optimal solution for dynamically configuring the resources of logistics delivery networks is devised through setting the appropriate value for the weight of edges in the model, which aims at minimizing the total traffic cost of a delivery network. The solution then employs an amended Dijkstra routing algorithm to determine a traffic path in the hierarchical model for a logistics delivery demand. The effects of this solution were compared with the other two traditional delivery solutions from the aspects of traffic costs and the network blocking ratio, which shows the proposed solution achieved a satisfying performance.

关键词： logistics delivery networks hierarchical model routing algorithm traffic cost blocking ratio

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：