Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Control and management of large and dynamic networks
Control and management of large and dynamic networks
Art and Theory of Dynamic Programming
Art and Theory of Dynamic Programming
Simulation of Hierarchical Routing Algorithms
Simulation of Hierarchical Routing Algorithms
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks
IEEE Transactions on Computers
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Complexity of gradient projection method for optimal routing in data networks
IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Cross-Layer Design for Data Accessibility in Mobile Ad Hoc Networks
Wireless Personal Communications: An International Journal
Braving the broadcast storm: infrastructural support for ad hoc routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-Modifiable Color Petri Nets for Modeling User Manipulation and Network Event Handling
IEEE Transactions on Computers
Modeling adaptable multimedia and self-modifying protocol execution
Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
A framework for evaluating the performance of cluster algorithms for hierarchical networks
IEEE/ACM Transactions on Networking (TON)
A hierarchical networking architecture based on new switching address
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Orthogonal rendezvous routing protocol for wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Two-layer hierarchical wavelength routing for islands of transparency optical networks
Computer Communications
New theoretical studies and optimal cluster-population determination for hierarchical networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Extending address space of IP networks with hierarchical addressing
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
A novel method to evaluate clustering algorithms for hierarchical optical networks
Photonic Network Communications
Scalable and efficient broadcasting algorithms for very large internetworks
Computer Communications
| Hi-index | 14.99 |
An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed protocol is found to be superior to the other protocols tested in many different types of network traffic and topological configurations. The results indicate that intercluster links must be reliable, because (1) the failure of these links can significantly degrade the routing performance, even though the protocol does not degrade as badly as the existing scheme and (2) hierarchical routing protocols usually prefer small clusters, which means that there will be many intercluster links. The tradeoff between two conflicting performance criteria, response speed and communication overhead, is shown.