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

Design and Evaluation of Low-Latency and Shortest-Path routing algorithm for Triplet-Based Hierarchical Interconnection Network

引用

JOURNAL OF TESTING AND EVALUATION 2013年第4期41卷 541-550页

作者： Zhang, Yang Shi, Feng Beijing Inst Technol Sch Comp Beijing 100081 Peoples R China Hebei Univ Sci & Technol Sch Informat Sci & Engn Shijiazhuang 050018 Hebei Peoples R China

routing is one of the key factors that determine how much of the ideal performance of the network-on-chip is realized. A well-designed routing algorithm can extend much benefit through the implementation of this potential. Existing routing algorithms for a triplet-based hierarchical interconnection network (THIN) can be applied for a balanced THIN but are not suitable for a non-balanced THIN. This paper proposes the shortest path routing algorithm for THIN, called SPORT, which can be applied to both the balanced and non-balanced THINs. Based on the THIN features, SPORT computes the shortest path at the source node and constructs the output port list to minimize the computation time at the intermediate node. The simulation results show that SPORT can obtain lower traffic latency than existing routing algorithms. We also compare THIN with the 2D mesh in terms of traffic locality. The simulation results show that THIN is more suitable than the 2D mesh for these high-locality traffic-workloads.

关键词： routing algorithm coding scheme THIN performance evaluation

来源：评论

学校读者我要写书评

暂无评论

An intelligent fuzzy-based routing algorithm for video conferencing service provisioning in software defined networking

引用

TELECOMMUNICATION SYSTEMS 2024年第4期87卷 887-898页

作者： Wu, Changqian Zhang, Yulin Li, Na Rezaeipanah, Amin Minnan Sci & Technol Coll Key Lab Big Data & Artificial Intelligence Univ Fu Quanzhou 362000 Fujian Peoples R China Jose Rizal Univ Dept Business Adm Manila 1552 Philippines Tongji Univ Coll Elect & Informat Engn Shanghai 201800 Peoples R China Persian Gulf Univ Dept Comp Engn Bushehr Iran

The requirements for providing video conferencing services through Software-Defined Networking (SDN) are growing. The importance of this issue has been recognized by the research society, as video conferencing consumes significant network bandwidth. However, SDN can improve network performance and Quality of Service (QoS) by flexible mechanisms and adopting cheaper switches. The combination of SDN and fuzzy logic can provide a global perspective of traffic engineering to deal with these problems. In this study, we present an intelligent Fuzzy-based routing algorithm for Video Conferencing service provisioning under Latency and Bandwidth constraints in SDN (FRVCLB). FRVCLB considers the routing problem in SDN with guaranteed latency and bandwidth under QoS requirements, where the details of future requests are unknown. First, the network is weighted based on critical links to reduce routing interference on future requests. Second, FRVCLB uses a deferral module to temporarily postpone requests with high resource demands to manage connection priorities. Finally, an intelligent routing algorithm based on fuzzy logic is applied for routing on the weighted network. The results of the evaluations show that FRVCLB significantly improves the admission rate of video conferencing connections compared to its peers.

关键词： Software-defined networking Video conferencing services Fuzzy logic routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Q-Learning-Based Fault-Tolerant and Congestion-Aware Adaptive routing algorithm for Networks-on-Chip

引用

IEEE EMBEDDED SYSTEMS LETTERS 2022年第4期14卷 203-206页

作者： Liu, Yi Guo, Rujia Xu, Changqing Weng, Xiaodong Yang, Yintang Xidian Univ Sch Microelect Xian 710071 Peoples R China Xidian Univ Guangzhou Inst Technol Xian 710071 Peoples R China

Link failure and network congestion have a serious impact on the performance degradation of network on chip (NoC). Adaptive routing algorithms, which have the capability of fault tolerance and congestion awareness, can make NoCs adapt to complex and changeable applications. The proposed algorithm in this letter is an adaptive routing algorithm based on Q -learning. By introducing H - Q table to learn the congestion and fault information of the paths between the source node and the destination node, it can avoid the unnecessary detour of data in the fault area and select the path with less congestion. Aiming at the problem caused by the untimely updating of some values in Q -learning, the Q -value decay and dynamic learning rate mechanism are proposed. Experimental results demonstrate that the proposed routing algorithms still can obtain a good performance under a high failure rate (Fault rate > 25%) with modest extra hardware overhead.

关键词： Congestion aware fault tolerant network on chip (NoC) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing algorithm in bifurcated buffer banyan ATM switch

Routing algorithm in bifurcated buffer banyan ATM switch

引用

4th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, ITELSIKS 1999

作者： Radusinović, Igor Pejanović-Durišić, Milica Petrović, Zoran Faculty of Electrical Engineering University of Montenegro Cetinjski put bb 81000 Podgorica Montenegro Faculty of Electrical Engineering University in Belgrade Bulevar Revolucije 73 11000 Belgrade Serbia

The authors present their research on the routing algorithm of a bifurcated buffer banyan ATM switch. They affirm input buffer banyans because of their simplicity for implementation and required performance levels. Th... 详细信息

ISBN: (纸本)078035768X

关键词： ATM backpressure Banyan routing algorithm switch

来源：评论

学校读者我要写书评

暂无评论

Trust based Intelligent routing algorithm for Delay Tolerant Network using Artificial Neural Network

引用

WIRELESS NETWORKS 2017年第3期23卷 693-702页

作者： Singh, Ajay Vikram Juyal, Vandana Saggar, Ravish Amity Univ Noida Uttar Pradesh India BCIIT Delhi India

In today's world, when every mobile device corresponds with human behavioral patterns. People often come across with various communities having patterns such as mobility, communication and groups. Trust is an intrinsic factor, which plays important role in formation of such communities. It is important to see the inherent risk involved in such socially active communities. Such factors motivate the use of trust as a routing factor in Delay Tolerant Networks (DTNs). This paper proposes a Trust based Intelligent routing algorithm, which exploits the Call Data Record from Call Detail Record. The function of Artificial Neural Network is to calculate and learn, trust value that can be shared among network devices. Our algorithm lowers the need of nodes resources like energy consumption, computation time and space overheads. The proposed algorithm enhances the routing performance in DTN. The earlier work claiming better efficiency generally ends up consuming network's resources. On the contrary our proposed algorithm provides in-built security, without any additional overhead. To the best of our knowledge the proposed work is the first of its kind, providing ingrained security feature to the DTN. This work gives vantage point to the researchers in the field over other schemes proposed in the past.

关键词： Delay Tolerant Network Opportunistic Network Trust Management Artificial Neural Network routing algorithm Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Adaptive routing algorithm for Network Load Balancing

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2011年第5期6卷 441-449页

作者： Une, Hiroyuki Qian, Fei Hirata, Hironori Hiroshima Kokusai Gakuin Univ Fac Informat Design Aki Ku Hiroshima 7390321 Japan Chiba Univ Grad Sch Engn Inage Ku Chiba 2638522 Japan Kanto Gakuin Univ Coll Engn Kanazawa Ku Yokohama Kanagawa 2368501 Japan

This paper introduces a routing algorithm which distributes the network traffic for each feasible route based on the reinforcement learning scheme. The aim of this algorithm is to reduce the transfer delay caused by congestion of the network. Most routing algorithms based on the reinforcement learning scheme could not avoid forwarding traffic toward the source of data packets. This property creates transfer loops and a lot of packet loss. In particular, the transfer loop may cause change in the order of packets, and also retransmit on the TCP connection. Thus, we employ a method that estimates the lower boundary of the probability for valid route to the destination, and this lower boundary can be used to reject the routes which cause the transfer loop. (C) 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： routing algorithm load balancing ant colony optimization reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Weighted-based path rediscovery routing algorithm for improving the routing decision in wireless sensor network

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2021年 1-9页

作者： Sankaran, K. Sakthidasan Vijayan, K. Yuvaraj, S. Periasamy, J. K. Balasaraswathi, M. Verma, Jay Prakash Narayan Tyagi, Chandra Shakher Hindustan Inst Technol & Sci Dept Elect & Commun Engn Chennai Tamil Nadu India SRM Inst Sci & Technol Fac Engn & Technol Dept Telecommun Engn Chennai Tamil Nadu India SRM Inst Sci & Technol Fac Engn & Technol Dept Elect & Commun Engn Chennai Tamil Nadu India Sri Sairam Engn Coll Dept Comp Sci & Engn Chennai Tamil Nadu India Saveetha Sch Engn Dept Elect & Commun Engn Chennai Tamil Nadu India SRM Inst Sci & Technol Fac Engn & Technol Dept Elect & Commun Engn NCR Campus DelhiNCR CampusDelhi Meerut Rd Modinagar UP India

Route failures pursued by rerouting is common in WSNs due to the unpredictable network dynamics and autonomous node behaviors. Optimal selection of neighbor is henceforth necessary to ensure profitable packet delivery and application support. In this manuscript, we propose a Weighted Path Rediscovery (WPR) routing for improving the routing decisions of WSN nodes. This routing algorithm is intended to prevent backtracking and curtail looped routing in WSNs. WPR precis's conventional routing based on link expiration time (let) and fun factor at the time of neighbor discovery and reinforced routing, respectively. The two distinct features are converged using link stability factor to ensure the improved routing satisfying node's behavior constraints. This improves the quality of packet transmission and minimizes routing complexity. The proposed routing algorithm is assessed using the factors: Packet Delivery Ratio (PDR), End-to-End Delay, Overhead and Connection Ratio.

关键词： routing algorithm Weighted path Sensor networks Transmission swiftness Neighbor nodes

来源：评论

学校读者我要写书评

暂无评论

A fuzzy delay-bandwidth guaranteed routing algorithm for video conferencing services over SDN networks

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2023年第17期82卷 25585-25614页

作者： Gong, Jianhu Rezaeipanah, Amin Guangdong Peizheng Coll Sch Data & Comp Sci Guangzhou 510830 Peoples R China Univ Rahjuyan Danesh Borazjan Dept Comp Engn Bushehr Iran

Video conferencing is one of the advanced technologies for users that allows online communication despite long distances. High quality communication and ongoing support for the principles of video conferencing service that can be achieved through Software-Defined Networking (SDN). SDN is a new architecture for computer networks that separates the control plane from the data plane to improve network resources and reduce operating costs. All routing decisions and control mechanisms are made by a device called a controller. Traffic engineering can be well implemented in SDN because the entire network topology is known to the controller. Considering SDN features, user requests can be dynamically routed according to current network status and Quality of Service (QoS) requirements. In general, the purpose of SDN routing algorithms is to maximize the acceptance rate of user requests by considering QoS requirements. In this literature, most routing studies to provide satisfactory video conferencing services have focused solely on bandwidth. Nevertheless, some studies have considered both delay and bandwidth constraints. In this paper, a Fuzzy Delay-Bandwidth Guaranteed routing (FDBGR) algorithm is proposed that considers both delay and bandwidth constraints in routing. The proposed fuzzy system is based on rules that can postpone requests with high resource demands. Also, the purpose of the FDBGR is to distribute the network workload evenly for all requests, where this is done by maintaining the capacity to accept future requests. The combination of conventional routing algorithms and SDN provides remarkable improvements in mobility, scalability and the overall performance of the networks. Simulations are performed on different scenarios to evaluate the performance of the FDBGR compared to state-of-the-art methods. Besides, FDBGR has been compared with a number of most related previous works such as H-MCOP, MH-MCOP, QoMRA, QROUTE and REDO based on criteria such as number of

关键词： routing algorithm SDN Delay Bandwidth Video conferencing service Fuzzy system

来源：评论

学校读者我要写书评

暂无评论

An energy-aware trust-based routing algorithm using gravitational search approach in wireless sensor networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年第1期12卷 167-176页

作者： Zahedi, Abdulhamid Parma, Faryad Kermanshah Univ Technol Dept Elect Engn Kermanshah Iran Islamic Azad Univ Kermanshah Branch Dept Comp Engn Kermanshah Iran

Rapid developments in the field of processors and radio technology have provided the context of small sensor nodes which are able to communicate in wireless sensor networks. But data security is restricted by these factors. An intelligent trust management plan needs to be applied for detection of the reliability of sensor nodes to distinguish between malicious nodes from other nodes. In this paper a trust-based energy-aware routing algorithm has been proposed. Considering direct and indirect trust of nodes and energy saving issue, the routing function metrics are optimized by Gravitational Search Approach. This routing method is called Energy-aware Trust-based Gravitational Search Approach (ETGSA). Simulation has been done by NS-2 and it is shown that the main characteristics such as reduction of computational overhead and increasing reliability against of attacks in the network are improved compared with other efficient algorithms in this field.

关键词： Gravitational search approach Network attacks routing algorithm Trust-based decision Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A new position based routing algorithm for vehicular ad hoc networks

引用

TELECOMMUNICATION SYSTEMS 2020年第2期75卷 205-220页

作者： Shukla, Ravi Shankar Tyagi, Neeraj Gupta, Ashutosh Dubey, Kamlesh Kumar Invertis Univ Dept CSE & IT Bareilly Uttar Pradesh India MNNIT Allahabad Dept CSE Allahabad Uttar Pradesh India MJP Rohilkhand Univ Dept CS & IT Bareilly Uttar Pradesh India Invertis Univ Dept Math Bareilly Uttar Pradesh India

The main requirement to make safer journey in VANET environment is minimum delay with high packet delivery rate. This ensures that all data packets are received with minimal delay to prevent any accident. This paper presents a new algorithm for VANET class routing protocol that covers sparse and coarse region of vehicles. It takes the advantage of road layout to improve the performance of routing in VANETs. The proposed algorithm uses real-time GPS tracking system to obtain traffic information for creating road based paths from source node to destination node. The optimize forwarding is used to figure out the forwarding node along the road pattern that form the path to deliver the data packets. The results shows that proposed algorithm obtain better results considering the various simulation parameters.

关键词： Ad-hoc network VANET routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：