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

arXiv 2024年

作者： Sinha, Ujjwal Kumar, Vikas Singh, Shubham Kumar Dept of ISE BIT

routing algorithms play a crucial role in the efficient transmission of data within computer networks by determining the optimal paths for packet forwarding. This paper presents a comprehensive exploration of routing algorithms, focusing on their fundamental principles, classification, challenges, recent advancements, and practical applications. Beginning with an overview of the significance of routing in modern communication networks, the paper delves into the historical evolution of routing algorithms, tracing their development from early approaches to contemporary techniques. Key categories of routing algorithms, including distance vector, link-state, and path vector algorithms, are examined in detail, along with hybrid approaches that integrate multiple routing paradigms. Common challenges faced by routing algorithms, such as routing loops and scalability issues, are identified, and current research efforts aimed at addressing these challenges are discussed. © 2024, CC0.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

PKCA: A priori-knowledge and congestion-awareness method for adaptive routing algorithms in mesh architectures

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2024年第4期35卷

作者： Wang, Yongchang Zhao, Hongzhi Wang, Yi Wang, Baosheng Liu, Yuanxu Wu, Jie Beijing JiaoTong Univ Engn Res Ctr Network Management Technol High Speed Sch Comp & Informat Technol Minist Educ Beijing Peoples R China Univ Calif Irvine Dept EECS Irvine CA USA Beijing JiaoTong Univ Engn Res Ctr Network Management Technol High Speed Sch Comp & Informat Technol Minist Educ Beijing 100044 Peoples R China

Adaptive routing algorithms have been widely utilized in Network-on-Chip (NoC) architectures and have shown to enhance overall throughput in numerous studies. The adaptive routing algorithms can effectively detect network congestion. On the one hand, one-hop awareness or local awareness can easily detect network congestion but may also result in local greed. On the other hand, global awareness is better for load balancing, but it is difficult to be aware of the network congestion status. This article proposes a lightweight adaptive on-chip routing algorithm based on the concentric circles theory and prior knowledge derived from real-life observations. The algorithm, named the Priori-Knowledge and Congestion-Awareness method (PKCA), aims to optimize the routing efficiency within the chip. PKCA is designed to be not only simple but also to have low time complexity, allowing it to calculate paths to destinations without local greed. We performed evaluations, and the results demonstrated that our design surpasses one-hop awareness, two-hop awareness, and global awareness by 31%, 25%, and 20%, respectively, in terms of latency, and by 22%, 14%, and 22%, respectively, in terms of throughput. Furthermore, the time complexity is only O(N)$$ O(N) $$ in an NxN$$ N\times N $$ 2D mesh. This article proposes a lightweight adaptive on-chip routing algorithm NoC based on the concentric circles theory and prior knowledge derived from real-life observations. The algorithm, named the Priori-Knowledge and Congestion-Awareness method (PKCA), aims to optimize the routing efficiency within the chip. image

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating the quality of service of Opportunistic Mobile Ad Hoc Network routing algorithms on real devices: A software-driven approach

引用

AD HOC NETWORKS 2024年 163卷

作者： Jesus-Azabal, Manuel Garcia-Alonso, Jose Galan-Jimenez, Jaime Univ Extremadura Dept Ingn Sistemas Informat & Telemat Ave ElvasS-N Badajoz 06006 Extremadura Spain

Opportunistic Mobile Ad Hoc Networks (MANETs) offer versatile solutions in contexts where the Internet is unavailable. These networks facilitate the transmission between endpoints using a store-carry-forward strategy, thereby allowing information to be stored during periods of disconnection. Consequently, selecting the next hop in the routing process becomes a significant challenge for nodes, particularly because of its impact on Quality of Service (QoS). Therefore, routing strategies are crucial in opportunistic MANETs;however, their deployment and evaluation in real scenarios can be challenging. In response to this context, this paper introduces a monitoring software-driven tool designed to evaluate the QoS of routing algorithms in physical opportunistic MANETs. The implementation and its components are detailed, along with a case study and the outcomes provided by an implementation of the proposed solution. The results demonstrate the effectiveness of the implementation in enabling the analysis of routing protocols in real scenarios, highlighting significant differences with simulation results: mobility patterns in simulations tend to be inaccurate and overly optimistic, leading to a higher delivery probability and lower latency than what is observed in the real testbed.

关键词： Opportunistic Mobile Ad Hoc Networks Quality of Service routing algorithms Monitoring tool Testbed tool

来源：评论

学校读者我要写书评

暂无评论

Competitive analysis of minimal oblivious routing algorithms on hypercubes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第1期E84D卷 65-75页

作者： Yeh, TH Lei, CL Natl Taiwan Univ Dept Elect Engn Taipei 10764 Taiwan

We study the performance of oblivious routing algorithms that follow minimal (shortest) paths, referred to as minimal oblivious routing algorithms in this paper, using competitive analysis on a d-dimensional, N = 2(d)-node hypercube. We assume that packets are injected into the hypercube arbitrarily and continuously, without ally (e.g., probalilistic) assumption on the arrival pattern of the packets. Minimal algorithms reduce the total load in the network in the first place and they preserve locality. First we show that the well known deterministic oblivious routing algorithm, namely, the greedy routing algorithm, has competitive ratio Omega (N-1/2). Then we show a problem lower bound of Omega (N-log2(5/4)/log(5) N). We also give a natural randomized minimal oblivious routing algorithm whose competitive ratio is close to thr problem lower bound we provide.

关键词： routing algorithms minimal oblivious routing algorithms hypercubes competitive analysis

来源：评论

学校读者我要写书评

暂无评论

MIROR: A middleware software tool for interfacing mobile industrial robots with optimization routing algorithms

引用

SOFTWAREX 2022年 17卷

作者： Syrmos, Evangelos Bechtsis, Dimitrios Tsolakis, Naoum Int Hellen Univ Sch Engn Dept Ind Engn & Management Thessaloniki Greece Int Hellen Univ Sch Econ & Business Adm Dept Supply Chain Management Katerini Greece

Mobile robots are extensively used in flexible manufacturing systems and intra-logistics on a 24/7 basis to address demand fluctuations, increase productivity and promote environmental, economic and social sustainability. In this regard, routing algorithms are used to navigate mobile industrial robots for optimizing shop-floor logistics operations. However, open-source tools and software libraries implementing routing algorithms provide limited real-world relevance via indicatively neglecting the physical operating environment's characteristics and the kinematics of mobile robots. To this effect, this research designs, analyzes and develops MIROR, a middleware software tool that interfaces mobile industrial robots with route optimization algorithms to deliver a sophisticated testing environment that: (i) applies routing algorithms for the optimal logistics of mobile robots in customized industrial facility layouts;(ii) allows the comparison of the resulting algorithmic outcomes to inform about effective and efficient routing options;and (iii) creates optimal routing plans for informing the logistics operations of equivalent real-world mobile robots in industrial manufacturing settings. Specifically, MIROR integrates open-source Operations Research tools and the Robot Operating System to simulate and explore alternative logistics scenarios for mobile robots in 3D recreated industrial manufacturing facilities. To a greater extent, MIROR allows the transfer of the optimal routing code to equivalent real-world vehicles. Specifically, the implemented middleware tool handles variations of the Traveling Salesman Problem and generates feasible routes in complex facility layouts considering a variety of mobile robots. Academics and practitioners could benefit from the user-friendly interface of MIROR to generate realistic scheduling and routing options for the optimal planning of the logistics operations of mobile industrial robots in manufacturing environments. (C) 2021 The

关键词： routing algorithms Logistics optimization Mobile industrial robots Traveling Salesman Problem Middleware software tool Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

Comparison of routing algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)

引用

IEEE ACCESS 2019年 7卷 148629-148644页

作者： Akin, Erdal Korkmaz, Turgay Univ Texas San Antonio San Antonio TX 78249 USA Univ Texas San Antonio Comp Sci Dept San Antonio TX 78249 USA

In this paper, we compared the existing routing algorithms in the context of Software Defined Networking (SDN), where a logically centralized controller acquires the global view of the network, selects the paths using a routing algorithm, and installs the determined routing rules to the switches. We divided existing routing algorithms (RA) into three categories: RA with static link cost (RA-SLC), RA with dynamic link cost (RA-DLC), and RA with dynamic link cost and minimum interference (RA-DLCMI). We then implemented various routing algorithms from each category using RYU SDN controller and compared their performances on Mininet emulator. For the network state information (NSI) needed for the routing algorithms, we first consider the idealistic case where the accurate NSI is available, as assumed in the literature. However, since this is not possible in practice, we also considered the practical case where the controller periodically collects the NSI with some inaccuracy. In our experiments, we observed that while RA-DLC and RA-DLCMI give similar performance, RA-SLC falls behind of RA-DLC and RA-DLCMI in the number of accepted flows and total throughput. We also showed that the performance of every algorithm is adversely affected from the inaccuracy of NSI, calling for further research on developing effective NSI collection methods.

关键词： routing algorithms network state information accuracy software defined networking (SDN) traffic engineering

来源：评论

学校读者我要写书评

暂无评论

Optimal mapping of x-ray laser diffraction patterns into three dimensions using routing algorithms

引用

Physical Review E 2013年第4期88卷 042710-042710页

作者： Stephan Kassemeyer Aliakbar Jafarpour Lukas Lomb Jan Steinbrener Andrew V. Martin Ilme Schlichting Max-Planck-Institut für medizinische Forschung Jahnstr. 29 69120 Heidelberg Max Planck Advanced Study Group Center for Free-Electron Laser Science (CFEL) Notkestr. 85 22607 Hamburg Germany ARC Centre of Excellence for Coherent X-ray Science School of Physics The University of Melbourne Victoria 3010 Australia

Coherent diffractive imaging with x-ray free-electron lasers (XFEL) promises high-resolution structure determination of noncrystalline objects. Randomly oriented particles are exposed to XFEL pulses for acquisition of two-dimensional (2D) diffraction snapshots. The knowledge of their orientations enables 3D imaging by multiview reconstruction, combining 2D diffraction snapshots in different orientations. Here we introduce a globally optimal algorithm that can infer these orientations. We apply it to experimental XFEL data of nanoparticles and so determine their 3D electron density.

关键词： X-ray diffraction CARTOGRAPHY -- Laser use in X-ray lasers FREE electron lasers routing algorithms CRYSTAL structure NANOPARTICLES

来源：评论

学校读者我要写书评

暂无评论

UAV Ad Hoc Network routing algorithms in Space-Air-Ground Integrated Networks: Challenges and Directions

引用

DRONES 2023年第7期7卷

作者： Lu, Yuxi Wen, Wu Igorevich, Kostromitin Konstantin Ren, Peng Zhang, Hongxia Duan, Youxiang Zhu, Hailong Zhang, Peiying China Univ Petr East China Qingdao Inst Software Coll Comp Sci & Technol Qingdao 266580 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Guangzhou Univ Sch Comp Sci & Cyber Engn Guangzhou 510006 Peoples R China South Ural State Univ Dept Phys Nanoscale Syst 76 Lenin Ave Chelyabinsk 454080 Russia China Univ Petr East China Coll Oceanog & Space Informat Qingdao 266580 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

With the rapid development of 5G and 6G communications in recent years, there has been significant interest in space-air-ground integrated networks (SAGINs), which aim to achieve seamless all-area, all-time coverage. As a key component of SAGINs, flying ad hoc networks (FANETs) have been widely used in the agriculture and transportation sectors in recent years. Reliable communication in SAGINs requires efficient routing algorithms to support them. In this study, we analyze the unique communication architecture of FANETs in SAGINs. At the same time, existing routing protocols are presented and clustered. In addition, we review the latest research advances in routing algorithms over the last five years. Finally, we clarify the future research trends of FANET routing algorithms in SAGINs by discussing the algorithms and comparing the routing experiments with the characteristics of unmanned aerial vehicles.

关键词： unmanned aerial vehicles flying ad hoc network routing algorithms space-air-ground integrated

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient routing algorithms Based on OVSF Code and Priority in Clustered Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2013年第unknown期2013卷 1-8页

作者： Wu, Xiaoling Wang, Yangyang Liu, Guangcong Li, Jianjun Shu, Lei Zhang, Xiaobo Chen, Hainan Lee, Sungyoung Chinese Acad Sci Guangzhou Inst Adv Technol Guangzhou 511458 Guangdong Peoples R China Jinan Univ Guangzhou 510632 Guangdong Peoples R China Guangdong Univ Technol Guangzhou 510006 Guangdong Peoples R China Guangdong Univ Petrochem Technol Maoming 525000 Peoples R China Kyung Hee Univ Dept Comp Engn Yongin 446701 South Korea

Energy awareness is a vital design issue in wireless sensor networks. Since the amount of sensing data may be large and sensor nodes are usually battery-powered, it is critical to design energy-efficient routing algorithms to prolong network lifetime. Given a certain sensor deployment, the routing strategy of sensor data would have profound effects on the communication cost. In this paper, based on low-energy adaptive clustering hierarchy (LEACH) series protocols which are low-energy consumption adaptive clustering routing protocols, we propose the OVSF mechanism based routing protocol and EERPP (Energy-Efficient routing Protocol based on Priority). Simulation results of OVSF mechanism based protocol and EERPP demonstrate a significant improvement on the network metrics such as the lifetime and the end-to-end delay.

关键词： routing algorithms ENERGY consumption ORTHOGONAL functions WIRELESS sensor networks COMPUTER network protocols COMPUTER science

来源：评论

学校读者我要写书评

暂无评论

A Survey to Analyse routing algorithms for Opportunistic Network

引用

Procedia Computer Science 2020年 171卷 2501-2511页

作者： Soamdeep Singha Biswapati Jana Sharmistha Halder Jana Niranjan Kumar Mandal Department of Computer Science Vidyasagar University Paschim Medinipur West Bengal India-721102 Department of Electrical Engineering University of Engineering & Management Kolkata WB India

A mobile ad-hoc network (MANET) is a continuously self-configuring, infrastructure-less network of the wireless mobile device. Nodes are connected wirelessly and also responsible for data forwarding (no data transfer or routing device is present that is a router, switch, etc.). The opportunistic network is a subcategory of MANET, typically wireless handheld device carried by people. This survey admits a summary of the acquirable OPPNETs routing algorithms, their categorization, and an assessment of five routing protocols (Epidemic, Spray and Wait, First Contact, Prophet, and Max-Prop) in terms of variable buffer size. Detailed computer simulation demonstrates that as the burden or load on the network growths, the efficiency of routing strategies decrease in terms of delivery probability and overhead ratio. The experiments establish that Maxprop routing delivery probability is highest than the others. It has been also observed that the ratio of packet dropped and relayed has been decreased according to buffer size increased. The First Contact routing delivery probability may not differ most with changes the buffer sizes. In terms of overhead ratio, the result of Epidemic is better than Spray and Wait, First Contact, Prophet, MaxProp routing algorithms. Results vary depending on the buffer size, contact times, and speed. The consequences indicate that some can carry and exchange information faster, and improve connectivity in OPPNETs.

关键词： Mobile Adhoc Network (MANET) Opportunistic Network (OPPNET) routing algorithms Congestion Control Packet Loss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：