Group routing without group routing tables: an exercise in protocol design
Computer Communications
QoS-based routing of multimedia streams in computer networks
IEEE Journal on Selected Areas in Communications
Coordinating mobile agents by the XML-based tuple space
Journal of Computer Science and Technology
A Distributed Computing Model and Its Application
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Competitive proportional resource allocation policy for computational grid
Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
A QoS multicast routing protocol for dynamic group topology
Information Sciences: an International Journal
A hybrid topological-stochastic partitioning method for scaling QoS routing algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Genetic algorithm-based QoS multicast routing for uncertainty in network parameters
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
A distributed broadcast algorithm for wireless mobile ad hoc networks
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
An efficient distributed broadcasting algorithm for ad hoc networks
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
QoS-based routing algorithms for ATM networks
Computer Communications
| Hi-index | 0.24 |
The routing decision is one of the important research issues in the network fields. With the rapid development of high-speed networks, multimedia communication networks and mobile computer networks, the hierarchical routing techniques for the dynamic and large networks or high-speed networks have triggered interests among many people worldwide. This paper proposes a hierarchical dynamic routing protocol (HDRP), which can adapt to dynamic and large computer networks (DLCN) with clustering topology. It also gives the main procedures for realizing routing update and routing decision, and the proof of correctness and complexity analysis of the protocol. The performance measures of HDRP, including throughput and average message delay, are evaluated using simulation. The study shows that HDRP provides a new available approach to routing decision for DLCN with clustering topology.