Comprehensive Analytic Performance Assessment and K-means based Multicast Routing Algorithm and Architecture for 3D-NoC of Spiking Neurons

2019 ◽  
Vol 15 (4) ◽  
pp. 1-28 ◽  
Author(s):  
The H. Vu ◽  
Yuichi Okuyama ◽  
Abderazek Ben Abdallah
Keyword(s):  
Performance Assessment ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Spiking Neurons ◽  
Multicast Routing Algorithm

Overlay multicast routing algorithm with minimum overlay cost

2009 ◽  
Vol 28 (10) ◽  
pp. 2569-2572
Author(s):  
Long-xin LIN ◽  
Jie ZHOU ◽  
Ling ZHANG ◽  
Zhao YE
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Overlay Multicast ◽  
Multicast Routing Algorithm

An Energy Balanced Ad Hoc Multicast Routing Algorithm

2012 ◽  
Vol 466-467 ◽  
pp. 425-429
Author(s):  
Qi Zhang ◽  
Hai Jun Xiong
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Energy Model ◽  
Specific Data ◽  
Routing Technology ◽  
Multicast Routing Algorithm ◽  
Energy Network

Multicast routing technology of Ad hoc network is a method of transferring specific data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. After the analysis of energy model and other routing algorithms ,an energy model and a balanced energy network multicast routing algorithm EBAMRA have been proposed in this article,. Experiments had been done, the simulation results show that this algorithm is feasible and effective, which provides a new and effective way of Ad hoc multicast routing technology.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Multicast Routing Algorithm with QoS Constraints in Mobile Ad Hoc Networks

2014 ◽  
Vol 602-605 ◽  
pp. 3169-3172 ◽  
Author(s):  
Yue Li ◽  
Yin Hui Liu ◽  
Zhong Bao Luo
Keyword(s):  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Estimation Algorithm ◽  
Bandwidth Estimation ◽  
Routing Problem ◽  
Network Bandwidth ◽  
Hoc Networks ◽  
Multicast Routing Algorithm ◽  
Select Function

Through the study of MANET's QoS multicast routing problem, we propose a heuristic-demand multicast routing algorithm. Algorithm combines the MANET network bandwidth estimation algorithm, redefined the select function, restrictions request packets of flooding algorithm, to ensure fair treatment delay and bandwidth. Simulation results show that the algorithm has the advantage of fewer routing overhead, high success rate.

Sign in / Sign up

Export Citation Format

Share Document