scholarly journals MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

2005 ◽  
pp. 292-313 ◽  
Author(s):  
Fengyun Cao ◽  
Jaswinder Pal Singh
Keyword(s):  
Dynamic Multicast

Two-stage evolutionary algorithm for dynamic multicast routing in mesh network

2008 ◽  
Vol 9 (6) ◽  
pp. 791-798
Author(s):  
Li Zhu ◽  
Zhi-shu Li ◽  
Liang-yin Chen ◽  
Yan-hong Cheng
Keyword(s):  
Evolutionary Algorithm ◽  
Multicast Routing ◽  
Mesh Network ◽  
Two Stage ◽  
Dynamic Multicast

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

Dynamic Grid-Based Algorithms in DDM

2012 ◽  
Vol 433-440 ◽  
pp. 4297-4301
Author(s):  
Hui Ru Wang ◽  
Jing Ding
Keyword(s):  
Large Scale ◽  
Data Distribution ◽  
Experimental Results ◽  
Interactive Simulation ◽  
Distribution Management ◽  
Distributed Interactive Simulation ◽  
Dynamic Multicast ◽  
Grid Based

For large-scale distributed interactive simulation, it is important and difficult for data to communicate among thousands of objects. The purpose of the Data Distribution Management (DDM) service performs data filter and reduces irrelevant data between federations. Grid-based algorithm can only manage to filter part of irrelevant data. Experimental results show that, compare with normal grid-based algorithms, the dynamic multicast method can minimize.

Sign in / Sign up

Export Citation Format

Share Document