Resource Type

Journal Article 301

Year

2023 19

2022 17

2021 25

2020 15

2019 18

2018 20

2017 35

2016 23

2015 4

2014 7

2013 6

2012 4

2011 3

2010 4

2009 6

2008 11

2007 16

2006 17

2005 11

2004 10

open ︾

Keywords

genetic algorithm 12

Genetic algorithm 4

Artificial intelligence 3

Deep learning 3

Reinforcement learning 3

ANN 2

BP algorithm 2

Convolutional neural network 2

Optimization 2

genetic algorithms 2

learning algorithm 2

motion compensation 2

neural network 2

optimization 2

scanning microwave radiometer 2

1) model 1

3D path planning 1

3D printing 1

5G 1

open ︾

Search scope:

排序： Display mode:

Dynamical Fast IP-Routing Lookup Algorithm

Liu Yalin

Strategic Study of CAE 2002, Volume 4, Issue 7,   Pages 60-68

Abstract:

This paper proposes a dynamical fast IP-routing lookup algorithm (DFR). This algorithm uses special data structure to construct index table, and can support inserting, deleting and updating route dynamically. DFR algorithm accesses memory at most four times and at least two times for a route look up. DFR is suitable not only for hardware implementation but also for software implementation.

Keywords： prefix expansion     dynamical fast IP-routing lookup algorithm (DFR)     route     route lookup    

HTML PDF Collect

One Novel Dynamic Routing and Wavelength Assignment Integrate Algorithm in WDM Optical Network

Li Lei,Tang Yong,Rao Min,Chen Yu,Jiang Jianfeng,Zhang Mingde,Sun Xiaohan

Strategic Study of CAE 2004, Volume 6, Issue 12,   Pages 73-77

Abstract:

Dynamic routing and wavelength assignment in the WDM networks with.both dynamic service traffic and limited-range wavelength conversion have been discussed. According to probability and limitation of wavelength conversion, a novel heuristic algorithm, which could achieve dynamic minimum cost routing and optimal virtual wavelength path, DMC - OVWP, is proposed based on Moone-Dijkstra algorithm. With separation and combination of routing and wavelength assignment subproblems, the algorithm optimizes RWA problem. The results simulating CERNET using the algorithm show that low blocking probability has been obtained.

Keywords： dynamic routing     DWC-OVWP     wavelength conversion     virtual wavelength path     link weight    

HTML PDF Collect

A fuzzy integrated congestion-aware routing algorithm for network on chip Research Articles

Shahrouz Yasrebi, Akram Reza, Mohammad Nikravan, Seena Vazifedan,a.reza@qodsiau.ac.ir,a.ak.reza@gmail.com

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 5,   Pages 615-766 doi: 10.1631/FITEE.2000069

Abstract: (NoC) is an infrastructure providing a communication platform to multiprocessor chips. Furthermore, the wormhole-switching method, which shares resources, was used to increase its efficiency; however, this can lead to congestion. Moreover, dealing with this congestion consumes more energy and correspondingly leads to increase in power consumption. Furthermore, consuming more power results in more heat and increases thermal fluctuations that lessen the life span of the infrastructures and, more importantly, the network’s performance. Given these complications, providing a method that controls congestion is a significant design challenge. In this paper, a is presented to enhance the NoC’s performance when facing congestion. To avoid congestion, the proposed algorithm employs the occupied input buffer and the total occupied buffers of the neighboring nodes along with the maximum possible path diversity with minimal path length from instant neighbors to the destination as the selection parameters. To enhance the path selection function, the uncertainty of the algorithm is used. As a result, the average delay, power consumption, and maximum delay are reduced by 14.88%, 7.98%, and 19.39%, respectively. Additionally, the proposed method enhances the throughput and the total number of packets received by 14.9% and 11.59%, respectively. To show the significance, the proposed algorithm is examined using transpose traffic patterns, and the average delay is improved by 15.3%. The average delay is reduced by 3.8% in TMPEG-4 (treble MPEG-4), 36.6% in QPIP (quadruplicate PIP), and 20.9% in TVOPD (treble VOPD).

Keywords： 片上网络；路由算法；拥塞控制；模糊逻辑    

HTML PDF Collect

A novel context-aware RPL algorithm based on a triangle module operator Research Article

Yanan Cao, Hao Yuan,caoyanan@tjnu.edu.cn,yuanhao19880520@163.com

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 12,   Pages 1551-1684 doi: 10.1631/FITEE.2000658

Abstract: For the use in low-power and lossy networks (LLNs) under complex and harsh communication conditions, the routing protocol for LLNs (RPL) standardized by the Internet Engineering Task Force is specially designed. To improve the performance of LLNs, we propose a novel RPL algorithm based on a (CAR-TMO). A novel composite routing metric (CA-RM) is designed, which synchronously evaluates the residual energy index, buffer occupancy ratio of a node, expected transmission count (ETX), delay, and hop count from a candidate parent to the root. CA-RM considers the residual energy index and buffer occupancy ratio of the candidate parent and its preferred parent in a recursive manner to reduce the effect of upstream parents, since farther paths are considered. CA-RM comprehensively uses the sum, mean, and standard deviation values of ETX and delay of links in a path to ensure a better performance. Moreover, in CAR-TMO, the of each routing metric is designed. Then, a comprehensive is constructed based on a , the of each routing metric, and a comprehensive objective function. A novel mechanism for calculating the node rank and the mechanisms for preferred parent selection are proposed. Finally, theoretical analysis and simulation results show that CAR-TMO outperforms several state-of-the-art RPL algorithms in terms of the packet delivery ratio and energy efficiency.

Keywords： 三角模算子；隶属度函数；情景感知；低功耗有损网络路由协议（RPL）；路由度量    

HTML PDF Collect

Anovel forwarding and routing mechanism design in SDN-basedNDNarchitecture None

Jia LI, Ren-chao XIE, Tao HUANG, Li SUN

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 9,   Pages 1135-1150 doi: 10.1631/FITEE.1700698

Abstract:

Combining named data networking (NDN) and software-defined networking (SDN) has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service (QoS) applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm (GA) to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.

Keywords： SDN-based NDN     Forwarding mechanism     QoS routing     Genetic algorithm    

HTML PDF Collect

Design and Implementation of High Performance Security Router BW7000

Xu Mingwei,Xu Ke,Xiong Yongqiang,Jiang Yong,Sun Xiaoxia,Wu Jian,Yu Zhongchao

Strategic Study of CAE 2002, Volume 4, Issue 3,   Pages 54-62

Abstract:

High performance and security are hot areas of the research of Internet. How to provide security protection but not decrease the forwarding performance is a hot research topic currently. This paper is based on the research of the high performance security router, a key project of national high technology research and development plan. Operating system (HEROS) of the high performance router BW7000 was developed independently. In order to provide high performance IP packets forwarding, a high performance routing lookup algorithm based on RAM was developed. A novel classification algorithm based on non-collision Hash-Trie-tree and an algorithm based on distributed packet fair queuing with feedback mechanism weve designed and impemented to support QoS control and security management. In order to secure the network, a router security architecture based on distributed key management was proposed.

Keywords： router     Security     router operating system     route lookup     packet classification     packet scheduling    

HTML PDF Collect

A highly efficient reconfigurable rotation unit based on an inverse butterfly network Article

Chao MA, Zi-bin DAI, Wei LI, Hai-juan ZANG

Frontiers of Information Technology & Electronic Engineering 2017, Volume 18, Issue 11,   Pages 1784-1794 doi: 10.1631/FITEE.1601265

Abstract: We propose a reconfigurable control-bit generation algorithm for rotation and sub-word rotation operations. The algorithm uses a self-routing characteristic to configure an inverse butterfly network. In addition to being highly parallelized and inexpensive, the algorithm integrates the rotation-shift, bi-directional rotation-shift, and sub-word rotation-shift operations. To our best knowledge, this is the first scheme to accommodate a variety of rotation operations into the same architecture. We have developed the highly efficient reconfigurable rotation unit (HERRU) and synthesized it into the Semiconductor Manufacturing International Corporation (SMIC)’s 65-nm process. The results show that the overall efficiency (relative area×relative latency) of our HERRU is higher by at least 23% than that of other designs with similar functions. When executing the bi-directional rotation operations alone, HERRU occupies a significantly smaller area with a lower latency than previously proposed designs.

Keywords： Rotation operations     Self-routing     Control-bit generation algorithm     Inverse butterfly network    

HTML PDF Collect

Cross-layer QoS routing algorithm of metric-based cooperative relay in WSNs

Xu Nan,Sun Yamin,Yu Jiming,Wang Hua

Strategic Study of CAE 2011, Volume 13, Issue 3,   Pages 45-49

Abstract:

We proposed a cross-layer QoS routing algorithm which is metric-based cooperative relay initiative forwarding(MCRICQR). Nodes form a metric according to energy, channel, congestion and distance to sink. The node with maximal metric forwards or relays or leapfrogs the data in term of it's own states. Simulation results show that MCRICQR can prolong the lifetime of network and guarantee the required QoS. It also can transmit data in time and load balance which improve the reliability and energy efficiency and throughput of WSN(wireless sensor network).

Keywords： quality of service     cross-layer design     cooperative relay     initiative forwarding     wireless sensor network    

HTML PDF Collect

Status quo and outlook of reconfigurable research

Li Yufeng,Qiu Han,Lan Julong

Strategic Study of CAE 2008, Volume 10, Issue 7,   Pages 82-89

Abstract:

Today, with new services and applications blooming on the internet, to enable traditional routers to offer enough capability and speed of upgrade along with these services and applications in time would become even harder than ever. Run-time reconfiguration (RTR), based on the Field Programmable Gate Array (FPGA), is a new promising technology that can configure the partial or total hardware logic resources of a system at run time. Based on the technology, reconfigurable routers can support dynamic reconfiguration of new hardware logic for the new service, while keeping the other services still run properly, hence can provide a new possible solution to the update problem of the traditional routers. After introducing the basic concepts of RTR and the current development of the FPGA, this paper summarizes the past major research efforts with respect to the reconfigurable router, as well as the current work on it. Research directions and open problems are also discussed from the point of view of reconfigurable network.

Keywords： internet     reconfigurable router     reconfigurable network     programmable hardware    

HTML PDF Collect

Research and Realization of IP Multicast Routing Protocol

Li Wei

Strategic Study of CAE 2002, Volume 4, Issue 1,   Pages 82-88

Abstract:

This paper first explains why IP multicasting must be used. Then it summaries the fundamentals of IP multicasting and multicast routing protocols. After that it specially discusses protoool independent multicast-sparse mode (PIM-SM), points out its defect and proposes a scheme to solve it. In this scheme each source registers and sends data packets toward multiple rendezvous points (RPs) but receivers only join to a single RP. If one of the RPs fails, receivers will join to one of the alternative RPs quickly. On implementation, the paper centers on the details of implementing PIM-SM. Finally it discusses the problems and prospect of IP multicasting.

Keywords： protocol independent multicast-sparse mode (PIM-SM)     multiple rendezvous     point (RPs)     multicast    

HTML PDF Collect

Asplitting-after-merging approach tomulti-FIB compression and fast refactoring in virtual routers Article

Da-fang ZHANG,Dan CHEN,Yan-biao LI,Kun XIE,Tong SHEN

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 12,   Pages 1266-1274 doi: 10.1631/FITEE.1500499

Abstract: Virtual routers are gaining increasing attention in the research field of future networks. As the core network device to achieve network virtualization, virtual routers have multiple virtual instances coexisting on a physical router platform, and each instance retains its own forwarding information base (FIB). Thus, memory scalability suffers from the limited on-chip memory. In this paper, we present a splitting-after-merging approach to compress the FIBs, which not only improves the memory efficiency but also offers an ideal split position to achieve system refactoring. Moreover, we propose an improved strategy to save the time used for system rebuilding to achieve fast refactoring. Experiments with 14 real-world routing data sets show that our approach needs only a unibit trie holding 134 188 nodes, while the original number of nodes is 4 569 133. Moreover, our approach has a good performance in scalability, guaranteeing 90 000 000 prefixes and 65 600 FIBs.

Keywords： Virtual routers     Merging     Splitting     Compression     Fast refactoring    

HTML PDF Collect

A Cyber-Physical Routing Protocol Exploiting Trajectory Dynamics for Mission-Oriented Flying Ad Hoc Networks Article

Die Hu, Shaoshi Yang, Min Gong, Zhiyong Feng, Xuejun Zhu

Engineering 2022, Volume 19, Issue 12,   Pages 217-227 doi: 10.1016/j.eng.2021.10.022

Abstract:

As a special type of mobile ad hoc network (MANET), the flying ad hoc network (FANET) has the potential to enable a variety of emerging applications in both civilian wireless communications (e.g., 5G and 6G) and the defense industry. The routing protocol plays a pivotal role in FANET. However, when designing the routing protocol for FANET, it is conventionally assumed that the aerial nodes move randomly. This is clearly inappropriate for a mission-oriented FANET (MO-FANET), in which the aerial nodes typically move toward a given destination from given departure point(s), possibly along a roughly deterministic flight path while maintaining a well-established formation, in order to carry out certain missions. In this paper, a novel cyber-physical routing protocol exploiting the particular mobility pattern of an MO-FANET is proposed based on cross-disciplinary integration, which makes full use of the mission-determined trajectory dynamics to construct the time sequence of rejoining and separating, as well as the adjacency matrix for each node, as prior information. Compared with the existing representative routing protocols used in FANETs, our protocol achieves a higher packet-delivery ratio (PDR) at the cost of even lower overhead and lower average end-to-end latency, while maintaining a reasonably moderate and stable network jitter, as demonstrated by extensive ns-3-based simulations assuming realistic configurations in an MO-FANET.

Keywords： Cyber-physical system     Flying ad hoc network (FANET)     Routing protocol     Trajectory dynamics     Unmanned aerial vehicle (UAV)    

HTML PDF Collect

Research and Implementation of IP - VPN

Li Xiuzhong

Strategic Study of CAE 2002, Volume 4, Issue 3,   Pages 84-91

Abstract:

Recently, IP - VPN is proposed as a way satisfying large company´s inter-connect requirement because of the prevalence of Internet. But there are some problems to be solved, especially security and QoS. In this paper, one way of network-based VPN QoS is proposed based on analysis of some available QoS algorithms. For IP - VPN, now there are several mechanisms： VLL, VPRN, VPLS and VPDN. This paper places emphasis on VPRN and VPLS. Two kinds of VPRN: BGP/MPLS and VR are discussed and compared with each other. And besides, VLAN, one way of VPLS, is introduced.

Keywords： virtual private routed network (VPRN)     virtual private LAN segment (VPLS)     border gateway protocol / multi-protocol label switch (GP/MPLS)     virtual router (VR)     worst-case weighted fair queue (WF2Q)     random early detection (RED)    

HTML PDF Collect

Optimization and its realization of anneal-genetic algorithm

Wang Ying

Strategic Study of CAE 2008, Volume 10, Issue 7,   Pages 57-59

Abstract:

A method that uses annealing algorithm to improve the inefficient local search of genetic algorithm is proposed. That method bases on analysis of the advantages and disadvantages of the annealing and the genetic algorithm. The algorithm optimization is more rapidly in precision after annealing algorithm integration with the genetic algorithm. By examples of cement ratio works, compared with results of the simple algorithm, it is effectively.

Keywords： genetic algorithm     simulated annealing algorithm     genetic algorithm improvement    

HTML PDF Collect

A multipath routing algorithm for satellite networksbased on service demand and traffic awareness Research Article

Ziyang XING, Hui QI, Xiaoqiang DI, Jinyao LIU, Rui XU, Jing CHEN, Ligang CONG,dixiaoqiang@cust.edu.cn

Frontiers of Information Technology & Electronic Engineering 2023, Volume 24, Issue 6,   Pages 844-858 doi: 10.1631/FITEE.2200507

Abstract: With the reduction in manufacturing and launch costs of low Earth orbit satellites and the advantages of large coverage and high data transmission rates, satellites have become an important part of data transmission in air-ground networks. However, due to the factors such as geographical location and people’s living habits, the differences in user’ demand for multimedia data will result in unbalanced network traffic, which may lead to network congestion and affect data transmission. In addition, in traditional transmission, the convergence of network information acquisition is slow and global network information cannot be collected in a fine-grained manner, which is not conducive to calculating optimal routes. The service quality requirements cannot be satisfied when multiple service requests are made. Based on the above, in this paper artificial intelligence technology is applied to the , and a software-defined network is used to obtain the global network information, perceive network traffic, develop comprehensive decisions online through , and update the optimal routing strategy in real time. Simulation results show that the proposed algorithm has good convergence performance and strong generalizability. Compared with traditional routing, the throughput is 8% higher, and the proposed method has load balancing characteristics.

Keywords： Software-defined network (SDN)     Quick user datagram protocol Internet connection (QUIC)     Reinforcement learning     Sketch     Multi-service demand     Satellite network    

HTML PDF Collect

Title Author Date Type Operation

Dynamical Fast IP-Routing Lookup Algorithm

Liu Yalin

Journal Article

One Novel Dynamic Routing and Wavelength Assignment Integrate Algorithm in WDM Optical Network

Li Lei,Tang Yong,Rao Min,Chen Yu,Jiang Jianfeng,Zhang Mingde,Sun Xiaohan

Journal Article

A fuzzy integrated congestion-aware routing algorithm for network on chip

Shahrouz Yasrebi, Akram Reza, Mohammad Nikravan, Seena Vazifedan,a.reza@qodsiau.ac.ir,a.ak.reza@gmail.com

Journal Article

A novel context-aware RPL algorithm based on a triangle module operator

Yanan Cao, Hao Yuan,caoyanan@tjnu.edu.cn,yuanhao19880520@163.com

Journal Article

Anovel forwarding and routing mechanism design in SDN-basedNDNarchitecture

Jia LI, Ren-chao XIE, Tao HUANG, Li SUN

Journal Article

Design and Implementation of High Performance Security Router BW7000

Xu Mingwei,Xu Ke,Xiong Yongqiang,Jiang Yong,Sun Xiaoxia,Wu Jian,Yu Zhongchao

Journal Article

A highly efficient reconfigurable rotation unit based on an inverse butterfly network

Chao MA, Zi-bin DAI, Wei LI, Hai-juan ZANG

Journal Article

Cross-layer QoS routing algorithm of metric-based cooperative relay in WSNs

Xu Nan,Sun Yamin,Yu Jiming,Wang Hua

Journal Article

Status quo and outlook of reconfigurable research

Li Yufeng,Qiu Han,Lan Julong

Journal Article

Research and Realization of IP Multicast Routing Protocol

Li Wei

Journal Article

Asplitting-after-merging approach tomulti-FIB compression and fast refactoring in virtual routers

Da-fang ZHANG,Dan CHEN,Yan-biao LI,Kun XIE,Tong SHEN

Journal Article

A Cyber-Physical Routing Protocol Exploiting Trajectory Dynamics for Mission-Oriented Flying Ad Hoc Networks

Die Hu, Shaoshi Yang, Min Gong, Zhiyong Feng, Xuejun Zhu

Journal Article

Research and Implementation of IP - VPN

Li Xiuzhong

Journal Article

Optimization and its realization of anneal-genetic algorithm

Wang Ying

Journal Article

A multipath routing algorithm for satellite networksbased on service demand and traffic awareness

Ziyang XING, Hui QI, Xiaoqiang DI, Jinyao LIU, Rui XU, Jing CHEN, Ligang CONG,dixiaoqiang@cust.edu.cn

Journal Article