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

bellman-ford algorithm for solving shortest path problem of a network under picture fuzzy environment

COMPLEX & INTELLIGENT SYSTEMS 2021年第5期7卷 2373-2381页

作者： Parimala, Mani Broumi, Said Prakash, Karthikeyan Topal, Selcuk Bannari Amman Inst Technol Dept Math Sathyamangalam 638401 India Univ Hassan 2 Fac Sci Ben MSik Lab Informat Proc Casablanca Morocco Bitlis Eren Univ Arts & Sci Fac Dept Math Bitlis Turkey

An elongation of the novel intuitionistic fuzzy set is a picture fuzzy set theory. The demonstration of this has been used to deal with the abstinence criteria in a decision-making problem. The uncertainty in nature occurs sometimes in real-world problems and amidst them, the prominent one is the shortest path problem (SPP) solving. In the last few years, one of the best algorithms on the network for finding SPP is bellman-ford. Due to uncertainty in the decision-making process, it becomes difficult for decision-makers for communicating their point of view and judgment with certainty. We conceive of SPP in this contribution via bellman's algorithm (BA) for a network with trapezoidal picture fuzzy numbers (TPFNs). We introduce a new algorithm to stand the shortest picture fuzzy path between each pair of nodes. A TPFN is considered for the length of all edges. A numerical example for the validation of the presented algorithm has also been proposed. There has also been relative research with existing techniques showing the benefits of the new algorithm.

关键词： Shortest path problem bellman-ford algorithm Picture fuzzy graph Trapezoidal picture fuzzy number

来源：评论

学校读者我要写书评

暂无评论

Application of Modified bellman-ford algorithm for Cooperative Communication

引用

WIRELESS PERSONAL COMMUNICATIONS 2019年第3期109卷 2025-2049页

作者： Devi, Boddu Rama Rao, K. Kishan Rani, M. Asha Kakatiya Inst Technol & Sci Dept ECE Warangal 500015 Telangana India Sreenidhi Engn Dept ECE Warangal 506005 Telangana India JNTUH Coll Engn Hyderabad Dept ECE Kukatpally 500085 Telangana India

Network lifetime of mobile ad hoc networks is limited by the battery power of the mobile nodes. Energy saving can be achieved by operating the nodes in power save mode (PSM). Cooperative communication provides the cooperative diversity and the performance of the network can be improved by using cooperative relays. A new cooperative modified bellman ford algorithm (CMBFA) using PSM is proposed to improve the performance of the network. Distributed bellman ford algorithm (DBFA) is considered as a basic routing protocol. A modified bellman-ford algorithm (MBFA) also called as Non-cooperative MBFA (NCMBFA) is developed by modifying the DBFA. In NCMBFA, residual energy of a node is considered to select the optimal path for routing the packets. NCMBFA is energy efficient and suitable for Grid topology using PSM. In the proposed CMBFA, the nodes in the Grid topology are categorized into amplify-and-forward and decode-and-forward nodes using the received signal-to-noise ratio at the relay. All the DF nodes are considered for routing and the optimum route is calculated using the NCMBFA. For CMBFA and NCMBFA, the bit error rate performance of the network for BPSK, QPSK, and 64-QAM modulation schemes are analyzed. The performance metrics of the packet received, delay and the average jitter of CMBFA and NCMBFA are compared. Simulation results show clearly that CMBFA gives better performance over NCMBFA and CMBFA consumes less energy compared to NCMBFA using PSM.

关键词： Amplify-and-forward bellman-ford algorithm Cooperative communication Decodeand and forward Power save mode

来源：评论

学校读者我要写书评

暂无评论

Link Failure Emulation with Dijkstra and bellman-ford algorithm in Software Defined Network Architecture (Case Study: Telkom University Topology) 6

Link Failure Emulation with Dijkstra and Bellman-Ford Algori...

引用

6th International Conference on Information and Communication Technology (ICoICT)

作者： Nastiti, Anggie Rakhmatsyah, Andrian Nugroho, Muhammad Arief Telkom Univ Sch Informat Engn Informat Engn Bandung Indonesia

ISBN: (纸本)9781538645727

In Telkom University, the topology used does not have backup link for campus internal network in case of link failure because the topology is still based on interVLAN where each switch only has one path to switch core. Data packets cannot be delivered from source to destination if there is a link failure on the path. Based on the problem, it is proposed a new architecture which is Software Defined Network (SDN) that can overcome the link failure by configuring the controller in order to move to alternative links that have been provided with OpenFlow. This architecture separates the control plane and data plane, so it is centralized and programmable. To look for alternative links when a link failure occurs, the shortest path algorithm is Dijkstra and bellman-ford algorithms. The test parameters performed in this research are functionality to determine whether the two algorithms can determine the path or not, and convergence time to find out how long it takes to form the path from source to destination. Scenario of the test is done before and after the link failure occurs by using Ryu as controller and Mininet as emulator. Based on the results of the tests conducted, it was found that Dijkstra and bellman-ford algorithm can be applied well on link failure emulation in accordance with the scenario and topology used in the test. In addition to convergence time parameters obtained that Dijkstra algorithm is superior compared to bellman-ford algorithm. The difference gained in both scenarios has a value that is not so great the difference.

关键词： Software Defined Network Dijkstra algorithm bellman-ford algorithm Link Failure

来源：评论

学校读者我要写书评

暂无评论

The Purpose of bellman-ford algorithm to Summarize the Multiple Scientific Indonesian Journal Articles 6

The Purpose of Bellman-Ford Algorithm to Summarize the Multi...

引用

6th International Conference on Wireless and Telematics (ICWT)

作者： Maylawati, Dian Sa'adillah Alam, Cecep Nurul Muharram, Muhammad Fakhri Ramdhani, Muhammad Ali Amin, Abdusy Syakur Aulawi, Hilmi UIN Sunan Gunung Djati Bandung Dept Informat Bandung Indonesia Univ Pasundan Dept Ind Engn Bandung Indonesia Sekolah Tinggi Teknol Garut Dept Ind Engn Garut Indonesia

ISBN: (纸本)9781728175966

Text is a one of huge type data in the big data era today. It can be processed to be valuable information with Natural Language Processing approach, such as Automated Text Summarization. This study aims to purpose the text summarization automatically for multiple text documents with graph approach at once. The graph approach that purposed in this research as methodology is bellman-ford algorithm. This research uses scientific journal articles documents in Indonesian language as the case study. The result of this research is the logical framework based on literature review ana analysis of bellman-ford algorithm for automated text summarization. This framework can be implemented and evaluated in the further works.

关键词： bellman-ford algorithm extractive summarization multiple documents natural language processing text summarization

来源：评论

学校读者我要写书评

暂无评论

An Improved Approach for Eliminating the Loop in Hybrid Software Defined Network (SDN) Using Modified bellman-ford algorithm

引用

JOURNAL OF INTERCONNECTION NETWORKS 2020年第4期20卷

作者： Mohan, J. Devanagaonkar, Shweta M. Garur, Vineeta V. Karthik, A. Rohitaksha, K. Rajendra, A. B. JSS Acad Tech Educ Dept Comp Sci & Engn VTU Bengaluru Karnataka India Vidyavardhaka Coll Engn Dept Informat Sci & Engn Mysuru Karnataka India

SDN is approaching its own structure of acceptance. Therefore, the increasing deployment of SDNs is being discussed as a possible approach, appearing in the development of the hybrid SDN networks. An foremost work in the hybrid SDN networks is bandwidth allocation, taking into account the integration of both SDN-enabled and conventional switches. The network loop in layer 2 switches is skipped in Spanning Tree Protocol (STP) by ceaselessly watching the network to trace all links and block the unwanted ones. Bridge loops will occur anytime there's a redundant Layer2 way between ends. By default, switches forward broadcast/multicast out all ports, other than the port from that the broadcast/multicast was delivered. Once a switch loop is brought in the network, broadcast messages are going to be broadcasted more often leading to broadcast storms. The Spanning-tree algorithm enforces a distributed divergent of the bellman-ford iterative algorithm that always looks for the optimal solution and selects an optimal influential switch anytime. In this paper we use controller's global network view for resolving loop problem in layer 2 network. SDN controller acts on broadcast packets received from switch-ports and host-ports differently that is if the broadcast packets received from host ports, the SDN controller broadcasts these packets to all ports and if broadcast packets is received from switch ports, only some switches broadcasts these packets on all ports instead of all switches.

关键词： Hybrid Software Defined Network (Hy SDN) OpenFlow Pox controller Legacy switches bellman-ford algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Implementation of the bellman-ford algorithm on GPU 4

Efficient Implementation of the Bellman-Ford Algorithm on GP...

引用

IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Nazarifard, Marjan Bahrepour, Davoud Salman Inst Higher Educ Mashhad Iran Islamic Azad Univ Mashhad Branch Mashhad Iran

ISBN: (纸本)9781538626405

Single-source shortest path (SSSP) problem is a common algorithm in graph analysis. bellman-ford is a primitive algorithm to solve the shortest path to the source node, which enables the detection of the negative-weighted cycle in a graph. Moreover, it is represents a class of parallel algorithms, the memory accesses and work distribution of which are both irregular and data-dependent. Recently, graphics processors have been used for implementing many algorithms, as well as an accelerator in supercomputers. Several SSSP algorithms have been proposed based on graphics processing units (GPUs), each of which could traverse a specific type of graph. In this paper, we accelerated the bellman-ford algorithm on GPU using CUDA, so that it could traverse dense and sparse graphs (regular and irregular) within the shortest time compared to the previous algorithms. According to the simulation results, the proposed implementation provided an average speed-up of 1.87x compared to most of the previous parallel implementation algorithms.

关键词： single-source shortest path (SSSP) bellman-ford algorithm graphics processing unit (GPU) negative weighted cycle (NWC) non-coalesced memory access warp divergence

来源：评论

学校读者我要写书评

暂无评论

Accelerating a bellman-ford Routing algorithm Using GPU 1

引用

FTRA International Symposium on Frontier and Innovation in Future Computing and Communications (FCC)

作者： Jeong, In-Kyu Uddin, Jia Kang, Myeongsu Kim, Cheol-Hong Kim, Jong-Myon Univ Ulsan Sch Elect Engn Ulsan 680749 South Korea Chonnam Natl Univ Sch Elect & Comp Engn Gwangju South Korea

ISBN: (数字)9789401787987

ISBN: (纸本)9789401787987;9789401787970

This paper presents a graphics processing unit (GPU)-based implementation of the bellman-ford (BF) routing algorithm used in distance-vector routing protocols. In the proposed GPU-based approach, multiple threads concurrently run in numerous streaming processors in the GPU to update the routing information instead of computing the individual vertex distances one-by-one, where an individual vertex distance is considered as a single thread. This paper compares the performance and energy consumption of the GPU-based approach with those of the equivalent central processing unit (CPU) implementation for varying the number of vertices. Experiment results show that the proposed approach outperforms the equivalent sequential CPU implementation in terms of execution time by exploiting massive parallelism inherent in the BF routing algorithm.

关键词： bellman-ford algorithm Internet protocol routing Graphics processing unit Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An intelligent energy management for an on-grid hybrid energy system cost reduction

引用

JOURNAL OF ENERGY STORAGE 2025年 110卷

作者： Riveron-Miranda, Israel Gomez-Gonzalez, Jose Francisco Mendez-Perez, Juan Albino Univ La Laguna Dept Comp Sci & Syst Engn San Cristobal la Laguna Spain Univ La Laguna Dept Ind Engn San Cristobal la Laguna 25197 Spain

This paper introduces an innovative Energy Management System (EMS) designed to reduce the cost of energy flows in a Hybrid Renewable Energy System (HRES) connected to a grid with an Energy Storage System (ESS) based on Li-ion batteries. This study considers power purchase and sale tariffs, as well as the variable costs associated with the battery wear contingent on its State of Charge (SoC). The proposed EMS is a supervised controller that combines three Fuzzy Logic Controllers (FLCs) in a cascade to regulate the SoC of the battery via its current, and a setpoint controller based on a Hysteresis-Based Calculation algorithm (HBC) to establish charge and discharge setpoints and SoC bounds according to the battery wear cost profile. Other EMSs consider battery wear fixed costs or calculate them by counting algorithms, and arbitrary minimum SoCs to extend its Cycle Life (CL). However, these approaches are insufficient to achieve adequate battery management that, in addition to preventing deterioration and premature replacement, analyses the costs due to its usage alongside the other costs of the HRES in order to reduce them. The present work proposes amore advanced EMS that uses a battery usage cost profile based on its Full Equivalent Cycle (FEC) according to the Depth of Discharge (DoD). This approach allows amore realistic calculation of the battery wear cost. Additionally, it establishes more appropriate SoC limits aligned with the energy flow costs across the entire HRES. This perspective adds robustness to the EMS, enabling its use with cost profiles for batteries of different technologies and capacities, as well as varying energy purchase-sale tariffs and power limitations. The introduced approach was found to be more reliable against uncertainties in power-balanced forecasts, and also more computationally cost-effective and convenient for real-time applications compared to existing optimisation techniques. Accordingly, the EMS's supervised control strategy was e

关键词： Energy Management System Hybrid Renewable Energy System Energy Storage System Microgrid Electric battery Fuzzy Logic Controller Supervisory Control Optimal Power Flow bellman-ford algorithm

来源：评论

学校读者我要写书评

暂无评论

Closed semiring connectionist network for the bellman-ford computation

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1996年第3期143卷 189-195页

作者： Lam, KP Tong, CW Department of Systems Engineering & Engineering Management The Chinese University of Hong Kong Shatin Hong Kong

The bellman-ford algorithm is well known for providing a dynamic programming solution for the shortest path problem. Alternatively, the closed semiring is an algebraic structure which unifies a family of path problems, including all-pairs shortest path, transitive closure and minimum spanning tree, defined on directed or undirected graphs. This paper proposes a connectionist network architecture, called the binary relation inference network, which incorporates the bellman-ford computation for solving closed semiring problems. The extension and summary operators of closed semirings correspond to the site and unit functions of the network. The inference network structure offers an obvious advantage of being simply extensible for asynchronous and continuous-time operation. Implementation in analogue processing circuits promises a practical problem size independence in the solution time. VLSI circuits are also presented and limiting factors of performance are discussed, with particular reference to the minimum spanning tree problem.

关键词： bellman-ford algorithm dynamic programming VLSI closed semirings connectionist network architecture

来源：评论

学校读者我要写书评

暂无评论

Digital FPGA implementation for bellman-ford computation

Digital FPGA implementation for Bellman-Ford computation

引用

Conference on Reconfigurable Technology - FPGAs and Reconfigurable Processors for Computing and Communications III

作者： Fung, WM Ng, HS Lam, KP Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China

ISBN: (纸本)0819442496

The binary relation inference network (BRIN) is an architecture for the realisation of the bellman-ford and Floyd-Warshall algorithms. It has been used to solve a range of path problems, including shortest path and minimum spanning tree (MST) on graphs. Previous implementation was performed on an analog platform, by connecting op-amp chips externally. However, physical size of circuits would become impractical as the problem size grows. The external connections would also lead to bandwidth problems. The advancement of field programmable gate arrays (FPGAs) in recent years, allowing millions of gates on a single chip and accompanying with high level design tools, has allowed the implementation of very complex networks. With this exemption on manual circuit construction and availability of efficient design platform, the BRIN architecture could be built in a much more efficient way. Problems on bandwidth are removed by taking all previous external connections to the inside of the chip. By transforming BRIN to FPGA (Xilinx XC4010XL and XCV800 Virtex), we implement a synchronous network with computations in a finite number of steps. Two case studies are presented, with correct results verified from both simulation and circuit implementation. Resource consumption on FPGAs is studied showing that Virtex devices are more suitable for the expansion of network in future developments.

关键词： binary relation inference network bellman-ford algorithm Floyd-Warshall algorithm shortest path minimum spanning tree FPGA implementation Xilinx XC4010XL Xilinx Virtex device

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：