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

Time-Varying Graph and Binary Tree Search Based routing algorithm for LEO Satellite Networks

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2023年第10期72卷 13683-13688页

作者： Zhang, Ningtao Na, Zhenyu Tao, Jiahui Lin, Bin Zhang, Ning Zhao, Kanglian Dalian Maritime Univ Sch Informat Sci & Technol Dalian 116026 Peoples R China Peng Cheng Lab Shenzhen 518052 Peoples R China Univ Windsor Dept Elect & Comp Engn Windsor ON N9B 3P4 Canada Nanjing Univ Sch Elect Sci & Engn Nanjing 210046 Peoples R China

Though low earth orbit (LEO) satellite networks have superiorities in short delay, wide coverage and flexible networking, the end-to-end (E2E) transmission has been confronted with severe challenges due to frequent changes of network topology. In this article, a time-varying graph and binary tree search based routing algorithm for LEO satellite networks is proposed to reduce the E2E transmission delay and improve the network quality of service. Firstly, a coordinate graph (CG) model is adopted to characterize the topology structure and resource distribution of LEO satellite networks. Then, an E2E minimum-hop area is determined based on CG model, so that a minimum-hop binary tree (MHBT) is constructed. Finally, the pruning traversal of MHBT is performed to obtain all minimum-hop paths, based on which the E2E path with the shortest delay is determined. Simulation results show that the proposed routing algorithm not only reduces the path delay, but also improves the file delivery ratio.

关键词： Binary tree delay LEO satellite networks routing algorithm time-varying graph

来源：评论

学校读者我要写书评

暂无评论

A DTN Oriented Adaptive routing algorithm Based on Node Load

引用

China Communications 2022年第12期19卷 54-63页

作者： Hongyan Cui Diyue Chen Roy E.Welsch State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing University of Posts and TelecommunicationsBeijing 100876China Massachusetts Institute of Technology CambridgeMA 02139USA

In recent years,Delay Tolerant Networks(DTN)have received more and more *** the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network *** paper proposes an AdaptiveSpray routing *** algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination *** the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding *** simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.

关键词： DTN routing algorithm adaptive cache management

来源：评论

学校读者我要写书评

暂无评论

A Fast FPGA Connection Router Using Prerouting-Based Parallel Local routing algorithm

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2023年第11期42卷 3868-3880页

作者： Wang, Dekui Feng, Jun Liu, Ke Zhou, Wei Hao, Xingxing Zhang, Xiaodan Northwest Univ Sch Informat Sci & Technol Xian 710127 Peoples R China

routing is one of the most time-consuming steps in the field-programmable gate array (FPGA) design process. Even if unceasing efforts have been made to accelerate FPGA routing, the existing work seldom pays attention to the underlying FPGA connection router. In this article, we present a fast FPGA connection router called PRoute which implements a novel prerouting-based parallel local routing algorithm. Basically, PRoute precomputes the potential routing solutions for various connection patterns on FPGAs, which can be directly used in the later practical routing. On the whole, PRoute is composed of A-star maze expansion and parallel local search. In the first part, PRoute gradually expands the maze wavefront toward the lowest-cost node to search for the target sink. For a wire-type node, PRoute invokes a fast parallel local search instead taking advantage of the prerouting results, and hence the time-expensive maze expansion can be reduced. Particularly, it allows PRoute to call one another between A-star maze expansion and parallel local search. This enables the runtime efficiency of PRoute while ensuring its global search ability. In addition, we put forward an engineering improvement to further speed up PRoute by avoiding the exploration of block output pins. To our best knowledge, this work is the first to apply the idea of prerouting for FPGAs. Experimental results show that PRoute achieves speedups of 1.8x, 2.4x, 3.2x, 4.1x, and 5.1x with 1, 4, 8, 16, and 32 threads relative to the baseline versatile place to route's connection router, respectively, without degrading the quality of results.

关键词： Field programmable gate arrays routing Runtime Pins Costs Wires Delays Field-programmable gate arrays (FPGA) routing prerouting routing algorithm shortest path

来源：评论

学校读者我要写书评

暂无评论

LEAD: An Adaptive 3D-NoC routing algorithm with Queuing-Theory Based Analytical Verification

引用

IEEE TRANSACTIONS ON COMPUTERS 2018年第8期67卷 1153-1166页

作者： Salamat, Ronak Khayambashi, Misagh Ebrahimi, Masoumeh Bagherzadeh, Nader Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA Univ Turku SF-20500 Turku Finland KTH Royal Inst Technol S-11428 Stockholm Sweden

2D-NoCs have been the mainstream approach used to interconnect multi-core systems. 3D-NoCs have emerged to compensate for deficiencies of 2D-NoCs such as long latency and power overhead. A low-latency routing algorithm for 3D-NoC is designed to accommodate high-speed communication between cores. Both simulation and analytical models are applied to estimate the communication latency of NoCs. Generally, simulations are time-consuming and slow down the design process. Analytical models provide, within a fraction of the time, nearly accurate results which can be used by simulation to fine-tune the design. In this paper, a high performance and adaptive routing algorithm has been proposed for partially connected 3D-NoCs. Latency of the routing algorithm under different traffic patterns, different number of elevators and different elevator assignment mechanisms are reported. An analytical model, tailored to the adaptivity of the algorithm and under low traffic scenarios, has been developed and the results have been verified by simulation. According to the results, simulation and analytical results are consistent within a 10 percent margin.

关键词： 3D network-on-chip routing algorithm deadlock-free queuing theory analytical model latency

来源：评论

学校读者我要写书评

暂无评论

Hotspot Preventing routing algorithm for delay-sensitive applications of in vivo biomedical sensor networks

引用

INFORMATION FUSION 2008年第3期9卷 389-398页

作者： Bag, Anirban Bassiouni, Mostafa A. Univ Cent Florida Sch Elect Engn & Comp Sci Orlando FL 32816 USA

Networks of implanted biomedical sensor nodes promise to give a new direction to medical research. The in vivo sensor nodes collect desired biometric data and communicate the data wirelessly to a base-station through a multi-hop network. The wireless communication produces heat, leading to a rise in the temperature of the nodes. A high temperature of the in vivo nodes for a prolonged period is not desired as it might damage the surrounding tissues. Medical applications are also often delay-sensitive. In this paper, we propose Hotspot Preventing routing (HPR) algorithm that performs much better than the shortest hop routing algorithm and the previously proposed Thermal Aware routing algorithm (TARA) in terms of preventing the formation of hotspots and reducing the average packet delivery delay by dynamically adapting to the network load. The simulation results presented also show that the HPR algorithm is highly scalable, increases the operational life of the network and helps reduce the number of packets dropped. (C) 2007 Elsevier B.V. All rights reserved.

关键词： routing algorithm biomedical sensor networks hotspot prevention

来源：评论

学校读者我要写书评

暂无评论

Quality of Video Oriented and Multi-Meeting Based routing algorithm for Video Data Offloading

引用

IEEE ACCESS 2018年 6卷 36966-36976页

作者： Wu, Honghai Ma, Huahong Xing, Ling Zheng, Guoqiang Henan Univ Sci & Technol Sch Informat Engn Luoyang 471023 Peoples R China Henan Univ Sci & Technol Postdoctoral Res Stn Control Sci & Engn Luoyang 471023 Peoples R China

The increasing popularity of video delivery among mobile users makes the problem of explosive traffic growth becoming more and more serious for traditional wireless networks, and video transmission-based on device-to-device communication through mobile opportunistic networks (MONs) is regarded as an ideal way to resolve this issue. However, data transmission in the MONs is mainly through the two ways: data replication and data forwarding. Thus, to achieve high delivery ratio and low delivery delay, data replication is usually excessively exploited, and the large number of redundant replicas will not only consume large amount of nodal resource but also greatly increase the overload of networks. For video transmission, this issue becomes more severe for its volume and continuity. Thus, in this paper, we propose a novel routing scheme for video data transmission in the MONs, namely, video routing-based multi-player cooperative game which can maximize the quality of reconstructed video data while minimizing the overhead of nodal and network resources. Specifically, we first construct the marginal gain model for video delivery quality, and then model the video data transmission among multiple encounters as a multi-player cooperative game. Under the guidance of the Nash equilibrium theory, the video data carried by these encountering nodes is adaptively and optimally re-assigned among them. Extensive simulations based on real-life mobility traces and synthetic traces have validated the effectiveness of the proposed routing algorithm.

关键词： Video data offloading mobile opportunistic networks routing algorithm multi-player cooperative game

来源：评论

学校读者我要写书评

暂无评论

An energy- and buffer-aware fully adaptive routing algorithm for Network-on-Chip

引用

MICROELECTRONICS JOURNAL 2013年第2期44卷 137-144页

作者： Wang, Junhui Gu, Huaxi Yang, Yintang Wang, Kun Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Inst Microelect Xian Peoples R China Xidian Univ Sch Comp Sci Xian Peoples R China

routing algorithms play a significant role in high performance Network-on-Chip which has been widely applied as an efficient communication paradigm for large System-on-Chip. However, existing routing algorithms largely neglect the imbalanced thermal distribution which leads to high temperature nodes. In this paper, an energy- and buffer-aware fully adaptive routing algorithm (EBAR) is proposed to balance the thermal distribution and satisfy the performance requirements. A network state function model, which takes both historical and current states of network into consideration, is constructed to balance the distribution of thermal and alleviate the network congestion. In the meanwhile, a new thermal management scheme is proposed to lower the temperature and satisfy the performance requirements of high priority packets. The simulation results show that EBAR can provide improvement in thermal distribution without performance degradation. The improvements of end-to-end delay and throughput also demonstrate the advantages that can be provided by EBAR. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Network-on-Chip routing algorithm Thermal balance Interconnection networks

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a load balancing routing algorithm for clustered multiple cache servers

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2002年第1期E85B卷 147-156页

作者： Miwa, H Kumagai, K Nogami, S Abe, T Yamamoto, H NTT Serv Integrat Labs Musashino Tokyo 1808585 Japan

The explosive growth of World Wide Web usage is causing a number of performance problems, including slow response times, network congestion, and denial of service. Web site that has a huge number of accesses and requires high quality of services, such as a site offering hosting services, or content delivery services, usually uses a cache server to reduce the load on the original server offering the original content. To increase the throughput of the caching process and to improve service availability, multiple cache servers are often positioned in front of the original server. This requires a switch to direct incoming requests to one of the multiple cache servers. In this paper, we propose a routing algorithm for such a switch in front of clustered multiple cache servers and evaluate its performance by simulation. The results show that our routing algorithm is effective when content has request locality and a short period of validity, for example, news, map data, road traffic data, or weather information. We also identify points to consider when the proposed algorithm is applied to a real system.

关键词： load balancing cache server routing algorithm request locality period of validity

来源：评论

学校读者我要写书评

暂无评论

GreeDi: An energy efficient routing algorithm for big data on cloud

引用

AD HOC NETWORKS 2015年第Dec.期35卷 83-96页

作者： Baker, T. Al-Dawsari, B. Tawfik, H. Reid, D. Ngoko, Y. Liverpool John Moores Univ Sch Comp & Math Sci Liverpool L3 5UX Merseyside England Liverpool Hope Univ Dept Math & Comp Sci Liverpool Merseyside England Inst Gallillee Lab Informat Paris Nord Paris France

The ever-increasing density in cloud computing parties, i.e. users, services, providers and data centres, has led to a significant exponential growth in: data produced and transferred among the cloud computing parties;network traffic;and the energy consumed by the cloud computing massive infrastructure, which is required to respond quickly and effectively to users requests. Transferring big data volume among the aforementioned parties requires a high bandwidth connection, which consumes larger amounts of energy than just processing and storing big data on cloud data centres, and hence producing high carbon dioxide emissions. This power consumption is highly significant when transferring big data into a data centre located relatively far from the users geographical location. Thus, it became high-necessity to locate the lowest energy consumption route between the user and the designated data centre, while making sure the users requirements, e.g. response time, are met. The main contribution of this paper is GreeDi, a network-based routing algorithm to find the most energy efficient path to the cloud data centre for processing and storing big data. The algorithm is, first, formalised by the situation calculus. The linear, goal and dynamic programming approaches are used to model the algorithm. The algorithm is then evaluated against the baseline shortest path algorithm with minimum number of nodes traversed, using a real Italian ISP physical network topology. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Big data Cloud computing routing algorithm Data centre

来源：评论

学校读者我要写书评

暂无评论

The design of ZigBee routing algorithm in smart lighting system

引用

FERROELECTRICS 2019年第1期549卷 254-265页

作者： Wei, Wang Min, Wang Tianjin Polytech Univ Sch Elect Engn & Automat Tianjin Peoples R China Tianjin Polytech Univ Tianjin Key Lab Adv Technol Elect Engn & Energy Tianjin Peoples R China

With the rapid development of technology, the smart lighting system has been a part of our daily life. The control theory has absolutely changed the traditional lighting system. Due to the flexibility, lower cost and power dissipation, the smart lighting system uses ZigBee technique to realize its function. This paper proposed a new routing algorithm based on the traditional algorithm?ADPS (Address Redistribute and Path Reselection). The improved address allocation method according to the weight and network depth has been put forward. The results show that the new routing algorithm can basically optimize the real-time performance and reliability of smart lighting system.

关键词： Smart lighting ZigBee routing algorithm ADPS real-time performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：